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-171683761100428.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 ShieldPPPs-PT-005B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683761100428
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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.7K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 13 11:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Apr 13 11:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 13 11:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 13 11:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 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 86K 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 ShieldPPPs-PT-005B-LTLFireability-00
FORMULA_NAME ShieldPPPs-PT-005B-LTLFireability-01
FORMULA_NAME ShieldPPPs-PT-005B-LTLFireability-02
FORMULA_NAME ShieldPPPs-PT-005B-LTLFireability-03
FORMULA_NAME ShieldPPPs-PT-005B-LTLFireability-04
FORMULA_NAME ShieldPPPs-PT-005B-LTLFireability-05
FORMULA_NAME ShieldPPPs-PT-005B-LTLFireability-06
FORMULA_NAME ShieldPPPs-PT-005B-LTLFireability-07
FORMULA_NAME ShieldPPPs-PT-005B-LTLFireability-08
FORMULA_NAME ShieldPPPs-PT-005B-LTLFireability-09
FORMULA_NAME ShieldPPPs-PT-005B-LTLFireability-10
FORMULA_NAME ShieldPPPs-PT-005B-LTLFireability-11
FORMULA_NAME ShieldPPPs-PT-005B-LTLFireability-12
FORMULA_NAME ShieldPPPs-PT-005B-LTLFireability-13
FORMULA_NAME ShieldPPPs-PT-005B-LTLFireability-14
FORMULA_NAME ShieldPPPs-PT-005B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717243116163

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-005B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 11:58:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 11:58:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 11:58:37] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2024-06-01 11:58:37] [INFO ] Transformed 343 places.
[2024-06-01 11:58:37] [INFO ] Transformed 318 transitions.
[2024-06-01 11:58:37] [INFO ] Found NUPN structural information;
[2024-06-01 11:58:37] [INFO ] Parsed PT model containing 343 places and 318 transitions and 876 arcs in 186 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA ShieldPPPs-PT-005B-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-005B-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-005B-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-005B-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-005B-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-005B-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 318/318 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 317 transition count 292
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 317 transition count 292
Applied a total of 52 rules in 66 ms. Remains 317 /343 variables (removed 26) and now considering 292/318 (removed 26) transitions.
// Phase 1: matrix 292 rows 317 cols
[2024-06-01 11:58:37] [INFO ] Computed 56 invariants in 21 ms
[2024-06-01 11:58:38] [INFO ] Implicit Places using invariants in 278 ms returned []
[2024-06-01 11:58:38] [INFO ] Invariant cache hit.
[2024-06-01 11:58:38] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 572 ms to find 0 implicit places.
Running 291 sub problems to find dead transitions.
[2024-06-01 11:58:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (OVERLAPS) 1/317 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-01 11:58:42] [INFO ] Deduced a trap composed of 17 places in 276 ms of which 14 ms to minimize.
[2024-06-01 11:58:42] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-06-01 11:58:42] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-06-01 11:58:42] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 0 ms to minimize.
[2024-06-01 11:58:42] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 0 ms to minimize.
[2024-06-01 11:58:42] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-06-01 11:58:42] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 1 ms to minimize.
[2024-06-01 11:58:42] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:58:42] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-06-01 11:58:42] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2024-06-01 11:58:42] [INFO ] Deduced a trap composed of 20 places in 166 ms of which 1 ms to minimize.
[2024-06-01 11:58:43] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 0 ms to minimize.
[2024-06-01 11:58:43] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 2 ms to minimize.
[2024-06-01 11:58:43] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-06-01 11:58:43] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 13 ms to minimize.
[2024-06-01 11:58:43] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 2 ms to minimize.
[2024-06-01 11:58:43] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:58:43] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:58:43] [INFO ] Deduced a trap composed of 30 places in 29 ms of which 0 ms to minimize.
[2024-06-01 11:58:43] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/317 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-01 11:58:44] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 2 ms to minimize.
[2024-06-01 11:58:44] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 2 ms to minimize.
[2024-06-01 11:58:44] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 2 ms to minimize.
[2024-06-01 11:58:44] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 2 ms to minimize.
[2024-06-01 11:58:44] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 2 ms to minimize.
[2024-06-01 11:58:44] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 2 ms to minimize.
[2024-06-01 11:58:44] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:58:44] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:58:44] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-06-01 11:58:45] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:58:45] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-06-01 11:58:45] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-06-01 11:58:45] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
[2024-06-01 11:58:45] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
[2024-06-01 11:58:45] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 2 ms to minimize.
[2024-06-01 11:58:45] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-06-01 11:58:45] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-06-01 11:58:45] [INFO ] Deduced a trap composed of 17 places in 18 ms of which 1 ms to minimize.
[2024-06-01 11:58:45] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:58:45] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/317 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-01 11:58:47] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 0 ms to minimize.
[2024-06-01 11:58:47] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:58:47] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:58:47] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 0 ms to minimize.
[2024-06-01 11:58:47] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-06-01 11:58:47] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 0 ms to minimize.
[2024-06-01 11:58:47] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:58:47] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:58:48] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:58:48] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 1 ms to minimize.
[2024-06-01 11:58:48] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2024-06-01 11:58:48] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:58:48] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-06-01 11:58:48] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-06-01 11:58:48] [INFO ] Deduced a trap composed of 60 places in 49 ms of which 1 ms to minimize.
[2024-06-01 11:58:48] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:58:48] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 4 ms to minimize.
[2024-06-01 11:58:48] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-06-01 11:58:48] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2024-06-01 11:58:48] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-01 11:58:49] [INFO ] Deduced a trap composed of 48 places in 45 ms of which 1 ms to minimize.
[2024-06-01 11:58:49] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-06-01 11:58:49] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:58:50] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 4/120 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-01 11:58:51] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:58:51] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:58:51] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-06-01 11:58:51] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:58:51] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 0 ms to minimize.
[2024-06-01 11:58:51] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 2 ms to minimize.
[2024-06-01 11:58:51] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-06-01 11:58:51] [INFO ] Deduced a trap composed of 26 places in 21 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 8/128 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-01 11:58:54] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
[2024-06-01 11:58:54] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-06-01 11:58:54] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-06-01 11:58:54] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-06-01 11:58:54] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2024-06-01 11:58:55] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:58:55] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:58:55] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 8/136 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-01 11:58:57] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:58:57] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-06-01 11:58:57] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 3/139 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-01 11:58:58] [INFO ] Deduced a trap composed of 66 places in 58 ms of which 2 ms to minimize.
[2024-06-01 11:58:59] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-01 11:59:01] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:59:01] [INFO ] Deduced a trap composed of 45 places in 42 ms of which 0 ms to minimize.
[2024-06-01 11:59:01] [INFO ] Deduced a trap composed of 33 places in 30 ms of which 1 ms to minimize.
[2024-06-01 11:59:02] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 1 ms to minimize.
[2024-06-01 11:59:02] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:59:02] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:59:02] [INFO ] Deduced a trap composed of 37 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:59:02] [INFO ] Deduced a trap composed of 48 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:59:02] [INFO ] Deduced a trap composed of 39 places in 29 ms of which 0 ms to minimize.
[2024-06-01 11:59:02] [INFO ] Deduced a trap composed of 38 places in 27 ms of which 1 ms to minimize.
[2024-06-01 11:59:02] [INFO ] Deduced a trap composed of 39 places in 27 ms of which 0 ms to minimize.
[2024-06-01 11:59:02] [INFO ] Deduced a trap composed of 37 places in 25 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/317 variables, 12/153 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-01 11:59:03] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 2 ms to minimize.
[2024-06-01 11:59:03] [INFO ] Deduced a trap composed of 27 places in 25 ms of which 1 ms to minimize.
[2024-06-01 11:59:03] [INFO ] Deduced a trap composed of 28 places in 20 ms of which 0 ms to minimize.
[2024-06-01 11:59:04] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-06-01 11:59:04] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:59:04] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 0 ms to minimize.
[2024-06-01 11:59:04] [INFO ] Deduced a trap composed of 27 places in 24 ms of which 1 ms to minimize.
[2024-06-01 11:59:04] [INFO ] Deduced a trap composed of 23 places in 21 ms of which 1 ms to minimize.
[2024-06-01 11:59:04] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2024-06-01 11:59:04] [INFO ] Deduced a trap composed of 47 places in 43 ms of which 1 ms to minimize.
[2024-06-01 11:59:04] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-06-01 11:59:05] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-06-01 11:59:05] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/317 variables, 13/166 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-01 11:59:06] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 1 ms to minimize.
[2024-06-01 11:59:06] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
[2024-06-01 11:59:07] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/317 variables, 3/169 constraints. Problems are: Problem set: 0 solved, 291 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 317/609 variables, and 169 constraints, problems are : Problem set: 0 solved, 291 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 0/317 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 113/113 constraints]
Escalating to Integer solving :Problem set: 0 solved, 291 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (OVERLAPS) 1/317 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/317 variables, 113/169 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-01 11:59:10] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 7 ms to minimize.
[2024-06-01 11:59:10] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:59:10] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:59:11] [INFO ] Deduced a trap composed of 53 places in 52 ms of which 1 ms to minimize.
[2024-06-01 11:59:11] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
[2024-06-01 11:59:11] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/317 variables, 6/175 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-01 11:59:12] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-01 11:59:14] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-06-01 11:59:14] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2024-06-01 11:59:14] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 3/179 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-01 11:59:16] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 1 ms to minimize.
[2024-06-01 11:59:16] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-06-01 11:59:16] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-06-01 11:59:16] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:59:16] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-06-01 11:59:16] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 2 ms to minimize.
[2024-06-01 11:59:17] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 1 ms to minimize.
[2024-06-01 11:59:17] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-06-01 11:59:17] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-06-01 11:59:17] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 2 ms to minimize.
[2024-06-01 11:59:17] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 2 ms to minimize.
[2024-06-01 11:59:17] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 2 ms to minimize.
[2024-06-01 11:59:17] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 2 ms to minimize.
[2024-06-01 11:59:17] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-06-01 11:59:17] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 2 ms to minimize.
[2024-06-01 11:59:17] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 2 ms to minimize.
[2024-06-01 11:59:17] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2024-06-01 11:59:18] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 2 ms to minimize.
[2024-06-01 11:59:18] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-06-01 11:59:18] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 20/199 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-01 11:59:20] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:59:20] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-06-01 11:59:20] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:59:20] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:59:20] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 0 ms to minimize.
[2024-06-01 11:59:20] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:59:20] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:59:20] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
[2024-06-01 11:59:21] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-06-01 11:59:21] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:59:21] [INFO ] Deduced a trap composed of 33 places in 30 ms of which 1 ms to minimize.
[2024-06-01 11:59:21] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 12/211 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-01 11:59:24] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-06-01 11:59:24] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-06-01 11:59:24] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 2 ms to minimize.
[2024-06-01 11:59:25] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:59:25] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:59:26] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 6/217 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-01 11:59:30] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 1 ms to minimize.
[2024-06-01 11:59:30] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2024-06-01 11:59:31] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 0 ms to minimize.
[2024-06-01 11:59:31] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:59:31] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 5/222 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-01 11:59:37] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 2 ms to minimize.
[2024-06-01 11:59:37] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 317/609 variables, and 224 constraints, problems are : Problem set: 0 solved, 291 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 0/317 constraints, PredecessorRefiner: 0/291 constraints, Known Traps: 168/168 constraints]
After SMT, in 60144ms problems are : Problem set: 0 solved, 291 unsolved
Search for dead transitions found 0 dead transitions in 60167ms
Starting structural reductions in LTL mode, iteration 1 : 317/343 places, 292/318 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60828 ms. Remains : 317/343 places, 292/318 transitions.
Support contains 31 out of 317 places after structural reductions.
[2024-06-01 11:59:38] [INFO ] Flatten gal took : 56 ms
[2024-06-01 11:59:38] [INFO ] Flatten gal took : 21 ms
[2024-06-01 11:59:38] [INFO ] Input system was already deterministic with 292 transitions.
Support contains 30 out of 317 places (down from 31) after GAL structural reductions.
RANDOM walk for 40000 steps (44 resets) in 1108 ms. (36 steps per ms) remains 2/19 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 1/2 properties
[2024-06-01 11:59:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp7 is UNSAT
After SMT solving in domain Real declared 15/609 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 19 ms.
Refiners :[Positive P Invariants (semi-flows): 1/56 constraints, State Equation: 0/317 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 26ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
FORMULA ShieldPPPs-PT-005B-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 66 stabilizing places and 66 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 317 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 317/317 places, 292/292 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 316 transition count 255
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 280 transition count 255
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 72 place count 280 transition count 230
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 122 place count 255 transition count 230
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 130 place count 247 transition count 222
Iterating global reduction 2 with 8 rules applied. Total rules applied 138 place count 247 transition count 222
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 138 place count 247 transition count 217
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 148 place count 242 transition count 217
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 314 place count 159 transition count 134
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 316 place count 157 transition count 132
Applied a total of 316 rules in 68 ms. Remains 157 /317 variables (removed 160) and now considering 132/292 (removed 160) transitions.
// Phase 1: matrix 132 rows 157 cols
[2024-06-01 11:59:39] [INFO ] Computed 56 invariants in 2 ms
[2024-06-01 11:59:39] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-01 11:59:39] [INFO ] Invariant cache hit.
[2024-06-01 11:59:39] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
[2024-06-01 11:59:39] [INFO ] Redundant transitions in 2 ms returned []
Running 129 sub problems to find dead transitions.
[2024-06-01 11:59:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-06-01 11:59:40] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-06-01 11:59:40] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 1/157 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-06-01 11:59:41] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-06-01 11:59:41] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-06-01 11:59:41] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
[2024-06-01 11:59:42] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:59:42] [INFO ] Deduced a trap composed of 58 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:59:42] [INFO ] Deduced a trap composed of 72 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 132/289 variables, 157/221 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-06-01 11:59:43] [INFO ] Deduced a trap composed of 41 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/289 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 222 constraints, problems are : Problem set: 0 solved, 129 unsolved in 5535 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 9/64 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 1/157 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-06-01 11:59:46] [INFO ] Deduced a trap composed of 39 places in 32 ms of which 0 ms to minimize.
[2024-06-01 11:59:46] [INFO ] Deduced a trap composed of 70 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 132/289 variables, 157/224 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 129/353 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-06-01 11:59:48] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 10 (OVERLAPS) 0/289 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 354 constraints, problems are : Problem set: 0 solved, 129 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 12/12 constraints]
After SMT, in 35564ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 35566ms
Starting structural reductions in SI_LTL mode, iteration 1 : 157/317 places, 132/292 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 35920 ms. Remains : 157/317 places, 132/292 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-005B-LTLFireability-00
Product exploration explored 100000 steps with 22141 reset in 309 ms.
Product exploration explored 100000 steps with 22083 reset in 218 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/157 stabilizing places and 2/132 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 273 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
RANDOM walk for 9 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 167 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
[2024-06-01 12:00:16] [INFO ] Invariant cache hit.
[2024-06-01 12:00:16] [INFO ] [Real]Absence check using 56 positive place invariants in 8 ms returned sat
[2024-06-01 12:00:16] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2024-06-01 12:00:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:00:17] [INFO ] [Nat]Absence check using 56 positive place invariants in 9 ms returned sat
[2024-06-01 12:00:17] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-06-01 12:00:17] [INFO ] Computed and/alt/rep : 129/248/129 causal constraints (skipped 0 transitions) in 8 ms.
[2024-06-01 12:00:17] [INFO ] Added : 104 causal constraints over 21 iterations in 404 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 157 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 157/157 places, 132/132 transitions.
Applied a total of 0 rules in 5 ms. Remains 157 /157 variables (removed 0) and now considering 132/132 (removed 0) transitions.
[2024-06-01 12:00:17] [INFO ] Invariant cache hit.
[2024-06-01 12:00:17] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-06-01 12:00:17] [INFO ] Invariant cache hit.
[2024-06-01 12:00:17] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
[2024-06-01 12:00:17] [INFO ] Redundant transitions in 3 ms returned []
Running 129 sub problems to find dead transitions.
[2024-06-01 12:00:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-06-01 12:00:18] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:00:18] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 1/157 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-06-01 12:00:19] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:00:19] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2024-06-01 12:00:19] [INFO ] Deduced a trap composed of 6 places in 15 ms of which 1 ms to minimize.
[2024-06-01 12:00:19] [INFO ] Deduced a trap composed of 43 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:00:19] [INFO ] Deduced a trap composed of 58 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:00:19] [INFO ] Deduced a trap composed of 72 places in 34 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 132/289 variables, 157/221 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-06-01 12:00:21] [INFO ] Deduced a trap composed of 41 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/289 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 222 constraints, problems are : Problem set: 0 solved, 129 unsolved in 5167 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 9/64 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 1/157 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-06-01 12:00:23] [INFO ] Deduced a trap composed of 39 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:00:23] [INFO ] Deduced a trap composed of 70 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 132/289 variables, 157/224 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 129/353 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-06-01 12:00:25] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 10 (OVERLAPS) 0/289 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 354 constraints, problems are : Problem set: 0 solved, 129 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 12/12 constraints]
After SMT, in 35192ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 35195ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 35505 ms. Remains : 157/157 places, 132/132 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/157 stabilizing places and 2/132 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 215 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
RANDOM walk for 9 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 190 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2024-06-01 12:00:53] [INFO ] Invariant cache hit.
[2024-06-01 12:00:53] [INFO ] [Real]Absence check using 56 positive place invariants in 8 ms returned sat
[2024-06-01 12:00:53] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2024-06-01 12:00:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:00:53] [INFO ] [Nat]Absence check using 56 positive place invariants in 9 ms returned sat
[2024-06-01 12:00:53] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2024-06-01 12:00:53] [INFO ] Computed and/alt/rep : 129/248/129 causal constraints (skipped 0 transitions) in 9 ms.
[2024-06-01 12:00:54] [INFO ] Added : 104 causal constraints over 21 iterations in 377 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22420 reset in 152 ms.
Product exploration explored 100000 steps with 22113 reset in 186 ms.
Support contains 1 out of 157 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 157/157 places, 132/132 transitions.
Applied a total of 0 rules in 4 ms. Remains 157 /157 variables (removed 0) and now considering 132/132 (removed 0) transitions.
[2024-06-01 12:00:54] [INFO ] Invariant cache hit.
[2024-06-01 12:00:54] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-01 12:00:54] [INFO ] Invariant cache hit.
[2024-06-01 12:00:54] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2024-06-01 12:00:54] [INFO ] Redundant transitions in 2 ms returned []
Running 129 sub problems to find dead transitions.
[2024-06-01 12:00:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-06-01 12:00:55] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:00:55] [INFO ] Deduced a trap composed of 28 places in 24 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 1/157 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-06-01 12:00:56] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:00:56] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-06-01 12:00:56] [INFO ] Deduced a trap composed of 6 places in 14 ms of which 1 ms to minimize.
[2024-06-01 12:00:56] [INFO ] Deduced a trap composed of 43 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:00:56] [INFO ] Deduced a trap composed of 58 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:00:56] [INFO ] Deduced a trap composed of 72 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 132/289 variables, 157/221 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-06-01 12:00:58] [INFO ] Deduced a trap composed of 41 places in 27 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/289 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 222 constraints, problems are : Problem set: 0 solved, 129 unsolved in 5094 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 9/64 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 1/157 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-06-01 12:01:00] [INFO ] Deduced a trap composed of 39 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:01:00] [INFO ] Deduced a trap composed of 70 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 132/289 variables, 157/224 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 129/353 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-06-01 12:01:02] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 10 (OVERLAPS) 0/289 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 354 constraints, problems are : Problem set: 0 solved, 129 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 12/12 constraints]
After SMT, in 35118ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 35120ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 35330 ms. Remains : 157/157 places, 132/132 transitions.
Treatment of property ShieldPPPs-PT-005B-LTLFireability-00 finished in 110449 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(G(p1)))))'
Support contains 4 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 292/292 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 308 transition count 283
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 308 transition count 283
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 307 transition count 282
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 307 transition count 282
Applied a total of 20 rules in 21 ms. Remains 307 /317 variables (removed 10) and now considering 282/292 (removed 10) transitions.
// Phase 1: matrix 282 rows 307 cols
[2024-06-01 12:01:30] [INFO ] Computed 56 invariants in 2 ms
[2024-06-01 12:01:30] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-01 12:01:30] [INFO ] Invariant cache hit.
[2024-06-01 12:01:30] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
Running 281 sub problems to find dead transitions.
[2024-06-01 12:01:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (OVERLAPS) 1/307 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 12:01:33] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-06-01 12:01:33] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:01:33] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-06-01 12:01:33] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:01:33] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:01:33] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-06-01 12:01:33] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 2 ms to minimize.
[2024-06-01 12:01:33] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-06-01 12:01:33] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:01:33] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:01:33] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:01:33] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:01:33] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:01:34] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
[2024-06-01 12:01:34] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:01:34] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:01:34] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:01:34] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:01:34] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-06-01 12:01:34] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 12:01:34] [INFO ] Deduced a trap composed of 37 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:01:35] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 2 ms to minimize.
[2024-06-01 12:01:35] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:01:35] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:01:35] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:01:35] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 0 ms to minimize.
[2024-06-01 12:01:35] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:01:35] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 2 ms to minimize.
[2024-06-01 12:01:35] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:01:35] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:01:35] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:01:35] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:01:35] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:01:35] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-06-01 12:01:35] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 1 ms to minimize.
[2024-06-01 12:01:35] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:01:35] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
[2024-06-01 12:01:36] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2024-06-01 12:01:36] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:01:36] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/307 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 12:01:37] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-06-01 12:01:37] [INFO ] Deduced a trap composed of 17 places in 16 ms of which 0 ms to minimize.
[2024-06-01 12:01:38] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-06-01 12:01:38] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2024-06-01 12:01:38] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 2 ms to minimize.
[2024-06-01 12:01:38] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:01:38] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 2 ms to minimize.
[2024-06-01 12:01:38] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
[2024-06-01 12:01:38] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 1 ms to minimize.
[2024-06-01 12:01:38] [INFO ] Deduced a trap composed of 25 places in 23 ms of which 0 ms to minimize.
[2024-06-01 12:01:38] [INFO ] Deduced a trap composed of 48 places in 53 ms of which 2 ms to minimize.
[2024-06-01 12:01:38] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:01:39] [INFO ] Deduced a trap composed of 61 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:01:39] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2024-06-01 12:01:39] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 15/111 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 12:01:40] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 0 ms to minimize.
[2024-06-01 12:01:40] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2024-06-01 12:01:40] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:01:41] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 4/115 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 12:01:42] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2024-06-01 12:01:42] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 2 ms to minimize.
[2024-06-01 12:01:42] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 2 ms to minimize.
[2024-06-01 12:01:42] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 2 ms to minimize.
[2024-06-01 12:01:42] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 2 ms to minimize.
[2024-06-01 12:01:42] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:01:42] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:01:43] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-06-01 12:01:43] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:01:43] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:01:43] [INFO ] Deduced a trap composed of 31 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:01:43] [INFO ] Deduced a trap composed of 29 places in 25 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 12/127 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 8 (OVERLAPS) 282/589 variables, 307/434 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 12:01:46] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:01:48] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 0 ms to minimize.
[2024-06-01 12:01:48] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/589 variables, 3/437 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 12:01:52] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:01:52] [INFO ] Deduced a trap composed of 41 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:01:52] [INFO ] Deduced a trap composed of 39 places in 28 ms of which 0 ms to minimize.
[2024-06-01 12:01:52] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:01:52] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:01:53] [INFO ] Deduced a trap composed of 30 places in 28 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/589 variables, 6/443 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 12:01:54] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:01:54] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:01:55] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 0 ms to minimize.
[2024-06-01 12:01:55] [INFO ] Deduced a trap composed of 37 places in 26 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/589 variables, 4/447 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 12:01:56] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:01:57] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:01:57] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-06-01 12:01:58] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 0 ms to minimize.
[2024-06-01 12:01:58] [INFO ] Deduced a trap composed of 38 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:01:58] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/589 variables, 6/453 constraints. Problems are: Problem set: 0 solved, 281 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 589/589 variables, and 453 constraints, problems are : Problem set: 0 solved, 281 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 307/307 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 90/90 constraints]
Escalating to Integer solving :Problem set: 0 solved, 281 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (OVERLAPS) 1/307 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 90/146 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 12:02:02] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:02:02] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:02:02] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:02:02] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:02:02] [INFO ] Deduced a trap composed of 31 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:02:02] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:02:02] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:02:02] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:02:02] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:02:03] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:02:03] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:02:03] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/307 variables, 12/158 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 12:02:04] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 0 ms to minimize.
[2024-06-01 12:02:04] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:02:04] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:02:04] [INFO ] Deduced a trap composed of 27 places in 19 ms of which 0 ms to minimize.
[2024-06-01 12:02:04] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:02:05] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:02:05] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:02:05] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 8/166 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 12:02:06] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:02:06] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:02:06] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:02:06] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:02:06] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 0 ms to minimize.
[2024-06-01 12:02:06] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:02:06] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:02:06] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:02:07] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 0 ms to minimize.
[2024-06-01 12:02:07] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 10/176 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 7 (OVERLAPS) 282/589 variables, 307/483 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/589 variables, 281/764 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 12:02:12] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-06-01 12:02:13] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 1 ms to minimize.
[2024-06-01 12:02:13] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 2 ms to minimize.
[2024-06-01 12:02:13] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 2 ms to minimize.
[2024-06-01 12:02:13] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 2 ms to minimize.
[2024-06-01 12:02:13] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 1 ms to minimize.
[2024-06-01 12:02:14] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:02:14] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-06-01 12:02:14] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:02:15] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:02:15] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:02:15] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:02:15] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:02:15] [INFO ] Deduced a trap composed of 45 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:02:17] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-06-01 12:02:17] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 1 ms to minimize.
[2024-06-01 12:02:17] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 2 ms to minimize.
[2024-06-01 12:02:17] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:02:17] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 2 ms to minimize.
[2024-06-01 12:02:18] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/589 variables, 20/784 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 12:02:25] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:02:26] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 0 ms to minimize.
[2024-06-01 12:02:26] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2024-06-01 12:02:26] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-06-01 12:02:29] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 2 ms to minimize.
[2024-06-01 12:02:29] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 2 ms to minimize.
[2024-06-01 12:02:30] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 589/589 variables, and 791 constraints, problems are : Problem set: 0 solved, 281 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 307/307 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 147/147 constraints]
After SMT, in 60051ms problems are : Problem set: 0 solved, 281 unsolved
Search for dead transitions found 0 dead transitions in 60053ms
Starting structural reductions in LTL mode, iteration 1 : 307/317 places, 282/292 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60329 ms. Remains : 307/317 places, 282/292 transitions.
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-005B-LTLFireability-01
Product exploration explored 100000 steps with 50000 reset in 131 ms.
Product exploration explored 100000 steps with 50000 reset in 113 ms.
Computed a total of 59 stabilizing places and 59 stable transitions
Computed a total of 59 stabilizing places and 59 stable transitions
Detected a total of 59/307 stabilizing places and 59/282 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 11 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-005B-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-005B-LTLFireability-01 finished in 60709 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 317 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 317/317 places, 292/292 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 316 transition count 255
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 280 transition count 255
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 72 place count 280 transition count 230
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 122 place count 255 transition count 230
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 130 place count 247 transition count 222
Iterating global reduction 2 with 8 rules applied. Total rules applied 138 place count 247 transition count 222
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 138 place count 247 transition count 217
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 148 place count 242 transition count 217
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Deduced a syphon composed of 81 places in 0 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 2 with 162 rules applied. Total rules applied 310 place count 161 transition count 136
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 312 place count 159 transition count 134
Applied a total of 312 rules in 32 ms. Remains 159 /317 variables (removed 158) and now considering 134/292 (removed 158) transitions.
// Phase 1: matrix 134 rows 159 cols
[2024-06-01 12:02:30] [INFO ] Computed 56 invariants in 1 ms
[2024-06-01 12:02:30] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-06-01 12:02:30] [INFO ] Invariant cache hit.
[2024-06-01 12:02:30] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2024-06-01 12:02:30] [INFO ] Redundant transitions in 3 ms returned []
Running 130 sub problems to find dead transitions.
[2024-06-01 12:02:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 2/159 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-01 12:02:31] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-06-01 12:02:31] [INFO ] Deduced a trap composed of 5 places in 13 ms of which 0 ms to minimize.
[2024-06-01 12:02:31] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 1 ms to minimize.
[2024-06-01 12:02:32] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
[2024-06-01 12:02:32] [INFO ] Deduced a trap composed of 7 places in 14 ms of which 0 ms to minimize.
[2024-06-01 12:02:32] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:02:32] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:02:32] [INFO ] Deduced a trap composed of 43 places in 34 ms of which 0 ms to minimize.
[2024-06-01 12:02:32] [INFO ] Deduced a trap composed of 56 places in 32 ms of which 0 ms to minimize.
[2024-06-01 12:02:32] [INFO ] Deduced a trap composed of 72 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 10/66 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (OVERLAPS) 134/293 variables, 159/225 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (OVERLAPS) 0/293 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 225 constraints, problems are : Problem set: 0 solved, 130 unsolved in 3494 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 8/55 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (OVERLAPS) 2/159 variables, 9/64 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-01 12:02:35] [INFO ] Deduced a trap composed of 43 places in 27 ms of which 0 ms to minimize.
[2024-06-01 12:02:35] [INFO ] Deduced a trap composed of 41 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (OVERLAPS) 134/293 variables, 159/227 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/293 variables, 130/357 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-01 12:02:41] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:02:41] [INFO ] Deduced a trap composed of 8 places in 15 ms of which 1 ms to minimize.
[2024-06-01 12:02:43] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/293 variables, 3/360 constraints. Problems are: Problem set: 0 solved, 130 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 293/293 variables, and 360 constraints, problems are : Problem set: 0 solved, 130 unsolved in 30007 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 15/15 constraints]
After SMT, in 33518ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 33520ms
Starting structural reductions in SI_LTL mode, iteration 1 : 159/317 places, 134/292 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 33781 ms. Remains : 159/317 places, 134/292 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-005B-LTLFireability-03
Stuttering criterion allowed to conclude after 393 steps with 2 reset in 1 ms.
FORMULA ShieldPPPs-PT-005B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-005B-LTLFireability-03 finished in 33906 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||(p1&&F(G(p1))))))'
Support contains 2 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 292/292 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 310 transition count 285
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 310 transition count 285
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 309 transition count 284
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 309 transition count 284
Applied a total of 16 rules in 9 ms. Remains 309 /317 variables (removed 8) and now considering 284/292 (removed 8) transitions.
// Phase 1: matrix 284 rows 309 cols
[2024-06-01 12:03:04] [INFO ] Computed 56 invariants in 3 ms
[2024-06-01 12:03:04] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-06-01 12:03:04] [INFO ] Invariant cache hit.
[2024-06-01 12:03:04] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
Running 283 sub problems to find dead transitions.
[2024-06-01 12:03:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (OVERLAPS) 1/309 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 12:03:07] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:03:07] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
[2024-06-01 12:03:08] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:03:08] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:03:08] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 2 ms to minimize.
[2024-06-01 12:03:08] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2024-06-01 12:03:08] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:03:08] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:03:08] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:03:08] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:03:08] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2024-06-01 12:03:08] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:03:08] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 2 ms to minimize.
[2024-06-01 12:03:08] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-06-01 12:03:08] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 2 ms to minimize.
[2024-06-01 12:03:08] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:03:08] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2024-06-01 12:03:09] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2024-06-01 12:03:09] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:03:09] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/309 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 12:03:09] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:03:09] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:03:09] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 0 ms to minimize.
[2024-06-01 12:03:09] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-06-01 12:03:09] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:03:10] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
[2024-06-01 12:03:10] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:03:10] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:03:10] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 0 ms to minimize.
[2024-06-01 12:03:10] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 2 ms to minimize.
[2024-06-01 12:03:10] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-06-01 12:03:10] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 0 ms to minimize.
[2024-06-01 12:03:10] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:03:10] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-06-01 12:03:10] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
[2024-06-01 12:03:10] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:03:10] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:03:10] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:03:10] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 2 ms to minimize.
[2024-06-01 12:03:10] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 12:03:12] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:03:12] [INFO ] Deduced a trap composed of 18 places in 17 ms of which 1 ms to minimize.
[2024-06-01 12:03:13] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:03:13] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:03:13] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:03:13] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:03:13] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:03:13] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:03:13] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:03:13] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:03:13] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:03:13] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:03:13] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
[2024-06-01 12:03:13] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:03:13] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:03:13] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:03:14] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 17/113 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 12:03:14] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 0 ms to minimize.
[2024-06-01 12:03:15] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 1 ms to minimize.
[2024-06-01 12:03:15] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:03:15] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:03:15] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:03:15] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 6/119 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 12:03:17] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 8 (OVERLAPS) 284/593 variables, 309/429 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 12:03:21] [INFO ] Deduced a trap composed of 47 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:03:21] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 0 ms to minimize.
[2024-06-01 12:03:22] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:03:22] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:03:23] [INFO ] Deduced a trap composed of 48 places in 36 ms of which 0 ms to minimize.
[2024-06-01 12:03:23] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 0 ms to minimize.
[2024-06-01 12:03:23] [INFO ] Deduced a trap composed of 28 places in 21 ms of which 0 ms to minimize.
[2024-06-01 12:03:23] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 0 ms to minimize.
[2024-06-01 12:03:23] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/593 variables, 9/438 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 12:03:26] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-06-01 12:03:26] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 0 ms to minimize.
[2024-06-01 12:03:26] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:03:26] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:03:26] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/593 variables, 5/443 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 12:03:27] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:03:28] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:03:28] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:03:28] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:03:28] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:03:28] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:03:28] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:03:28] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:03:29] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2024-06-01 12:03:29] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 1 ms to minimize.
[2024-06-01 12:03:29] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 2 ms to minimize.
[2024-06-01 12:03:29] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 1 ms to minimize.
[2024-06-01 12:03:29] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:03:29] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 2 ms to minimize.
[2024-06-01 12:03:29] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 1 ms to minimize.
[2024-06-01 12:03:30] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 0 ms to minimize.
[2024-06-01 12:03:30] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:03:30] [INFO ] Deduced a trap composed of 39 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:03:30] [INFO ] Deduced a trap composed of 40 places in 27 ms of which 0 ms to minimize.
[2024-06-01 12:03:30] [INFO ] Deduced a trap composed of 40 places in 28 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/593 variables, 20/463 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 12:03:31] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 0 ms to minimize.
[2024-06-01 12:03:31] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:03:32] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 1 ms to minimize.
[2024-06-01 12:03:32] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:03:32] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 1 ms to minimize.
[2024-06-01 12:03:32] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:03:32] [INFO ] Deduced a trap composed of 51 places in 51 ms of which 2 ms to minimize.
[2024-06-01 12:03:32] [INFO ] Deduced a trap composed of 49 places in 59 ms of which 1 ms to minimize.
[2024-06-01 12:03:32] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:03:32] [INFO ] Deduced a trap composed of 47 places in 56 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/593 variables, 10/473 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 593/593 variables, and 473 constraints, problems are : Problem set: 0 solved, 283 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 309/309 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 108/108 constraints]
Escalating to Integer solving :Problem set: 0 solved, 283 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (OVERLAPS) 1/309 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/309 variables, 108/164 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 12:03:37] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:03:37] [INFO ] Deduced a trap composed of 31 places in 27 ms of which 0 ms to minimize.
[2024-06-01 12:03:37] [INFO ] Deduced a trap composed of 33 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:03:37] [INFO ] Deduced a trap composed of 27 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:03:37] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:03:37] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 6/170 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 12:03:38] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2024-06-01 12:03:38] [INFO ] Deduced a trap composed of 20 places in 17 ms of which 1 ms to minimize.
[2024-06-01 12:03:38] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:03:39] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:03:39] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:03:39] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:03:39] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 0 ms to minimize.
[2024-06-01 12:03:39] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 0 ms to minimize.
[2024-06-01 12:03:39] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 9/179 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 12:03:40] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-06-01 12:03:40] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-06-01 12:03:40] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:03:41] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 4/183 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (OVERLAPS) 284/593 variables, 309/492 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/593 variables, 283/775 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 12:03:48] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:03:48] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:03:48] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
[2024-06-01 12:03:48] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:03:49] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 2 ms to minimize.
[2024-06-01 12:03:50] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 2 ms to minimize.
[2024-06-01 12:03:50] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 2 ms to minimize.
[2024-06-01 12:03:51] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-06-01 12:03:51] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 1 ms to minimize.
[2024-06-01 12:03:51] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 2 ms to minimize.
[2024-06-01 12:03:51] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
[2024-06-01 12:03:51] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-06-01 12:03:52] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 2 ms to minimize.
[2024-06-01 12:03:52] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/593 variables, 14/789 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 12:04:00] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 1 ms to minimize.
[2024-06-01 12:04:00] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 2 ms to minimize.
[2024-06-01 12:04:01] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 2 ms to minimize.
[2024-06-01 12:04:01] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 2 ms to minimize.
[2024-06-01 12:04:02] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:04:02] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2024-06-01 12:04:02] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:04:03] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:04:03] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:04:03] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:04:04] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 593/593 variables, and 800 constraints, problems are : Problem set: 0 solved, 283 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 309/309 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 152/152 constraints]
After SMT, in 60052ms problems are : Problem set: 0 solved, 283 unsolved
Search for dead transitions found 0 dead transitions in 60055ms
Starting structural reductions in LTL mode, iteration 1 : 309/317 places, 284/292 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60372 ms. Remains : 309/317 places, 284/292 transitions.
Stuttering acceptance computed with spot in 231 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-005B-LTLFireability-04
Product exploration explored 100000 steps with 116 reset in 274 ms.
Product exploration explored 100000 steps with 114 reset in 353 ms.
Computed a total of 60 stabilizing places and 60 stable transitions
Computed a total of 60 stabilizing places and 60 stable transitions
Detected a total of 60/309 stabilizing places and 60/284 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 89 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), true, (NOT p1)]
RANDOM walk for 1940 steps (0 resets) in 18 ms. (102 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 (NOT p0)), (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 4 factoid took 158 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), true, (NOT p1)]
Support contains 2 out of 309 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 309/309 places, 284/284 transitions.
Applied a total of 0 rules in 2 ms. Remains 309 /309 variables (removed 0) and now considering 284/284 (removed 0) transitions.
[2024-06-01 12:04:06] [INFO ] Invariant cache hit.
[2024-06-01 12:04:06] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-06-01 12:04:06] [INFO ] Invariant cache hit.
[2024-06-01 12:04:06] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
Running 283 sub problems to find dead transitions.
[2024-06-01 12:04:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (OVERLAPS) 1/309 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 12:04:09] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:04:09] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:04:10] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:04:10] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:04:10] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 2 ms to minimize.
[2024-06-01 12:04:10] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 2 ms to minimize.
[2024-06-01 12:04:10] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:04:10] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:04:10] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:04:10] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:04:10] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 0 ms to minimize.
[2024-06-01 12:04:10] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:04:10] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
[2024-06-01 12:04:10] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 2 ms to minimize.
[2024-06-01 12:04:10] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-06-01 12:04:10] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:04:11] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:04:11] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-06-01 12:04:11] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-06-01 12:04:11] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/309 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 12:04:11] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2024-06-01 12:04:11] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-06-01 12:04:11] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:04:11] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:04:12] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:04:12] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 1 ms to minimize.
[2024-06-01 12:04:12] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:04:12] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 3 ms to minimize.
[2024-06-01 12:04:12] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:04:12] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 2 ms to minimize.
[2024-06-01 12:04:12] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:04:12] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 0 ms to minimize.
[2024-06-01 12:04:12] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:04:12] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:04:12] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:04:12] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:04:12] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-06-01 12:04:12] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2024-06-01 12:04:12] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:04:12] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 12:04:15] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:04:15] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:04:15] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:04:15] [INFO ] Deduced a trap composed of 47 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:04:15] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:04:15] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:04:15] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-06-01 12:04:15] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:04:15] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:04:15] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:04:15] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:04:15] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:04:15] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 0 ms to minimize.
[2024-06-01 12:04:15] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:04:15] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:04:16] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-06-01 12:04:16] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 17/113 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 12:04:17] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:04:17] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2024-06-01 12:04:17] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:04:17] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:04:17] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:04:17] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 6/119 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 12:04:19] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 8 (OVERLAPS) 284/593 variables, 309/429 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 12:04:23] [INFO ] Deduced a trap composed of 47 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:04:23] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 0 ms to minimize.
[2024-06-01 12:04:24] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:04:25] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:04:25] [INFO ] Deduced a trap composed of 48 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:04:25] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:04:25] [INFO ] Deduced a trap composed of 28 places in 26 ms of which 0 ms to minimize.
[2024-06-01 12:04:25] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:04:25] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/593 variables, 9/438 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 12:04:28] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:04:29] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-06-01 12:04:29] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:04:29] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 0 ms to minimize.
[2024-06-01 12:04:29] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/593 variables, 5/443 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 12:04:30] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:04:30] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-06-01 12:04:31] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:04:31] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:04:31] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 0 ms to minimize.
[2024-06-01 12:04:31] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:04:31] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 0 ms to minimize.
[2024-06-01 12:04:31] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:04:31] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:04:31] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 2 ms to minimize.
[2024-06-01 12:04:32] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2024-06-01 12:04:32] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 1 ms to minimize.
[2024-06-01 12:04:32] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 1 ms to minimize.
[2024-06-01 12:04:32] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 2 ms to minimize.
[2024-06-01 12:04:32] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:04:32] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:04:32] [INFO ] Deduced a trap composed of 39 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:04:33] [INFO ] Deduced a trap composed of 39 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:04:33] [INFO ] Deduced a trap composed of 40 places in 32 ms of which 0 ms to minimize.
[2024-06-01 12:04:33] [INFO ] Deduced a trap composed of 40 places in 30 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/593 variables, 20/463 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 12:04:34] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 0 ms to minimize.
[2024-06-01 12:04:34] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:04:34] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 1 ms to minimize.
[2024-06-01 12:04:34] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:04:34] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:04:34] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:04:34] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:04:34] [INFO ] Deduced a trap composed of 49 places in 53 ms of which 2 ms to minimize.
[2024-06-01 12:04:35] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:04:35] [INFO ] Deduced a trap composed of 47 places in 59 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/593 variables, 10/473 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 593/593 variables, and 473 constraints, problems are : Problem set: 0 solved, 283 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 309/309 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 108/108 constraints]
Escalating to Integer solving :Problem set: 0 solved, 283 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (OVERLAPS) 1/309 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/309 variables, 108/164 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 12:04:39] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:04:39] [INFO ] Deduced a trap composed of 31 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:04:39] [INFO ] Deduced a trap composed of 33 places in 23 ms of which 0 ms to minimize.
[2024-06-01 12:04:39] [INFO ] Deduced a trap composed of 27 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:04:39] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
[2024-06-01 12:04:39] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 6/170 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 12:04:40] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:04:40] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
[2024-06-01 12:04:40] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 2 ms to minimize.
[2024-06-01 12:04:41] [INFO ] Deduced a trap composed of 25 places in 19 ms of which 0 ms to minimize.
[2024-06-01 12:04:41] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:04:41] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:04:41] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:04:41] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
[2024-06-01 12:04:41] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 9/179 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 12:04:42] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:04:42] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:04:42] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 1 ms to minimize.
[2024-06-01 12:04:43] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 4/183 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (OVERLAPS) 284/593 variables, 309/492 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/593 variables, 283/775 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 12:04:50] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 2 ms to minimize.
[2024-06-01 12:04:50] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:04:50] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 0 ms to minimize.
[2024-06-01 12:04:50] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:04:51] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 2 ms to minimize.
[2024-06-01 12:04:52] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 2 ms to minimize.
[2024-06-01 12:04:53] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 2 ms to minimize.
[2024-06-01 12:04:53] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-06-01 12:04:53] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 1 ms to minimize.
[2024-06-01 12:04:53] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2024-06-01 12:04:53] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-06-01 12:04:54] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 2 ms to minimize.
[2024-06-01 12:04:54] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-06-01 12:04:54] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/593 variables, 14/789 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 12:05:02] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2024-06-01 12:05:03] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 2 ms to minimize.
[2024-06-01 12:05:03] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2024-06-01 12:05:03] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 1 ms to minimize.
[2024-06-01 12:05:04] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:05:04] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:05:04] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:05:05] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:05:05] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 2 ms to minimize.
[2024-06-01 12:05:05] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:05:06] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 593/593 variables, and 800 constraints, problems are : Problem set: 0 solved, 283 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 309/309 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 152/152 constraints]
After SMT, in 60055ms problems are : Problem set: 0 solved, 283 unsolved
Search for dead transitions found 0 dead transitions in 60058ms
Finished structural reductions in LTL mode , in 1 iterations and 60363 ms. Remains : 309/309 places, 284/284 transitions.
Computed a total of 60 stabilizing places and 60 stable transitions
Computed a total of 60 stabilizing places and 60 stable transitions
Detected a total of 60/309 stabilizing places and 60/284 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 124 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), true, (NOT p1)]
RANDOM walk for 2021 steps (1 resets) in 17 ms. (112 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 (NOT p0)), (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 4 factoid took 159 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), true, (NOT p1)]
Product exploration explored 100000 steps with 114 reset in 227 ms.
Product exploration explored 100000 steps with 115 reset in 263 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), true, (NOT p1)]
Support contains 2 out of 309 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 309/309 places, 284/284 transitions.
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 309 transition count 284
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 12 Pre rules applied. Total rules applied 35 place count 309 transition count 286
Deduced a syphon composed of 47 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 47 place count 309 transition count 286
Performed 103 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 150 places in 0 ms
Iterating global reduction 1 with 103 rules applied. Total rules applied 150 place count 309 transition count 286
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 185 place count 274 transition count 251
Deduced a syphon composed of 115 places in 0 ms
Iterating global reduction 1 with 35 rules applied. Total rules applied 220 place count 274 transition count 251
Deduced a syphon composed of 115 places in 0 ms
Applied a total of 220 rules in 47 ms. Remains 274 /309 variables (removed 35) and now considering 251/284 (removed 33) transitions.
[2024-06-01 12:05:08] [INFO ] Redundant transitions in 2 ms returned []
Running 250 sub problems to find dead transitions.
// Phase 1: matrix 251 rows 274 cols
[2024-06-01 12:05:08] [INFO ] Computed 56 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (OVERLAPS) 1/274 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-06-01 12:05:10] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-06-01 12:05:10] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-06-01 12:05:10] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-06-01 12:05:11] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-06-01 12:05:11] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-06-01 12:05:11] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-06-01 12:05:11] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-06-01 12:05:11] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-06-01 12:05:11] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
Problem TDEAD24 is UNSAT
[2024-06-01 12:05:11] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-06-01 12:05:11] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-06-01 12:05:11] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-06-01 12:05:11] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
Problem TDEAD38 is UNSAT
[2024-06-01 12:05:11] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
Problem TDEAD40 is UNSAT
[2024-06-01 12:05:11] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
[2024-06-01 12:05:11] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
[2024-06-01 12:05:11] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-06-01 12:05:11] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
[2024-06-01 12:05:11] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
[2024-06-01 12:05:11] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 20/76 constraints. Problems are: Problem set: 75 solved, 175 unsolved
[2024-06-01 12:05:11] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
[2024-06-01 12:05:11] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
[2024-06-01 12:05:11] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:05:11] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
[2024-06-01 12:05:11] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
[2024-06-01 12:05:11] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
[2024-06-01 12:05:11] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD67 is UNSAT
[2024-06-01 12:05:11] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
[2024-06-01 12:05:12] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
[2024-06-01 12:05:12] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
Problem TDEAD72 is UNSAT
[2024-06-01 12:05:12] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
[2024-06-01 12:05:12] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
[2024-06-01 12:05:12] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
[2024-06-01 12:05:12] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD80 is UNSAT
[2024-06-01 12:05:12] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
[2024-06-01 12:05:12] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
Problem TDEAD84 is UNSAT
[2024-06-01 12:05:12] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
[2024-06-01 12:05:12] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
[2024-06-01 12:05:12] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD138 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
[2024-06-01 12:05:12] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 20/96 constraints. Problems are: Problem set: 114 solved, 136 unsolved
[2024-06-01 12:05:13] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
Problem TDEAD184 is UNSAT
[2024-06-01 12:05:13] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Problem TDEAD206 is UNSAT
[2024-06-01 12:05:13] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD228 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 3/99 constraints. Problems are: Problem set: 117 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 0/99 constraints. Problems are: Problem set: 117 solved, 133 unsolved
At refinement iteration 6 (OVERLAPS) 251/525 variables, 274/373 constraints. Problems are: Problem set: 117 solved, 133 unsolved
[2024-06-01 12:05:15] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-06-01 12:05:16] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/525 variables, 2/375 constraints. Problems are: Problem set: 117 solved, 133 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/525 variables, 0/375 constraints. Problems are: Problem set: 117 solved, 133 unsolved
[2024-06-01 12:05:17] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:05:17] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2024-06-01 12:05:18] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-06-01 12:05:18] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 0 ms to minimize.
[2024-06-01 12:05:18] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:05:18] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/525 variables, 6/381 constraints. Problems are: Problem set: 117 solved, 133 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/525 variables, 0/381 constraints. Problems are: Problem set: 117 solved, 133 unsolved
[2024-06-01 12:05:20] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:05:20] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-06-01 12:05:21] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/525 variables, 3/384 constraints. Problems are: Problem set: 117 solved, 133 unsolved
[2024-06-01 12:05:22] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:05:22] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/525 variables, 2/386 constraints. Problems are: Problem set: 117 solved, 133 unsolved
[2024-06-01 12:05:23] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/525 variables, 1/387 constraints. Problems are: Problem set: 117 solved, 133 unsolved
[2024-06-01 12:05:24] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/525 variables, 1/388 constraints. Problems are: Problem set: 117 solved, 133 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/525 variables, 0/388 constraints. Problems are: Problem set: 117 solved, 133 unsolved
[2024-06-01 12:05:27] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/525 variables, 1/389 constraints. Problems are: Problem set: 117 solved, 133 unsolved
[2024-06-01 12:05:28] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/525 variables, 1/390 constraints. Problems are: Problem set: 117 solved, 133 unsolved
[2024-06-01 12:05:29] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:05:29] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/525 variables, 2/392 constraints. Problems are: Problem set: 117 solved, 133 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/525 variables, 0/392 constraints. Problems are: Problem set: 117 solved, 133 unsolved
At refinement iteration 20 (OVERLAPS) 0/525 variables, 0/392 constraints. Problems are: Problem set: 117 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 525/525 variables, and 392 constraints, problems are : Problem set: 117 solved, 133 unsolved in 24143 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 62/62 constraints]
Escalating to Integer solving :Problem set: 117 solved, 133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 117 solved, 133 unsolved
At refinement iteration 1 (OVERLAPS) 116/274 variables, 56/56 constraints. Problems are: Problem set: 117 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 62/118 constraints. Problems are: Problem set: 117 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 0/118 constraints. Problems are: Problem set: 117 solved, 133 unsolved
At refinement iteration 4 (OVERLAPS) 251/525 variables, 274/392 constraints. Problems are: Problem set: 117 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/525 variables, 133/525 constraints. Problems are: Problem set: 117 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/525 variables, 0/525 constraints. Problems are: Problem set: 117 solved, 133 unsolved
At refinement iteration 7 (OVERLAPS) 0/525 variables, 0/525 constraints. Problems are: Problem set: 117 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Int declared 525/525 variables, and 525 constraints, problems are : Problem set: 117 solved, 133 unsolved in 11117 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 133/250 constraints, Known Traps: 62/62 constraints]
After SMT, in 35297ms problems are : Problem set: 117 solved, 133 unsolved
Search for dead transitions found 117 dead transitions in 35302ms
Found 117 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 117 transitions
Dead transitions reduction (with SMT) removed 117 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 274/309 places, 134/284 transitions.
Graph (complete) has 416 edges and 274 vertex of which 159 are kept as prefixes of interest. Removing 115 places using SCC suffix rule.2 ms
Discarding 115 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 13 ms. Remains 159 /274 variables (removed 115) and now considering 134/134 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 159/309 places, 134/284 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 35381 ms. Remains : 159/309 places, 134/284 transitions.
Support contains 2 out of 309 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 309/309 places, 284/284 transitions.
Applied a total of 0 rules in 4 ms. Remains 309 /309 variables (removed 0) and now considering 284/284 (removed 0) transitions.
// Phase 1: matrix 284 rows 309 cols
[2024-06-01 12:05:44] [INFO ] Computed 56 invariants in 2 ms
[2024-06-01 12:05:44] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-01 12:05:44] [INFO ] Invariant cache hit.
[2024-06-01 12:05:44] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
Running 283 sub problems to find dead transitions.
[2024-06-01 12:05:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (OVERLAPS) 1/309 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 12:05:47] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:05:47] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:05:47] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-06-01 12:05:47] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:05:47] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 2 ms to minimize.
[2024-06-01 12:05:47] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 2 ms to minimize.
[2024-06-01 12:05:47] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:05:47] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
[2024-06-01 12:05:47] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:05:47] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:05:47] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 0 ms to minimize.
[2024-06-01 12:05:48] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:05:48] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
[2024-06-01 12:05:48] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 2 ms to minimize.
[2024-06-01 12:05:48] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-06-01 12:05:48] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:05:48] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
[2024-06-01 12:05:48] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:05:48] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
[2024-06-01 12:05:48] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/309 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 12:05:49] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-06-01 12:05:49] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-06-01 12:05:49] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:05:49] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 2 ms to minimize.
[2024-06-01 12:05:49] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:05:49] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 0 ms to minimize.
[2024-06-01 12:05:49] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:05:49] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:05:49] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:05:49] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-06-01 12:05:49] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:05:49] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:05:49] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:05:49] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:05:50] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:05:50] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:05:50] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-06-01 12:05:50] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:05:50] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:05:50] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 12:05:52] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 0 ms to minimize.
[2024-06-01 12:05:52] [INFO ] Deduced a trap composed of 18 places in 17 ms of which 1 ms to minimize.
[2024-06-01 12:05:52] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:05:52] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:05:52] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:05:52] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:05:53] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:05:53] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:05:53] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:05:53] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:05:53] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:05:53] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:05:53] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
[2024-06-01 12:05:53] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:05:53] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:05:53] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2024-06-01 12:05:53] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 17/113 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 12:05:54] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
[2024-06-01 12:05:54] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:05:55] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-06-01 12:05:55] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:05:55] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:05:55] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 6/119 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 12:05:57] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 8 (OVERLAPS) 284/593 variables, 309/429 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 12:06:01] [INFO ] Deduced a trap composed of 47 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:06:01] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:06:02] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 0 ms to minimize.
[2024-06-01 12:06:03] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:06:03] [INFO ] Deduced a trap composed of 48 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:06:03] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:06:03] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 0 ms to minimize.
[2024-06-01 12:06:03] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:06:03] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/593 variables, 9/438 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 12:06:06] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:06:06] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:06:06] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 0 ms to minimize.
[2024-06-01 12:06:07] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 0 ms to minimize.
[2024-06-01 12:06:07] [INFO ] Deduced a trap composed of 20 places in 19 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/593 variables, 5/443 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 12:06:08] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2024-06-01 12:06:08] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:06:08] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:06:08] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:06:09] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:06:09] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:06:09] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:06:09] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:06:09] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:06:09] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 1 ms to minimize.
[2024-06-01 12:06:09] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-06-01 12:06:09] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 2 ms to minimize.
[2024-06-01 12:06:09] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 2 ms to minimize.
[2024-06-01 12:06:10] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 2 ms to minimize.
[2024-06-01 12:06:10] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 1 ms to minimize.
[2024-06-01 12:06:10] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:06:10] [INFO ] Deduced a trap composed of 39 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:06:10] [INFO ] Deduced a trap composed of 39 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:06:10] [INFO ] Deduced a trap composed of 40 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:06:10] [INFO ] Deduced a trap composed of 40 places in 29 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/593 variables, 20/463 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 12:06:12] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:06:12] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:06:12] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 3 ms to minimize.
[2024-06-01 12:06:12] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 2 ms to minimize.
[2024-06-01 12:06:12] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 2 ms to minimize.
[2024-06-01 12:06:12] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:06:12] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 1 ms to minimize.
[2024-06-01 12:06:12] [INFO ] Deduced a trap composed of 49 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:06:13] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:06:13] [INFO ] Deduced a trap composed of 47 places in 59 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/593 variables, 10/473 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 593/593 variables, and 473 constraints, problems are : Problem set: 0 solved, 283 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 309/309 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 108/108 constraints]
Escalating to Integer solving :Problem set: 0 solved, 283 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (OVERLAPS) 1/309 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/309 variables, 108/164 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 12:06:16] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:06:16] [INFO ] Deduced a trap composed of 31 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:06:16] [INFO ] Deduced a trap composed of 33 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:06:16] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 0 ms to minimize.
[2024-06-01 12:06:17] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:06:17] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 6/170 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 12:06:18] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:06:18] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:06:18] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:06:18] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:06:19] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 2 ms to minimize.
[2024-06-01 12:06:19] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:06:19] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:06:19] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:06:19] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 9/179 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 12:06:20] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:06:20] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:06:20] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 0 ms to minimize.
[2024-06-01 12:06:21] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 4/183 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (OVERLAPS) 284/593 variables, 309/492 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/593 variables, 283/775 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 12:06:28] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:06:28] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:06:28] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:06:28] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:06:29] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 2 ms to minimize.
[2024-06-01 12:06:30] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 2 ms to minimize.
[2024-06-01 12:06:31] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2024-06-01 12:06:31] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-06-01 12:06:31] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 2 ms to minimize.
[2024-06-01 12:06:31] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 2 ms to minimize.
[2024-06-01 12:06:31] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
[2024-06-01 12:06:32] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 2 ms to minimize.
[2024-06-01 12:06:32] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-06-01 12:06:32] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/593 variables, 14/789 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 12:06:40] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 2 ms to minimize.
[2024-06-01 12:06:40] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
[2024-06-01 12:06:41] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 2 ms to minimize.
[2024-06-01 12:06:41] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 2 ms to minimize.
[2024-06-01 12:06:42] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-06-01 12:06:42] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:06:42] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:06:43] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:06:43] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:06:43] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 593/593 variables, and 799 constraints, problems are : Problem set: 0 solved, 283 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 309/309 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 151/151 constraints]
After SMT, in 60055ms problems are : Problem set: 0 solved, 283 unsolved
Search for dead transitions found 0 dead transitions in 60058ms
Finished structural reductions in LTL mode , in 1 iterations and 60353 ms. Remains : 309/309 places, 284/284 transitions.
Treatment of property ShieldPPPs-PT-005B-LTLFireability-04 finished in 219816 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 317 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 317/317 places, 292/292 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 316 transition count 254
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 74 place count 279 transition count 254
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 74 place count 279 transition count 229
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 124 place count 254 transition count 229
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 132 place count 246 transition count 221
Iterating global reduction 2 with 8 rules applied. Total rules applied 140 place count 246 transition count 221
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 140 place count 246 transition count 215
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 152 place count 240 transition count 215
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 0 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 2 with 164 rules applied. Total rules applied 316 place count 158 transition count 133
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 318 place count 156 transition count 131
Applied a total of 318 rules in 25 ms. Remains 156 /317 variables (removed 161) and now considering 131/292 (removed 161) transitions.
// Phase 1: matrix 131 rows 156 cols
[2024-06-01 12:06:44] [INFO ] Computed 56 invariants in 1 ms
[2024-06-01 12:06:44] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-06-01 12:06:44] [INFO ] Invariant cache hit.
[2024-06-01 12:06:44] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
[2024-06-01 12:06:44] [INFO ] Redundant transitions in 0 ms returned []
Running 129 sub problems to find dead transitions.
[2024-06-01 12:06:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-06-01 12:06:45] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-06-01 12:06:45] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:06:45] [INFO ] Deduced a trap composed of 58 places in 34 ms of which 0 ms to minimize.
[2024-06-01 12:06:45] [INFO ] Deduced a trap composed of 72 places in 33 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 131/287 variables, 156/216 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-06-01 12:06:46] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2024-06-01 12:06:47] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-06-01 12:06:47] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-06-01 12:06:48] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/287 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/287 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 220 constraints, problems are : Problem set: 0 solved, 129 unsolved in 5995 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 131/287 variables, 156/220 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 129/349 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 0/287 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 349 constraints, problems are : Problem set: 0 solved, 129 unsolved in 8567 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 8/8 constraints]
After SMT, in 14574ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 14575ms
Starting structural reductions in SI_LTL mode, iteration 1 : 156/317 places, 131/292 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14905 ms. Remains : 156/317 places, 131/292 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-005B-LTLFireability-06
Product exploration explored 100000 steps with 272 reset in 247 ms.
Product exploration explored 100000 steps with 270 reset in 274 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 65 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
RANDOM walk for 957 steps (0 resets) in 7 ms. (119 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 131/131 transitions.
Applied a total of 0 rules in 3 ms. Remains 156 /156 variables (removed 0) and now considering 131/131 (removed 0) transitions.
[2024-06-01 12:07:00] [INFO ] Invariant cache hit.
[2024-06-01 12:07:00] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-01 12:07:00] [INFO ] Invariant cache hit.
[2024-06-01 12:07:00] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
[2024-06-01 12:07:00] [INFO ] Redundant transitions in 0 ms returned []
Running 129 sub problems to find dead transitions.
[2024-06-01 12:07:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-06-01 12:07:01] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:07:01] [INFO ] Deduced a trap composed of 42 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:07:01] [INFO ] Deduced a trap composed of 58 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:07:01] [INFO ] Deduced a trap composed of 72 places in 38 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 131/287 variables, 156/216 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-06-01 12:07:02] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 0 ms to minimize.
[2024-06-01 12:07:02] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-06-01 12:07:02] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-06-01 12:07:04] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 0 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/287 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/287 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 220 constraints, problems are : Problem set: 0 solved, 129 unsolved in 5914 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 131/287 variables, 156/220 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 129/349 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 0/287 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 349 constraints, problems are : Problem set: 0 solved, 129 unsolved in 8534 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 8/8 constraints]
After SMT, in 14461ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 14462ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14652 ms. Remains : 156/156 places, 131/131 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
RANDOM walk for 3828 steps (8 resets) in 19 ms. (191 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 272 reset in 244 ms.
Product exploration explored 100000 steps with 275 reset in 271 ms.
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 131/131 transitions.
Applied a total of 0 rules in 4 ms. Remains 156 /156 variables (removed 0) and now considering 131/131 (removed 0) transitions.
[2024-06-01 12:07:15] [INFO ] Invariant cache hit.
[2024-06-01 12:07:15] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-06-01 12:07:15] [INFO ] Invariant cache hit.
[2024-06-01 12:07:15] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2024-06-01 12:07:15] [INFO ] Redundant transitions in 0 ms returned []
Running 129 sub problems to find dead transitions.
[2024-06-01 12:07:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-06-01 12:07:16] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:07:16] [INFO ] Deduced a trap composed of 42 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:07:16] [INFO ] Deduced a trap composed of 58 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:07:16] [INFO ] Deduced a trap composed of 72 places in 38 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 131/287 variables, 156/216 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-06-01 12:07:17] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
[2024-06-01 12:07:18] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-06-01 12:07:18] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-06-01 12:07:19] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/287 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/287 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 220 constraints, problems are : Problem set: 0 solved, 129 unsolved in 5842 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 131/287 variables, 156/220 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 129/349 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 0/287 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 349 constraints, problems are : Problem set: 0 solved, 129 unsolved in 8437 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 8/8 constraints]
After SMT, in 14293ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 14294ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14511 ms. Remains : 156/156 places, 131/131 transitions.
Treatment of property ShieldPPPs-PT-005B-LTLFireability-06 finished in 45794 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((p0||G(F(p1)))) U X(G(p2)))))'
Support contains 4 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 292/292 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 308 transition count 283
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 308 transition count 283
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 307 transition count 282
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 307 transition count 282
Applied a total of 20 rules in 7 ms. Remains 307 /317 variables (removed 10) and now considering 282/292 (removed 10) transitions.
// Phase 1: matrix 282 rows 307 cols
[2024-06-01 12:07:30] [INFO ] Computed 56 invariants in 4 ms
[2024-06-01 12:07:30] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-06-01 12:07:30] [INFO ] Invariant cache hit.
[2024-06-01 12:07:30] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
Running 281 sub problems to find dead transitions.
[2024-06-01 12:07:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (OVERLAPS) 1/307 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 12:07:33] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:07:33] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:07:33] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-06-01 12:07:33] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:07:33] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:07:33] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-06-01 12:07:33] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 2 ms to minimize.
[2024-06-01 12:07:33] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 2 ms to minimize.
[2024-06-01 12:07:33] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:07:33] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:07:33] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-06-01 12:07:34] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:07:34] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:07:34] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 2 ms to minimize.
[2024-06-01 12:07:34] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-06-01 12:07:34] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:07:34] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:07:34] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:07:34] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:07:34] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 12:07:35] [INFO ] Deduced a trap composed of 37 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:07:35] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-06-01 12:07:35] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-06-01 12:07:35] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:07:35] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:07:35] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:07:35] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:07:35] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-06-01 12:07:35] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:07:35] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:07:35] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:07:35] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:07:35] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:07:35] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-06-01 12:07:35] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:07:36] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:07:36] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:07:36] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:07:36] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:07:36] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/307 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 12:07:37] [INFO ] Deduced a trap composed of 19 places in 19 ms of which 0 ms to minimize.
[2024-06-01 12:07:37] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 1 ms to minimize.
[2024-06-01 12:07:38] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:07:38] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-06-01 12:07:38] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-06-01 12:07:38] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 2 ms to minimize.
[2024-06-01 12:07:38] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 2 ms to minimize.
[2024-06-01 12:07:38] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
[2024-06-01 12:07:38] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 1 ms to minimize.
[2024-06-01 12:07:38] [INFO ] Deduced a trap composed of 25 places in 20 ms of which 1 ms to minimize.
[2024-06-01 12:07:39] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 1 ms to minimize.
[2024-06-01 12:07:39] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:07:39] [INFO ] Deduced a trap composed of 61 places in 57 ms of which 1 ms to minimize.
[2024-06-01 12:07:39] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2024-06-01 12:07:39] [INFO ] Deduced a trap composed of 26 places in 24 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 15/111 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 12:07:40] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:07:40] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:07:41] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:07:41] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 4/115 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 12:07:42] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 2 ms to minimize.
[2024-06-01 12:07:42] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-06-01 12:07:42] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 1 ms to minimize.
[2024-06-01 12:07:42] [INFO ] Deduced a trap composed of 43 places in 71 ms of which 2 ms to minimize.
[2024-06-01 12:07:42] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 2 ms to minimize.
[2024-06-01 12:07:43] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:07:43] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:07:43] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:07:43] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 0 ms to minimize.
[2024-06-01 12:07:43] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:07:43] [INFO ] Deduced a trap composed of 31 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:07:43] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 12/127 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 8 (OVERLAPS) 282/589 variables, 307/434 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 12:07:46] [INFO ] Deduced a trap composed of 27 places in 25 ms of which 0 ms to minimize.
[2024-06-01 12:07:48] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:07:48] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/589 variables, 3/437 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 12:07:52] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:07:52] [INFO ] Deduced a trap composed of 41 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:07:52] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 0 ms to minimize.
[2024-06-01 12:07:52] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:07:52] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 0 ms to minimize.
[2024-06-01 12:07:53] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/589 variables, 6/443 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 12:07:54] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 0 ms to minimize.
[2024-06-01 12:07:54] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:07:56] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:07:56] [INFO ] Deduced a trap composed of 37 places in 25 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/589 variables, 4/447 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 12:07:56] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:07:57] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:07:58] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2024-06-01 12:07:58] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 0 ms to minimize.
[2024-06-01 12:07:58] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 0 ms to minimize.
[2024-06-01 12:07:58] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 1.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 1.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 1.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 1.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 1.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 1.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 1.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 1.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 1.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 1.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 1.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 1.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 1.0)
(s258 0.0)
(s259 0.0)
(s260 1.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 12 (INCLUDED_ONLY) 0/589 variables, 6/453 constraints. Problems are: Problem set: 0 solved, 281 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 589/589 variables, and 453 constraints, problems are : Problem set: 0 solved, 281 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 307/307 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 90/90 constraints]
Escalating to Integer solving :Problem set: 0 solved, 281 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (OVERLAPS) 1/307 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 90/146 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 12:08:02] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:08:02] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:08:02] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:08:02] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:08:02] [INFO ] Deduced a trap composed of 31 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:08:03] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:08:03] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:08:03] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:08:03] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:08:03] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:08:03] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:08:03] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/307 variables, 12/158 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 12:08:04] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 0 ms to minimize.
[2024-06-01 12:08:04] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:08:04] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:08:04] [INFO ] Deduced a trap composed of 27 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:08:05] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:08:05] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:08:05] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:08:05] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 8/166 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 12:08:06] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2024-06-01 12:08:06] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:08:06] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:08:07] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:08:07] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:08:07] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:08:07] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:08:07] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 0 ms to minimize.
[2024-06-01 12:08:07] [INFO ] Deduced a trap composed of 28 places in 26 ms of which 0 ms to minimize.
[2024-06-01 12:08:07] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 10/176 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 7 (OVERLAPS) 282/589 variables, 307/483 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/589 variables, 281/764 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 12:08:12] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:08:13] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:08:13] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 3 ms to minimize.
[2024-06-01 12:08:14] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 2 ms to minimize.
[2024-06-01 12:08:14] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 2 ms to minimize.
[2024-06-01 12:08:14] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 2 ms to minimize.
[2024-06-01 12:08:14] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:08:15] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:08:15] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:08:15] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:08:15] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:08:15] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:08:16] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2024-06-01 12:08:16] [INFO ] Deduced a trap composed of 45 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:08:17] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-06-01 12:08:18] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:08:18] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:08:18] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:08:18] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:08:18] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/589 variables, 20/784 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 12:08:26] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:08:27] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:08:27] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 0 ms to minimize.
[2024-06-01 12:08:27] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-06-01 12:08:30] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-06-01 12:08:30] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 589/589 variables, and 790 constraints, problems are : Problem set: 0 solved, 281 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 307/307 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 146/146 constraints]
After SMT, in 60058ms problems are : Problem set: 0 solved, 281 unsolved
Search for dead transitions found 0 dead transitions in 60061ms
Starting structural reductions in LTL mode, iteration 1 : 307/317 places, 282/292 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60328 ms. Remains : 307/317 places, 282/292 transitions.
Stuttering acceptance computed with spot in 196 ms :[(NOT p2), (NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p2)]
Running random walk in product with property : ShieldPPPs-PT-005B-LTLFireability-08
Stuttering criterion allowed to conclude after 20845 steps with 86 reset in 55 ms.
FORMULA ShieldPPPs-PT-005B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-005B-LTLFireability-08 finished in 60595 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&F(p1))))'
Support contains 5 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 292/292 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 309 transition count 284
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 309 transition count 284
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 308 transition count 283
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 308 transition count 283
Applied a total of 18 rules in 9 ms. Remains 308 /317 variables (removed 9) and now considering 283/292 (removed 9) transitions.
// Phase 1: matrix 283 rows 308 cols
[2024-06-01 12:08:30] [INFO ] Computed 56 invariants in 2 ms
[2024-06-01 12:08:30] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-06-01 12:08:30] [INFO ] Invariant cache hit.
[2024-06-01 12:08:31] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
Running 282 sub problems to find dead transitions.
[2024-06-01 12:08:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/307 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (OVERLAPS) 1/308 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:08:34] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:08:34] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 6 ms to minimize.
[2024-06-01 12:08:34] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-06-01 12:08:34] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:08:34] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 2 ms to minimize.
[2024-06-01 12:08:34] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 2 ms to minimize.
[2024-06-01 12:08:34] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:08:34] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:08:34] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 0 ms to minimize.
[2024-06-01 12:08:34] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-06-01 12:08:34] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:08:34] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:08:35] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 2 ms to minimize.
[2024-06-01 12:08:35] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-06-01 12:08:35] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:08:35] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:08:35] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:08:35] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:08:35] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:08:35] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:08:35] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:08:36] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 2 ms to minimize.
[2024-06-01 12:08:36] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 2 ms to minimize.
[2024-06-01 12:08:36] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:08:36] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-06-01 12:08:36] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-06-01 12:08:36] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:08:36] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:08:36] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:08:36] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2024-06-01 12:08:36] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:08:36] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:08:36] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:08:36] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:08:36] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:08:37] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:08:37] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:08:37] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-06-01 12:08:37] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2024-06-01 12:08:37] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:08:38] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-06-01 12:08:38] [INFO ] Deduced a trap composed of 17 places in 16 ms of which 0 ms to minimize.
[2024-06-01 12:08:39] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-06-01 12:08:39] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-06-01 12:08:39] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:08:39] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-06-01 12:08:39] [INFO ] Deduced a trap composed of 57 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:08:39] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-06-01 12:08:39] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:08:39] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 2 ms to minimize.
[2024-06-01 12:08:39] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-06-01 12:08:40] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-06-01 12:08:40] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:08:40] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
[2024-06-01 12:08:40] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:08:40] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
[2024-06-01 12:08:40] [INFO ] Deduced a trap composed of 25 places in 22 ms of which 1 ms to minimize.
[2024-06-01 12:08:40] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
[2024-06-01 12:08:40] [INFO ] Deduced a trap composed of 61 places in 54 ms of which 1 ms to minimize.
[2024-06-01 12:08:40] [INFO ] Deduced a trap composed of 56 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:08:41] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:08:41] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:08:41] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:08:41] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-06-01 12:08:41] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:08:41] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 0 ms to minimize.
[2024-06-01 12:08:41] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:08:41] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:08:42] [INFO ] Deduced a trap composed of 30 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 9/125 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:08:43] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:08:43] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:08:43] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:08:43] [INFO ] Deduced a trap composed of 47 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:08:43] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 0 ms to minimize.
[2024-06-01 12:08:43] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 0 ms to minimize.
[2024-06-01 12:08:43] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
[2024-06-01 12:08:43] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 0 ms to minimize.
[2024-06-01 12:08:43] [INFO ] Deduced a trap composed of 30 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:08:43] [INFO ] Deduced a trap composed of 49 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:08:43] [INFO ] Deduced a trap composed of 56 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:08:44] [INFO ] Deduced a trap composed of 60 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:08:44] [INFO ] Deduced a trap composed of 60 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:08:44] [INFO ] Deduced a trap composed of 56 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:08:44] [INFO ] Deduced a trap composed of 57 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:08:44] [INFO ] Deduced a trap composed of 57 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:08:44] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:08:44] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 18/143 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:08:46] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:08:47] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 0 ms to minimize.
[2024-06-01 12:08:47] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
[2024-06-01 12:08:47] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 4/147 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:08:48] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:08:50] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:08:53] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:08:54] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 2/151 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/308 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 12 (OVERLAPS) 283/591 variables, 308/459 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:08:59] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:09:00] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:09:00] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:09:00] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 0 ms to minimize.
[2024-06-01 12:09:00] [INFO ] Deduced a trap composed of 37 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:09:00] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:09:00] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:09:00] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 2 ms to minimize.
[2024-06-01 12:09:00] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 2 ms to minimize.
[2024-06-01 12:09:00] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:09:01] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 1 ms to minimize.
[2024-06-01 12:09:01] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 591/591 variables, and 471 constraints, problems are : Problem set: 0 solved, 282 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 308/308 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 107/107 constraints]
Escalating to Integer solving :Problem set: 0 solved, 282 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/307 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (OVERLAPS) 1/308 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 107/163 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:09:03] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:09:03] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:09:03] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:09:03] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:09:03] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:09:03] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 0 ms to minimize.
[2024-06-01 12:09:03] [INFO ] Deduced a trap composed of 35 places in 26 ms of which 0 ms to minimize.
[2024-06-01 12:09:03] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:09:03] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:09:03] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:09:03] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:09:03] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:09:03] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:09:03] [INFO ] Deduced a trap composed of 39 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:09:03] [INFO ] Deduced a trap composed of 33 places in 26 ms of which 0 ms to minimize.
[2024-06-01 12:09:04] [INFO ] Deduced a trap composed of 45 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:09:04] [INFO ] Deduced a trap composed of 50 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:09:04] [INFO ] Deduced a trap composed of 47 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:09:04] [INFO ] Deduced a trap composed of 50 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:09:04] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 20/183 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:09:04] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:09:05] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:09:05] [INFO ] Deduced a trap composed of 43 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:09:05] [INFO ] Deduced a trap composed of 46 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:09:05] [INFO ] Deduced a trap composed of 41 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:09:05] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-06-01 12:09:05] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 2 ms to minimize.
[2024-06-01 12:09:05] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:09:05] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:09:05] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 10/193 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:09:07] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:09:07] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:09:07] [INFO ] Deduced a trap composed of 39 places in 28 ms of which 0 ms to minimize.
[2024-06-01 12:09:07] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-06-01 12:09:07] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:09:07] [INFO ] Deduced a trap composed of 31 places in 27 ms of which 0 ms to minimize.
[2024-06-01 12:09:07] [INFO ] Deduced a trap composed of 38 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:09:07] [INFO ] Deduced a trap composed of 30 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:09:07] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:09:07] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-06-01 12:09:07] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:09:07] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:09:07] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:09:07] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:09:07] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:09:07] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:09:07] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 0 ms to minimize.
[2024-06-01 12:09:08] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:09:08] [INFO ] Deduced a trap composed of 39 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:09:08] [INFO ] Deduced a trap composed of 39 places in 25 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 20/213 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:09:08] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 0 ms to minimize.
[2024-06-01 12:09:08] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:09:08] [INFO ] Deduced a trap composed of 26 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:09:09] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:09:09] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 5/218 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:09:11] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:09:12] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:09:12] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:09:12] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:09:12] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-06-01 12:09:12] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 0 ms to minimize.
[2024-06-01 12:09:12] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 0 ms to minimize.
[2024-06-01 12:09:12] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 0 ms to minimize.
[2024-06-01 12:09:13] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:09:13] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:09:13] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:09:13] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
[2024-06-01 12:09:13] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:09:13] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:09:13] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:09:14] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:09:14] [INFO ] Deduced a trap composed of 36 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 16/235 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:09:15] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:09:15] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:09:15] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:09:15] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 4/239 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:09:17] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:09:17] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:09:17] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:09:17] [INFO ] Deduced a trap composed of 66 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:09:17] [INFO ] Deduced a trap composed of 65 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:09:17] [INFO ] Deduced a trap composed of 54 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:09:17] [INFO ] Deduced a trap composed of 65 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:09:17] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:09:17] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:09:17] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:09:17] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:09:17] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:09:18] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 2 ms to minimize.
[2024-06-01 12:09:18] [INFO ] Deduced a trap composed of 54 places in 54 ms of which 2 ms to minimize.
[2024-06-01 12:09:18] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:09:18] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:09:18] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 17/256 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:09:19] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:09:20] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/308 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/308 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 13 (OVERLAPS) 283/591 variables, 308/566 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/591 variables, 282/848 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:09:27] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 2 ms to minimize.
[2024-06-01 12:09:28] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 2 ms to minimize.
[2024-06-01 12:09:28] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 2 ms to minimize.
[2024-06-01 12:09:28] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 1 ms to minimize.
[2024-06-01 12:09:28] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-06-01 12:09:28] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:09:28] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 2 ms to minimize.
[2024-06-01 12:09:29] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2024-06-01 12:09:29] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 2 ms to minimize.
[2024-06-01 12:09:29] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-06-01 12:09:29] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-06-01 12:09:30] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-06-01 12:09:30] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:09:30] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 591/591 variables, and 862 constraints, problems are : Problem set: 0 solved, 282 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 308/308 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 216/216 constraints]
After SMT, in 60043ms problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 60046ms
Starting structural reductions in LTL mode, iteration 1 : 308/317 places, 283/292 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60324 ms. Remains : 308/317 places, 283/292 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-005B-LTLFireability-12
Product exploration explored 100000 steps with 1612 reset in 168 ms.
Product exploration explored 100000 steps with 1621 reset in 184 ms.
Computed a total of 60 stabilizing places and 60 stable transitions
Computed a total of 60 stabilizing places and 60 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 96 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 7 states, 19 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 248 ms :[(NOT p1), (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 11099 steps (12 resets) in 39 ms. (277 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 11 factoid took 287 ms. Reduced automaton from 7 states, 19 edges and 2 AP (stutter insensitive) to 7 states, 19 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 224 ms :[(NOT p1), (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 232 ms :[(NOT p1), (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
[2024-06-01 12:09:32] [INFO ] Invariant cache hit.
[2024-06-01 12:09:32] [INFO ] [Real]Absence check using 56 positive place invariants in 14 ms returned sat
[2024-06-01 12:09:33] [INFO ] [Real]Absence check using state equation in 296 ms returned sat
[2024-06-01 12:09:33] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:09:33] [INFO ] [Nat]Absence check using 56 positive place invariants in 14 ms returned sat
[2024-06-01 12:09:33] [INFO ] [Nat]Absence check using state equation in 238 ms returned sat
[2024-06-01 12:09:33] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:09:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2024-06-01 12:09:33] [INFO ] Computed and/alt/rep : 282/498/282 causal constraints (skipped 0 transitions) in 15 ms.
[2024-06-01 12:09:35] [INFO ] Added : 245 causal constraints over 50 iterations in 2248 ms. Result :sat
Could not prove EG (NOT p1)
[2024-06-01 12:09:35] [INFO ] Invariant cache hit.
[2024-06-01 12:09:36] [INFO ] [Real]Absence check using 56 positive place invariants in 15 ms returned sat
[2024-06-01 12:09:36] [INFO ] [Real]Absence check using state equation in 226 ms returned sat
[2024-06-01 12:09:36] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:09:36] [INFO ] [Nat]Absence check using 56 positive place invariants in 13 ms returned sat
[2024-06-01 12:09:36] [INFO ] [Nat]Absence check using state equation in 275 ms returned sat
[2024-06-01 12:09:36] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-06-01 12:09:36] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:09:36] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:09:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 153 ms
[2024-06-01 12:09:36] [INFO ] Computed and/alt/rep : 282/498/282 causal constraints (skipped 0 transitions) in 19 ms.
[2024-06-01 12:09:38] [INFO ] Added : 224 causal constraints over 46 iterations in 1628 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 5 out of 308 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 308/308 places, 283/283 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 307 transition count 247
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 272 transition count 247
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 70 place count 272 transition count 221
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 122 place count 246 transition count 221
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 288 place count 163 transition count 138
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 290 place count 161 transition count 136
Applied a total of 290 rules in 24 ms. Remains 161 /308 variables (removed 147) and now considering 136/283 (removed 147) transitions.
// Phase 1: matrix 136 rows 161 cols
[2024-06-01 12:09:38] [INFO ] Computed 56 invariants in 1 ms
[2024-06-01 12:09:38] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-01 12:09:38] [INFO ] Invariant cache hit.
[2024-06-01 12:09:38] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
[2024-06-01 12:09:38] [INFO ] Redundant transitions in 0 ms returned []
Running 132 sub problems to find dead transitions.
[2024-06-01 12:09:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 2/161 variables, 12/56 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-06-01 12:09:39] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 1 ms to minimize.
[2024-06-01 12:09:39] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2024-06-01 12:09:39] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2024-06-01 12:09:39] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
[2024-06-01 12:09:39] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
[2024-06-01 12:09:39] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 1 ms to minimize.
[2024-06-01 12:09:39] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-06-01 12:09:39] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (OVERLAPS) 136/297 variables, 161/225 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-06-01 12:09:40] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2024-06-01 12:09:40] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-06-01 12:09:41] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-06-01 12:09:41] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 4/229 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (OVERLAPS) 0/297 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 297/297 variables, and 229 constraints, problems are : Problem set: 0 solved, 132 unsolved in 4538 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 6/50 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (OVERLAPS) 2/161 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 6/68 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 136/297 variables, 161/229 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 132/361 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-06-01 12:09:44] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 1/362 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-06-01 12:09:50] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/297 variables, 1/363 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/297 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 11 (OVERLAPS) 0/297 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 297/297 variables, and 363 constraints, problems are : Problem set: 0 solved, 132 unsolved in 21561 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 14/14 constraints]
After SMT, in 26117ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 26121ms
Starting structural reductions in SI_LTL mode, iteration 1 : 161/308 places, 136/283 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 26365 ms. Remains : 161/308 places, 136/283 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 2 factoid took 602 ms. Reduced automaton from 7 states, 19 edges and 2 AP (stutter insensitive) to 7 states, 19 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 236 ms :[(NOT p1), (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 3198 steps (8 resets) in 18 ms. (168 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 723 ms. Reduced automaton from 7 states, 19 edges and 2 AP (stutter insensitive) to 7 states, 19 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 253 ms :[(NOT p1), (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 252 ms :[(NOT p1), (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
[2024-06-01 12:10:06] [INFO ] Invariant cache hit.
[2024-06-01 12:10:06] [INFO ] [Real]Absence check using 56 positive place invariants in 9 ms returned sat
[2024-06-01 12:10:07] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2024-06-01 12:10:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:10:07] [INFO ] [Nat]Absence check using 56 positive place invariants in 8 ms returned sat
[2024-06-01 12:10:07] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2024-06-01 12:10:07] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
[2024-06-01 12:10:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2024-06-01 12:10:07] [INFO ] Computed and/alt/rep : 132/273/132 causal constraints (skipped 0 transitions) in 8 ms.
[2024-06-01 12:10:07] [INFO ] Added : 102 causal constraints over 21 iterations in 321 ms. Result :sat
Could not prove EG (NOT p1)
[2024-06-01 12:10:07] [INFO ] Invariant cache hit.
[2024-06-01 12:10:07] [INFO ] [Real]Absence check using 56 positive place invariants in 8 ms returned sat
[2024-06-01 12:10:07] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2024-06-01 12:10:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:10:07] [INFO ] [Nat]Absence check using 56 positive place invariants in 12 ms returned sat
[2024-06-01 12:10:07] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2024-06-01 12:10:07] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 1 ms to minimize.
[2024-06-01 12:10:07] [INFO ] Deduced a trap composed of 6 places in 14 ms of which 1 ms to minimize.
[2024-06-01 12:10:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 61 ms
[2024-06-01 12:10:07] [INFO ] Computed and/alt/rep : 132/273/132 causal constraints (skipped 0 transitions) in 8 ms.
[2024-06-01 12:10:08] [INFO ] Added : 109 causal constraints over 22 iterations in 310 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 245 ms :[(NOT p1), (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Stuttering criterion allowed to conclude after 47474 steps with 6423 reset in 79 ms.
FORMULA ShieldPPPs-PT-005B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-005B-LTLFireability-12 finished in 97707 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(!((X(p0) U p1) U p2))))'
Support contains 5 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 292/292 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 309 transition count 284
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 309 transition count 284
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 308 transition count 283
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 308 transition count 283
Applied a total of 18 rules in 10 ms. Remains 308 /317 variables (removed 9) and now considering 283/292 (removed 9) transitions.
// Phase 1: matrix 283 rows 308 cols
[2024-06-01 12:10:08] [INFO ] Computed 56 invariants in 1 ms
[2024-06-01 12:10:08] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-01 12:10:08] [INFO ] Invariant cache hit.
[2024-06-01 12:10:08] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
Running 282 sub problems to find dead transitions.
[2024-06-01 12:10:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/307 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (OVERLAPS) 1/308 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:10:11] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:10:11] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:10:11] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:10:11] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 0 ms to minimize.
[2024-06-01 12:10:11] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 0 ms to minimize.
[2024-06-01 12:10:12] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:10:12] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:10:12] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:10:12] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:10:12] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:10:12] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-06-01 12:10:12] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 2 ms to minimize.
[2024-06-01 12:10:12] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 2 ms to minimize.
[2024-06-01 12:10:12] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:10:12] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:10:12] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:10:12] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-06-01 12:10:12] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:10:12] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 2 ms to minimize.
[2024-06-01 12:10:12] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:10:13] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2024-06-01 12:10:13] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
[2024-06-01 12:10:13] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-06-01 12:10:13] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-06-01 12:10:13] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:10:13] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:10:13] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:10:13] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:10:13] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:10:13] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-06-01 12:10:14] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-06-01 12:10:14] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:10:14] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-06-01 12:10:14] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:10:14] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:10:14] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:10:14] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:10:14] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:10:14] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:10:14] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:10:16] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:10:16] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:10:16] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:10:16] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:10:16] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:10:17] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:10:17] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 0 ms to minimize.
[2024-06-01 12:10:17] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:10:17] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:10:17] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2024-06-01 12:10:17] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:10:17] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:10:17] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 0 ms to minimize.
[2024-06-01 12:10:17] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 14/110 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:10:18] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:10:20] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:10:20] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:10:23] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 9 (OVERLAPS) 283/591 variables, 308/422 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:10:28] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:10:29] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:10:29] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:10:29] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:10:29] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:10:29] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:10:29] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2024-06-01 12:10:29] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:10:30] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:10:30] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 0 ms to minimize.
[2024-06-01 12:10:30] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:10:30] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:10:30] [INFO ] Deduced a trap composed of 37 places in 31 ms of which 0 ms to minimize.
[2024-06-01 12:10:30] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:10:30] [INFO ] Deduced a trap composed of 36 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:10:30] [INFO ] Deduced a trap composed of 37 places in 26 ms of which 0 ms to minimize.
[2024-06-01 12:10:30] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:10:30] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:10:30] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:10:30] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/591 variables, 20/442 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:10:31] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:10:31] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:10:31] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 2 ms to minimize.
[2024-06-01 12:10:31] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 2 ms to minimize.
[2024-06-01 12:10:32] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 2 ms to minimize.
[2024-06-01 12:10:32] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 2 ms to minimize.
[2024-06-01 12:10:32] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 2 ms to minimize.
[2024-06-01 12:10:32] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 2 ms to minimize.
[2024-06-01 12:10:32] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:10:32] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:10:32] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-06-01 12:10:32] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:10:33] [INFO ] Deduced a trap composed of 39 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:10:33] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:10:33] [INFO ] Deduced a trap composed of 38 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:10:33] [INFO ] Deduced a trap composed of 40 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:10:33] [INFO ] Deduced a trap composed of 40 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:10:33] [INFO ] Deduced a trap composed of 40 places in 26 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/591 variables, 18/460 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:10:35] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 2 ms to minimize.
[2024-06-01 12:10:35] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/591 variables, 2/462 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 591/591 variables, and 462 constraints, problems are : Problem set: 0 solved, 282 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 308/308 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 98/98 constraints]
Escalating to Integer solving :Problem set: 0 solved, 282 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/307 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (OVERLAPS) 1/308 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 98/154 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:10:41] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-06-01 12:10:41] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:10:41] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 3/157 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:10:43] [INFO ] Deduced a trap composed of 46 places in 36 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:10:44] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:10:44] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:10:44] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:10:44] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:10:45] [INFO ] Deduced a trap composed of 48 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:10:45] [INFO ] Deduced a trap composed of 58 places in 56 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 6/164 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:10:46] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 2 ms to minimize.
[2024-06-01 12:10:47] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:10:47] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:10:47] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:10:47] [INFO ] Deduced a trap composed of 26 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:10:47] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 6/170 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:10:48] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:10:48] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:10:48] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:10:48] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:10:48] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 1 ms to minimize.
[2024-06-01 12:10:48] [INFO ] Deduced a trap composed of 16 places in 17 ms of which 0 ms to minimize.
[2024-06-01 12:10:49] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:10:49] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:10:49] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 9/179 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:10:50] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:10:51] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:10:51] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 3/182 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:10:52] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 1 ms to minimize.
[2024-06-01 12:10:52] [INFO ] Deduced a trap composed of 56 places in 54 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 2/184 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 11 (OVERLAPS) 283/591 variables, 308/492 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/591 variables, 282/774 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:10:59] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:10:59] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-06-01 12:10:59] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-06-01 12:11:00] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:11:00] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 2 ms to minimize.
[2024-06-01 12:11:03] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:11:04] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:11:04] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/591 variables, 8/782 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 591/591 variables, and 782 constraints, problems are : Problem set: 0 solved, 282 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 308/308 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 136/136 constraints]
After SMT, in 60057ms problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 60060ms
Starting structural reductions in LTL mode, iteration 1 : 308/317 places, 283/292 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60365 ms. Remains : 308/317 places, 283/292 transitions.
Stuttering acceptance computed with spot in 214 ms :[true, p2, (AND p2 p1 p0), (AND p1 p0), p2, p2]
Running random walk in product with property : ShieldPPPs-PT-005B-LTLFireability-13
Product exploration explored 100000 steps with 25000 reset in 99 ms.
Product exploration explored 100000 steps with 25000 reset in 105 ms.
Computed a total of 60 stabilizing places and 60 stable transitions
Computed a total of 60 stabilizing places and 60 stable transitions
Detected a total of 60/308 stabilizing places and 60/283 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 125 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[true, p2, (AND p2 p1 p0), (AND p1 p0), p2, p2]
Reduction of identical properties reduced properties to check from 11 to 9
RANDOM walk for 40000 steps (44 resets) in 392 ms. (101 steps per ms) remains 5/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 230 ms. (173 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 212 ms. (187 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 2/2 properties
[2024-06-01 12:11:10] [INFO ] Invariant cache hit.
Problem apf4 is UNSAT
Problem apf6 is UNSAT
After SMT solving in domain Real declared 5/591 variables, and 0 constraints, problems are : Problem set: 2 solved, 0 unsolved in 34 ms.
Refiners :[Positive P Invariants (semi-flows): 0/56 constraints, State Equation: 0/308 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 38ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (G (OR (NOT p1) p2)), (G (OR (NOT p1) p2 (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR p1 p2 (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p2)))), (F p2), (F (NOT (OR (NOT p1) (NOT p2) (NOT p0)))), (F (NOT (OR p1 (NOT p0)))), (F p0), (F (NOT (OR p1 (NOT p2) (NOT p0)))), (F (NOT (OR (NOT p1) (NOT p0)))), (F p1)]
Knowledge based reduction with 8 factoid took 512 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[true, (AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 129 ms :[true, (AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0)]
Support contains 3 out of 308 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 283/283 transitions.
Applied a total of 0 rules in 5 ms. Remains 308 /308 variables (removed 0) and now considering 283/283 (removed 0) transitions.
[2024-06-01 12:11:10] [INFO ] Invariant cache hit.
[2024-06-01 12:11:10] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-06-01 12:11:10] [INFO ] Invariant cache hit.
[2024-06-01 12:11:11] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
Running 282 sub problems to find dead transitions.
[2024-06-01 12:11:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/307 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (OVERLAPS) 1/308 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:11:14] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:11:14] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:11:14] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:11:14] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 0 ms to minimize.
[2024-06-01 12:11:14] [INFO ] Deduced a trap composed of 19 places in 16 ms of which 1 ms to minimize.
[2024-06-01 12:11:14] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:11:14] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-06-01 12:11:14] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:11:14] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:11:14] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:11:14] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-06-01 12:11:14] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 2 ms to minimize.
[2024-06-01 12:11:14] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 2 ms to minimize.
[2024-06-01 12:11:14] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-06-01 12:11:14] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:11:14] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:11:14] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:11:15] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 0 ms to minimize.
[2024-06-01 12:11:15] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2024-06-01 12:11:15] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:11:15] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:11:15] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:11:15] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:11:15] [INFO ] Deduced a trap composed of 18 places in 18 ms of which 1 ms to minimize.
[2024-06-01 12:11:16] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:11:16] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2024-06-01 12:11:16] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 0 ms to minimize.
[2024-06-01 12:11:16] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:11:16] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:11:16] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
[2024-06-01 12:11:16] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:11:16] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 0 ms to minimize.
[2024-06-01 12:11:16] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
[2024-06-01 12:11:16] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:11:16] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:11:16] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:11:16] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:11:16] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:11:16] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:11:16] [INFO ] Deduced a trap composed of 24 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:11:18] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-06-01 12:11:18] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2024-06-01 12:11:18] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:11:19] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-06-01 12:11:19] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:11:19] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:11:19] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:11:19] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:11:19] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:11:19] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:11:19] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:11:19] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-06-01 12:11:19] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
[2024-06-01 12:11:19] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 14/110 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:11:20] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:11:22] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:11:23] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:11:25] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 9 (OVERLAPS) 283/591 variables, 308/422 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:11:31] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:11:31] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:11:31] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:11:31] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:11:31] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
[2024-06-01 12:11:31] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:11:31] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:11:32] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2024-06-01 12:11:32] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 0 ms to minimize.
[2024-06-01 12:11:32] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:11:32] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:11:32] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:11:32] [INFO ] Deduced a trap composed of 37 places in 31 ms of which 0 ms to minimize.
[2024-06-01 12:11:32] [INFO ] Deduced a trap composed of 36 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:11:32] [INFO ] Deduced a trap composed of 36 places in 25 ms of which 0 ms to minimize.
[2024-06-01 12:11:32] [INFO ] Deduced a trap composed of 37 places in 26 ms of which 0 ms to minimize.
[2024-06-01 12:11:32] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:11:32] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:11:32] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:11:32] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/591 variables, 20/442 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:11:33] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:11:33] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:11:33] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 1 ms to minimize.
[2024-06-01 12:11:33] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 2 ms to minimize.
[2024-06-01 12:11:34] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 1 ms to minimize.
[2024-06-01 12:11:34] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 1 ms to minimize.
[2024-06-01 12:11:34] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 2 ms to minimize.
[2024-06-01 12:11:34] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 1 ms to minimize.
[2024-06-01 12:11:34] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:11:34] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:11:34] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:11:34] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:11:35] [INFO ] Deduced a trap composed of 39 places in 28 ms of which 0 ms to minimize.
[2024-06-01 12:11:35] [INFO ] Deduced a trap composed of 39 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:11:35] [INFO ] Deduced a trap composed of 38 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:11:35] [INFO ] Deduced a trap composed of 40 places in 26 ms of which 0 ms to minimize.
[2024-06-01 12:11:35] [INFO ] Deduced a trap composed of 40 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:11:35] [INFO ] Deduced a trap composed of 40 places in 31 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/591 variables, 18/460 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:11:37] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 1 ms to minimize.
[2024-06-01 12:11:37] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/591 variables, 2/462 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 591/591 variables, and 462 constraints, problems are : Problem set: 0 solved, 282 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 308/308 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 98/98 constraints]
Escalating to Integer solving :Problem set: 0 solved, 282 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/307 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (OVERLAPS) 1/308 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 98/154 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:11:43] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-06-01 12:11:43] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:11:43] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 3/157 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:11:45] [INFO ] Deduced a trap composed of 46 places in 36 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:11:46] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:11:46] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:11:46] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:11:47] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:11:47] [INFO ] Deduced a trap composed of 48 places in 49 ms of which 2 ms to minimize.
[2024-06-01 12:11:47] [INFO ] Deduced a trap composed of 58 places in 53 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 6/164 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:11:49] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 1 ms to minimize.
[2024-06-01 12:11:49] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:11:49] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 0 ms to minimize.
[2024-06-01 12:11:49] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:11:49] [INFO ] Deduced a trap composed of 26 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:11:49] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 6/170 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:11:50] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:11:50] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:11:50] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:11:50] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 0 ms to minimize.
[2024-06-01 12:11:50] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 1 ms to minimize.
[2024-06-01 12:11:50] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 0 ms to minimize.
[2024-06-01 12:11:51] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 0 ms to minimize.
[2024-06-01 12:11:51] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:11:51] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 9/179 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:11:52] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:11:53] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:11:53] [INFO ] Deduced a trap composed of 23 places in 20 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 3/182 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:11:54] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-06-01 12:11:54] [INFO ] Deduced a trap composed of 56 places in 57 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 2/184 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 11 (OVERLAPS) 283/591 variables, 308/492 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/591 variables, 282/774 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:12:01] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:12:01] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-06-01 12:12:01] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 2 ms to minimize.
[2024-06-01 12:12:01] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:12:02] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 1 ms to minimize.
[2024-06-01 12:12:05] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:12:05] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:12:06] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/591 variables, 8/782 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 591/591 variables, and 782 constraints, problems are : Problem set: 0 solved, 282 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 308/308 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 136/136 constraints]
After SMT, in 60053ms problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 60056ms
Finished structural reductions in LTL mode , in 1 iterations and 60332 ms. Remains : 308/308 places, 283/283 transitions.
Computed a total of 60 stabilizing places and 60 stable transitions
Computed a total of 60 stabilizing places and 60 stable transitions
Detected a total of 60/308 stabilizing places and 60/283 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 69 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[true, (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
RANDOM walk for 40000 steps (44 resets) in 587 ms. (68 steps per ms) remains 2/4 properties
BEST_FIRST walk for 5662 steps (0 resets) in 19 ms. (283 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0)]
Knowledge based reduction with 2 factoid took 142 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[true, (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 144 ms :[true, (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 145 ms :[true, (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 25000 reset in 90 ms.
Product exploration explored 100000 steps with 25000 reset in 91 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 130 ms :[true, (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Support contains 3 out of 308 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 308/308 places, 283/283 transitions.
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 308 transition count 283
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 35 place count 308 transition count 285
Deduced a syphon composed of 46 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 46 place count 308 transition count 285
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 146 places in 0 ms
Iterating global reduction 1 with 100 rules applied. Total rules applied 146 place count 308 transition count 285
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 181 place count 273 transition count 250
Deduced a syphon composed of 111 places in 0 ms
Iterating global reduction 1 with 35 rules applied. Total rules applied 216 place count 273 transition count 250
Deduced a syphon composed of 111 places in 0 ms
Applied a total of 216 rules in 24 ms. Remains 273 /308 variables (removed 35) and now considering 250/283 (removed 33) transitions.
[2024-06-01 12:12:12] [INFO ] Redundant transitions in 1 ms returned []
Running 249 sub problems to find dead transitions.
// Phase 1: matrix 250 rows 273 cols
[2024-06-01 12:12:12] [INFO ] Computed 56 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (OVERLAPS) 1/273 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 249 unsolved
[2024-06-01 12:12:14] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-06-01 12:12:14] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-06-01 12:12:14] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-06-01 12:12:14] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-06-01 12:12:14] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-06-01 12:12:15] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-06-01 12:12:15] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-06-01 12:12:15] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
Problem TDEAD24 is UNSAT
[2024-06-01 12:12:15] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-06-01 12:12:15] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-06-01 12:12:15] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-06-01 12:12:15] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
Problem TDEAD36 is UNSAT
[2024-06-01 12:12:15] [INFO ] Deduced a trap composed of 7 places in 14 ms of which 0 ms to minimize.
Problem TDEAD39 is UNSAT
Problem TDEAD44 is UNSAT
[2024-06-01 12:12:15] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
[2024-06-01 12:12:15] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
Problem TDEAD47 is UNSAT
[2024-06-01 12:12:15] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
[2024-06-01 12:12:15] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
Problem TDEAD51 is UNSAT
[2024-06-01 12:12:15] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
[2024-06-01 12:12:15] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:12:15] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD246 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 20/76 constraints. Problems are: Problem set: 69 solved, 180 unsolved
[2024-06-01 12:12:15] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
[2024-06-01 12:12:15] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
Problem TDEAD60 is UNSAT
[2024-06-01 12:12:15] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
[2024-06-01 12:12:15] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
[2024-06-01 12:12:15] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
[2024-06-01 12:12:15] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
Problem TDEAD68 is UNSAT
[2024-06-01 12:12:15] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
[2024-06-01 12:12:15] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
[2024-06-01 12:12:16] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem TDEAD73 is UNSAT
[2024-06-01 12:12:16] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
[2024-06-01 12:12:16] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
[2024-06-01 12:12:16] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
[2024-06-01 12:12:16] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
Problem TDEAD82 is UNSAT
[2024-06-01 12:12:16] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
[2024-06-01 12:12:16] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
Problem TDEAD86 is UNSAT
[2024-06-01 12:12:16] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
[2024-06-01 12:12:16] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:12:16] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2024-06-01 12:12:16] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
[2024-06-01 12:12:16] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 20/96 constraints. Problems are: Problem set: 108 solved, 141 unsolved
[2024-06-01 12:12:17] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
Problem TDEAD155 is UNSAT
[2024-06-01 12:12:17] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD161 is UNSAT
[2024-06-01 12:12:17] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
Problem TDEAD184 is UNSAT
[2024-06-01 12:12:17] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
Problem TDEAD205 is UNSAT
[2024-06-01 12:12:17] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem TDEAD227 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 5/101 constraints. Problems are: Problem set: 113 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 0/101 constraints. Problems are: Problem set: 113 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 250/523 variables, 273/374 constraints. Problems are: Problem set: 113 solved, 136 unsolved
[2024-06-01 12:12:20] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-06-01 12:12:20] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/523 variables, 2/376 constraints. Problems are: Problem set: 113 solved, 136 unsolved
[2024-06-01 12:12:20] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 0 ms to minimize.
[2024-06-01 12:12:20] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2024-06-01 12:12:21] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
[2024-06-01 12:12:21] [INFO ] Deduced a trap composed of 6 places in 15 ms of which 1 ms to minimize.
[2024-06-01 12:12:21] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:12:21] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2024-06-01 12:12:21] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:12:21] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/523 variables, 8/384 constraints. Problems are: Problem set: 113 solved, 136 unsolved
[2024-06-01 12:12:22] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/523 variables, 1/385 constraints. Problems are: Problem set: 113 solved, 136 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/523 variables, 0/385 constraints. Problems are: Problem set: 113 solved, 136 unsolved
At refinement iteration 11 (OVERLAPS) 0/523 variables, 0/385 constraints. Problems are: Problem set: 113 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 523/523 variables, and 385 constraints, problems are : Problem set: 113 solved, 136 unsolved in 13072 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 56/56 constraints]
Escalating to Integer solving :Problem set: 113 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 0/0 constraints. Problems are: Problem set: 113 solved, 136 unsolved
At refinement iteration 1 (OVERLAPS) 112/273 variables, 56/56 constraints. Problems are: Problem set: 113 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 56/112 constraints. Problems are: Problem set: 113 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 0/112 constraints. Problems are: Problem set: 113 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 250/523 variables, 273/385 constraints. Problems are: Problem set: 113 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/523 variables, 136/521 constraints. Problems are: Problem set: 113 solved, 136 unsolved
[2024-06-01 12:12:29] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-06-01 12:12:30] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:12:31] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:12:31] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/523 variables, 4/525 constraints. Problems are: Problem set: 113 solved, 136 unsolved
[2024-06-01 12:12:37] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/523 variables, 1/526 constraints. Problems are: Problem set: 113 solved, 136 unsolved
[2024-06-01 12:12:47] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/523 variables, 1/527 constraints. Problems are: Problem set: 113 solved, 136 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 523/523 variables, and 527 constraints, problems are : Problem set: 113 solved, 136 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 136/249 constraints, Known Traps: 62/62 constraints]
After SMT, in 43120ms problems are : Problem set: 113 solved, 136 unsolved
Search for dead transitions found 113 dead transitions in 43123ms
Found 113 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 113 transitions
Dead transitions reduction (with SMT) removed 113 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 273/308 places, 137/283 transitions.
Graph (complete) has 420 edges and 273 vertex of which 162 are kept as prefixes of interest. Removing 111 places using SCC suffix rule.1 ms
Discarding 111 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 162 /273 variables (removed 111) and now considering 137/137 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 162/308 places, 137/283 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 43159 ms. Remains : 162/308 places, 137/283 transitions.
Support contains 3 out of 308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 283/283 transitions.
Applied a total of 0 rules in 3 ms. Remains 308 /308 variables (removed 0) and now considering 283/283 (removed 0) transitions.
// Phase 1: matrix 283 rows 308 cols
[2024-06-01 12:12:55] [INFO ] Computed 56 invariants in 2 ms
[2024-06-01 12:12:55] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-01 12:12:55] [INFO ] Invariant cache hit.
[2024-06-01 12:12:56] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
Running 282 sub problems to find dead transitions.
[2024-06-01 12:12:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/307 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (OVERLAPS) 1/308 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:12:59] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:12:59] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:12:59] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:12:59] [INFO ] Deduced a trap composed of 29 places in 26 ms of which 0 ms to minimize.
[2024-06-01 12:12:59] [INFO ] Deduced a trap composed of 19 places in 18 ms of which 0 ms to minimize.
[2024-06-01 12:12:59] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:12:59] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:12:59] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:12:59] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:12:59] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-06-01 12:12:59] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:12:59] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 1 ms to minimize.
[2024-06-01 12:12:59] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-06-01 12:12:59] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:12:59] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:12:59] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:12:59] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:13:00] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:13:00] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
[2024-06-01 12:13:00] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:13:00] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:13:00] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:13:00] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-06-01 12:13:00] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 0 ms to minimize.
[2024-06-01 12:13:01] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:13:01] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:13:01] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-06-01 12:13:01] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:13:01] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
[2024-06-01 12:13:01] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:13:01] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:13:01] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:13:01] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 1 ms to minimize.
[2024-06-01 12:13:01] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:13:01] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 0 ms to minimize.
[2024-06-01 12:13:01] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:13:01] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:13:01] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-06-01 12:13:01] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:13:01] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:13:03] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:13:03] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:13:03] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 0 ms to minimize.
[2024-06-01 12:13:04] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:13:04] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:13:04] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:13:04] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:13:04] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:13:04] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-06-01 12:13:04] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:13:04] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:13:04] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-06-01 12:13:04] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
[2024-06-01 12:13:04] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 14/110 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:13:05] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:13:07] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:13:08] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:13:10] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 9 (OVERLAPS) 283/591 variables, 308/422 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:13:16] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-06-01 12:13:16] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:13:16] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:13:16] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:13:16] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:13:16] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:13:16] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:13:17] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 0 ms to minimize.
[2024-06-01 12:13:17] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 0 ms to minimize.
[2024-06-01 12:13:17] [INFO ] Deduced a trap composed of 32 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:13:17] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:13:17] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 0 ms to minimize.
[2024-06-01 12:13:17] [INFO ] Deduced a trap composed of 37 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:13:17] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:13:17] [INFO ] Deduced a trap composed of 36 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:13:17] [INFO ] Deduced a trap composed of 37 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:13:17] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:13:17] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:13:17] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:13:17] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/591 variables, 20/442 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:13:18] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:13:18] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 0 ms to minimize.
[2024-06-01 12:13:18] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 2 ms to minimize.
[2024-06-01 12:13:18] [INFO ] Deduced a trap composed of 35 places in 97 ms of which 1 ms to minimize.
[2024-06-01 12:13:19] [INFO ] Deduced a trap composed of 37 places in 69 ms of which 1 ms to minimize.
[2024-06-01 12:13:19] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 2 ms to minimize.
[2024-06-01 12:13:19] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 1 ms to minimize.
[2024-06-01 12:13:19] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 2 ms to minimize.
[2024-06-01 12:13:19] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:13:19] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:13:19] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:13:19] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-06-01 12:13:20] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:13:20] [INFO ] Deduced a trap composed of 39 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:13:20] [INFO ] Deduced a trap composed of 38 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:13:20] [INFO ] Deduced a trap composed of 40 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:13:20] [INFO ] Deduced a trap composed of 40 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:13:20] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/591 variables, 18/460 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:13:22] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 1 ms to minimize.
[2024-06-01 12:13:22] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/591 variables, 2/462 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 591/591 variables, and 462 constraints, problems are : Problem set: 0 solved, 282 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 308/308 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 98/98 constraints]
Escalating to Integer solving :Problem set: 0 solved, 282 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/307 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (OVERLAPS) 1/308 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 98/154 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:13:28] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:13:28] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:13:28] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 3/157 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:13:30] [INFO ] Deduced a trap composed of 46 places in 33 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:13:31] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:13:31] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:13:31] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:13:32] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:13:32] [INFO ] Deduced a trap composed of 48 places in 53 ms of which 2 ms to minimize.
[2024-06-01 12:13:32] [INFO ] Deduced a trap composed of 58 places in 57 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 6/164 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:13:34] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 1 ms to minimize.
[2024-06-01 12:13:34] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2024-06-01 12:13:34] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:13:34] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:13:34] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 0 ms to minimize.
[2024-06-01 12:13:34] [INFO ] Deduced a trap composed of 38 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 6/170 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:13:35] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 0 ms to minimize.
[2024-06-01 12:13:35] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 0 ms to minimize.
[2024-06-01 12:13:35] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:13:35] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:13:35] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 1 ms to minimize.
[2024-06-01 12:13:35] [INFO ] Deduced a trap composed of 16 places in 17 ms of which 0 ms to minimize.
[2024-06-01 12:13:36] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:13:36] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:13:36] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 9/179 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:13:37] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:13:38] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:13:38] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 3/182 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:13:39] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
[2024-06-01 12:13:39] [INFO ] Deduced a trap composed of 56 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 2/184 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 11 (OVERLAPS) 283/591 variables, 308/492 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/591 variables, 282/774 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-06-01 12:13:46] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:13:47] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-06-01 12:13:47] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:13:47] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:13:47] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 2 ms to minimize.
[2024-06-01 12:13:50] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:13:51] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:13:51] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/591 variables, 8/782 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 591/591 variables, and 782 constraints, problems are : Problem set: 0 solved, 282 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 308/308 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 136/136 constraints]
After SMT, in 60057ms problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 60060ms
Finished structural reductions in LTL mode , in 1 iterations and 60360 ms. Remains : 308/308 places, 283/283 transitions.
Treatment of property ShieldPPPs-PT-005B-LTLFireability-13 finished in 227630 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 3 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 292/292 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 308 transition count 283
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 308 transition count 283
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 307 transition count 282
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 307 transition count 282
Applied a total of 20 rules in 12 ms. Remains 307 /317 variables (removed 10) and now considering 282/292 (removed 10) transitions.
// Phase 1: matrix 282 rows 307 cols
[2024-06-01 12:13:56] [INFO ] Computed 56 invariants in 2 ms
[2024-06-01 12:13:56] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-06-01 12:13:56] [INFO ] Invariant cache hit.
[2024-06-01 12:13:56] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
Running 281 sub problems to find dead transitions.
[2024-06-01 12:13:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (OVERLAPS) 1/307 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 12:13:59] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:13:59] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:13:59] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:13:59] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-06-01 12:13:59] [INFO ] Deduced a trap composed of 22 places in 20 ms of which 1 ms to minimize.
[2024-06-01 12:13:59] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-06-01 12:13:59] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 1 ms to minimize.
[2024-06-01 12:13:59] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 2 ms to minimize.
[2024-06-01 12:13:59] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:13:59] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:14:00] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:14:00] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:14:00] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2024-06-01 12:14:00] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 2 ms to minimize.
[2024-06-01 12:14:00] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:14:00] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:14:00] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:14:00] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:14:00] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:14:00] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 12:14:01] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:14:01] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 2 ms to minimize.
[2024-06-01 12:14:01] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:14:01] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:14:01] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:14:01] [INFO ] Deduced a trap composed of 29 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:14:01] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 0 ms to minimize.
[2024-06-01 12:14:01] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2024-06-01 12:14:01] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:14:01] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:14:01] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 0 ms to minimize.
[2024-06-01 12:14:01] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:14:02] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:14:02] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
[2024-06-01 12:14:02] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 1 ms to minimize.
[2024-06-01 12:14:02] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:14:02] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:14:02] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-06-01 12:14:02] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:14:02] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/307 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 12:14:04] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 0 ms to minimize.
[2024-06-01 12:14:04] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 0 ms to minimize.
[2024-06-01 12:14:04] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:14:04] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-06-01 12:14:04] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:14:04] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 2 ms to minimize.
[2024-06-01 12:14:05] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:14:05] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
[2024-06-01 12:14:05] [INFO ] Deduced a trap composed of 21 places in 20 ms of which 1 ms to minimize.
[2024-06-01 12:14:05] [INFO ] Deduced a trap composed of 25 places in 21 ms of which 1 ms to minimize.
[2024-06-01 12:14:05] [INFO ] Deduced a trap composed of 48 places in 67 ms of which 1 ms to minimize.
[2024-06-01 12:14:05] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:14:05] [INFO ] Deduced a trap composed of 61 places in 62 ms of which 1 ms to minimize.
[2024-06-01 12:14:05] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:14:05] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 15/111 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 12:14:06] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:14:07] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:14:07] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:14:07] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 4/115 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 12:14:08] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 2 ms to minimize.
[2024-06-01 12:14:08] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 2 ms to minimize.
[2024-06-01 12:14:08] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 2 ms to minimize.
[2024-06-01 12:14:08] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 1 ms to minimize.
[2024-06-01 12:14:09] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
[2024-06-01 12:14:09] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:14:09] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:14:09] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:14:09] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:14:09] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:14:09] [INFO ] Deduced a trap composed of 31 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:14:09] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 12/127 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 8 (OVERLAPS) 282/589 variables, 307/434 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 12:14:13] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:14:14] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:14:14] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/589 variables, 3/437 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 12:14:18] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:14:18] [INFO ] Deduced a trap composed of 41 places in 32 ms of which 0 ms to minimize.
[2024-06-01 12:14:18] [INFO ] Deduced a trap composed of 39 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:14:18] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:14:19] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:14:19] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/589 variables, 6/443 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 12:14:20] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2024-06-01 12:14:20] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:14:21] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:14:22] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/589 variables, 4/447 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 12:14:22] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:14:23] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:14:23] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:14:24] [INFO ] Deduced a trap composed of 40 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:14:24] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:14:24] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/589 variables, 6/453 constraints. Problems are: Problem set: 0 solved, 281 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 589/589 variables, and 453 constraints, problems are : Problem set: 0 solved, 281 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 307/307 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 90/90 constraints]
Escalating to Integer solving :Problem set: 0 solved, 281 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (OVERLAPS) 1/307 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 90/146 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 12:14:28] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-06-01 12:14:28] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2024-06-01 12:14:28] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:14:28] [INFO ] Deduced a trap composed of 34 places in 27 ms of which 0 ms to minimize.
[2024-06-01 12:14:28] [INFO ] Deduced a trap composed of 31 places in 23 ms of which 0 ms to minimize.
[2024-06-01 12:14:28] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:14:28] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:14:29] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:14:29] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:14:29] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:14:29] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:14:29] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/307 variables, 12/158 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 12:14:30] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-06-01 12:14:30] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:14:30] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:14:30] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:14:31] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:14:31] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:14:31] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:14:31] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 8/166 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 12:14:32] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-06-01 12:14:32] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:14:32] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 0 ms to minimize.
[2024-06-01 12:14:32] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 0 ms to minimize.
[2024-06-01 12:14:33] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 0 ms to minimize.
[2024-06-01 12:14:33] [INFO ] Deduced a trap composed of 38 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:14:33] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:14:33] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:14:33] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:14:33] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 10/176 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 7 (OVERLAPS) 282/589 variables, 307/483 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/589 variables, 281/764 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 12:14:38] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2024-06-01 12:14:39] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 0 ms to minimize.
[2024-06-01 12:14:39] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 1 ms to minimize.
[2024-06-01 12:14:39] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-06-01 12:14:39] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 2 ms to minimize.
[2024-06-01 12:14:40] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 2 ms to minimize.
[2024-06-01 12:14:40] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:14:40] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:14:40] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:14:41] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:14:41] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:14:41] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:14:41] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:14:41] [INFO ] Deduced a trap composed of 45 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:14:43] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-06-01 12:14:43] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:14:43] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 2 ms to minimize.
[2024-06-01 12:14:43] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:14:43] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 2 ms to minimize.
[2024-06-01 12:14:43] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/589 variables, 20/784 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-01 12:14:51] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:14:52] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:14:52] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:14:52] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:14:55] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-06-01 12:14:55] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
[2024-06-01 12:14:56] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-06-01 12:14:56] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 589/589 variables, and 792 constraints, problems are : Problem set: 0 solved, 281 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 307/307 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 148/148 constraints]
After SMT, in 60046ms problems are : Problem set: 0 solved, 281 unsolved
Search for dead transitions found 0 dead transitions in 60050ms
Starting structural reductions in LTL mode, iteration 1 : 307/317 places, 282/292 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60333 ms. Remains : 307/317 places, 282/292 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-005B-LTLFireability-15
Product exploration explored 100000 steps with 1777 reset in 156 ms.
Product exploration explored 100000 steps with 1792 reset in 164 ms.
Computed a total of 59 stabilizing places and 59 stable transitions
Computed a total of 59 stabilizing places and 59 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 220 steps (0 resets) in 4 ms. (44 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
[2024-06-01 12:14:57] [INFO ] Invariant cache hit.
[2024-06-01 12:14:57] [INFO ] [Real]Absence check using 56 positive place invariants in 13 ms returned sat
[2024-06-01 12:14:57] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2024-06-01 12:14:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:14:57] [INFO ] [Nat]Absence check using 56 positive place invariants in 13 ms returned sat
[2024-06-01 12:14:57] [INFO ] [Nat]Absence check using state equation in 228 ms returned sat
[2024-06-01 12:14:57] [INFO ] Computed and/alt/rep : 281/497/281 causal constraints (skipped 0 transitions) in 14 ms.
[2024-06-01 12:14:59] [INFO ] Added : 236 causal constraints over 48 iterations in 1573 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 307 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 307/307 places, 282/282 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 306 transition count 245
Reduce places removed 36 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 37 rules applied. Total rules applied 73 place count 270 transition count 244
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 269 transition count 244
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 74 place count 269 transition count 219
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 124 place count 244 transition count 219
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 1 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 3 with 170 rules applied. Total rules applied 294 place count 159 transition count 134
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 296 place count 157 transition count 132
Applied a total of 296 rules in 21 ms. Remains 157 /307 variables (removed 150) and now considering 132/282 (removed 150) transitions.
// Phase 1: matrix 132 rows 157 cols
[2024-06-01 12:14:59] [INFO ] Computed 56 invariants in 1 ms
[2024-06-01 12:14:59] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-06-01 12:14:59] [INFO ] Invariant cache hit.
[2024-06-01 12:14:59] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2024-06-01 12:14:59] [INFO ] Redundant transitions in 0 ms returned []
Running 129 sub problems to find dead transitions.
[2024-06-01 12:14:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-06-01 12:15:00] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:15:00] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 1/157 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-06-01 12:15:01] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:15:01] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
[2024-06-01 12:15:01] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 0 ms to minimize.
[2024-06-01 12:15:01] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:15:01] [INFO ] Deduced a trap composed of 58 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:15:01] [INFO ] Deduced a trap composed of 71 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 132/289 variables, 157/221 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-06-01 12:15:02] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-06-01 12:15:04] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/289 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/289 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 11 (OVERLAPS) 0/289 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 223 constraints, problems are : Problem set: 0 solved, 129 unsolved in 6244 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 8/56 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 1/157 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 132/289 variables, 157/223 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 129/352 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-06-01 12:15:07] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 10 (OVERLAPS) 0/289 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 353 constraints, problems are : Problem set: 0 solved, 129 unsolved in 14019 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 11/11 constraints]
After SMT, in 20275ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 20276ms
Starting structural reductions in SI_LTL mode, iteration 1 : 157/307 places, 132/282 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20486 ms. Remains : 157/307 places, 132/282 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 135 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 12 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 123 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
[2024-06-01 12:15:20] [INFO ] Invariant cache hit.
[2024-06-01 12:15:20] [INFO ] [Real]Absence check using 56 positive place invariants in 9 ms returned sat
[2024-06-01 12:15:20] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2024-06-01 12:15:20] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:15:20] [INFO ] [Nat]Absence check using 56 positive place invariants in 9 ms returned sat
[2024-06-01 12:15:20] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2024-06-01 12:15:20] [INFO ] Computed and/alt/rep : 129/256/129 causal constraints (skipped 0 transitions) in 9 ms.
[2024-06-01 12:15:21] [INFO ] Added : 124 causal constraints over 25 iterations in 374 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22618 reset in 153 ms.
Product exploration explored 100000 steps with 22563 reset in 170 ms.
Support contains 3 out of 157 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 157/157 places, 132/132 transitions.
Applied a total of 0 rules in 10 ms. Remains 157 /157 variables (removed 0) and now considering 132/132 (removed 0) transitions.
[2024-06-01 12:15:21] [INFO ] Invariant cache hit.
[2024-06-01 12:15:21] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-01 12:15:21] [INFO ] Invariant cache hit.
[2024-06-01 12:15:21] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2024-06-01 12:15:21] [INFO ] Redundant transitions in 0 ms returned []
Running 129 sub problems to find dead transitions.
[2024-06-01 12:15:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-06-01 12:15:22] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-06-01 12:15:22] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 1/157 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-06-01 12:15:23] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2024-06-01 12:15:23] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-06-01 12:15:23] [INFO ] Deduced a trap composed of 7 places in 14 ms of which 0 ms to minimize.
[2024-06-01 12:15:23] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:15:23] [INFO ] Deduced a trap composed of 58 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:15:23] [INFO ] Deduced a trap composed of 71 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 132/289 variables, 157/221 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-06-01 12:15:24] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-06-01 12:15:26] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/289 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/289 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 11 (OVERLAPS) 0/289 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 223 constraints, problems are : Problem set: 0 solved, 129 unsolved in 6220 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 8/56 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 1/157 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 132/289 variables, 157/223 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 129/352 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-06-01 12:15:30] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 10 (OVERLAPS) 0/289 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 353 constraints, problems are : Problem set: 0 solved, 129 unsolved in 14137 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 11/11 constraints]
After SMT, in 20374ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 20376ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 20589 ms. Remains : 157/157 places, 132/132 transitions.
Treatment of property ShieldPPPs-PT-005B-LTLFireability-15 finished in 106079 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||(p1&&F(G(p1))))))'
Found a Lengthening insensitive property : ShieldPPPs-PT-005B-LTLFireability-04
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), true, (NOT p1)]
Support contains 2 out of 317 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 317/317 places, 292/292 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 316 transition count 255
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 280 transition count 255
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 72 place count 280 transition count 230
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 122 place count 255 transition count 230
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 129 place count 248 transition count 223
Iterating global reduction 2 with 7 rules applied. Total rules applied 136 place count 248 transition count 223
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 136 place count 248 transition count 218
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 146 place count 243 transition count 218
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 312 place count 160 transition count 135
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 314 place count 158 transition count 133
Applied a total of 314 rules in 22 ms. Remains 158 /317 variables (removed 159) and now considering 133/292 (removed 159) transitions.
// Phase 1: matrix 133 rows 158 cols
[2024-06-01 12:15:42] [INFO ] Computed 56 invariants in 2 ms
[2024-06-01 12:15:42] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-01 12:15:42] [INFO ] Invariant cache hit.
[2024-06-01 12:15:42] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
Running 130 sub problems to find dead transitions.
[2024-06-01 12:15:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-01 12:15:43] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-06-01 12:15:43] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (OVERLAPS) 1/158 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-01 12:15:44] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2024-06-01 12:15:44] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 1 ms to minimize.
[2024-06-01 12:15:44] [INFO ] Deduced a trap composed of 6 places in 15 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 133/291 variables, 158/219 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-01 12:15:45] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (OVERLAPS) 0/291 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 220 constraints, problems are : Problem set: 0 solved, 130 unsolved in 5082 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 6/61 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (OVERLAPS) 1/158 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (OVERLAPS) 133/291 variables, 158/220 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 130/350 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-01 12:15:52] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/291 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/291 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 10 (OVERLAPS) 0/291 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 351 constraints, problems are : Problem set: 0 solved, 130 unsolved in 17175 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 7/7 constraints]
After SMT, in 22270ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 22272ms
Starting structural reductions in LI_LTL mode, iteration 1 : 158/317 places, 133/292 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 22497 ms. Remains : 158/317 places, 133/292 transitions.
Running random walk in product with property : ShieldPPPs-PT-005B-LTLFireability-04
Entered a terminal (fully accepting) state of product in 714 steps with 2 reset in 6 ms.
Treatment of property ShieldPPPs-PT-005B-LTLFireability-04 finished in 22774 ms.
FORMULA ShieldPPPs-PT-005B-LTLFireability-04 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(!((X(p0) U p1) U p2))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Found a Shortening insensitive property : ShieldPPPs-PT-005B-LTLFireability-15
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 317 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 317/317 places, 292/292 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 316 transition count 255
Reduce places removed 36 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 37 rules applied. Total rules applied 73 place count 280 transition count 254
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 279 transition count 254
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 74 place count 279 transition count 229
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 124 place count 254 transition count 229
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 133 place count 245 transition count 220
Iterating global reduction 3 with 9 rules applied. Total rules applied 142 place count 245 transition count 220
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 142 place count 245 transition count 214
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 154 place count 239 transition count 214
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 314 place count 159 transition count 134
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 316 place count 157 transition count 132
Applied a total of 316 rules in 34 ms. Remains 157 /317 variables (removed 160) and now considering 132/292 (removed 160) transitions.
// Phase 1: matrix 132 rows 157 cols
[2024-06-01 12:16:05] [INFO ] Computed 56 invariants in 2 ms
[2024-06-01 12:16:05] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-01 12:16:05] [INFO ] Invariant cache hit.
[2024-06-01 12:16:05] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
Running 129 sub problems to find dead transitions.
[2024-06-01 12:16:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-06-01 12:16:06] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:16:06] [INFO ] Deduced a trap composed of 28 places in 26 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 1/157 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-06-01 12:16:07] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2024-06-01 12:16:07] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 1 ms to minimize.
[2024-06-01 12:16:07] [INFO ] Deduced a trap composed of 7 places in 14 ms of which 0 ms to minimize.
[2024-06-01 12:16:07] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:16:07] [INFO ] Deduced a trap composed of 58 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:16:07] [INFO ] Deduced a trap composed of 71 places in 41 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-06-01 12:16:08] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 0 ms to minimize.
[2024-06-01 12:16:08] [INFO ] Deduced a trap composed of 44 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:16:08] [INFO ] Deduced a trap composed of 44 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:16:08] [INFO ] Deduced a trap composed of 41 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:16:08] [INFO ] Deduced a trap composed of 39 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 5/69 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 132/289 variables, 157/226 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-06-01 12:16:09] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-06-01 12:16:09] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:16:09] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-06-01 12:16:10] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:16:10] [INFO ] Deduced a trap composed of 28 places in 20 ms of which 1 ms to minimize.
[2024-06-01 12:16:10] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 3/232 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/289 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-06-01 12:16:11] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/289 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/289 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 13 (OVERLAPS) 0/289 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 233 constraints, problems are : Problem set: 0 solved, 129 unsolved in 7525 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 18/66 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 1/157 variables, 8/74 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 132/289 variables, 157/233 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 129/362 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/289 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 362 constraints, problems are : Problem set: 0 solved, 129 unsolved in 14271 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 20/20 constraints]
After SMT, in 21810ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 21811ms
Starting structural reductions in LI_LTL mode, iteration 1 : 157/317 places, 132/292 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 22047 ms. Remains : 157/317 places, 132/292 transitions.
Running random walk in product with property : ShieldPPPs-PT-005B-LTLFireability-15
Product exploration explored 100000 steps with 22703 reset in 145 ms.
Product exploration explored 100000 steps with 22667 reset in 169 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 1 factoid took 160 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 8 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 185 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
[2024-06-01 12:16:28] [INFO ] Invariant cache hit.
[2024-06-01 12:16:28] [INFO ] [Real]Absence check using 56 positive place invariants in 9 ms returned sat
[2024-06-01 12:16:28] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2024-06-01 12:16:28] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:16:28] [INFO ] [Nat]Absence check using 56 positive place invariants in 9 ms returned sat
[2024-06-01 12:16:28] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-06-01 12:16:28] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-06-01 12:16:28] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-06-01 12:16:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 71 ms
[2024-06-01 12:16:28] [INFO ] Computed and/alt/rep : 129/256/129 causal constraints (skipped 0 transitions) in 10 ms.
[2024-06-01 12:16:29] [INFO ] Added : 100 causal constraints over 20 iterations in 321 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 157 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 157/157 places, 132/132 transitions.
Applied a total of 0 rules in 4 ms. Remains 157 /157 variables (removed 0) and now considering 132/132 (removed 0) transitions.
[2024-06-01 12:16:29] [INFO ] Invariant cache hit.
[2024-06-01 12:16:29] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-01 12:16:29] [INFO ] Invariant cache hit.
[2024-06-01 12:16:29] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2024-06-01 12:16:29] [INFO ] Redundant transitions in 1 ms returned []
Running 129 sub problems to find dead transitions.
[2024-06-01 12:16:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-06-01 12:16:29] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-06-01 12:16:30] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 1/157 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-06-01 12:16:30] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
[2024-06-01 12:16:30] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
[2024-06-01 12:16:30] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 1 ms to minimize.
[2024-06-01 12:16:31] [INFO ] Deduced a trap composed of 42 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:16:31] [INFO ] Deduced a trap composed of 58 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:16:31] [INFO ] Deduced a trap composed of 71 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-06-01 12:16:31] [INFO ] Deduced a trap composed of 42 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:16:31] [INFO ] Deduced a trap composed of 44 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:16:31] [INFO ] Deduced a trap composed of 44 places in 24 ms of which 0 ms to minimize.
[2024-06-01 12:16:31] [INFO ] Deduced a trap composed of 41 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:16:31] [INFO ] Deduced a trap composed of 39 places in 23 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 5/69 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 132/289 variables, 157/226 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-06-01 12:16:32] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 0 ms to minimize.
[2024-06-01 12:16:32] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-06-01 12:16:32] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-06-01 12:16:33] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:16:33] [INFO ] Deduced a trap composed of 28 places in 21 ms of which 1 ms to minimize.
[2024-06-01 12:16:33] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 3/232 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/289 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-06-01 12:16:35] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/289 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/289 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 13 (OVERLAPS) 0/289 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 233 constraints, problems are : Problem set: 0 solved, 129 unsolved in 7724 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 18/66 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 1/157 variables, 8/74 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 132/289 variables, 157/233 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 129/362 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/289 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 362 constraints, problems are : Problem set: 0 solved, 129 unsolved in 14523 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 20/20 constraints]
After SMT, in 22260ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 22261ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 22451 ms. Remains : 157/157 places, 132/132 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 150 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 9 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 173 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
[2024-06-01 12:16:52] [INFO ] Invariant cache hit.
[2024-06-01 12:16:52] [INFO ] [Real]Absence check using 56 positive place invariants in 9 ms returned sat
[2024-06-01 12:16:52] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2024-06-01 12:16:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:16:52] [INFO ] [Nat]Absence check using 56 positive place invariants in 9 ms returned sat
[2024-06-01 12:16:52] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2024-06-01 12:16:52] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 1 ms to minimize.
[2024-06-01 12:16:52] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-06-01 12:16:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 64 ms
[2024-06-01 12:16:52] [INFO ] Computed and/alt/rep : 129/256/129 causal constraints (skipped 0 transitions) in 10 ms.
[2024-06-01 12:16:52] [INFO ] Added : 100 causal constraints over 20 iterations in 311 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22522 reset in 165 ms.
Product exploration explored 100000 steps with 22742 reset in 176 ms.
Support contains 3 out of 157 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 157/157 places, 132/132 transitions.
Applied a total of 0 rules in 2 ms. Remains 157 /157 variables (removed 0) and now considering 132/132 (removed 0) transitions.
[2024-06-01 12:16:53] [INFO ] Invariant cache hit.
[2024-06-01 12:16:53] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-01 12:16:53] [INFO ] Invariant cache hit.
[2024-06-01 12:16:53] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2024-06-01 12:16:53] [INFO ] Redundant transitions in 0 ms returned []
Running 129 sub problems to find dead transitions.
[2024-06-01 12:16:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-06-01 12:16:54] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-06-01 12:16:54] [INFO ] Deduced a trap composed of 28 places in 22 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 1/157 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-06-01 12:16:54] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-06-01 12:16:55] [INFO ] Deduced a trap composed of 5 places in 12 ms of which 0 ms to minimize.
[2024-06-01 12:16:55] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 0 ms to minimize.
[2024-06-01 12:16:55] [INFO ] Deduced a trap composed of 42 places in 27 ms of which 0 ms to minimize.
[2024-06-01 12:16:55] [INFO ] Deduced a trap composed of 58 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:16:55] [INFO ] Deduced a trap composed of 71 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-06-01 12:16:55] [INFO ] Deduced a trap composed of 42 places in 31 ms of which 0 ms to minimize.
[2024-06-01 12:16:55] [INFO ] Deduced a trap composed of 44 places in 25 ms of which 0 ms to minimize.
[2024-06-01 12:16:55] [INFO ] Deduced a trap composed of 44 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:16:55] [INFO ] Deduced a trap composed of 41 places in 24 ms of which 0 ms to minimize.
[2024-06-01 12:16:55] [INFO ] Deduced a trap composed of 39 places in 24 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 5/69 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 132/289 variables, 157/226 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-06-01 12:16:56] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-06-01 12:16:56] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-06-01 12:16:56] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-06-01 12:16:57] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 0 ms to minimize.
[2024-06-01 12:16:57] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
[2024-06-01 12:16:57] [INFO ] Deduced a trap composed of 27 places in 23 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 3/232 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/289 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-06-01 12:16:59] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/289 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/289 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 13 (OVERLAPS) 0/289 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 233 constraints, problems are : Problem set: 0 solved, 129 unsolved in 7644 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 18/66 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 1/157 variables, 8/74 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 132/289 variables, 157/233 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 129/362 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/289 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 362 constraints, problems are : Problem set: 0 solved, 129 unsolved in 14574 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 20/20 constraints]
After SMT, in 22230ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 22233ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 22430 ms. Remains : 157/157 places, 132/132 transitions.
Treatment of property ShieldPPPs-PT-005B-LTLFireability-15 finished in 70298 ms.
[2024-06-01 12:17:15] [INFO ] Flatten gal took : 15 ms
[2024-06-01 12:17:15] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-01 12:17:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 317 places, 292 transitions and 824 arcs took 4 ms.
Total runtime 1118404 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : ShieldPPPs-PT-005B-LTLFireability-00
FORMULA ShieldPPPs-PT-005B-LTLFireability-04 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldPPPs-PT-005B-LTLFireability-06 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldPPPs-PT-005B-LTLFireability-13 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : ShieldPPPs-PT-005B-LTLFireability-15

BK_STOP 1717244655527

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name ShieldPPPs-PT-005B-LTLFireability-00
ltl formula formula --ltl=/tmp/8346/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 317 places, 292 transitions and 824 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.010 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/8346/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/8346/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/8346/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/8346/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 319 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 318, there are 294 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): ~504 levels ~10000 states ~26988 transitions
pnml2lts-mc( 0/ 4): ~504 levels ~20000 states ~50272 transitions
pnml2lts-mc( 0/ 4): ~504 levels ~40000 states ~101880 transitions
pnml2lts-mc( 0/ 4): ~590 levels ~80000 states ~203752 transitions
pnml2lts-mc( 2/ 4): ~679 levels ~160000 states ~442220 transitions
pnml2lts-mc( 2/ 4): ~679 levels ~320000 states ~952068 transitions
pnml2lts-mc( 2/ 4): ~679 levels ~640000 states ~1945036 transitions
pnml2lts-mc( 2/ 4): ~679 levels ~1280000 states ~4212320 transitions
pnml2lts-mc( 2/ 4): ~679 levels ~2560000 states ~8912628 transitions
pnml2lts-mc( 2/ 4): ~679 levels ~5120000 states ~18310420 transitions
pnml2lts-mc( 2/ 4): ~679 levels ~10240000 states ~37987132 transitions
pnml2lts-mc( 2/ 4): ~679 levels ~20480000 states ~80172592 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 26643724
pnml2lts-mc( 0/ 4): unique states count: 26646079
pnml2lts-mc( 0/ 4): unique transitions count: 101122136
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 74462621
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 26646087
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2487
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 26646087 states 101122153 transitions, fanout: 3.795
pnml2lts-mc( 0/ 4): Total exploration time 124.720 sec (124.690 sec minimum, 124.705 sec on average)
pnml2lts-mc( 0/ 4): States per second: 213647, Transitions per second: 810793
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 267.4MB, 10.5 B/state, compr.: 0.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 79.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 295 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 267.4MB (~256.0MB paged-in)
ltl formula name ShieldPPPs-PT-005B-LTLFireability-04
ltl formula formula --ltl=/tmp/8346/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 317 places, 292 transitions and 824 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.030 real 0.010 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/8346/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/8346/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/8346/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/8346/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): There are 318 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 318, there are 307 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~613 levels ~10000 states ~43336 transitions
pnml2lts-mc( 3/ 4): ~613 levels ~20000 states ~92804 transitions
pnml2lts-mc( 3/ 4): ~656 levels ~40000 states ~187236 transitions
pnml2lts-mc( 3/ 4): ~656 levels ~80000 states ~392092 transitions
pnml2lts-mc( 3/ 4): ~657 levels ~160000 states ~851508 transitions
pnml2lts-mc( 1/ 4): ~660 levels ~320000 states ~1682164 transitions
pnml2lts-mc( 1/ 4): ~660 levels ~640000 states ~3615836 transitions
pnml2lts-mc( 1/ 4): ~660 levels ~1280000 states ~7499768 transitions
pnml2lts-mc( 1/ 4): ~660 levels ~2560000 states ~15862504 transitions
pnml2lts-mc( 2/ 4): ~937 levels ~5120000 states ~32938896 transitions
pnml2lts-mc( 2/ 4): ~937 levels ~10240000 states ~70058856 transitions
pnml2lts-mc( 1/ 4): ~1044 levels ~20480000 states ~140721268 transitions
pnml2lts-mc( 1/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33533155
pnml2lts-mc( 0/ 4): unique states count: 33536833
pnml2lts-mc( 0/ 4): unique transitions count: 254483420
pnml2lts-mc( 0/ 4): - self-loop count: 387
pnml2lts-mc( 0/ 4): - claim dead count: 220928595
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33536843
pnml2lts-mc( 0/ 4): - cum. max stack depth: 3781
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33536843 states 254483446 transitions, fanout: 7.588
pnml2lts-mc( 0/ 4): Total exploration time 180.220 sec (180.210 sec minimum, 180.213 sec on average)
pnml2lts-mc( 0/ 4): States per second: 186088, Transitions per second: 1412071
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 266.8MB, 8.3 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/16.0%
pnml2lts-mc( 0/ 4): Stored 295 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 266.8MB (~256.0MB paged-in)
ltl formula name ShieldPPPs-PT-005B-LTLFireability-06
ltl formula formula --ltl=/tmp/8346/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 317 places, 292 transitions and 824 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/8346/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/8346/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/8346/ltl_2_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.010 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/8346/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 318 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 318, there are 298 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~730 levels ~10000 states ~45560 transitions
pnml2lts-mc( 3/ 4): ~932 levels ~20000 states ~77384 transitions
pnml2lts-mc( 1/ 4): ~803 levels ~40000 states ~189932 transitions
pnml2lts-mc( 1/ 4): ~804 levels ~80000 states ~389812 transitions
pnml2lts-mc( 2/ 4): ~1319 levels ~160000 states ~765312 transitions
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~1479!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 241150
pnml2lts-mc( 0/ 4): unique states count: 245208
pnml2lts-mc( 0/ 4): unique transitions count: 1263550
pnml2lts-mc( 0/ 4): - self-loop count: 154
pnml2lts-mc( 0/ 4): - claim dead count: 1001316
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 245222
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4125
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 245222 states 1263589 transitions, fanout: 5.153
pnml2lts-mc( 0/ 4): Total exploration time 1.660 sec (1.660 sec minimum, 1.660 sec on average)
pnml2lts-mc( 0/ 4): States per second: 147724, Transitions per second: 761198
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 3.0MB, 11.9 B/state, compr.: 0.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/1.0%
pnml2lts-mc( 0/ 4): Stored 295 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 3.0MB (~256.0MB paged-in)
ltl formula name ShieldPPPs-PT-005B-LTLFireability-13
ltl formula formula --ltl=/tmp/8346/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 317 places, 292 transitions and 824 arcs
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.010 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/8346/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/8346/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/8346/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/8346/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 319 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 318, there are 323 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 8
pnml2lts-mc( 0/ 4): unique states count: 8
pnml2lts-mc( 0/ 4): unique transitions count: 13
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 10
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 23
pnml2lts-mc( 0/ 4): - cum. max stack depth: 16
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 23 states 52 transitions, fanout: 2.261
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 75.0 B/state, compr.: 5.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 295 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name ShieldPPPs-PT-005B-LTLFireability-15
ltl formula formula --ltl=/tmp/8346/ltl_4_
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
pnml2lts-mc( 0/ 4): Petri net has 317 places, 292 transitions and 824 arcs
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
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.030 real 0.000 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/8346/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/8346/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/8346/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/8346/ltl_4_
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 319 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 318, there are 301 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): ~235 levels ~10000 states ~52240 transitions
pnml2lts-mc( 0/ 4): ~235 levels ~20000 states ~108776 transitions
pnml2lts-mc( 0/ 4): ~235 levels ~40000 states ~231784 transitions
pnml2lts-mc( 0/ 4): ~235 levels ~80000 states ~483112 transitions
pnml2lts-mc( 0/ 4): ~235 levels ~160000 states ~983808 transitions
pnml2lts-mc( 0/ 4): ~235 levels ~320000 states ~2081296 transitions
pnml2lts-mc( 0/ 4): ~235 levels ~640000 states ~4210856 transitions
pnml2lts-mc( 0/ 4): ~235 levels ~1280000 states ~8708800 transitions
pnml2lts-mc( 0/ 4): ~235 levels ~2560000 states ~18223808 transitions
pnml2lts-mc( 0/ 4): ~235 levels ~5120000 states ~37584048 transitions
pnml2lts-mc( 0/ 4): ~235 levels ~10240000 states ~79646560 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 17393321
pnml2lts-mc( 0/ 4): unique states count: 17394067
pnml2lts-mc( 0/ 4): unique transitions count: 144406283
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 127005105
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 17394076
pnml2lts-mc( 0/ 4): - cum. max stack depth: 883
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 17394076 states 144406316 transitions, fanout: 8.302
pnml2lts-mc( 0/ 4): Total exploration time 111.160 sec (111.140 sec minimum, 111.150 sec on average)
pnml2lts-mc( 0/ 4): States per second: 156478, Transitions per second: 1299085
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 196.7MB, 11.9 B/state, compr.: 0.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 51.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 295 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 196.7MB (~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="ShieldPPPs-PT-005B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is ShieldPPPs-PT-005B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r528-tall-171683761100428"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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