Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r198-tall-174894533400820.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is ShieldPPPt-PT-003B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r198-tall-174894533400820
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 56K May 29 14:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME ShieldPPPt-PT-003B-LTLFireability-00
FORMULA_NAME ShieldPPPt-PT-003B-LTLFireability-01
FORMULA_NAME ShieldPPPt-PT-003B-LTLFireability-02
FORMULA_NAME ShieldPPPt-PT-003B-LTLFireability-03
FORMULA_NAME ShieldPPPt-PT-003B-LTLFireability-04
FORMULA_NAME ShieldPPPt-PT-003B-LTLFireability-05
FORMULA_NAME ShieldPPPt-PT-003B-LTLFireability-06
FORMULA_NAME ShieldPPPt-PT-003B-LTLFireability-07
FORMULA_NAME ShieldPPPt-PT-003B-LTLFireability-08
FORMULA_NAME ShieldPPPt-PT-003B-LTLFireability-09
FORMULA_NAME ShieldPPPt-PT-003B-LTLFireability-10
FORMULA_NAME ShieldPPPt-PT-003B-LTLFireability-11
FORMULA_NAME ShieldPPPt-PT-003B-LTLFireability-12
FORMULA_NAME ShieldPPPt-PT-003B-LTLFireability-13
FORMULA_NAME ShieldPPPt-PT-003B-LTLFireability-14
FORMULA_NAME ShieldPPPt-PT-003B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1749297317982

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-003B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-07 11:55:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-07 11:55:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 11:55:19] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2025-06-07 11:55:19] [INFO ] Transformed 237 places.
[2025-06-07 11:55:19] [INFO ] Transformed 216 transitions.
[2025-06-07 11:55:19] [INFO ] Found NUPN structural information;
[2025-06-07 11:55:19] [INFO ] Parsed PT model containing 237 places and 216 transitions and 540 arcs in 158 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldPPPt-PT-003B-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-003B-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-003B-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 237 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 216/216 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 209 transition count 188
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 209 transition count 188
Applied a total of 56 rules in 42 ms. Remains 209 /237 variables (removed 28) and now considering 188/216 (removed 28) transitions.
// Phase 1: matrix 188 rows 209 cols
[2025-06-07 11:55:19] [INFO ] Computed 34 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:55:19] [INFO ] Implicit Places using invariants in 209 ms returned []
[2025-06-07 11:55:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:55:19] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
Running 187 sub problems to find dead transitions.
[2025-06-07 11:55:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (OVERLAPS) 1/209 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 187 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:55:22] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:55:22] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:55:22] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:55:22] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:55:22] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:55:22] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:55:22] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:55:22] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:55:22] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:55:22] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:55:22] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:55:22] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:55:22] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:55:22] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:55:22] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:55:22] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:55:22] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:55:23] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:55:23] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:55:23] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 187 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:55:23] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:55:23] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:55:23] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:55:23] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:55:24] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 5/59 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (OVERLAPS) 188/397 variables, 209/268 constraints. Problems are: Problem set: 0 solved, 187 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:55:26] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 187 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:55:29] [INFO ] Deduced a trap along path composed of 7 places in 34 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/397 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 187 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:55:30] [INFO ] Deduced a trap along path composed of 7 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:55:31] [INFO ] Deduced a trap along path composed of 5 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/397 variables, 2/272 constraints. Problems are: Problem set: 0 solved, 187 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:55:33] [INFO ] Deduced a trap along path composed of 5 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:55:33] [INFO ] Deduced a trap along path composed of 5 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:55:33] [INFO ] Deduced a trap along path composed of 5 places in 26 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:55:33] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/397 variables, 4/276 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/397 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 187 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:55:37] [INFO ] Deduced a trap along path composed of 5 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:55:37] [INFO ] Deduced a trap along path composed of 5 places in 28 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/397 variables, 2/278 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/397 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 13 (OVERLAPS) 0/397 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Real declared 397/397 variables, and 278 constraints, problems are : Problem set: 0 solved, 187 unsolved in 21826 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 187 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (OVERLAPS) 1/209 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 26/60 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (OVERLAPS) 188/397 variables, 209/269 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/397 variables, 187/456 constraints. Problems are: Problem set: 0 solved, 187 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:55:43] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:55:43] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:55:43] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:55:43] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:55:43] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:55:43] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:55:43] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:55:44] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:55:44] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:55:44] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:55:44] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 11/467 constraints. Problems are: Problem set: 0 solved, 187 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:55:45] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:55:45] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:55:45] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:55:45] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/397 variables, 4/471 constraints. Problems are: Problem set: 0 solved, 187 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:55:46] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:55:46] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/397 variables, 2/473 constraints. Problems are: Problem set: 0 solved, 187 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:55:48] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:55:48] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:55:48] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/397 variables, 3/476 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/397 variables, 9/485 constraints. Problems are: Problem set: 0 solved, 187 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:55:52] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/397 variables, 1/486 constraints. Problems are: Problem set: 0 solved, 187 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:55:57] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/397 variables, 1/487 constraints. Problems are: Problem set: 0 solved, 187 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:56:07] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:56:07] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/397 variables, 2/489 constraints. Problems are: Problem set: 0 solved, 187 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 397/397 variables, and 489 constraints, problems are : Problem set: 0 solved, 187 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 50/50 constraints, Known Traps Along Path: 9/9 constraints]
After SMT, in 51888ms problems are : Problem set: 0 solved, 187 unsolved
Search for dead transitions found 0 dead transitions in 51899ms
Starting structural reductions in LTL mode, iteration 1 : 209/237 places, 188/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52375 ms. Remains : 209/237 places, 188/216 transitions.
Support contains 38 out of 209 places after structural reductions.
[2025-06-07 11:56:11] [INFO ] Flatten gal took : 32 ms
[2025-06-07 11:56:11] [INFO ] Flatten gal took : 14 ms
[2025-06-07 11:56:12] [INFO ] Input system was already deterministic with 188 transitions.
Support contains 37 out of 209 places (down from 38) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 32 to 31
RANDOM walk for 2678 steps (0 resets) in 156 ms. (17 steps per ms) remains 0/31 properties
FORMULA ShieldPPPt-PT-003B-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 49 stabilizing places and 49 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&F(p1)))))'
Support contains 2 out of 209 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 188/188 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 204 transition count 183
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 204 transition count 183
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 203 transition count 182
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 203 transition count 182
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 202 transition count 181
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 202 transition count 181
Applied a total of 14 rules in 19 ms. Remains 202 /209 variables (removed 7) and now considering 181/188 (removed 7) transitions.
// Phase 1: matrix 181 rows 202 cols
[2025-06-07 11:56:12] [INFO ] Computed 34 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:56:12] [INFO ] Implicit Places using invariants in 77 ms returned []
[2025-06-07 11:56:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:56:12] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Running 180 sub problems to find dead transitions.
[2025-06-07 11:56:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:56:14] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:56:14] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:56:14] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:56:14] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:56:14] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:56:14] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:56:14] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:56:14] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:56:15] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:56:15] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:56:15] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:56:15] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:56:15] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:56:15] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:56:15] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:56:15] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:56:15] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:56:15] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:56:15] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 19/53 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (OVERLAPS) 181/383 variables, 202/255 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:56:18] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:56:19] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:56:21] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:56:22] [INFO ] Deduced a trap along path composed of 7 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:56:22] [INFO ] Deduced a trap along path composed of 5 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:56:23] [INFO ] Deduced a trap along path composed of 5 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:56:23] [INFO ] Deduced a trap along path composed of 3 places in 17 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/383 variables, 4/262 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:56:24] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/383 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:56:26] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:56:26] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/383 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/383 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:56:30] [INFO ] Deduced a trap along path composed of 7 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:56:30] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:56:30] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/383 variables, 3/268 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/383 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 14 (OVERLAPS) 0/383 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Real declared 383/383 variables, and 268 constraints, problems are : Problem set: 0 solved, 180 unsolved in 22474 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 25/59 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:56:35] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (OVERLAPS) 181/383 variables, 202/262 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 180/442 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:56:37] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:56:37] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:56:37] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:56:37] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:56:37] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:56:37] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:56:37] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:56:37] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:56:37] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:56:38] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:56:38] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:56:38] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:56:38] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 13/455 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:56:39] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:56:39] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:56:39] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/383 variables, 3/458 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/383 variables, 7/465 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:56:41] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/383 variables, 1/466 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:56:47] [INFO ] Deduced a trap along path composed of 5 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:56:47] [INFO ] Deduced a trap along path composed of 7 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:56:48] [INFO ] Deduced a trap along path composed of 7 places in 22 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/383 variables, 3/469 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:57:01] [INFO ] Deduced a trap along path composed of 7 places in 27 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:57:02] [INFO ] Deduced a trap along path composed of 7 places in 26 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:57:02] [INFO ] Deduced a trap along path composed of 7 places in 26 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:57:03] [INFO ] Deduced a trap along path composed of 6 places in 23 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/383 variables, 4/473 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 383/383 variables, and 473 constraints, problems are : Problem set: 0 solved, 180 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 43/43 constraints, Known Traps Along Path: 14/14 constraints]
After SMT, in 52507ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 52508ms
Starting structural reductions in LTL mode, iteration 1 : 202/209 places, 181/188 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52727 ms. Remains : 202/209 places, 181/188 transitions.
Stuttering acceptance computed with spot in 305 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-003B-LTLFireability-00
Product exploration explored 100000 steps with 33333 reset in 176 ms.
Product exploration explored 100000 steps with 33333 reset in 112 ms.
Computed a total of 46 stabilizing places and 46 stable transitions
Computed a total of 46 stabilizing places and 46 stable transitions
Detected a total of 46/202 stabilizing places and 46/181 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X 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 5 factoid took 13 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-003B-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-003B-LTLFireability-00 finished in 53400 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((X(X(X(X(p0))))&&G(p1))||G(p0))))'
Support contains 2 out of 209 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 188/188 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 204 transition count 183
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 204 transition count 183
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 203 transition count 182
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 203 transition count 182
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 202 transition count 181
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 202 transition count 181
Applied a total of 14 rules in 22 ms. Remains 202 /209 variables (removed 7) and now considering 181/188 (removed 7) transitions.
[2025-06-07 11:57:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:57:06] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-07 11:57:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:57:06] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
Running 180 sub problems to find dead transitions.
[2025-06-07 11:57:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:57:07] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:57:07] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:57:07] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:57:07] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:57:08] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:57:08] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:57:08] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:57:08] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:57:08] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:57:08] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:57:08] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:57:08] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:57:08] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:57:08] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:57:08] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:57:08] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:57:08] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:57:08] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:57:08] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 19/53 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (OVERLAPS) 181/383 variables, 202/255 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:57:11] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:57:12] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:57:14] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:57:16] [INFO ] Deduced a trap along path composed of 7 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:57:16] [INFO ] Deduced a trap along path composed of 5 places in 20 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:57:16] [INFO ] Deduced a trap along path composed of 5 places in 26 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:57:16] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/383 variables, 4/262 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:57:17] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/383 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:57:20] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:57:20] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/383 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/383 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:57:23] [INFO ] Deduced a trap along path composed of 7 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:57:23] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:57:23] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/383 variables, 3/268 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/383 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 14 (OVERLAPS) 0/383 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Real declared 383/383 variables, and 268 constraints, problems are : Problem set: 0 solved, 180 unsolved in 22524 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 25/59 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:57:28] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (OVERLAPS) 181/383 variables, 202/262 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 180/442 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:57:30] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:57:30] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:57:30] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:57:31] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:57:31] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:57:31] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:57:31] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:57:31] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:57:31] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:57:31] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:57:31] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:57:31] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:57:31] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 13/455 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:57:32] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:57:33] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:57:33] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/383 variables, 3/458 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/383 variables, 7/465 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:57:35] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/383 variables, 1/466 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:57:41] [INFO ] Deduced a trap along path composed of 5 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:57:41] [INFO ] Deduced a trap along path composed of 7 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:57:42] [INFO ] Deduced a trap along path composed of 7 places in 24 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/383 variables, 3/469 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:57:54] [INFO ] Deduced a trap along path composed of 7 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:57:55] [INFO ] Deduced a trap along path composed of 7 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:57:56] [INFO ] Deduced a trap along path composed of 7 places in 26 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:57:56] [INFO ] Deduced a trap along path composed of 6 places in 19 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/383 variables, 4/473 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 383/383 variables, and 473 constraints, problems are : Problem set: 0 solved, 180 unsolved in 30007 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 43/43 constraints, Known Traps Along Path: 14/14 constraints]
After SMT, in 52543ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 52544ms
Starting structural reductions in LTL mode, iteration 1 : 202/209 places, 181/188 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52742 ms. Remains : 202/209 places, 181/188 transitions.
Stuttering acceptance computed with spot in 1062 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-003B-LTLFireability-02
Product exploration explored 100000 steps with 700 reset in 153 ms.
Product exploration explored 100000 steps with 656 reset in 226 ms.
Computed a total of 46 stabilizing places and 46 stable transitions
Computed a total of 46 stabilizing places and 46 stable transitions
Detected a total of 46/202 stabilizing places and 46/181 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 285 ms. Reduced automaton from 24 states, 96 edges and 2 AP (stutter sensitive) to 24 states, 96 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1126 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 409 ms. (97 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 144 ms. (275 steps per ms) remains 1/1 properties
[2025-06-07 11:58:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:58:01] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 2 ms to minimize.
Problem apf1 is UNSAT
After SMT solving in domain Real declared 52/383 variables, and 10 constraints, problems are : Problem set: 1 solved, 0 unsolved in 52 ms.
Refiners :[Positive P Invariants (semi-flows): 9/34 constraints, State Equation: 0/202 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p0 p1))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 15 factoid took 3014 ms. Reduced automaton from 24 states, 96 edges and 2 AP (stutter sensitive) to 24 states, 72 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1098 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 1169 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 181/181 transitions.
Applied a total of 0 rules in 9 ms. Remains 202 /202 variables (removed 0) and now considering 181/181 (removed 0) transitions.
[2025-06-07 11:58:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:58:07] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-06-07 11:58:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:58:07] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Running 180 sub problems to find dead transitions.
[2025-06-07 11:58:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:58:08] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:58:09] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:58:09] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:58:09] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:58:09] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:58:09] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:58:09] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:58:09] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:58:09] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:58:09] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:58:09] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:58:09] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:58:09] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:58:09] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:58:09] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:58:09] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:58:09] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:58:10] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:58:10] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 19/53 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (OVERLAPS) 181/383 variables, 202/255 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:58:12] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:58:13] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:58:15] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:58:17] [INFO ] Deduced a trap along path composed of 7 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:58:17] [INFO ] Deduced a trap along path composed of 5 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:58:17] [INFO ] Deduced a trap along path composed of 5 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:58:17] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/383 variables, 4/262 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:58:18] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/383 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:58:21] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:58:21] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/383 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/383 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:58:24] [INFO ] Deduced a trap along path composed of 7 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:58:24] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:58:25] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/383 variables, 3/268 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/383 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 14 (OVERLAPS) 0/383 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Real declared 383/383 variables, and 268 constraints, problems are : Problem set: 0 solved, 180 unsolved in 22591 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 25/59 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:58:30] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (OVERLAPS) 181/383 variables, 202/262 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 180/442 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:58:31] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:58:31] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:58:32] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:58:32] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:58:32] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:58:32] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:58:32] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:58:32] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:58:32] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:58:32] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:58:32] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:58:32] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:58:32] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 13/455 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:58:33] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:58:34] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:58:34] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/383 variables, 3/458 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/383 variables, 7/465 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:58:36] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/383 variables, 1/466 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:58:41] [INFO ] Deduced a trap along path composed of 5 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:58:42] [INFO ] Deduced a trap along path composed of 7 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:58:43] [INFO ] Deduced a trap along path composed of 7 places in 22 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/383 variables, 3/469 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:58:56] [INFO ] Deduced a trap along path composed of 7 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:58:56] [INFO ] Deduced a trap along path composed of 7 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:58:57] [INFO ] Deduced a trap along path composed of 7 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:58:57] [INFO ] Deduced a trap along path composed of 6 places in 23 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/383 variables, 4/473 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 383/383 variables, and 473 constraints, problems are : Problem set: 0 solved, 180 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 43/43 constraints, Known Traps Along Path: 14/14 constraints]
After SMT, in 52621ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 52621ms
Finished structural reductions in LTL mode , in 1 iterations and 52819 ms. Remains : 202/202 places, 181/181 transitions.
Computed a total of 46 stabilizing places and 46 stable transitions
Computed a total of 46 stabilizing places and 46 stable transitions
Detected a total of 46/202 stabilizing places and 46/181 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p1), (X (AND p0 p1)), (X p0), (X (X p1)), (X (X (AND p0 p1))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 3391 ms. Reduced automaton from 24 states, 72 edges and 2 AP (stutter sensitive) to 24 states, 72 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1100 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
RANDOM walk for 1132 steps (0 resets) in 8 ms. (125 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 p0), (X p1), (X (AND p0 p1)), (X p0), (X (X p1)), (X (X (AND p0 p1))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 8 factoid took 3546 ms. Reduced automaton from 24 states, 72 edges and 2 AP (stutter sensitive) to 24 states, 72 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1146 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 1223 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 1177 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 638 reset in 149 ms.
Product exploration explored 100000 steps with 710 reset in 161 ms.
Built C files in :
/tmp/ltsmin17535723374560264808
[2025-06-07 11:59:16] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17535723374560264808
Running compilation step : cd /tmp/ltsmin17535723374560264808;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 741 ms.
Running link step : cd /tmp/ltsmin17535723374560264808;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin17535723374560264808;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7849143830802360734.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 181/181 transitions.
Applied a total of 0 rules in 3 ms. Remains 202 /202 variables (removed 0) and now considering 181/181 (removed 0) transitions.
[2025-06-07 11:59:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:59:31] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-07 11:59:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:59:31] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
Running 180 sub problems to find dead transitions.
[2025-06-07 11:59:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:59:33] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:59:33] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:59:33] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:59:33] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:59:33] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:59:33] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:59:34] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:59:34] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:59:34] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:59:34] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:59:34] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:59:34] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:59:34] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:59:34] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:59:34] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:59:34] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:59:34] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:59:34] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:59:34] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 19/53 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (OVERLAPS) 181/383 variables, 202/255 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:59:37] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:59:38] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:59:40] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:59:41] [INFO ] Deduced a trap along path composed of 7 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:59:41] [INFO ] Deduced a trap along path composed of 5 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:59:42] [INFO ] Deduced a trap along path composed of 5 places in 21 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:59:42] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/383 variables, 4/262 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:59:43] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/383 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:59:45] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:59:45] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/383 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/383 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:59:49] [INFO ] Deduced a trap along path composed of 7 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:59:49] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:59:49] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/383 variables, 3/268 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/383 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 14 (OVERLAPS) 0/383 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Real declared 383/383 variables, and 268 constraints, problems are : Problem set: 0 solved, 180 unsolved in 22414 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 25/59 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:59:54] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (OVERLAPS) 181/383 variables, 202/262 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 180/442 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:59:56] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:59:56] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:59:56] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:59:56] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:59:56] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:59:56] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:59:56] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:59:56] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:59:56] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:59:57] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:59:57] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:59:57] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:59:57] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 13/455 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:59:58] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:59:58] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 11:59:58] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/383 variables, 3/458 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/383 variables, 7/465 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:00:00] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/383 variables, 1/466 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:00:06] [INFO ] Deduced a trap along path composed of 5 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:00:06] [INFO ] Deduced a trap along path composed of 7 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:00:07] [INFO ] Deduced a trap along path composed of 7 places in 21 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/383 variables, 3/469 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:00:20] [INFO ] Deduced a trap along path composed of 7 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:00:21] [INFO ] Deduced a trap along path composed of 7 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:00:21] [INFO ] Deduced a trap along path composed of 7 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:00:22] [INFO ] Deduced a trap along path composed of 6 places in 24 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/383 variables, 4/473 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 383/383 variables, and 473 constraints, problems are : Problem set: 0 solved, 180 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 43/43 constraints, Known Traps Along Path: 14/14 constraints]
After SMT, in 52443ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 52445ms
Finished structural reductions in LTL mode , in 1 iterations and 52624 ms. Remains : 202/202 places, 181/181 transitions.
Built C files in :
/tmp/ltsmin140417184136910919
[2025-06-07 12:00:24] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin140417184136910919
Running compilation step : cd /tmp/ltsmin140417184136910919;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 278 ms.
Running link step : cd /tmp/ltsmin140417184136910919;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin140417184136910919;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15406306478919691.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-07 12:00:39] [INFO ] Flatten gal took : 8 ms
[2025-06-07 12:00:39] [INFO ] Flatten gal took : 9 ms
[2025-06-07 12:00:39] [INFO ] Time to serialize gal into /tmp/LTL11945106473920278850.gal : 2 ms
[2025-06-07 12:00:39] [INFO ] Time to serialize properties into /tmp/LTL3232856144983693459.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11945106473920278850.gal' '-t' 'CGAL' '-hoa' '/tmp/aut78411972185887466.hoa' '-atoms' '/tmp/LTL3232856144983693459.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL3232856144983693459.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut78411972185887466.hoa
Reverse transition relation is NOT exact ! Due to transitions t12, t16, t21, t25, t30, t35, t41, t44, t47, t49, t50, t52, t53, t55, t56, t60, t65, t70, t74...435
Computing Next relation with stutter on 7806 deadlock states
Detected timeout of ITS tools.
[2025-06-07 12:00:54] [INFO ] Flatten gal took : 8 ms
[2025-06-07 12:00:54] [INFO ] Flatten gal took : 8 ms
[2025-06-07 12:00:54] [INFO ] Time to serialize gal into /tmp/LTL10212110719722528209.gal : 1 ms
[2025-06-07 12:00:54] [INFO ] Time to serialize properties into /tmp/LTL4061040939616692415.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10212110719722528209.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4061040939616692415.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G("(p10!=1)"))||((X(X(X(X("(p10!=1)")))))&&(G("(p79!=1)"))))))
Formula 0 simplified : G(F!"(p10!=1)" & (XXXX!"(p10!=1)" | F!"(p79!=1)"))
Reverse transition relation is NOT exact ! Due to transitions t12, t16, t21, t25, t30, t35, t41, t44, t47, t49, t50, t52, t53, t55, t56, t60, t65, t70, t74...435
Computing Next relation with stutter on 7806 deadlock states
Detected timeout of ITS tools.
[2025-06-07 12:01:09] [INFO ] Flatten gal took : 8 ms
[2025-06-07 12:01:09] [INFO ] Applying decomposition
[2025-06-07 12:01:09] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17179812920577926976.txt' '-o' '/tmp/graph17179812920577926976.bin' '-w' '/tmp/graph17179812920577926976.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17179812920577926976.bin' '-l' '-1' '-v' '-w' '/tmp/graph17179812920577926976.weights' '-q' '0' '-e' '0.001'
[2025-06-07 12:01:09] [INFO ] Decomposing Gal with order
[2025-06-07 12:01:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 12:01:09] [INFO ] Removed a total of 33 redundant transitions.
[2025-06-07 12:01:09] [INFO ] Flatten gal took : 44 ms
[2025-06-07 12:01:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2025-06-07 12:01:09] [INFO ] Time to serialize gal into /tmp/LTL14232342876561696808.gal : 5 ms
[2025-06-07 12:01:09] [INFO ] Time to serialize properties into /tmp/LTL7493141140921938218.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14232342876561696808.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7493141140921938218.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((G("(i0.i1.u4.p10!=1)"))||((X(X(X(X("(i0.i1.u4.p10!=1)")))))&&(G("(i2.i1.u23.p79!=1)"))))))
Formula 0 simplified : G(F!"(i0.i1.u4.p10!=1)" & (XXXX!"(i0.i1.u4.p10!=1)" | F!"(i2.i1.u23.p79!=1)"))
Reverse transition relation is NOT exact ! Due to transitions t47, t50, t94, t97, t142, t145, t171, t185, i0.t180, i0.i0.u1.t152, i0.i2.u11.t144, i0.i3.t11...727
Computing Next relation with stutter on 7806 deadlock states
Detected timeout of ITS tools.
Treatment of property ShieldPPPt-PT-003B-LTLFireability-02 finished in 258964 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 209 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 188/188 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 208 transition count 142
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 90 place count 163 transition count 142
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 90 place count 163 transition count 121
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 132 place count 142 transition count 121
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 135 place count 139 transition count 118
Iterating global reduction 2 with 3 rules applied. Total rules applied 138 place count 139 transition count 118
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 138 place count 139 transition count 116
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 142 place count 137 transition count 116
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 240 place count 88 transition count 67
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 241 place count 88 transition count 66
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 243 place count 87 transition count 65
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 259 place count 79 transition count 65
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 260 place count 79 transition count 65
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 262 place count 77 transition count 63
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 263 place count 76 transition count 63
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 263 place count 76 transition count 61
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 267 place count 74 transition count 61
Applied a total of 267 rules in 41 ms. Remains 74 /209 variables (removed 135) and now considering 61/188 (removed 127) transitions.
// Phase 1: matrix 61 rows 74 cols
[2025-06-07 12:01:24] [INFO ] Computed 33 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:01:25] [INFO ] Implicit Places using invariants in 49 ms returned [57, 61]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 50 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 72/209 places, 61/188 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 70 transition count 59
Applied a total of 4 rules in 3 ms. Remains 70 /72 variables (removed 2) and now considering 59/61 (removed 2) transitions.
// Phase 1: matrix 59 rows 70 cols
[2025-06-07 12:01:25] [INFO ] Computed 31 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:01:25] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-06-07 12:01:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:01:25] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 70/209 places, 59/188 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 215 ms. Remains : 70/209 places, 59/188 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-003B-LTLFireability-03
Product exploration explored 100000 steps with 1071 reset in 159 ms.
Stack based approach found an accepted trace after 688 steps with 5 reset with depth 183 and stack size 175 in 2 ms.
FORMULA ShieldPPPt-PT-003B-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-003B-LTLFireability-03 finished in 467 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||(F(p1)&&(F(p2) U p3)))))'
Support contains 5 out of 209 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 188/188 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 43 place count 208 transition count 144
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 86 place count 165 transition count 144
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 86 place count 165 transition count 123
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 128 place count 144 transition count 123
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 130 place count 142 transition count 121
Iterating global reduction 2 with 2 rules applied. Total rules applied 132 place count 142 transition count 121
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 132 place count 142 transition count 120
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 134 place count 141 transition count 120
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 232 place count 92 transition count 71
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 233 place count 92 transition count 70
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 235 place count 91 transition count 69
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 251 place count 83 transition count 69
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 253 place count 81 transition count 67
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 254 place count 80 transition count 67
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 254 place count 80 transition count 65
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 258 place count 78 transition count 65
Applied a total of 258 rules in 28 ms. Remains 78 /209 variables (removed 131) and now considering 65/188 (removed 123) transitions.
// Phase 1: matrix 65 rows 78 cols
[2025-06-07 12:01:25] [INFO ] Computed 33 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:01:25] [INFO ] Implicit Places using invariants in 51 ms returned [60, 64]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 52 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 76/209 places, 65/188 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 74 transition count 63
Applied a total of 4 rules in 4 ms. Remains 74 /76 variables (removed 2) and now considering 63/65 (removed 2) transitions.
// Phase 1: matrix 63 rows 74 cols
[2025-06-07 12:01:25] [INFO ] Computed 31 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:01:25] [INFO ] Implicit Places using invariants in 43 ms returned []
[2025-06-07 12:01:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:01:25] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 74/209 places, 63/188 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 185 ms. Remains : 74/209 places, 63/188 transitions.
Stuttering acceptance computed with spot in 155 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : ShieldPPPt-PT-003B-LTLFireability-04
Product exploration explored 100000 steps with 1776 reset in 154 ms.
Stack based approach found an accepted trace after 13 steps with 0 reset with depth 14 and stack size 14 in 0 ms.
FORMULA ShieldPPPt-PT-003B-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-003B-LTLFireability-04 finished in 516 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U G(p1))))'
Support contains 2 out of 209 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 188/188 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 205 transition count 184
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 205 transition count 184
Applied a total of 8 rules in 10 ms. Remains 205 /209 variables (removed 4) and now considering 184/188 (removed 4) transitions.
// Phase 1: matrix 184 rows 205 cols
[2025-06-07 12:01:25] [INFO ] Computed 34 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:01:25] [INFO ] Implicit Places using invariants in 61 ms returned []
[2025-06-07 12:01:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:01:26] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
Running 183 sub problems to find dead transitions.
[2025-06-07 12:01:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:01:27] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:01:27] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:01:27] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:01:28] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:01:28] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:01:28] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:01:28] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:01:28] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:01:28] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:01:28] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:01:28] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:01:28] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:01:28] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:01:28] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:01:28] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:01:28] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:01:28] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:01:28] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:01:28] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:01:28] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:01:29] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (OVERLAPS) 184/389 variables, 205/260 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:01:32] [INFO ] Deduced a trap along path composed of 7 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:01:32] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:01:33] [INFO ] Deduced a trap along path composed of 5 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:01:33] [INFO ] Deduced a trap along path composed of 5 places in 16 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 4/264 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:01:35] [INFO ] Deduced a trap along path composed of 5 places in 16 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/389 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:01:36] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/389 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 10 (OVERLAPS) 0/389 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 183 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 266 constraints, problems are : Problem set: 0 solved, 183 unsolved in 15924 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 183 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 22/56 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (OVERLAPS) 184/389 variables, 205/261 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/389 variables, 183/444 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:01:43] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:01:43] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:01:43] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:01:43] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:01:43] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:01:43] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:01:43] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:01:44] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:01:44] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:01:44] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:01:44] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:01:44] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:01:44] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:01:44] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:01:44] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 15/459 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:01:45] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:01:45] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:01:45] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:01:45] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/389 variables, 4/463 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 5/468 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:01:50] [INFO ] Deduced a trap along path composed of 6 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:01:50] [INFO ] Deduced a trap along path composed of 5 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:01:53] [INFO ] Deduced a trap along path composed of 7 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/389 variables, 3/471 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:01:58] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/389 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 389/389 variables, and 472 constraints, problems are : Problem set: 0 solved, 183 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 8/8 constraints]
After SMT, in 45951ms problems are : Problem set: 0 solved, 183 unsolved
Search for dead transitions found 0 dead transitions in 45952ms
Starting structural reductions in LTL mode, iteration 1 : 205/209 places, 184/188 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46133 ms. Remains : 205/209 places, 184/188 transitions.
Stuttering acceptance computed with spot in 163 ms :[(NOT p1), (NOT p1), true, (AND p1 (NOT p0)), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-003B-LTLFireability-05
Entered a terminal (fully accepting) state of product in 364 steps with 0 reset in 2 ms.
FORMULA ShieldPPPt-PT-003B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-003B-LTLFireability-05 finished in 46326 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 2 out of 209 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 188/188 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 208 transition count 141
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 92 place count 162 transition count 141
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 92 place count 162 transition count 120
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 134 place count 141 transition count 120
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 136 place count 139 transition count 118
Iterating global reduction 2 with 2 rules applied. Total rules applied 138 place count 139 transition count 118
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 138 place count 139 transition count 117
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 140 place count 138 transition count 117
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 240 place count 88 transition count 67
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 241 place count 88 transition count 66
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 243 place count 87 transition count 65
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 259 place count 79 transition count 65
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 261 place count 77 transition count 63
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 262 place count 76 transition count 63
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 262 place count 76 transition count 61
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 266 place count 74 transition count 61
Applied a total of 266 rules in 35 ms. Remains 74 /209 variables (removed 135) and now considering 61/188 (removed 127) transitions.
// Phase 1: matrix 61 rows 74 cols
[2025-06-07 12:02:12] [INFO ] Computed 33 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:02:12] [INFO ] Implicit Places using invariants in 58 ms returned [57, 61]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 59 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 72/209 places, 61/188 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 70 transition count 59
Applied a total of 4 rules in 2 ms. Remains 70 /72 variables (removed 2) and now considering 59/61 (removed 2) transitions.
// Phase 1: matrix 59 rows 70 cols
[2025-06-07 12:02:12] [INFO ] Computed 31 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:02:12] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-06-07 12:02:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:02:12] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 70/209 places, 59/188 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 195 ms. Remains : 70/209 places, 59/188 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-003B-LTLFireability-08
Product exploration explored 100000 steps with 6804 reset in 145 ms.
Stack based approach found an accepted trace after 34 steps with 2 reset with depth 18 and stack size 18 in 0 ms.
FORMULA ShieldPPPt-PT-003B-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-003B-LTLFireability-08 finished in 428 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G((G(p0) U p1))) U (G((F(p0) U p2))&&F(p1))))'
Support contains 4 out of 209 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 188/188 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 208 transition count 145
Reduce places removed 42 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 43 rules applied. Total rules applied 85 place count 166 transition count 144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 86 place count 165 transition count 144
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 86 place count 165 transition count 122
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 130 place count 143 transition count 122
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 133 place count 140 transition count 119
Iterating global reduction 3 with 3 rules applied. Total rules applied 136 place count 140 transition count 119
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 136 place count 140 transition count 117
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 140 place count 138 transition count 117
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 236 place count 90 transition count 69
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 237 place count 90 transition count 68
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 239 place count 89 transition count 67
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 253 place count 82 transition count 67
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 255 place count 80 transition count 65
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 256 place count 79 transition count 65
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 256 place count 79 transition count 63
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 260 place count 77 transition count 63
Applied a total of 260 rules in 25 ms. Remains 77 /209 variables (removed 132) and now considering 63/188 (removed 125) transitions.
// Phase 1: matrix 63 rows 77 cols
[2025-06-07 12:02:12] [INFO ] Computed 33 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:02:12] [INFO ] Implicit Places using invariants in 53 ms returned [60, 64]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 54 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 75/209 places, 63/188 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 74 transition count 62
Applied a total of 2 rules in 2 ms. Remains 74 /75 variables (removed 1) and now considering 62/63 (removed 1) transitions.
// Phase 1: matrix 62 rows 74 cols
[2025-06-07 12:02:12] [INFO ] Computed 31 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:02:12] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-06-07 12:02:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:02:12] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 74/209 places, 62/188 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 179 ms. Remains : 74/209 places, 62/188 transitions.
Stuttering acceptance computed with spot in 345 ms :[(OR (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p2), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-003B-LTLFireability-09
Product exploration explored 100000 steps with 1109 reset in 167 ms.
Stack based approach found an accepted trace after 20 steps with 0 reset with depth 21 and stack size 21 in 0 ms.
FORMULA ShieldPPPt-PT-003B-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-003B-LTLFireability-09 finished in 720 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0||X(p1))) U X((p2 U p3)))))'
Support contains 4 out of 209 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 188/188 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 204 transition count 183
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 204 transition count 183
Applied a total of 10 rules in 10 ms. Remains 204 /209 variables (removed 5) and now considering 183/188 (removed 5) transitions.
// Phase 1: matrix 183 rows 204 cols
[2025-06-07 12:02:13] [INFO ] Computed 34 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:02:13] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-07 12:02:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:02:13] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Running 182 sub problems to find dead transitions.
[2025-06-07 12:02:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:02:15] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:02:15] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:02:15] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:02:15] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:02:15] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:02:15] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:02:15] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:02:15] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:02:15] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:02:15] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:02:15] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:02:15] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:02:15] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:02:16] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:02:16] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:02:16] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:02:16] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:02:16] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:02:16] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:02:16] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:02:17] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (OVERLAPS) 183/387 variables, 204/259 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:02:20] [INFO ] Deduced a trap along path composed of 7 places in 26 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:02:20] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:02:20] [INFO ] Deduced a trap along path composed of 5 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:02:20] [INFO ] Deduced a trap along path composed of 5 places in 25 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 4/263 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:02:22] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:02:24] [INFO ] Deduced a trap along path composed of 7 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:02:25] [INFO ] Deduced a trap along path composed of 5 places in 23 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/387 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 11 (OVERLAPS) 0/387 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 266 constraints, problems are : Problem set: 0 solved, 182 unsolved in 17355 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 22/56 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:02:31] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (OVERLAPS) 183/387 variables, 204/261 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 182/443 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:02:32] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:02:32] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:02:33] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:02:33] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:02:33] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:02:33] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:02:33] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:02:33] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:02:33] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:02:33] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:02:33] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:02:33] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:02:33] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:02:34] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:02:34] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:02:34] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:02:34] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 17/460 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:02:34] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:02:35] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 2/462 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:02:36] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 1/463 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/387 variables, 6/469 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:02:43] [INFO ] Deduced a trap along path composed of 5 places in 33 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:02:44] [INFO ] Deduced a trap along path composed of 5 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:02:44] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:02:44] [INFO ] Deduced a trap along path composed of 5 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:02:45] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:02:45] [INFO ] Deduced a trap along path composed of 6 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:02:45] [INFO ] Deduced a trap along path composed of 7 places in 22 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/387 variables, 7/476 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:02:54] [INFO ] Deduced a trap along path composed of 6 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:02:55] [INFO ] Deduced a trap along path composed of 7 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:02:56] [INFO ] Deduced a trap along path composed of 5 places in 23 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/387 variables, 3/479 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 387/387 variables, and 479 constraints, problems are : Problem set: 0 solved, 182 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 43/43 constraints, Known Traps Along Path: 16/16 constraints]
After SMT, in 47379ms problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 47379ms
Starting structural reductions in LTL mode, iteration 1 : 204/209 places, 183/188 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47570 ms. Remains : 204/209 places, 183/188 transitions.
Stuttering acceptance computed with spot in 344 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p1) (NOT p3)), true, (NOT p3), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-003B-LTLFireability-10
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-003B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-003B-LTLFireability-10 finished in 47943 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||(X((p1||X(p1)))&&(p2||G(p3)))))))'
Support contains 4 out of 209 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 188/188 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 204 transition count 183
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 204 transition count 183
Applied a total of 10 rules in 7 ms. Remains 204 /209 variables (removed 5) and now considering 183/188 (removed 5) transitions.
[2025-06-07 12:03:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:03:01] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-07 12:03:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:03:01] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
Running 182 sub problems to find dead transitions.
[2025-06-07 12:03:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:03] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:03] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:03] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:03] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:03] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:03] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:03] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:03] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:03] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:03] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:03] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:03] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:03] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:03] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:04] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:04] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:04] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:04] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:04] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:04] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:04] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (OVERLAPS) 183/387 variables, 204/259 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:08] [INFO ] Deduced a trap along path composed of 7 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:08] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:08] [INFO ] Deduced a trap along path composed of 5 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:08] [INFO ] Deduced a trap along path composed of 5 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 4/263 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:10] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:12] [INFO ] Deduced a trap along path composed of 7 places in 25 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:13] [INFO ] Deduced a trap along path composed of 5 places in 21 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/387 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 11 (OVERLAPS) 0/387 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 266 constraints, problems are : Problem set: 0 solved, 182 unsolved in 17190 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 22/56 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:18] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (OVERLAPS) 183/387 variables, 204/261 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 182/443 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:20] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:20] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:20] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:20] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:21] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:21] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:21] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:21] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:21] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:21] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:21] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:21] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:21] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:21] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:21] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:21] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:21] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 17/460 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:22] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:22] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 2/462 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:24] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 1/463 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/387 variables, 6/469 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:31] [INFO ] Deduced a trap along path composed of 5 places in 30 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:31] [INFO ] Deduced a trap along path composed of 5 places in 28 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:32] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:32] [INFO ] Deduced a trap along path composed of 5 places in 20 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:33] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:33] [INFO ] Deduced a trap along path composed of 6 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:33] [INFO ] Deduced a trap along path composed of 7 places in 21 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/387 variables, 7/476 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:42] [INFO ] Deduced a trap along path composed of 6 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:43] [INFO ] Deduced a trap along path composed of 7 places in 20 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:43] [INFO ] Deduced a trap along path composed of 5 places in 22 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/387 variables, 3/479 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 387/387 variables, and 479 constraints, problems are : Problem set: 0 solved, 182 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 43/43 constraints, Known Traps Along Path: 16/16 constraints]
After SMT, in 47213ms problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 47213ms
Starting structural reductions in LTL mode, iteration 1 : 204/209 places, 183/188 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47399 ms. Remains : 204/209 places, 183/188 transitions.
Stuttering acceptance computed with spot in 193 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), true, (NOT p1), (OR (AND p0 (NOT p3)) (AND p2 (NOT p3))), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-003B-LTLFireability-11
Entered a terminal (fully accepting) state of product in 116 steps with 0 reset in 2 ms.
FORMULA ShieldPPPt-PT-003B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-003B-LTLFireability-11 finished in 47609 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (F(p1) U (p0 U (X((X(p2) U p3))||p1))))))'
Support contains 6 out of 209 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 188/188 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 206 transition count 185
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 206 transition count 185
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 205 transition count 184
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 205 transition count 184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 204 transition count 183
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 204 transition count 183
Applied a total of 10 rules in 13 ms. Remains 204 /209 variables (removed 5) and now considering 183/188 (removed 5) transitions.
// Phase 1: matrix 183 rows 204 cols
[2025-06-07 12:03:48] [INFO ] Computed 34 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:03:49] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-07 12:03:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:03:49] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Running 182 sub problems to find dead transitions.
[2025-06-07 12:03:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:50] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:50] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:50] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:51] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:51] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:51] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:51] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:51] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:51] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:51] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:51] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:51] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:51] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:51] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:51] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:51] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:51] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:51] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:51] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:52] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:52] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (OVERLAPS) 183/387 variables, 204/259 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:55] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:57] [INFO ] Deduced a trap along path composed of 5 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:57] [INFO ] Deduced a trap along path composed of 5 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:57] [INFO ] Deduced a trap along path composed of 5 places in 24 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 3/263 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:03:58] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:04:00] [INFO ] Deduced a trap along path composed of 7 places in 25 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:04:02] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/387 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:04:04] [INFO ] Deduced a trap along path composed of 7 places in 25 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/387 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:04:05] [INFO ] Deduced a trap along path composed of 7 places in 24 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/387 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/387 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 14 (OVERLAPS) 0/387 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 268 constraints, problems are : Problem set: 0 solved, 182 unsolved in 21248 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 24/58 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (OVERLAPS) 183/387 variables, 204/262 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/387 variables, 182/444 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:04:11] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:04:11] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:04:12] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:04:12] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:04:12] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:04:12] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:04:12] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:04:12] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:04:12] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:04:12] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:04:12] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:04:12] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 12/456 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:04:13] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:04:13] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:04:13] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:04:14] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 4/460 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 6/466 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:04:17] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:04:18] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 2/468 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:04:24] [INFO ] Deduced a trap along path composed of 6 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:04:24] [INFO ] Deduced a trap along path composed of 7 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:04:24] [INFO ] Deduced a trap along path composed of 5 places in 26 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:04:25] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:04:26] [INFO ] Deduced a trap along path composed of 5 places in 26 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:04:27] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:04:28] [INFO ] Deduced a trap along path composed of 7 places in 25 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/387 variables, 7/475 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:04:32] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/387 variables, 1/476 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 387/387 variables, and 476 constraints, problems are : Problem set: 0 solved, 182 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 43/43 constraints, Known Traps Along Path: 13/13 constraints]
After SMT, in 51272ms problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 51272ms
Starting structural reductions in LTL mode, iteration 1 : 204/209 places, 183/188 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51458 ms. Remains : 204/209 places, 183/188 transitions.
Stuttering acceptance computed with spot in 279 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))]
Running random walk in product with property : ShieldPPPt-PT-003B-LTLFireability-12
Product exploration explored 100000 steps with 266 reset in 217 ms.
Stack based approach found an accepted trace after 99 steps with 0 reset with depth 100 and stack size 100 in 0 ms.
FORMULA ShieldPPPt-PT-003B-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-003B-LTLFireability-12 finished in 51981 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F(!p0) U (G((G(!p1)||F(!p0)))||(!p1&&(G(!p1)||F(!p0)))))))))'
Support contains 3 out of 209 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 188/188 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 204 transition count 183
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 204 transition count 183
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 203 transition count 182
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 203 transition count 182
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 202 transition count 181
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 202 transition count 181
Applied a total of 14 rules in 13 ms. Remains 202 /209 variables (removed 7) and now considering 181/188 (removed 7) transitions.
// Phase 1: matrix 181 rows 202 cols
[2025-06-07 12:04:40] [INFO ] Computed 34 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:04:41] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-06-07 12:04:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:04:41] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Running 180 sub problems to find dead transitions.
[2025-06-07 12:04:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:04:42] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:04:42] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:04:42] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:04:43] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:04:43] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:04:43] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:04:43] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:04:43] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:04:43] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:04:43] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:04:43] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:04:43] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:04:43] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:04:43] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:04:43] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:04:43] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:04:43] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:04:43] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:04:43] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 19/53 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (OVERLAPS) 181/383 variables, 202/255 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:04:46] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:04:47] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:04:49] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:04:51] [INFO ] Deduced a trap along path composed of 7 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:04:51] [INFO ] Deduced a trap along path composed of 5 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:04:51] [INFO ] Deduced a trap along path composed of 5 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:04:51] [INFO ] Deduced a trap along path composed of 3 places in 18 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/383 variables, 4/262 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:04:52] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/383 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:04:55] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:04:55] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/383 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/383 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:04:58] [INFO ] Deduced a trap along path composed of 7 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:04:58] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:04:59] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/383 variables, 3/268 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/383 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 14 (OVERLAPS) 0/383 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Real declared 383/383 variables, and 268 constraints, problems are : Problem set: 0 solved, 180 unsolved in 22706 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 25/59 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:05:04] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (OVERLAPS) 181/383 variables, 202/262 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 180/442 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:05:05] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:05:05] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:05:06] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:05:06] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:05:06] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:05:06] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:05:06] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:05:06] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:05:06] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:05:06] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:05:06] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:05:06] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:05:06] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 13/455 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:05:07] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:05:08] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:05:08] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/383 variables, 3/458 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/383 variables, 7/465 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:05:10] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/383 variables, 1/466 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:05:16] [INFO ] Deduced a trap along path composed of 5 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:05:16] [INFO ] Deduced a trap along path composed of 7 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:05:17] [INFO ] Deduced a trap along path composed of 7 places in 23 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/383 variables, 3/469 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:05:30] [INFO ] Deduced a trap along path composed of 7 places in 26 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:05:31] [INFO ] Deduced a trap along path composed of 7 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:05:31] [INFO ] Deduced a trap along path composed of 7 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:05:32] [INFO ] Deduced a trap along path composed of 6 places in 21 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/383 variables, 4/473 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 383/383 variables, and 473 constraints, problems are : Problem set: 0 solved, 180 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 43/43 constraints, Known Traps Along Path: 14/14 constraints]
After SMT, in 52730ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 52731ms
Starting structural reductions in LTL mode, iteration 1 : 202/209 places, 181/188 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52924 ms. Remains : 202/209 places, 181/188 transitions.
Stuttering acceptance computed with spot in 225 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p0, (AND p0 p1)]
Running random walk in product with property : ShieldPPPt-PT-003B-LTLFireability-13
Product exploration explored 100000 steps with 25000 reset in 71 ms.
Product exploration explored 100000 steps with 25000 reset in 75 ms.
Computed a total of 46 stabilizing places and 46 stable transitions
Computed a total of 46 stabilizing places and 46 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 95 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p0, (AND p0 p1)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 2110 steps (0 resets) in 22 ms. (91 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 1 factoid took 185 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 198 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p0, (AND p0 p1)]
Support contains 3 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 181/181 transitions.
Applied a total of 0 rules in 5 ms. Remains 202 /202 variables (removed 0) and now considering 181/181 (removed 0) transitions.
[2025-06-07 12:05:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:05:35] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-07 12:05:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:05:35] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
Running 180 sub problems to find dead transitions.
[2025-06-07 12:05:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:05:37] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:05:37] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:05:37] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:05:37] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:05:37] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:05:37] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:05:37] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:05:37] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:05:37] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:05:37] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:05:37] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:05:37] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:05:37] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:05:37] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:05:38] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:05:38] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:05:38] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:05:38] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:05:38] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 19/53 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (OVERLAPS) 181/383 variables, 202/255 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:05:40] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:05:42] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:05:43] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:05:45] [INFO ] Deduced a trap along path composed of 7 places in 27 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:05:45] [INFO ] Deduced a trap along path composed of 5 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:05:46] [INFO ] Deduced a trap along path composed of 5 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:05:46] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/383 variables, 4/262 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:05:47] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/383 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:05:49] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:05:49] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/383 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/383 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:05:52] [INFO ] Deduced a trap along path composed of 7 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:05:52] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:05:53] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/383 variables, 3/268 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/383 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 14 (OVERLAPS) 0/383 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Real declared 383/383 variables, and 268 constraints, problems are : Problem set: 0 solved, 180 unsolved in 22462 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 25/59 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:05:58] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (OVERLAPS) 181/383 variables, 202/262 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 180/442 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:05:59] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:05:59] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:06:00] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:06:00] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:06:00] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:06:00] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:06:00] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:06:00] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:06:00] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:06:00] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:06:00] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:06:00] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:06:00] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 13/455 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:06:01] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:06:02] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:06:02] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/383 variables, 3/458 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/383 variables, 7/465 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:06:04] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/383 variables, 1/466 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:06:10] [INFO ] Deduced a trap along path composed of 5 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:06:10] [INFO ] Deduced a trap along path composed of 7 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:06:11] [INFO ] Deduced a trap along path composed of 7 places in 24 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/383 variables, 3/469 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:06:24] [INFO ] Deduced a trap along path composed of 7 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:06:24] [INFO ] Deduced a trap along path composed of 7 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:06:25] [INFO ] Deduced a trap along path composed of 7 places in 26 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:06:26] [INFO ] Deduced a trap along path composed of 6 places in 23 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/383 variables, 4/473 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 383/383 variables, and 473 constraints, problems are : Problem set: 0 solved, 180 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 43/43 constraints, Known Traps Along Path: 14/14 constraints]
After SMT, in 52488ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 52490ms
Finished structural reductions in LTL mode , in 1 iterations and 52670 ms. Remains : 202/202 places, 181/181 transitions.
Computed a total of 46 stabilizing places and 46 stable transitions
Computed a total of 46 stabilizing places and 46 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 88 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 251 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p0, (AND p0 p1)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 1589 steps (0 resets) in 12 ms. (122 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 1 factoid took 191 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 246 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 238 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 241 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p0, (AND p0 p1)]
Product exploration explored 100000 steps with 25000 reset in 77 ms.
Product exploration explored 100000 steps with 25000 reset in 75 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 252 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p0, (AND p0 p1)]
Support contains 3 out of 202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 202/202 places, 181/181 transitions.
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 202 transition count 181
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 14 Pre rules applied. Total rules applied 42 place count 202 transition count 192
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 56 place count 202 transition count 192
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 111 places in 0 ms
Iterating global reduction 1 with 55 rules applied. Total rules applied 111 place count 202 transition count 192
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 112 place count 202 transition count 191
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 135 place count 179 transition count 168
Deduced a syphon composed of 88 places in 0 ms
Iterating global reduction 2 with 23 rules applied. Total rules applied 158 place count 179 transition count 168
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 89 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 159 place count 179 transition count 168
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 161 place count 177 transition count 166
Deduced a syphon composed of 87 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 163 place count 177 transition count 166
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -44
Deduced a syphon composed of 98 places in 0 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 174 place count 177 transition count 210
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 185 place count 166 transition count 188
Deduced a syphon composed of 87 places in 0 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 196 place count 166 transition count 188
Deduced a syphon composed of 87 places in 0 ms
Applied a total of 196 rules in 41 ms. Remains 166 /202 variables (removed 36) and now considering 188/181 (removed -7) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 12:06:29] [INFO ] Redundant transitions in 5 ms returned []
Running 187 sub problems to find dead transitions.
// Phase 1: matrix 188 rows 166 cols
[2025-06-07 12:06:29] [INFO ] Computed 34 invariants in 2 ms
[2025-06-07 12:06:29] [INFO ] State equation strengthened by 19 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (OVERLAPS) 1/166 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 187 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:06:31] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:06:31] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 2 ms to minimize.
Problem TDEAD2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:06:31] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 2 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:06:31] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 2 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:06:31] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 2 ms to minimize.
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:06:31] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 2 ms to minimize.
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:06:31] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 2 ms to minimize.
Problem TDEAD14 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:06:31] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:06:31] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD17 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:06:31] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:06:31] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 2 ms to minimize.
Problem TDEAD21 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:06:31] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 2 ms to minimize.
Problem TDEAD22 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:06:31] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 2 ms to minimize.
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:06:31] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:06:31] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD28 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:06:31] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 2 ms to minimize.
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:06:31] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
Problem TDEAD31 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:06:31] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:06:31] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:06:31] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 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 TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 20/54 constraints. Problems are: Problem set: 116 solved, 71 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:06:31] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:06:31] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
Problem TDEAD40 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:06:31] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD62 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:06:31] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 2 ms to minimize.
Problem TDEAD63 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 4/58 constraints. Problems are: Problem set: 123 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/58 constraints. Problems are: Problem set: 123 solved, 64 unsolved
At refinement iteration 5 (OVERLAPS) 188/354 variables, 166/224 constraints. Problems are: Problem set: 123 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 19/243 constraints. Problems are: Problem set: 123 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 0/243 constraints. Problems are: Problem set: 123 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/354 variables, 0/243 constraints. Problems are: Problem set: 123 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 354/354 variables, and 243 constraints, problems are : Problem set: 123 solved, 64 unsolved in 3698 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 166/166 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 123 solved, 64 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 123 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 88/166 variables, 34/34 constraints. Problems are: Problem set: 123 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 24/58 constraints. Problems are: Problem set: 123 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 0/58 constraints. Problems are: Problem set: 123 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 188/354 variables, 166/224 constraints. Problems are: Problem set: 123 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 19/243 constraints. Problems are: Problem set: 123 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 64/307 constraints. Problems are: Problem set: 123 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 0/307 constraints. Problems are: Problem set: 123 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/354 variables, 0/307 constraints. Problems are: Problem set: 123 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 354/354 variables, and 307 constraints, problems are : Problem set: 123 solved, 64 unsolved in 6117 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 166/166 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 64/187 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9832ms problems are : Problem set: 123 solved, 64 unsolved
Search for dead transitions found 123 dead transitions in 9834ms
Found 123 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 123 transitions
Dead transitions reduction (with SMT) removed 123 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 166/202 places, 65/181 transitions.
Graph (complete) has 217 edges and 166 vertex of which 79 are kept as prefixes of interest. Removing 87 places using SCC suffix rule.2 ms
Discarding 87 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 ms. Remains 79 /166 variables (removed 87) and now considering 65/65 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 79/202 places, 65/181 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9896 ms. Remains : 79/202 places, 65/181 transitions.
Built C files in :
/tmp/ltsmin15809955931188218823
[2025-06-07 12:06:39] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15809955931188218823
Running compilation step : cd /tmp/ltsmin15809955931188218823;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 278 ms.
Running link step : cd /tmp/ltsmin15809955931188218823;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin15809955931188218823;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10446643146929401211.hoa' '--buchi-type=spotba'
LTSmin run took 109 ms.
FORMULA ShieldPPPt-PT-003B-LTLFireability-13 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPt-PT-003B-LTLFireability-13 finished in 119124 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(((p2&&F(p3))||p1))))))'
Support contains 5 out of 209 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 188/188 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 208 transition count 142
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 90 place count 163 transition count 142
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 90 place count 163 transition count 120
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 134 place count 141 transition count 120
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 137 place count 138 transition count 117
Iterating global reduction 2 with 3 rules applied. Total rules applied 140 place count 138 transition count 117
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 140 place count 138 transition count 116
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 142 place count 137 transition count 116
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 236 place count 90 transition count 69
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 237 place count 90 transition count 68
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 239 place count 89 transition count 67
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 255 place count 81 transition count 67
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 257 place count 79 transition count 65
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 258 place count 78 transition count 65
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 258 place count 78 transition count 63
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 262 place count 76 transition count 63
Applied a total of 262 rules in 21 ms. Remains 76 /209 variables (removed 133) and now considering 63/188 (removed 125) transitions.
// Phase 1: matrix 63 rows 76 cols
[2025-06-07 12:06:40] [INFO ] Computed 33 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:06:40] [INFO ] Implicit Places using invariants in 44 ms returned [59, 63]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 45 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 74/209 places, 63/188 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 72 transition count 61
Applied a total of 4 rules in 2 ms. Remains 72 /74 variables (removed 2) and now considering 61/63 (removed 2) transitions.
// Phase 1: matrix 61 rows 72 cols
[2025-06-07 12:06:40] [INFO ] Computed 31 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:06:40] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-06-07 12:06:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:06:40] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 72/209 places, 61/188 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 167 ms. Remains : 72/209 places, 61/188 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : ShieldPPPt-PT-003B-LTLFireability-15
Product exploration explored 100000 steps with 240 reset in 164 ms.
Stack based approach found an accepted trace after 17113 steps with 42 reset with depth 578 and stack size 561 in 33 ms.
FORMULA ShieldPPPt-PT-003B-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-003B-LTLFireability-15 finished in 507 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((X(X(X(X(p0))))&&G(p1))||G(p0))))'
Found a Shortening insensitive property : ShieldPPPt-PT-003B-LTLFireability-02
Stuttering acceptance computed with spot in 1071 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 209 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 209/209 places, 188/188 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 208 transition count 142
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 90 place count 163 transition count 142
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 90 place count 163 transition count 122
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 130 place count 143 transition count 122
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 133 place count 140 transition count 119
Iterating global reduction 2 with 3 rules applied. Total rules applied 136 place count 140 transition count 119
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 136 place count 140 transition count 117
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 140 place count 138 transition count 117
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 238 place count 89 transition count 68
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 239 place count 89 transition count 67
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 241 place count 88 transition count 66
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 255 place count 81 transition count 66
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 257 place count 79 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 258 place count 78 transition count 64
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 258 place count 78 transition count 62
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 262 place count 76 transition count 62
Applied a total of 262 rules in 20 ms. Remains 76 /209 variables (removed 133) and now considering 62/188 (removed 126) transitions.
// Phase 1: matrix 62 rows 76 cols
[2025-06-07 12:06:41] [INFO ] Computed 33 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:06:41] [INFO ] Implicit Places using invariants in 53 ms returned [59, 63]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 53 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 74/209 places, 62/188 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 72 transition count 60
Applied a total of 4 rules in 2 ms. Remains 72 /74 variables (removed 2) and now considering 60/62 (removed 2) transitions.
// Phase 1: matrix 60 rows 72 cols
[2025-06-07 12:06:41] [INFO ] Computed 31 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:06:41] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-06-07 12:06:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:06:41] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-06-07 12:06:41] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 72/209 places, 60/188 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 175 ms. Remains : 72/209 places, 60/188 transitions.
Running random walk in product with property : ShieldPPPt-PT-003B-LTLFireability-02
Product exploration explored 100000 steps with 1960 reset in 177 ms.
Product exploration explored 100000 steps with 1948 reset in 191 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/72 stabilizing places and 2/60 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p0)), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 8 factoid took 764 ms. Reduced automaton from 24 states, 96 edges and 2 AP (stutter sensitive) to 24 states, 96 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1077 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 122 ms. (325 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
[2025-06-07 12:06:44] [INFO ] Invariant cache hit.
[2025-06-07 12:06:44] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/25 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:06:44] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
Problem apf1 is UNSAT
After SMT solving in domain Real declared 25/132 variables, and 10 constraints, problems are : Problem set: 1 solved, 0 unsolved in 47 ms.
Refiners :[Positive P Invariants (semi-flows): 9/31 constraints, State Equation: 0/72 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (G (OR p0 p1))]
False Knowledge obtained : [(X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p0)), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p0 p1))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 3685 ms. Reduced automaton from 24 states, 96 edges and 2 AP (stutter sensitive) to 24 states, 72 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1202 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 1218 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 60/60 transitions.
Applied a total of 0 rules in 1 ms. Remains 72 /72 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2025-06-07 12:06:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:06:50] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-06-07 12:06:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:06:50] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-06-07 12:06:50] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Running 55 sub problems to find dead transitions.
[2025-06-07 12:06:50] [INFO ] Invariant cache hit.
[2025-06-07 12:06:50] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 3/72 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 55 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:06:50] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:06:50] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:06:50] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (OVERLAPS) 60/132 variables, 72/106 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 55 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:06:51] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 9 (OVERLAPS) 0/132 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 110 constraints, problems are : Problem set: 0 solved, 55 unsolved in 1658 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, State Equation: 72/72 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 55 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (OVERLAPS) 3/72 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (OVERLAPS) 60/132 variables, 72/106 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 55/164 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/132 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 11 (OVERLAPS) 0/132 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 165 constraints, problems are : Problem set: 0 solved, 55 unsolved in 1677 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, State Equation: 72/72 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 3339ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 3339ms
Finished structural reductions in LTL mode , in 1 iterations and 3445 ms. Remains : 72/72 places, 60/60 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/72 stabilizing places and 2/60 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X p0), (X (NOT p0)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 3773 ms. Reduced automaton from 24 states, 72 edges and 2 AP (stutter sensitive) to 24 states, 72 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1210 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
RANDOM walk for 140 steps (0 resets) in 5 ms. (23 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X p0), (X (NOT p0)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT p0)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 4 factoid took 3899 ms. Reduced automaton from 24 states, 72 edges and 2 AP (stutter sensitive) to 24 states, 72 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1146 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 1213 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 1224 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1972 reset in 159 ms.
Product exploration explored 100000 steps with 2011 reset in 178 ms.
Built C files in :
/tmp/ltsmin111979968682806494
[2025-06-07 12:07:11] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin111979968682806494
Running compilation step : cd /tmp/ltsmin111979968682806494;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 145 ms.
Running link step : cd /tmp/ltsmin111979968682806494;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin111979968682806494;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8124540611827986114.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 60/60 transitions.
Applied a total of 0 rules in 1 ms. Remains 72 /72 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2025-06-07 12:07:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:07:26] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-07 12:07:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:07:26] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-06-07 12:07:26] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Running 55 sub problems to find dead transitions.
[2025-06-07 12:07:26] [INFO ] Invariant cache hit.
[2025-06-07 12:07:26] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 3/72 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 55 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:07:26] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:07:26] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:07:26] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (OVERLAPS) 60/132 variables, 72/106 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 55 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:07:27] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 9 (OVERLAPS) 0/132 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 110 constraints, problems are : Problem set: 0 solved, 55 unsolved in 1656 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, State Equation: 72/72 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 55 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (OVERLAPS) 3/72 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (OVERLAPS) 60/132 variables, 72/106 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 55/164 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/132 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 11 (OVERLAPS) 0/132 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 165 constraints, problems are : Problem set: 0 solved, 55 unsolved in 1648 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, State Equation: 72/72 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 3308ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 3308ms
Finished structural reductions in LTL mode , in 1 iterations and 3429 ms. Remains : 72/72 places, 60/60 transitions.
Built C files in :
/tmp/ltsmin5770868124137587532
[2025-06-07 12:07:29] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5770868124137587532
Running compilation step : cd /tmp/ltsmin5770868124137587532;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 138 ms.
Running link step : cd /tmp/ltsmin5770868124137587532;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin5770868124137587532;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11749472553937562518.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-07 12:07:45] [INFO ] Flatten gal took : 3 ms
[2025-06-07 12:07:45] [INFO ] Flatten gal took : 3 ms
[2025-06-07 12:07:45] [INFO ] Time to serialize gal into /tmp/LTL13791272012586782329.gal : 1 ms
[2025-06-07 12:07:45] [INFO ] Time to serialize properties into /tmp/LTL2238189365187523619.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13791272012586782329.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10234764560377919575.hoa' '-atoms' '/tmp/LTL2238189365187523619.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL2238189365187523619.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10234764560377919575.hoa
Reverse transition relation is NOT exact ! Due to transitions t4.t99, t132.t142.t145.t148.t133.t134, t108.t111, Intersection with reachable at each step e...209
Computing Next relation with stutter on 7806 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
51 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.529358,38460,1,0,438,116446,150,361,2165,192698,946
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
Treatment of property ShieldPPPt-PT-003B-LTLFireability-02 finished in 65163 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2025-06-07 12:07:45] [INFO ] Flatten gal took : 7 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2425378540989197516
[2025-06-07 12:07:45] [INFO ] Computing symmetric may disable matrix : 188 transitions.
[2025-06-07 12:07:45] [INFO ] Applying decomposition
[2025-06-07 12:07:45] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 12:07:45] [INFO ] Computing symmetric may enable matrix : 188 transitions.
[2025-06-07 12:07:45] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 12:07:45] [INFO ] Flatten gal took : 6 ms
[2025-06-07 12:07:45] [INFO ] Computing Do-Not-Accords matrix : 188 transitions.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17057032596659178548.txt' '-o' '/tmp/graph17057032596659178548.bin' '-w' '/tmp/graph17057032596659178548.weights'
[2025-06-07 12:07:45] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17057032596659178548.bin' '-l' '-1' '-v' '-w' '/tmp/graph17057032596659178548.weights' '-q' '0' '-e' '0.001'
[2025-06-07 12:07:45] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2425378540989197516
Running compilation step : cd /tmp/ltsmin2425378540989197516;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-07 12:07:45] [INFO ] Decomposing Gal with order
[2025-06-07 12:07:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 12:07:45] [INFO ] Removed a total of 25 redundant transitions.
[2025-06-07 12:07:45] [INFO ] Flatten gal took : 13 ms
[2025-06-07 12:07:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-07 12:07:45] [INFO ] Time to serialize gal into /tmp/LTLFireability2964893903178809721.gal : 3 ms
[2025-06-07 12:07:45] [INFO ] Time to serialize properties into /tmp/LTLFireability1331774309617451006.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2964893903178809721.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1331774309617451006.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(((X(X(X(X("(i2.i1.u4.p10!=1)")))))&&(G("(i0.i2.u25.p79!=1)")))||(G("(i2.i1.u4.p10!=1)")))))
Formula 0 simplified : G(F!"(i2.i1.u4.p10!=1)" & (XXXX!"(i2.i1.u4.p10!=1)" | F!"(i0.i2.u25.p79!=1)"))
Compilation finished in 328 ms.
Running link step : cd /tmp/ltsmin2425378540989197516;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin2425378540989197516;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(((X(X(X(X((LTLAPp0==true)))))&&[]((LTLAPp1==true)))||[]((LTLAPp0==true))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t47, t53, t94, t97, t142, t148, t176, t185, i0.t145, i0.i0.u6.t151, i0.i1.u9.t147, i0.i2.t111...834
Computing Next relation with stutter on 7806 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: LTL layer: formula: <>(((X(X(X(X((LTLAPp0==true)))))&&[]((LTLAPp1==true)))||[]((LTLAPp0==true))))
pins2lts-mc-linux64( 1/ 8), 0.003: "<>(((X(X(X(X((LTLAPp0==true)))))&&[]((LTLAPp1==true)))||[]((LTLAPp0==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.004: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.060: There are 191 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.060: State length is 210, there are 328 groups
pins2lts-mc-linux64( 0/ 8), 0.060: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.060: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.060: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.060: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.093: [Blue] ~120 levels ~960 states ~4576 transitions
pins2lts-mc-linux64( 2/ 8), 0.108: [Blue] ~240 levels ~1920 states ~8080 transitions
pins2lts-mc-linux64( 2/ 8), 0.138: [Blue] ~479 levels ~3840 states ~15680 transitions
pins2lts-mc-linux64( 2/ 8), 0.188: [Blue] ~957 levels ~7680 states ~31328 transitions
pins2lts-mc-linux64( 5/ 8), 0.336: [Blue] ~1920 levels ~15360 states ~80936 transitions
pins2lts-mc-linux64( 2/ 8), 0.523: [Blue] ~2850 levels ~30720 states ~120792 transitions
pins2lts-mc-linux64( 6/ 8), 0.898: [Blue] ~4835 levels ~61440 states ~219056 transitions
pins2lts-mc-linux64( 6/ 8), 1.435: [Blue] ~9016 levels ~122880 states ~445904 transitions
pins2lts-mc-linux64( 3/ 8), 2.226: [Blue] ~19017 levels ~245760 states ~855288 transitions
pins2lts-mc-linux64( 7/ 8), 3.246: [Blue] ~57068 levels ~491520 states ~2410376 transitions
pins2lts-mc-linux64( 7/ 8), 5.045: [Blue] ~110312 levels ~983040 states ~4810632 transitions
pins2lts-mc-linux64( 5/ 8), 8.746: [Blue] ~243471 levels ~1966080 states ~10716040 transitions
pins2lts-mc-linux64( 5/ 8), 16.284: [Blue] ~482195 levels ~3932160 states ~21759072 transitions
pins2lts-mc-linux64( 6/ 8), 31.404: [Blue] ~511583 levels ~7864320 states ~29908944 transitions
pins2lts-mc-linux64( 6/ 8), 61.754: [Blue] ~987702 levels ~15728640 states ~60767208 transitions
pins2lts-mc-linux64( 6/ 8), 123.410: [Blue] ~1880164 levels ~31457280 states ~122395304 transitions
pins2lts-mc-linux64( 1/ 8), 252.111: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 252.126:
pins2lts-mc-linux64( 0/ 8), 252.126: Explored 58666823 states 311904556 transitions, fanout: 5.317
pins2lts-mc-linux64( 0/ 8), 252.126: Total exploration time 252.060 sec (252.040 sec minimum, 252.048 sec on average)
pins2lts-mc-linux64( 0/ 8), 252.126: States per second: 232749, Transitions per second: 1237422
pins2lts-mc-linux64( 0/ 8), 252.126:
pins2lts-mc-linux64( 0/ 8), 252.126: State space has 134215926 states, 12640512 are accepting
pins2lts-mc-linux64( 0/ 8), 252.126: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 252.126: blue states: 58666823 (43.71%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 252.126: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 252.126: all-red states: 19341212 (14.41%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 252.126:
pins2lts-mc-linux64( 0/ 8), 252.126: Total memory used for local state coloring: 482.8MB
pins2lts-mc-linux64( 0/ 8), 252.126:
pins2lts-mc-linux64( 0/ 8), 252.126: Queue width: 8B, total height: 31642318, memory: 241.41MB
pins2lts-mc-linux64( 0/ 8), 252.126: Tree memory: 1088.5MB, 8.5 B/state, compr.: 1.0%
pins2lts-mc-linux64( 0/ 8), 252.126: Tree fill ratio (roots/leafs): 99.0%/25.0%
pins2lts-mc-linux64( 0/ 8), 252.126: Stored 188 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 252.126: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 252.126: Est. total memory use: 1329.9MB (~1265.4MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2425378540989197516;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(((X(X(X(X((LTLAPp0==true)))))&&[]((LTLAPp1==true)))||[]((LTLAPp0==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2425378540989197516;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(((X(X(X(X((LTLAPp0==true)))))&&[]((LTLAPp1==true)))||[]((LTLAPp0==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)
Detected timeout of ITS tools.
[2025-06-07 12:31:54] [INFO ] Applying decomposition
[2025-06-07 12:31:54] [INFO ] Flatten gal took : 6 ms
[2025-06-07 12:31:54] [INFO ] Decomposing Gal with order
[2025-06-07 12:31:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 12:31:54] [INFO ] Removed a total of 8 redundant transitions.
[2025-06-07 12:31:54] [INFO ] Flatten gal took : 10 ms
[2025-06-07 12:31:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 6 ms.
[2025-06-07 12:31:54] [INFO ] Time to serialize gal into /tmp/LTLFireability1011540576174831886.gal : 3 ms
[2025-06-07 12:31:54] [INFO ] Time to serialize properties into /tmp/LTLFireability8619778165403371847.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1011540576174831886.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8619778165403371847.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(((X(X(X(X("(i0.i0.i1.i0.i0.i0.u91.p10!=1)")))))&&(G("(i0.i0.i1.u24.p79!=1)")))||(G("(i0.i0.i1.i0.i0.i0.u91.p10!=1)")))))
Formula 0 simplified : G(F!"(i0.i0.i1.i0.i0.i0.u91.p10!=1)" & (XXXX!"(i0.i0.i1.i0.i0.i0.u91.p10!=1)" | F!"(i0.i0.i1.u24.p79!=1)"))
Reverse transition relation is NOT exact ! Due to transitions i0.i0.u3.t152, i0.i0.i1.t187, i0.i0.i1.u24.t107, i0.i0.i1.u24.t111, i0.i0.i1.i0.t180, i0.i0.i...1503
Computing Next relation with stutter on 7806 deadlock states

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is ShieldPPPt-PT-003B, 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 r198-tall-174894533400820"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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