Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r156-tall-174881254000436.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 PolyORBLF-PT-S02J06T06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-tall-174881254000436
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 15K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 25K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 133K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 8.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 37K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 40K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 223K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 27K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 140K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.9K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 10 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 601K May 29 14:32 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 PolyORBLF-PT-S02J06T06-LTLFireability-00
FORMULA_NAME PolyORBLF-PT-S02J06T06-LTLFireability-01
FORMULA_NAME PolyORBLF-PT-S02J06T06-LTLFireability-02
FORMULA_NAME PolyORBLF-PT-S02J06T06-LTLFireability-03
FORMULA_NAME PolyORBLF-PT-S02J06T06-LTLFireability-04
FORMULA_NAME PolyORBLF-PT-S02J06T06-LTLFireability-05
FORMULA_NAME PolyORBLF-PT-S02J06T06-LTLFireability-06
FORMULA_NAME PolyORBLF-PT-S02J06T06-LTLFireability-07
FORMULA_NAME PolyORBLF-PT-S02J06T06-LTLFireability-08
FORMULA_NAME PolyORBLF-PT-S02J06T06-LTLFireability-09
FORMULA_NAME PolyORBLF-PT-S02J06T06-LTLFireability-10
FORMULA_NAME PolyORBLF-PT-S02J06T06-LTLFireability-11
FORMULA_NAME PolyORBLF-PT-S02J06T06-LTLFireability-12
FORMULA_NAME PolyORBLF-PT-S02J06T06-LTLFireability-13
FORMULA_NAME PolyORBLF-PT-S02J06T06-LTLFireability-14
FORMULA_NAME PolyORBLF-PT-S02J06T06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748980377217

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S02J06T06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-03 19:52:58] [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-03 19:52:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 19:52:58] [INFO ] Load time of PNML (sax parser for PT used): 115 ms
[2025-06-03 19:52:58] [INFO ] Transformed 536 places.
[2025-06-03 19:52:58] [INFO ] Transformed 1064 transitions.
[2025-06-03 19:52:58] [INFO ] Parsed PT model containing 536 places and 1064 transitions and 4866 arcs in 208 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 242 out of 536 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 536/536 places, 968/968 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 534 transition count 968
Applied a total of 2 rules in 53 ms. Remains 534 /536 variables (removed 2) and now considering 968/968 (removed 0) transitions.
Running 966 sub problems to find dead transitions.
[2025-06-03 19:52:58] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
// Phase 1: matrix 956 rows 534 cols
[2025-06-03 19:52:58] [INFO ] Computed 48 invariants in 49 ms
[2025-06-03 19:52:59] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/532 variables, 30/46 constraints. Problems are: Problem set: 0 solved, 966 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:53:09] [INFO ] Deduced a trap composed of 15 places in 219 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:53:09] [INFO ] Deduced a trap composed of 73 places in 103 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:53:10] [INFO ] Deduced a trap composed of 73 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:53:10] [INFO ] Deduced a trap composed of 73 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:53:10] [INFO ] Deduced a trap composed of 73 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-03 19:53:10] [INFO ] Deduced a trap composed of 73 places in 54 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:53:10] [INFO ] Deduced a trap composed of 61 places in 186 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:53:10] [INFO ] Deduced a trap composed of 73 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:53:11] [INFO ] Deduced a trap composed of 253 places in 327 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:53:12] [INFO ] Deduced a trap composed of 133 places in 305 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:53:13] [INFO ] Deduced a trap composed of 247 places in 297 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:53:16] [INFO ] Deduced a trap composed of 42 places in 269 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:53:17] [INFO ] Deduced a trap composed of 259 places in 324 ms of which 99 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 532/1490 variables, and 59 constraints, problems are : Problem set: 0 solved, 966 unsolved in 20056 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/534 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 966/966 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 966 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/532 variables, 30/46 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 966 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 532/1490 variables, and 59 constraints, problems are : Problem set: 0 solved, 966 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/534 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/966 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40897ms problems are : Problem set: 0 solved, 966 unsolved
Search for dead transitions found 0 dead transitions in 40922ms
[2025-06-03 19:53:39] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2025-06-03 19:53:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:53:40] [INFO ] Implicit Places using invariants in 731 ms returned [96, 111, 240, 253, 306, 495]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 742 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 528/536 places, 968/968 transitions.
Applied a total of 0 rules in 19 ms. Remains 528 /528 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41780 ms. Remains : 528/536 places, 968/968 transitions.
Support contains 242 out of 528 places after structural reductions.
[2025-06-03 19:53:40] [INFO ] Flatten gal took : 98 ms
[2025-06-03 19:53:40] [INFO ] Flatten gal took : 68 ms
[2025-06-03 19:53:41] [INFO ] Input system was already deterministic with 968 transitions.
Support contains 240 out of 528 places (down from 242) after GAL structural reductions.
RANDOM walk for 40000 steps (14 resets) in 1293 ms. (30 steps per ms) remains 4/31 properties
BEST_FIRST walk for 40003 steps (11 resets) in 251 ms. (158 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (9 resets) in 147 ms. (270 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 146 ms. (272 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (11 resets) in 262 ms. (152 steps per ms) remains 4/4 properties
[2025-06-03 19:53:41] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
// Phase 1: matrix 956 rows 528 cols
[2025-06-03 19:53:41] [INFO ] Computed 42 invariants in 32 ms
[2025-06-03 19:53:41] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp28 is UNSAT
At refinement iteration 1 (OVERLAPS) 277/285 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/285 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 104/389 variables, 7/10 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/389 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 4/393 variables, 3/13 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp23 is UNSAT
At refinement iteration 7 (OVERLAPS) 129/522 variables, 24/37 constraints. Problems are: Problem set: 3 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:53:42] [INFO ] Deduced a trap composed of 74 places in 263 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:53:42] [INFO ] Deduced a trap composed of 74 places in 261 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:53:42] [INFO ] Deduced a trap composed of 74 places in 279 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:53:43] [INFO ] Deduced a trap composed of 74 places in 272 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:53:43] [INFO ] Deduced a trap composed of 74 places in 255 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:53:43] [INFO ] Deduced a trap composed of 251 places in 319 ms of which 93 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/522 variables, 6/43 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/522 variables, 0/43 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/526 variables, 4/47 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/526 variables, 0/47 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 956/1482 variables, 526/573 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1482 variables, 72/645 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1482 variables, 0/645 constraints. Problems are: Problem set: 3 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 2/1484 variables, 2/647 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1484 variables, 1/648 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1484 variables, 0/648 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1484 variables, 0/648 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1484/1484 variables, and 648 constraints, problems are : Problem set: 3 solved, 1 unsolved in 3175 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 528/528 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 284/285 variables, 3/3 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/285 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 104/389 variables, 7/10 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/389 variables, 0/10 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/393 variables, 3/13 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 0/13 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 129/522 variables, 24/37 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/522 variables, 6/43 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/522 variables, 0/43 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/526 variables, 4/47 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/526 variables, 0/47 constraints. Problems are: Problem set: 3 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1482/1484 variables, and 573 constraints, problems are : Problem set: 3 solved, 1 unsolved in 938 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 526/528 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4168ms problems are : Problem set: 3 solved, 1 unsolved
Parikh walk visited 0 properties in 42 ms.
Support contains 1 out of 528 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 528/528 places, 968/968 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 528 transition count 914
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 474 transition count 914
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 108 place count 474 transition count 854
Deduced a syphon composed of 60 places in 2 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 228 place count 414 transition count 854
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 231 place count 411 transition count 851
Iterating global reduction 2 with 3 rules applied. Total rules applied 234 place count 411 transition count 851
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 3 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 330 place count 363 transition count 803
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 2 with 12 rules applied. Total rules applied 342 place count 363 transition count 791
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 354 place count 351 transition count 791
Applied a total of 354 rules in 152 ms. Remains 351 /528 variables (removed 177) and now considering 791/968 (removed 177) transitions.
Running 789 sub problems to find dead transitions.
[2025-06-03 19:53:46] [INFO ] Flow matrix only has 779 transitions (discarded 12 similar events)
// Phase 1: matrix 779 rows 351 cols
[2025-06-03 19:53:46] [INFO ] Computed 42 invariants in 17 ms
[2025-06-03 19:53:46] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/349 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 789 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/349 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 789 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:53:52] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:53:52] [INFO ] Deduced a trap composed of 44 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-03 19:53:52] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:53:52] [INFO ] Deduced a trap composed of 45 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-03 19:53:52] [INFO ] Deduced a trap composed of 45 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-03 19:53:52] [INFO ] Deduced a trap composed of 44 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-03 19:53:53] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:53:53] [INFO ] Deduced a trap composed of 26 places in 192 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:53:54] [INFO ] Deduced a trap composed of 49 places in 176 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:53:58] [INFO ] Deduced a trap composed of 109 places in 217 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:53:59] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:53:59] [INFO ] Deduced a trap composed of 119 places in 258 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:53:59] [INFO ] Deduced a trap composed of 124 places in 241 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:54:00] [INFO ] Deduced a trap composed of 113 places in 211 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:54:00] [INFO ] Deduced a trap composed of 95 places in 192 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:54:00] [INFO ] Deduced a trap composed of 122 places in 196 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:54:01] [INFO ] Deduced a trap composed of 114 places in 201 ms of which 38 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/349 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 789 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 349/1130 variables, and 57 constraints, problems are : Problem set: 0 solved, 789 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/351 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 789/789 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 789 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/349 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 789 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/349 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 789 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/349 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 789 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:54:26] [INFO ] Deduced a trap composed of 204 places in 214 ms of which 47 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 349/1130 variables, and 58 constraints, problems are : Problem set: 0 solved, 789 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/351 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/789 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40616ms problems are : Problem set: 0 solved, 789 unsolved
Search for dead transitions found 0 dead transitions in 40619ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40774 ms. Remains : 351/528 places, 791/968 transitions.
RANDOM walk for 40000 steps (22 resets) in 769 ms. (51 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (11 resets) in 293 ms. (136 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 228163 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :0 out of 1
Probabilistic random walk after 228163 steps, saw 130674 distinct states, run finished after 3007 ms. (steps per millisecond=75 ) properties seen :0
[2025-06-03 19:54:30] [INFO ] Flow matrix only has 779 transitions (discarded 12 similar events)
[2025-06-03 19:54:30] [INFO ] Invariant cache hit.
[2025-06-03 19:54:30] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 224/225 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 30/255 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 91/346 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:54:30] [INFO ] Deduced a trap composed of 44 places in 100 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:54:30] [INFO ] Deduced a trap composed of 45 places in 82 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:54:30] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:54:30] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/346 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/346 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/348 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/348 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/349 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/349 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 779/1128 variables, 349/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1128 variables, 72/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1128 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 2/1130 variables, 2/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1130 variables, 1/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1130 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1130 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1130/1130 variables, and 469 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1097 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 351/351 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 224/225 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 30/255 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 91/346 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/346 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:54:31] [INFO ] Deduced a trap composed of 45 places in 39 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/346 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/346 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/348 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/348 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/349 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/349 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 779/1128 variables, 349/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1128 variables, 72/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1128 variables, 1/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:54:32] [INFO ] Deduced a trap composed of 124 places in 218 ms of which 45 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1128 variables, 1/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1128 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/1130 variables, 2/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1130 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1130 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1130 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1130/1130 variables, and 472 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1364 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 351/351 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2480ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 119 ms.
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 791/791 transitions.
Applied a total of 0 rules in 23 ms. Remains 351 /351 variables (removed 0) and now considering 791/791 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 351/351 places, 791/791 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 791/791 transitions.
Applied a total of 0 rules in 21 ms. Remains 351 /351 variables (removed 0) and now considering 791/791 (removed 0) transitions.
[2025-06-03 19:54:32] [INFO ] Flow matrix only has 779 transitions (discarded 12 similar events)
[2025-06-03 19:54:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:54:33] [INFO ] Implicit Places using invariants in 1233 ms returned []
[2025-06-03 19:54:33] [INFO ] Flow matrix only has 779 transitions (discarded 12 similar events)
[2025-06-03 19:54:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:54:34] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 19:54:37] [INFO ] Implicit Places using invariants and state equation in 4026 ms returned []
Implicit Place search using SMT with State Equation took 5261 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 19:54:37] [INFO ] Redundant transitions in 53 ms returned []
Running 789 sub problems to find dead transitions.
[2025-06-03 19:54:37] [INFO ] Flow matrix only has 779 transitions (discarded 12 similar events)
[2025-06-03 19:54:37] [INFO ] Invariant cache hit.
[2025-06-03 19:54:38] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/349 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 789 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/349 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 789 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:54:44] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:54:44] [INFO ] Deduced a trap composed of 45 places in 65 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:54:44] [INFO ] Deduced a trap composed of 45 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-03 19:54:44] [INFO ] Deduced a trap composed of 45 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-03 19:54:44] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:54:45] [INFO ] Deduced a trap composed of 44 places in 194 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:54:45] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:54:47] [INFO ] Deduced a trap composed of 49 places in 197 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:54:49] [INFO ] Deduced a trap composed of 204 places in 227 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:54:50] [INFO ] Deduced a trap composed of 108 places in 209 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:54:50] [INFO ] Deduced a trap composed of 109 places in 217 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:54:50] [INFO ] Deduced a trap composed of 119 places in 208 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:54:51] [INFO ] Deduced a trap composed of 113 places in 206 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:54:51] [INFO ] Deduced a trap composed of 124 places in 220 ms of which 44 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/349 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 789 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:54:56] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:54:56] [INFO ] Deduced a trap composed of 114 places in 208 ms of which 29 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/349 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 789 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 349/1130 variables, and 56 constraints, problems are : Problem set: 0 solved, 789 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/351 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 789/789 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 789 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/349 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 789 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/349 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 789 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/349 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 789 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:55:32] [INFO ] Deduced a trap composed of 95 places in 203 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:55:33] [INFO ] Deduced a trap composed of 194 places in 196 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:55:33] [INFO ] Deduced a trap composed of 122 places in 199 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:55:36] [INFO ] Deduced a trap composed of 26 places in 197 ms of which 28 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 349/1130 variables, and 60 constraints, problems are : Problem set: 0 solved, 789 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/351 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/789 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60552ms problems are : Problem set: 0 solved, 789 unsolved
Search for dead transitions found 0 dead transitions in 60554ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65902 ms. Remains : 351/351 places, 791/791 transitions.
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 6 out of 528 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 528/528 places, 968/968 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 528 transition count 914
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 474 transition count 914
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 108 place count 474 transition count 854
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 228 place count 414 transition count 854
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 231 place count 411 transition count 851
Iterating global reduction 2 with 3 rules applied. Total rules applied 234 place count 411 transition count 851
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 318 place count 369 transition count 809
Applied a total of 318 rules in 62 ms. Remains 369 /528 variables (removed 159) and now considering 809/968 (removed 159) transitions.
Running 807 sub problems to find dead transitions.
[2025-06-03 19:55:39] [INFO ] Flow matrix only has 797 transitions (discarded 12 similar events)
// Phase 1: matrix 797 rows 369 cols
[2025-06-03 19:55:39] [INFO ] Computed 42 invariants in 11 ms
[2025-06-03 19:55:39] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/367 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 807 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/367 variables, 24/39 constraints. Problems are: Problem set: 0 solved, 807 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:55:45] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:55:45] [INFO ] Deduced a trap composed of 114 places in 206 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:55:45] [INFO ] Deduced a trap composed of 115 places in 197 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:55:45] [INFO ] Deduced a trap composed of 119 places in 192 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:55:46] [INFO ] Deduced a trap composed of 120 places in 197 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:55:46] [INFO ] Deduced a trap composed of 25 places in 130 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:55:50] [INFO ] Deduced a trap composed of 55 places in 190 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:55:53] [INFO ] Deduced a trap composed of 130 places in 219 ms of which 45 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/367 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 807 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 9.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 9.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 3.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 1.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 1.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 1.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 1.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 1.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 1.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 1.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 1.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 1.0)
(s254 0.0)
(s255 1.0)
(s256 0.0)
(s257 1.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 1.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 1.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 7.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 1.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 1.0)
(s292 1.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 1.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 1.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 1.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 1.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 1.0)
(s344 0.0)
(s345 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 367/1166 variables, and 47 constraints, problems are : Problem set: 0 solved, 807 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 24/27 constraints, State Equation: 0/369 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 807/807 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 807 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/367 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 807 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/367 variables, 24/39 constraints. Problems are: Problem set: 0 solved, 807 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/367 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 807 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:56:11] [INFO ] Deduced a trap composed of 48 places in 67 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:56:11] [INFO ] Deduced a trap composed of 48 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-03 19:56:11] [INFO ] Deduced a trap composed of 47 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-03 19:56:13] [INFO ] Deduced a trap composed of 48 places in 210 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:56:13] [INFO ] Deduced a trap composed of 47 places in 220 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:56:13] [INFO ] Deduced a trap composed of 167 places in 227 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:56:14] [INFO ] Deduced a trap composed of 177 places in 213 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:56:15] [INFO ] Deduced a trap composed of 196 places in 203 ms of which 34 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 367/1166 variables, and 55 constraints, problems are : Problem set: 0 solved, 807 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 24/27 constraints, State Equation: 0/369 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/807 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40470ms problems are : Problem set: 0 solved, 807 unsolved
Search for dead transitions found 0 dead transitions in 40472ms
[2025-06-03 19:56:19] [INFO ] Flow matrix only has 797 transitions (discarded 12 similar events)
[2025-06-03 19:56:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:56:20] [INFO ] Implicit Places using invariants in 1268 ms returned []
[2025-06-03 19:56:20] [INFO ] Flow matrix only has 797 transitions (discarded 12 similar events)
[2025-06-03 19:56:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:56:21] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 19:56:26] [INFO ] Implicit Places using invariants and state equation in 5913 ms returned []
Implicit Place search using SMT with State Equation took 7193 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 19:56:26] [INFO ] Redundant transitions in 17 ms returned []
Running 807 sub problems to find dead transitions.
[2025-06-03 19:56:26] [INFO ] Flow matrix only has 797 transitions (discarded 12 similar events)
[2025-06-03 19:56:26] [INFO ] Invariant cache hit.
[2025-06-03 19:56:26] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/367 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 807 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/367 variables, 24/39 constraints. Problems are: Problem set: 0 solved, 807 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:56:33] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:56:33] [INFO ] Deduced a trap composed of 114 places in 206 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:56:33] [INFO ] Deduced a trap composed of 115 places in 179 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:56:33] [INFO ] Deduced a trap composed of 119 places in 186 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:56:34] [INFO ] Deduced a trap composed of 120 places in 191 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:56:35] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:56:37] [INFO ] Deduced a trap composed of 55 places in 189 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:56:40] [INFO ] Deduced a trap composed of 125 places in 193 ms of which 41 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/367 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 807 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:56:50] [INFO ] Deduced a trap composed of 130 places in 198 ms of which 25 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/367 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 807 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 367/1166 variables, and 48 constraints, problems are : Problem set: 0 solved, 807 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 24/27 constraints, State Equation: 0/369 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 807/807 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 807 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/367 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 807 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/367 variables, 24/39 constraints. Problems are: Problem set: 0 solved, 807 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/367 variables, 9/48 constraints. Problems are: Problem set: 0 solved, 807 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:57:09] [INFO ] Deduced a trap composed of 47 places in 94 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:57:10] [INFO ] Deduced a trap composed of 48 places in 68 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:57:10] [INFO ] Deduced a trap composed of 47 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-03 19:57:10] [INFO ] Deduced a trap composed of 48 places in 83 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:57:10] [INFO ] Deduced a trap composed of 47 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:57:10] [INFO ] Deduced a trap composed of 48 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-03 19:57:15] [INFO ] Deduced a trap composed of 157 places in 216 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:57:17] [INFO ] Deduced a trap composed of 192 places in 236 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:57:18] [INFO ] Deduced a trap composed of 127 places in 194 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:57:20] [INFO ] Deduced a trap composed of 197 places in 229 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:57:26] [INFO ] Deduced a trap composed of 217 places in 226 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:57:26] [INFO ] Deduced a trap composed of 222 places in 220 ms of which 54 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 367/1166 variables, and 60 constraints, problems are : Problem set: 0 solved, 807 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 24/27 constraints, State Equation: 0/369 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/807 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60456ms problems are : Problem set: 0 solved, 807 unsolved
Search for dead transitions found 0 dead transitions in 60458ms
Starting structural reductions in SI_LTL mode, iteration 1 : 369/528 places, 809/968 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 108216 ms. Remains : 369/528 places, 809/968 transitions.
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J06T06-LTLFireability-00
Product exploration explored 100000 steps with 3730 reset in 439 ms.
Product exploration explored 100000 steps with 3842 reset in 371 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 33 steps (0 resets) in 5 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Support contains 6 out of 369 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 369/369 places, 809/809 transitions.
Applied a total of 0 rules in 22 ms. Remains 369 /369 variables (removed 0) and now considering 809/809 (removed 0) transitions.
Running 807 sub problems to find dead transitions.
[2025-06-03 19:57:28] [INFO ] Flow matrix only has 797 transitions (discarded 12 similar events)
[2025-06-03 19:57:28] [INFO ] Invariant cache hit.
[2025-06-03 19:57:28] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/367 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 807 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/367 variables, 24/39 constraints. Problems are: Problem set: 0 solved, 807 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:57:34] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:57:34] [INFO ] Deduced a trap composed of 114 places in 203 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:57:35] [INFO ] Deduced a trap composed of 115 places in 186 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:57:35] [INFO ] Deduced a trap composed of 119 places in 190 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:57:36] [INFO ] Deduced a trap composed of 120 places in 189 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:57:36] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:57:39] [INFO ] Deduced a trap composed of 55 places in 212 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:57:42] [INFO ] Deduced a trap composed of 125 places in 199 ms of which 40 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/367 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 807 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 367/1166 variables, and 47 constraints, problems are : Problem set: 0 solved, 807 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 24/27 constraints, State Equation: 0/369 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 807/807 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 807 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/367 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 807 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/367 variables, 24/39 constraints. Problems are: Problem set: 0 solved, 807 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/367 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 807 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:58:07] [INFO ] Deduced a trap composed of 47 places in 95 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:58:07] [INFO ] Deduced a trap composed of 47 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:58:07] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:58:07] [INFO ] Deduced a trap composed of 48 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-03 19:58:07] [INFO ] Deduced a trap composed of 47 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-03 19:58:08] [INFO ] Deduced a trap composed of 142 places in 207 ms of which 46 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 367/1166 variables, and 53 constraints, problems are : Problem set: 0 solved, 807 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 24/27 constraints, State Equation: 0/369 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/807 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40469ms problems are : Problem set: 0 solved, 807 unsolved
Search for dead transitions found 0 dead transitions in 40470ms
[2025-06-03 19:58:09] [INFO ] Flow matrix only has 797 transitions (discarded 12 similar events)
[2025-06-03 19:58:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:58:10] [INFO ] Implicit Places using invariants in 1258 ms returned []
[2025-06-03 19:58:10] [INFO ] Flow matrix only has 797 transitions (discarded 12 similar events)
[2025-06-03 19:58:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:58:10] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 19:58:16] [INFO ] Implicit Places using invariants and state equation in 6088 ms returned []
Implicit Place search using SMT with State Equation took 7348 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 19:58:16] [INFO ] Redundant transitions in 16 ms returned []
Running 807 sub problems to find dead transitions.
[2025-06-03 19:58:16] [INFO ] Flow matrix only has 797 transitions (discarded 12 similar events)
[2025-06-03 19:58:16] [INFO ] Invariant cache hit.
[2025-06-03 19:58:16] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/367 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 807 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/367 variables, 24/39 constraints. Problems are: Problem set: 0 solved, 807 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:58:22] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:58:22] [INFO ] Deduced a trap composed of 114 places in 202 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:58:22] [INFO ] Deduced a trap composed of 115 places in 177 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:58:23] [INFO ] Deduced a trap composed of 119 places in 175 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:58:23] [INFO ] Deduced a trap composed of 120 places in 196 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:58:24] [INFO ] Deduced a trap composed of 25 places in 126 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:58:26] [INFO ] Deduced a trap composed of 55 places in 198 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:58:30] [INFO ] Deduced a trap composed of 125 places in 198 ms of which 40 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/367 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 807 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:58:39] [INFO ] Deduced a trap composed of 130 places in 204 ms of which 26 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/367 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 807 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 367/1166 variables, and 48 constraints, problems are : Problem set: 0 solved, 807 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 24/27 constraints, State Equation: 0/369 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 807/807 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 807 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/367 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 807 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/367 variables, 24/39 constraints. Problems are: Problem set: 0 solved, 807 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/367 variables, 9/48 constraints. Problems are: Problem set: 0 solved, 807 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:58:59] [INFO ] Deduced a trap composed of 47 places in 102 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:58:59] [INFO ] Deduced a trap composed of 48 places in 83 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:58:59] [INFO ] Deduced a trap composed of 47 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-03 19:58:59] [INFO ] Deduced a trap composed of 48 places in 95 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:58:59] [INFO ] Deduced a trap composed of 47 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:58:59] [INFO ] Deduced a trap composed of 48 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-03 19:59:05] [INFO ] Deduced a trap composed of 157 places in 234 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:59:06] [INFO ] Deduced a trap composed of 192 places in 225 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:59:08] [INFO ] Deduced a trap composed of 127 places in 207 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:59:09] [INFO ] Deduced a trap composed of 197 places in 206 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:59:15] [INFO ] Deduced a trap composed of 217 places in 222 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:59:16] [INFO ] Deduced a trap composed of 222 places in 221 ms of which 54 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 367/1166 variables, and 60 constraints, problems are : Problem set: 0 solved, 807 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 24/27 constraints, State Equation: 0/369 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/807 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60417ms problems are : Problem set: 0 solved, 807 unsolved
Search for dead transitions found 0 dead transitions in 60419ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 108289 ms. Remains : 369/369 places, 809/809 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 35 steps (0 resets) in 5 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3863 reset in 323 ms.
Product exploration explored 100000 steps with 3734 reset in 341 ms.
Built C files in :
/tmp/ltsmin3813042230635147503
[2025-06-03 19:59:18] [INFO ] Computing symmetric may disable matrix : 809 transitions.
[2025-06-03 19:59:18] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 19:59:18] [INFO ] Computing symmetric may enable matrix : 809 transitions.
[2025-06-03 19:59:18] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 19:59:18] [INFO ] Computing Do-Not-Accords matrix : 809 transitions.
[2025-06-03 19:59:18] [INFO ] Computation of Completed DNA matrix. took 29 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 19:59:18] [INFO ] Built C files in 196ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3813042230635147503
Running compilation step : cd /tmp/ltsmin3813042230635147503;'/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 2440 ms.
Running link step : cd /tmp/ltsmin3813042230635147503;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin3813042230635147503;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11739781398019215277.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 369 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 369/369 places, 809/809 transitions.
Applied a total of 0 rules in 19 ms. Remains 369 /369 variables (removed 0) and now considering 809/809 (removed 0) transitions.
Running 807 sub problems to find dead transitions.
[2025-06-03 19:59:33] [INFO ] Flow matrix only has 797 transitions (discarded 12 similar events)
[2025-06-03 19:59:33] [INFO ] Invariant cache hit.
[2025-06-03 19:59:33] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/367 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 807 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/367 variables, 24/39 constraints. Problems are: Problem set: 0 solved, 807 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:59:39] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:59:39] [INFO ] Deduced a trap composed of 114 places in 217 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:59:39] [INFO ] Deduced a trap composed of 115 places in 196 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:59:40] [INFO ] Deduced a trap composed of 119 places in 191 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:59:40] [INFO ] Deduced a trap composed of 120 places in 194 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:59:41] [INFO ] Deduced a trap composed of 25 places in 154 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:59:43] [INFO ] Deduced a trap composed of 55 places in 195 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 19:59:47] [INFO ] Deduced a trap composed of 125 places in 179 ms of which 41 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/367 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 807 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 367/1166 variables, and 47 constraints, problems are : Problem set: 0 solved, 807 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 24/27 constraints, State Equation: 0/369 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 807/807 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 807 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/367 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 807 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/367 variables, 24/39 constraints. Problems are: Problem set: 0 solved, 807 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/367 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 807 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:00:12] [INFO ] Deduced a trap composed of 47 places in 89 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:00:12] [INFO ] Deduced a trap composed of 47 places in 61 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:00:12] [INFO ] Deduced a trap composed of 48 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-03 20:00:12] [INFO ] Deduced a trap composed of 48 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-03 20:00:12] [INFO ] Deduced a trap composed of 47 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-03 20:00:13] [INFO ] Deduced a trap composed of 142 places in 224 ms of which 48 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 367/1166 variables, and 53 constraints, problems are : Problem set: 0 solved, 807 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 24/27 constraints, State Equation: 0/369 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/807 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40393ms problems are : Problem set: 0 solved, 807 unsolved
Search for dead transitions found 0 dead transitions in 40395ms
[2025-06-03 20:00:13] [INFO ] Flow matrix only has 797 transitions (discarded 12 similar events)
[2025-06-03 20:00:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 20:00:14] [INFO ] Implicit Places using invariants in 1272 ms returned []
[2025-06-03 20:00:14] [INFO ] Flow matrix only has 797 transitions (discarded 12 similar events)
[2025-06-03 20:00:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 20:00:15] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 20:00:20] [INFO ] Implicit Places using invariants and state equation in 5948 ms returned []
Implicit Place search using SMT with State Equation took 7226 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 20:00:20] [INFO ] Redundant transitions in 16 ms returned []
Running 807 sub problems to find dead transitions.
[2025-06-03 20:00:20] [INFO ] Flow matrix only has 797 transitions (discarded 12 similar events)
[2025-06-03 20:00:20] [INFO ] Invariant cache hit.
[2025-06-03 20:00:20] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/367 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 807 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/367 variables, 24/39 constraints. Problems are: Problem set: 0 solved, 807 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:00:27] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:00:27] [INFO ] Deduced a trap composed of 114 places in 191 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:00:27] [INFO ] Deduced a trap composed of 115 places in 178 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:00:27] [INFO ] Deduced a trap composed of 119 places in 179 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:00:28] [INFO ] Deduced a trap composed of 120 places in 189 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:00:29] [INFO ] Deduced a trap composed of 25 places in 130 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:00:31] [INFO ] Deduced a trap composed of 55 places in 186 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:00:34] [INFO ] Deduced a trap composed of 125 places in 186 ms of which 40 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/367 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 807 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:00:44] [INFO ] Deduced a trap composed of 130 places in 178 ms of which 25 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/367 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 807 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 367/1166 variables, and 48 constraints, problems are : Problem set: 0 solved, 807 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 24/27 constraints, State Equation: 0/369 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 807/807 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 807 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/367 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 807 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/367 variables, 24/39 constraints. Problems are: Problem set: 0 solved, 807 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/367 variables, 9/48 constraints. Problems are: Problem set: 0 solved, 807 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:01:03] [INFO ] Deduced a trap composed of 47 places in 85 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:01:04] [INFO ] Deduced a trap composed of 48 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-03 20:01:04] [INFO ] Deduced a trap composed of 47 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:01:04] [INFO ] Deduced a trap composed of 48 places in 96 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:01:04] [INFO ] Deduced a trap composed of 47 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:01:04] [INFO ] Deduced a trap composed of 48 places in 53 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:01:09] [INFO ] Deduced a trap composed of 157 places in 227 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:01:11] [INFO ] Deduced a trap composed of 192 places in 214 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:01:12] [INFO ] Deduced a trap composed of 127 places in 195 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:01:14] [INFO ] Deduced a trap composed of 197 places in 228 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:01:20] [INFO ] Deduced a trap composed of 217 places in 222 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:01:20] [INFO ] Deduced a trap composed of 222 places in 235 ms of which 54 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 367/1166 variables, and 60 constraints, problems are : Problem set: 0 solved, 807 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 24/27 constraints, State Equation: 0/369 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/807 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60434ms problems are : Problem set: 0 solved, 807 unsolved
Search for dead transitions found 0 dead transitions in 60436ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 108104 ms. Remains : 369/369 places, 809/809 transitions.
Built C files in :
/tmp/ltsmin10465395747096879462
[2025-06-03 20:01:21] [INFO ] Computing symmetric may disable matrix : 809 transitions.
[2025-06-03 20:01:21] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 20:01:21] [INFO ] Computing symmetric may enable matrix : 809 transitions.
[2025-06-03 20:01:21] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 20:01:21] [INFO ] Computing Do-Not-Accords matrix : 809 transitions.
[2025-06-03 20:01:21] [INFO ] Computation of Completed DNA matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 20:01:21] [INFO ] Built C files in 168ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10465395747096879462
Running compilation step : cd /tmp/ltsmin10465395747096879462;'/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 2321 ms.
Running link step : cd /tmp/ltsmin10465395747096879462;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin10465395747096879462;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased943027683525161313.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-03 20:01:36] [INFO ] Flatten gal took : 46 ms
[2025-06-03 20:01:36] [INFO ] Flatten gal took : 61 ms
[2025-06-03 20:01:36] [INFO ] Time to serialize gal into /tmp/LTL2196159071258745545.gal : 8 ms
[2025-06-03 20:01:36] [INFO ] Time to serialize properties into /tmp/LTL6797744306206008830.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/LTL2196159071258745545.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2408065156239902632.hoa' '-atoms' '/tmp/LTL6797744306206008830.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...317
Loading property file /tmp/LTL6797744306206008830.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2408065156239902632.hoa
Detected timeout of ITS tools.
[2025-06-03 20:01:51] [INFO ] Flatten gal took : 34 ms
[2025-06-03 20:01:51] [INFO ] Flatten gal took : 33 ms
[2025-06-03 20:01:51] [INFO ] Time to serialize gal into /tmp/LTL6748304416751937042.gal : 8 ms
[2025-06-03 20:01:51] [INFO ] Time to serialize properties into /tmp/LTL5179561680578770107.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/LTL6748304416751937042.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5179561680578770107.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...275
Read 1 LTL properties
Checking formula 0 : !((G(F("((((QueueJobE_4<1)&&(QueueJobE_1<1))&&((QueueJobE_2<1)&&(QueueJobE_6<1)))&&((QueueJobE_3<1)&&(QueueJobE_5<1)))"))))
Formula 0 simplified : FG!"((((QueueJobE_4<1)&&(QueueJobE_1<1))&&((QueueJobE_2<1)&&(QueueJobE_6<1)))&&((QueueJobE_3<1)&&(QueueJobE_5<1)))"
Detected timeout of ITS tools.
[2025-06-03 20:02:06] [INFO ] Flatten gal took : 70 ms
[2025-06-03 20:02:06] [INFO ] Applying decomposition
[2025-06-03 20:02:07] [INFO ] Flatten gal took : 31 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/graph9337693125710728835.txt' '-o' '/tmp/graph9337693125710728835.bin' '-w' '/tmp/graph9337693125710728835.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9337693125710728835.bin' '-l' '-1' '-v' '-w' '/tmp/graph9337693125710728835.weights' '-q' '0' '-e' '0.001'
[2025-06-03 20:02:07] [INFO ] Decomposing Gal with order
[2025-06-03 20:02:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 20:02:07] [INFO ] Removed a total of 416 redundant transitions.
[2025-06-03 20:02:07] [INFO ] Flatten gal took : 188 ms
[2025-06-03 20:02:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 438 labels/synchronizations in 25 ms.
[2025-06-03 20:02:07] [INFO ] Time to serialize gal into /tmp/LTL6364745418514327018.gal : 8 ms
[2025-06-03 20:02:07] [INFO ] Time to serialize properties into /tmp/LTL11787858037115576435.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/LTL6364745418514327018.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11787858037115576435.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 : !((G(F("((((u4.QueueJobE_4<1)&&(u4.QueueJobE_1<1))&&((u4.QueueJobE_2<1)&&(u4.QueueJobE_6<1)))&&((u4.QueueJobE_3<1)&&(u4.QueueJobE_5<1)...162
Formula 0 simplified : FG!"((((u4.QueueJobE_4<1)&&(u4.QueueJobE_1<1))&&((u4.QueueJobE_2<1)&&(u4.QueueJobE_6<1)))&&((u4.QueueJobE_3<1)&&(u4.QueueJobE_5<1)))...156
Detected timeout of ITS tools.
Treatment of property PolyORBLF-PT-S02J06T06-LTLFireability-00 finished in 403551 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((X(p0)&&(!p1 U (G(!p1)||(!p1&&G(!p2)))))))))'
Support contains 62 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 968/968 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 522 transition count 962
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 522 transition count 962
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 516 transition count 956
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 516 transition count 956
Applied a total of 24 rules in 27 ms. Remains 516 /528 variables (removed 12) and now considering 956/968 (removed 12) transitions.
Running 954 sub problems to find dead transitions.
[2025-06-03 20:02:22] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
// Phase 1: matrix 944 rows 516 cols
[2025-06-03 20:02:22] [INFO ] Computed 42 invariants in 17 ms
[2025-06-03 20:02:22] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:02:31] [INFO ] Deduced a trap composed of 15 places in 167 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:02:31] [INFO ] Deduced a trap composed of 72 places in 85 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:02:31] [INFO ] Deduced a trap composed of 72 places in 77 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:02:31] [INFO ] Deduced a trap composed of 72 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-03 20:02:32] [INFO ] Deduced a trap composed of 72 places in 80 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:02:32] [INFO ] Deduced a trap composed of 72 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-03 20:02:32] [INFO ] Deduced a trap composed of 72 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-03 20:02:32] [INFO ] Deduced a trap composed of 37 places in 160 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:02:33] [INFO ] Deduced a trap composed of 241 places in 294 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:02:33] [INFO ] Deduced a trap composed of 121 places in 222 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:02:41] [INFO ] Deduced a trap composed of 233 places in 301 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:02:42] [INFO ] Deduced a trap composed of 246 places in 277 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:02:43] [INFO ] Deduced a trap composed of 86 places in 257 ms of which 55 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/1460 variables, and 53 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/1460 variables, and 53 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20046 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40536ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 40538ms
[2025-06-03 20:03:03] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 20:03:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 20:03:04] [INFO ] Implicit Places using invariants in 932 ms returned []
[2025-06-03 20:03:04] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 20:03:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 20:03:04] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 20:03:09] [INFO ] Implicit Places using invariants and state equation in 5506 ms returned []
Implicit Place search using SMT with State Equation took 6464 ms to find 0 implicit places.
Running 954 sub problems to find dead transitions.
[2025-06-03 20:03:09] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 20:03:09] [INFO ] Invariant cache hit.
[2025-06-03 20:03:09] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:03:18] [INFO ] Deduced a trap composed of 15 places in 176 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:03:18] [INFO ] Deduced a trap composed of 72 places in 113 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:03:18] [INFO ] Deduced a trap composed of 72 places in 85 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:03:18] [INFO ] Deduced a trap composed of 72 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-03 20:03:18] [INFO ] Deduced a trap composed of 72 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:03:19] [INFO ] Deduced a trap composed of 72 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-03 20:03:19] [INFO ] Deduced a trap composed of 72 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-03 20:03:19] [INFO ] Deduced a trap composed of 37 places in 160 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:03:20] [INFO ] Deduced a trap composed of 241 places in 292 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:03:20] [INFO ] Deduced a trap composed of 121 places in 297 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:03:21] [INFO ] Deduced a trap composed of 246 places in 301 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:03:23] [INFO ] Deduced a trap composed of 86 places in 228 ms of which 50 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 12/52 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:03:35] [INFO ] Deduced a trap composed of 337 places in 271 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:03:37] [INFO ] Deduced a trap composed of 348 places in 300 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:03:39] [INFO ] Deduced a trap composed of 233 places in 273 ms of which 60 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/1460 variables, and 55 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:04:03] [INFO ] Deduced a trap composed of 266 places in 281 ms of which 69 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/1460 variables, and 56 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60536ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 60538ms
Starting structural reductions in LTL mode, iteration 1 : 516/528 places, 956/968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 107572 ms. Remains : 516/528 places, 956/968 transitions.
Stuttering acceptance computed with spot in 365 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), true, (NOT p0), p1, (AND p1 p2), p2]
Running random walk in product with property : PolyORBLF-PT-S02J06T06-LTLFireability-01
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T06-LTLFireability-01 finished in 107976 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(((F(p0) U p1)&&F((p2||X(p3))))))'
Support contains 61 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 968/968 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 522 transition count 962
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 522 transition count 962
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 516 transition count 956
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 516 transition count 956
Applied a total of 24 rules in 24 ms. Remains 516 /528 variables (removed 12) and now considering 956/968 (removed 12) transitions.
Running 954 sub problems to find dead transitions.
[2025-06-03 20:04:10] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 20:04:10] [INFO ] Invariant cache hit.
[2025-06-03 20:04:10] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:04:19] [INFO ] Deduced a trap composed of 15 places in 173 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:04:19] [INFO ] Deduced a trap composed of 72 places in 133 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:04:19] [INFO ] Deduced a trap composed of 72 places in 107 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:04:19] [INFO ] Deduced a trap composed of 72 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:04:19] [INFO ] Deduced a trap composed of 72 places in 68 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:04:20] [INFO ] Deduced a trap composed of 72 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-03 20:04:20] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:04:20] [INFO ] Deduced a trap composed of 37 places in 165 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:04:21] [INFO ] Deduced a trap composed of 241 places in 294 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:04:21] [INFO ] Deduced a trap composed of 121 places in 301 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:04:22] [INFO ] Deduced a trap composed of 246 places in 267 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:04:24] [INFO ] Deduced a trap composed of 86 places in 246 ms of which 50 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/1460 variables, and 52 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 12/52 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:04:47] [INFO ] Deduced a trap composed of 233 places in 323 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:04:48] [INFO ] Deduced a trap composed of 266 places in 285 ms of which 72 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/1460 variables, and 54 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40510ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 40512ms
[2025-06-03 20:04:51] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 20:04:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 20:04:52] [INFO ] Implicit Places using invariants in 1149 ms returned []
[2025-06-03 20:04:52] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 20:04:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 20:04:52] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 20:05:03] [INFO ] Implicit Places using invariants and state equation in 11054 ms returned []
Implicit Place search using SMT with State Equation took 12209 ms to find 0 implicit places.
Running 954 sub problems to find dead transitions.
[2025-06-03 20:05:03] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 20:05:03] [INFO ] Invariant cache hit.
[2025-06-03 20:05:03] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:05:12] [INFO ] Deduced a trap composed of 15 places in 166 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:05:12] [INFO ] Deduced a trap composed of 72 places in 108 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:05:12] [INFO ] Deduced a trap composed of 72 places in 87 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:05:12] [INFO ] Deduced a trap composed of 72 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-03 20:05:12] [INFO ] Deduced a trap composed of 72 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-03 20:05:12] [INFO ] Deduced a trap composed of 72 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-03 20:05:13] [INFO ] Deduced a trap composed of 72 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-03 20:05:13] [INFO ] Deduced a trap composed of 37 places in 160 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:05:14] [INFO ] Deduced a trap composed of 241 places in 276 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:05:14] [INFO ] Deduced a trap composed of 121 places in 259 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:05:15] [INFO ] Deduced a trap composed of 246 places in 273 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:05:17] [INFO ] Deduced a trap composed of 86 places in 277 ms of which 52 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 12/52 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:05:29] [INFO ] Deduced a trap composed of 337 places in 286 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:05:31] [INFO ] Deduced a trap composed of 348 places in 313 ms of which 95 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/1460 variables, and 54 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:05:53] [INFO ] Deduced a trap composed of 266 places in 299 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:06:02] [INFO ] Deduced a trap composed of 42 places in 254 ms of which 43 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/1460 variables, and 56 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60528ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 60530ms
Starting structural reductions in LTL mode, iteration 1 : 516/528 places, 956/968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 113280 ms. Remains : 516/528 places, 956/968 transitions.
Stuttering acceptance computed with spot in 256 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p0), (NOT p1), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : PolyORBLF-PT-S02J06T06-LTLFireability-02
Stuttering criterion allowed to conclude after 88527 steps with 3831 reset in 500 ms.
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T06-LTLFireability-02 finished in 114069 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(p0) U ((!p1 U (G(!p1)||(!p1&&G(p2))))||F((G(F(p2))||(F(p2)&&X(!p3)))))))'
Support contains 25 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 968/968 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 522 transition count 962
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 522 transition count 962
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 516 transition count 956
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 516 transition count 956
Applied a total of 24 rules in 36 ms. Remains 516 /528 variables (removed 12) and now considering 956/968 (removed 12) transitions.
Running 954 sub problems to find dead transitions.
[2025-06-03 20:06:04] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 20:06:04] [INFO ] Invariant cache hit.
[2025-06-03 20:06:04] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:06:13] [INFO ] Deduced a trap composed of 15 places in 161 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:06:13] [INFO ] Deduced a trap composed of 72 places in 114 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:06:13] [INFO ] Deduced a trap composed of 72 places in 85 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:06:13] [INFO ] Deduced a trap composed of 72 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-03 20:06:14] [INFO ] Deduced a trap composed of 72 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-03 20:06:14] [INFO ] Deduced a trap composed of 72 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-03 20:06:14] [INFO ] Deduced a trap composed of 72 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-03 20:06:14] [INFO ] Deduced a trap composed of 37 places in 153 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:06:15] [INFO ] Deduced a trap composed of 241 places in 280 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:06:15] [INFO ] Deduced a trap composed of 121 places in 261 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:06:16] [INFO ] Deduced a trap composed of 246 places in 263 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:06:18] [INFO ] Deduced a trap composed of 86 places in 231 ms of which 51 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/1460 variables, and 52 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 12/52 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:06:41] [INFO ] Deduced a trap composed of 233 places in 327 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:06:42] [INFO ] Deduced a trap composed of 266 places in 266 ms of which 75 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 9)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 5)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 1)
(s35 0)
(s36 1)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 1)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 5)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 1)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 1)
(s90 0)
(s91 0)
(s92 1)
(s93 0)
(s94 1)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 1)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 2)
(s138 0)
(s139 0)
(s140 0)
(s141 1)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 1)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 3)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 1)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 1)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 1)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 1)
(s302 0)
(s303 0)
(s304 0)
(s305 1)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 1)
(s314 0)
(s315 0)
(s316 0)
(s317 timeout
0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/1460 variables, and 54 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40538ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 40540ms
[2025-06-03 20:06:45] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 20:06:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 20:06:46] [INFO ] Implicit Places using invariants in 1078 ms returned []
[2025-06-03 20:06:46] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 20:06:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 20:06:46] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 20:06:53] [INFO ] Implicit Places using invariants and state equation in 6723 ms returned []
Implicit Place search using SMT with State Equation took 7806 ms to find 0 implicit places.
Running 954 sub problems to find dead transitions.
[2025-06-03 20:06:53] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 20:06:53] [INFO ] Invariant cache hit.
[2025-06-03 20:06:53] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:07:01] [INFO ] Deduced a trap composed of 15 places in 175 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:07:02] [INFO ] Deduced a trap composed of 72 places in 110 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:07:02] [INFO ] Deduced a trap composed of 72 places in 83 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:07:02] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:07:02] [INFO ] Deduced a trap composed of 72 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-03 20:07:02] [INFO ] Deduced a trap composed of 72 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-03 20:07:02] [INFO ] Deduced a trap composed of 72 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-03 20:07:02] [INFO ] Deduced a trap composed of 37 places in 149 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:07:03] [INFO ] Deduced a trap composed of 241 places in 293 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:07:03] [INFO ] Deduced a trap composed of 121 places in 268 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:07:05] [INFO ] Deduced a trap composed of 246 places in 260 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:07:06] [INFO ] Deduced a trap composed of 86 places in 249 ms of which 51 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 12/52 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:07:19] [INFO ] Deduced a trap composed of 337 places in 302 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:07:21] [INFO ] Deduced a trap composed of 348 places in 310 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:07:23] [INFO ] Deduced a trap composed of 233 places in 263 ms of which 59 ms to minimize.
SMT process timed out in 30607ms, After SMT, problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 30610ms
Starting structural reductions in LTL mode, iteration 1 : 516/528 places, 956/968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 79000 ms. Remains : 516/528 places, 956/968 transitions.
Stuttering acceptance computed with spot in 433 ms :[(AND p1 (NOT p2)), (AND (NOT p2) p1), (AND (NOT p2) p1 p3), (AND p1 (NOT p2)), (AND p1 (NOT p2) p3), (NOT p2), (AND (NOT p2) p3), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) p3 (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-PT-S02J06T06-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 530 ms.
Product exploration explored 100000 steps with 50000 reset in 540 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0) (NOT p3)), (X p2), (X (NOT (AND (NOT p2) p3))), (X (NOT p3)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0 p3))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND p0 p3))), (X (NOT (AND (NOT p2) (NOT p1) p3))), (X (NOT (AND (NOT p2) p1 p3))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0) p3))), (X (NOT (AND p1 (NOT p0) p3))), (X (NOT (AND (NOT p2) p1 p0 p3))), (X (NOT (AND p1 p3))), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND (NOT p2) p1 (NOT p0) p3))), (X (NOT (AND (NOT p2) (NOT p1) p0 p3))), (X (NOT (AND (NOT p2) p0 p3))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p1) p0 p3))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0) p3))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0 p3)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) p3)))), (X (X (NOT (AND (NOT p2) p1 p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0) p3)))), (X (X (NOT (AND p1 (NOT p0) p3)))), (X (X (NOT (AND (NOT p2) p1 p0 p3)))), (X (X (NOT (AND p1 p3)))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0) p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0 p3)))), (X (X (NOT (AND (NOT p2) p0 p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p1) p0 p3)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0) p3)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 51 factoid took 27 ms. Reduced automaton from 9 states, 36 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-PT-S02J06T06-LTLFireability-03 finished in 80587 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(!(p0 U p1))&&F(X(F(!p0)))))'
Support contains 15 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 968/968 transitions.
Applied a total of 0 rules in 13 ms. Remains 528 /528 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Running 966 sub problems to find dead transitions.
[2025-06-03 20:07:25] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
// Phase 1: matrix 956 rows 528 cols
[2025-06-03 20:07:25] [INFO ] Computed 42 invariants in 16 ms
[2025-06-03 20:07:25] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 966 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:07:37] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:07:38] [INFO ] Deduced a trap composed of 133 places in 158 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:07:39] [INFO ] Deduced a trap composed of 247 places in 237 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:07:39] [INFO ] Deduced a trap composed of 37 places in 133 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:07:40] [INFO ] Deduced a trap composed of 253 places in 233 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:07:41] [INFO ] Deduced a trap composed of 259 places in 219 ms of which 50 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 526/1484 variables, and 45 constraints, problems are : Problem set: 0 solved, 966 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/528 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 966/966 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 966 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 6/45 constraints. Problems are: Problem set: 0 solved, 966 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 526/1484 variables, and 45 constraints, problems are : Problem set: 0 solved, 966 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/528 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/966 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40534ms problems are : Problem set: 0 solved, 966 unsolved
Search for dead transitions found 0 dead transitions in 40536ms
[2025-06-03 20:08:05] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2025-06-03 20:08:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 20:08:06] [INFO ] Implicit Places using invariants in 1093 ms returned []
[2025-06-03 20:08:06] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2025-06-03 20:08:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 20:08:07] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 20:08:12] [INFO ] Implicit Places using invariants and state equation in 5908 ms returned []
Implicit Place search using SMT with State Equation took 7021 ms to find 0 implicit places.
Running 966 sub problems to find dead transitions.
[2025-06-03 20:08:12] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2025-06-03 20:08:12] [INFO ] Invariant cache hit.
[2025-06-03 20:08:12] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 966 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:08:24] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:08:26] [INFO ] Deduced a trap composed of 133 places in 168 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:08:27] [INFO ] Deduced a trap composed of 247 places in 252 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:08:28] [INFO ] Deduced a trap composed of 253 places in 269 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:08:28] [INFO ] Deduced a trap composed of 259 places in 242 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:08:29] [INFO ] Deduced a trap composed of 84 places in 102 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:08:29] [INFO ] Deduced a trap composed of 37 places in 101 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:08:35] [INFO ] Deduced a trap composed of 99 places in 227 ms of which 51 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 966 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 526/1484 variables, and 47 constraints, problems are : Problem set: 0 solved, 966 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/528 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 966/966 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 966 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 966 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 526/1484 variables, and 47 constraints, problems are : Problem set: 0 solved, 966 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 21/24 constraints, State Equation: 0/528 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/966 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60554ms problems are : Problem set: 0 solved, 966 unsolved
Search for dead transitions found 0 dead transitions in 60557ms
Finished structural reductions in LTL mode , in 1 iterations and 108132 ms. Remains : 528/528 places, 968/968 transitions.
Stuttering acceptance computed with spot in 134 ms :[(OR p0 p1), p1, p0]
Running random walk in product with property : PolyORBLF-PT-S02J06T06-LTLFireability-04
Product exploration explored 100000 steps with 28609 reset in 375 ms.
Product exploration explored 100000 steps with 28556 reset in 374 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 192 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[p0, p0]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 5 factoid took 202 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[p0, p0]
Stuttering acceptance computed with spot in 75 ms :[p0, p0]
Support contains 9 out of 528 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 528/528 places, 968/968 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 528 transition count 926
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 486 transition count 926
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 84 place count 486 transition count 866
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 204 place count 426 transition count 866
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 276 place count 390 transition count 830
Applied a total of 276 rules in 41 ms. Remains 390 /528 variables (removed 138) and now considering 830/968 (removed 138) transitions.
Running 828 sub problems to find dead transitions.
[2025-06-03 20:09:14] [INFO ] Flow matrix only has 818 transitions (discarded 12 similar events)
// Phase 1: matrix 818 rows 390 cols
[2025-06-03 20:09:14] [INFO ] Computed 42 invariants in 16 ms
[2025-06-03 20:09:14] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/388 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 828 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/388 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 828 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:09:21] [INFO ] Deduced a trap composed of 35 places in 114 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:09:21] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:09:21] [INFO ] Deduced a trap composed of 51 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-03 20:09:21] [INFO ] Deduced a trap composed of 51 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-03 20:09:21] [INFO ] Deduced a trap composed of 51 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-03 20:09:21] [INFO ] Deduced a trap composed of 51 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-03 20:09:21] [INFO ] Deduced a trap composed of 51 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-03 20:09:22] [INFO ] Deduced a trap composed of 126 places in 220 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:09:22] [INFO ] Deduced a trap composed of 131 places in 217 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:09:22] [INFO ] Deduced a trap composed of 131 places in 195 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:09:22] [INFO ] Deduced a trap composed of 51 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-03 20:09:23] [INFO ] Deduced a trap composed of 31 places in 131 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:09:23] [INFO ] Deduced a trap composed of 133 places in 215 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:09:23] [INFO ] Deduced a trap composed of 138 places in 198 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:09:24] [INFO ] Deduced a trap composed of 38 places in 199 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:09:24] [INFO ] Deduced a trap composed of 73 places in 221 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:09:27] [INFO ] Deduced a trap composed of 148 places in 234 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:09:31] [INFO ] Deduced a trap composed of 146 places in 207 ms of which 43 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/388 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 828 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 388/1208 variables, and 58 constraints, problems are : Problem set: 0 solved, 828 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/390 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 828/828 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 828 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/388 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 828 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/388 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 828 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/388 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 828 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:09:52] [INFO ] Deduced a trap composed of 240 places in 220 ms of which 57 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 388/1208 variables, and 59 constraints, problems are : Problem set: 0 solved, 828 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/390 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/828 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40530ms problems are : Problem set: 0 solved, 828 unsolved
Search for dead transitions found 0 dead transitions in 40532ms
[2025-06-03 20:09:55] [INFO ] Flow matrix only has 818 transitions (discarded 12 similar events)
[2025-06-03 20:09:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 20:09:56] [INFO ] Implicit Places using invariants in 1253 ms returned []
[2025-06-03 20:09:56] [INFO ] Flow matrix only has 818 transitions (discarded 12 similar events)
[2025-06-03 20:09:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 20:09:57] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 20:10:02] [INFO ] Implicit Places using invariants and state equation in 5476 ms returned []
Implicit Place search using SMT with State Equation took 6734 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 20:10:02] [INFO ] Redundant transitions in 10 ms returned []
Running 828 sub problems to find dead transitions.
[2025-06-03 20:10:02] [INFO ] Flow matrix only has 818 transitions (discarded 12 similar events)
[2025-06-03 20:10:02] [INFO ] Invariant cache hit.
[2025-06-03 20:10:02] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/388 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 828 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/388 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 828 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:10:08] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:10:08] [INFO ] Deduced a trap composed of 51 places in 61 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:10:08] [INFO ] Deduced a trap composed of 51 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-03 20:10:08] [INFO ] Deduced a trap composed of 51 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-03 20:10:09] [INFO ] Deduced a trap composed of 126 places in 211 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:10:09] [INFO ] Deduced a trap composed of 131 places in 215 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:10:09] [INFO ] Deduced a trap composed of 131 places in 227 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:10:09] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:10:09] [INFO ] Deduced a trap composed of 51 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-03 20:10:10] [INFO ] Deduced a trap composed of 51 places in 211 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:10:10] [INFO ] Deduced a trap composed of 138 places in 215 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:10:10] [INFO ] Deduced a trap composed of 31 places in 154 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:10:11] [INFO ] Deduced a trap composed of 38 places in 203 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:10:11] [INFO ] Deduced a trap composed of 73 places in 215 ms of which 35 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/388 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 828 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:10:21] [INFO ] Deduced a trap composed of 240 places in 220 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:10:27] [INFO ] Deduced a trap composed of 146 places in 211 ms of which 38 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/388 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 828 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 388/1208 variables, and 56 constraints, problems are : Problem set: 0 solved, 828 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/390 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 828/828 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 828 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/388 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 828 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/388 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 828 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/388 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 828 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:10:48] [INFO ] Deduced a trap composed of 148 places in 243 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:10:53] [INFO ] Deduced a trap composed of 36 places in 225 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:11:01] [INFO ] Deduced a trap composed of 133 places in 247 ms of which 68 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 388/1208 variables, and 59 constraints, problems are : Problem set: 0 solved, 828 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/390 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/828 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60520ms problems are : Problem set: 0 solved, 828 unsolved
Search for dead transitions found 0 dead transitions in 60521ms
Starting structural reductions in SI_LTL mode, iteration 1 : 390/528 places, 830/968 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 107850 ms. Remains : 390/528 places, 830/968 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 106 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[p0, p0]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 2 factoid took 110 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[p0, p0]
Stuttering acceptance computed with spot in 58 ms :[p0, p0]
Stuttering acceptance computed with spot in 65 ms :[p0, p0]
Product exploration explored 100000 steps with 28591 reset in 408 ms.
Product exploration explored 100000 steps with 28565 reset in 393 ms.
Built C files in :
/tmp/ltsmin4979128793342792719
[2025-06-03 20:11:04] [INFO ] Computing symmetric may disable matrix : 830 transitions.
[2025-06-03 20:11:04] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 20:11:04] [INFO ] Computing symmetric may enable matrix : 830 transitions.
[2025-06-03 20:11:04] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 20:11:04] [INFO ] Computing Do-Not-Accords matrix : 830 transitions.
[2025-06-03 20:11:04] [INFO ] Computation of Completed DNA matrix. took 33 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 20:11:04] [INFO ] Built C files in 185ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4979128793342792719
Running compilation step : cd /tmp/ltsmin4979128793342792719;'/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 2428 ms.
Running link step : cd /tmp/ltsmin4979128793342792719;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin4979128793342792719;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5643633186696592162.hoa' '--buchi-type=spotba'
LTSmin run took 7756 ms.
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-04 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PolyORBLF-PT-S02J06T06-LTLFireability-04 finished in 229333 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 ((p0 U p1)&&F(p2))))'
Support contains 60 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 968/968 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 522 transition count 962
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 522 transition count 962
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 516 transition count 956
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 516 transition count 956
Applied a total of 24 rules in 22 ms. Remains 516 /528 variables (removed 12) and now considering 956/968 (removed 12) transitions.
Running 954 sub problems to find dead transitions.
[2025-06-03 20:11:14] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
// Phase 1: matrix 944 rows 516 cols
[2025-06-03 20:11:14] [INFO ] Computed 42 invariants in 15 ms
[2025-06-03 20:11:14] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:11:23] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:11:23] [INFO ] Deduced a trap composed of 72 places in 89 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:11:23] [INFO ] Deduced a trap composed of 72 places in 77 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:11:23] [INFO ] Deduced a trap composed of 72 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-03 20:11:24] [INFO ] Deduced a trap composed of 72 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-03 20:11:24] [INFO ] Deduced a trap composed of 72 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-03 20:11:24] [INFO ] Deduced a trap composed of 72 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-03 20:11:24] [INFO ] Deduced a trap composed of 37 places in 160 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:11:25] [INFO ] Deduced a trap composed of 241 places in 296 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:11:25] [INFO ] Deduced a trap composed of 121 places in 243 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:11:33] [INFO ] Deduced a trap composed of 233 places in 265 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:11:34] [INFO ] Deduced a trap composed of 246 places in 268 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:11:35] [INFO ] Deduced a trap composed of 86 places in 261 ms of which 56 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/1460 variables, and 53 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/1460 variables, and 53 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40560ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 40562ms
[2025-06-03 20:11:55] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 20:11:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 20:11:56] [INFO ] Implicit Places using invariants in 1246 ms returned []
[2025-06-03 20:11:56] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 20:11:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 20:11:56] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 20:12:02] [INFO ] Implicit Places using invariants and state equation in 6241 ms returned []
Implicit Place search using SMT with State Equation took 7491 ms to find 0 implicit places.
Running 954 sub problems to find dead transitions.
[2025-06-03 20:12:02] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 20:12:02] [INFO ] Invariant cache hit.
[2025-06-03 20:12:02] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:12:11] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:12:11] [INFO ] Deduced a trap composed of 72 places in 118 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:12:12] [INFO ] Deduced a trap composed of 72 places in 93 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:12:12] [INFO ] Deduced a trap composed of 72 places in 67 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:12:12] [INFO ] Deduced a trap composed of 72 places in 76 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:12:12] [INFO ] Deduced a trap composed of 72 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:12:12] [INFO ] Deduced a trap composed of 72 places in 66 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:12:12] [INFO ] Deduced a trap composed of 37 places in 168 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:12:13] [INFO ] Deduced a trap composed of 241 places in 282 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:12:13] [INFO ] Deduced a trap composed of 121 places in 279 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:12:14] [INFO ] Deduced a trap composed of 246 places in 268 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:12:16] [INFO ] Deduced a trap composed of 86 places in 249 ms of which 51 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 12/52 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:12:28] [INFO ] Deduced a trap composed of 337 places in 314 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:12:30] [INFO ] Deduced a trap composed of 348 places in 286 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:12:33] [INFO ] Deduced a trap composed of 233 places in 289 ms of which 58 ms to minimize.
SMT process timed out in 30598ms, After SMT, problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 30600ms
Starting structural reductions in LTL mode, iteration 1 : 516/528 places, 956/968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 78680 ms. Remains : 516/528 places, 956/968 transitions.
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2), true]
Running random walk in product with property : PolyORBLF-PT-S02J06T06-LTLFireability-06
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T06-LTLFireability-06 finished in 78859 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(!p0)&&F(p1))||G(!p0))))'
Support contains 5 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 968/968 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 522 transition count 962
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 522 transition count 962
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 517 transition count 957
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 517 transition count 957
Applied a total of 22 rules in 30 ms. Remains 517 /528 variables (removed 11) and now considering 957/968 (removed 11) transitions.
Running 955 sub problems to find dead transitions.
[2025-06-03 20:12:33] [INFO ] Flow matrix only has 945 transitions (discarded 12 similar events)
// Phase 1: matrix 945 rows 517 cols
[2025-06-03 20:12:33] [INFO ] Computed 42 invariants in 10 ms
[2025-06-03 20:12:33] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/515 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 955 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/515 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 955 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:12:42] [INFO ] Deduced a trap composed of 15 places in 175 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:12:42] [INFO ] Deduced a trap composed of 37 places in 201 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:12:42] [INFO ] Deduced a trap composed of 73 places in 91 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:12:42] [INFO ] Deduced a trap composed of 72 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:12:42] [INFO ] Deduced a trap composed of 72 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-03 20:12:42] [INFO ] Deduced a trap composed of 72 places in 79 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:12:43] [INFO ] Deduced a trap composed of 72 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-03 20:12:43] [INFO ] Deduced a trap composed of 72 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:12:43] [INFO ] Deduced a trap composed of 247 places in 292 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:12:44] [INFO ] Deduced a trap composed of 122 places in 239 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:12:46] [INFO ] Deduced a trap composed of 87 places in 247 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:12:48] [INFO ] Deduced a trap composed of 42 places in 260 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:12:49] [INFO ] Deduced a trap composed of 242 places in 280 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:12:50] [INFO ] Deduced a trap composed of 267 places in 410 ms of which 94 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 515/1462 variables, and 54 constraints, problems are : Problem set: 0 solved, 955 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/517 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 955/955 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 955 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/515 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 955 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/515 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 955 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/515 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 955 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 515/1462 variables, and 54 constraints, problems are : Problem set: 0 solved, 955 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/517 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/955 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40546ms problems are : Problem set: 0 solved, 955 unsolved
Search for dead transitions found 0 dead transitions in 40547ms
[2025-06-03 20:13:13] [INFO ] Flow matrix only has 945 transitions (discarded 12 similar events)
[2025-06-03 20:13:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 20:13:15] [INFO ] Implicit Places using invariants in 1188 ms returned []
[2025-06-03 20:13:15] [INFO ] Flow matrix only has 945 transitions (discarded 12 similar events)
[2025-06-03 20:13:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 20:13:15] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 20:13:24] [INFO ] Implicit Places using invariants and state equation in 8961 ms returned []
Implicit Place search using SMT with State Equation took 10169 ms to find 0 implicit places.
Running 955 sub problems to find dead transitions.
[2025-06-03 20:13:24] [INFO ] Flow matrix only has 945 transitions (discarded 12 similar events)
[2025-06-03 20:13:24] [INFO ] Invariant cache hit.
[2025-06-03 20:13:24] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/515 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 955 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/515 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 955 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:13:33] [INFO ] Deduced a trap composed of 15 places in 186 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:13:33] [INFO ] Deduced a trap composed of 72 places in 114 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:13:33] [INFO ] Deduced a trap composed of 73 places in 86 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:13:33] [INFO ] Deduced a trap composed of 72 places in 108 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:13:33] [INFO ] Deduced a trap composed of 72 places in 71 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:13:33] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:13:33] [INFO ] Deduced a trap composed of 72 places in 74 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:13:34] [INFO ] Deduced a trap composed of 247 places in 285 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:13:34] [INFO ] Deduced a trap composed of 37 places in 154 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:13:35] [INFO ] Deduced a trap composed of 122 places in 286 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:13:39] [INFO ] Deduced a trap composed of 42 places in 247 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:13:40] [INFO ] Deduced a trap composed of 242 places in 294 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:13:40] [INFO ] Deduced a trap composed of 233 places in 283 ms of which 59 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/515 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 955 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:13:52] [INFO ] Deduced a trap composed of 87 places in 249 ms of which 54 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 515/1462 variables, and 54 constraints, problems are : Problem set: 0 solved, 955 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/517 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 955/955 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 955 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/515 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 955 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/515 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 955 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/515 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 955 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 515/1462 variables, and 54 constraints, problems are : Problem set: 0 solved, 955 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/517 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/955 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60534ms problems are : Problem set: 0 solved, 955 unsolved
Search for dead transitions found 0 dead transitions in 60538ms
Starting structural reductions in LTL mode, iteration 1 : 517/528 places, 957/968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 111288 ms. Remains : 517/528 places, 957/968 transitions.
Stuttering acceptance computed with spot in 122 ms :[p0, p0, (AND (NOT p1) p0)]
Running random walk in product with property : PolyORBLF-PT-S02J06T06-LTLFireability-09
Product exploration explored 100000 steps with 50000 reset in 357 ms.
Product exploration explored 100000 steps with 50000 reset in 401 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 14 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-PT-S02J06T06-LTLFireability-09 finished in 112209 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(((F((!p0&&G(p1)))&&G(p2))||G((F(!p0)&&F(G(p1)))))))'
Support contains 6 out of 528 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 528/528 places, 968/968 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 528 transition count 916
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 104 place count 476 transition count 916
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 59 Pre rules applied. Total rules applied 104 place count 476 transition count 857
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 222 place count 417 transition count 857
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 226 place count 413 transition count 853
Iterating global reduction 2 with 4 rules applied. Total rules applied 230 place count 413 transition count 853
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 324 place count 366 transition count 806
Applied a total of 324 rules in 48 ms. Remains 366 /528 variables (removed 162) and now considering 806/968 (removed 162) transitions.
Running 804 sub problems to find dead transitions.
[2025-06-03 20:14:25] [INFO ] Flow matrix only has 794 transitions (discarded 12 similar events)
// Phase 1: matrix 794 rows 366 cols
[2025-06-03 20:14:25] [INFO ] Computed 42 invariants in 13 ms
[2025-06-03 20:14:25] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 804 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 804 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:14:31] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:14:31] [INFO ] Deduced a trap composed of 46 places in 72 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:14:31] [INFO ] Deduced a trap composed of 47 places in 73 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:14:31] [INFO ] Deduced a trap composed of 49 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-03 20:14:32] [INFO ] Deduced a trap composed of 98 places in 212 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:14:32] [INFO ] Deduced a trap composed of 117 places in 233 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:14:32] [INFO ] Deduced a trap composed of 48 places in 64 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:14:32] [INFO ] Deduced a trap composed of 46 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-03 20:14:32] [INFO ] Deduced a trap composed of 46 places in 60 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:14:32] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:14:33] [INFO ] Deduced a trap composed of 123 places in 204 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:14:35] [INFO ] Deduced a trap composed of 123 places in 198 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:14:36] [INFO ] Deduced a trap composed of 129 places in 214 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:14:37] [INFO ] Deduced a trap composed of 28 places in 180 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:14:37] [INFO ] Deduced a trap composed of 57 places in 210 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:14:40] [INFO ] Deduced a trap composed of 121 places in 210 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:14:40] [INFO ] Deduced a trap composed of 131 places in 199 ms of which 41 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 804 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 364/1160 variables, and 57 constraints, problems are : Problem set: 0 solved, 804 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/366 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 804/804 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 804 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 804 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 804 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 804 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:14:56] [INFO ] Deduced a trap composed of 118 places in 213 ms of which 48 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 364/1160 variables, and 58 constraints, problems are : Problem set: 0 solved, 804 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/366 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/804 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40504ms problems are : Problem set: 0 solved, 804 unsolved
Search for dead transitions found 0 dead transitions in 40506ms
[2025-06-03 20:15:06] [INFO ] Flow matrix only has 794 transitions (discarded 12 similar events)
[2025-06-03 20:15:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 20:15:07] [INFO ] Implicit Places using invariants in 1276 ms returned []
[2025-06-03 20:15:07] [INFO ] Flow matrix only has 794 transitions (discarded 12 similar events)
[2025-06-03 20:15:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 20:15:07] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 20:15:12] [INFO ] Implicit Places using invariants and state equation in 4629 ms returned []
Implicit Place search using SMT with State Equation took 5930 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 20:15:12] [INFO ] Redundant transitions in 9 ms returned []
Running 804 sub problems to find dead transitions.
[2025-06-03 20:15:12] [INFO ] Flow matrix only has 794 transitions (discarded 12 similar events)
[2025-06-03 20:15:12] [INFO ] Invariant cache hit.
[2025-06-03 20:15:12] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 804 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 804 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:15:18] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:15:18] [INFO ] Deduced a trap composed of 46 places in 87 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:15:18] [INFO ] Deduced a trap composed of 47 places in 65 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:15:18] [INFO ] Deduced a trap composed of 46 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:15:18] [INFO ] Deduced a trap composed of 49 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-03 20:15:18] [INFO ] Deduced a trap composed of 121 places in 213 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:15:18] [INFO ] Deduced a trap composed of 46 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-03 20:15:19] [INFO ] Deduced a trap composed of 48 places in 55 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:15:19] [INFO ] Deduced a trap composed of 123 places in 190 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:15:19] [INFO ] Deduced a trap composed of 25 places in 130 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:15:20] [INFO ] Deduced a trap composed of 28 places in 191 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:15:20] [INFO ] Deduced a trap composed of 57 places in 196 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:15:22] [INFO ] Deduced a trap composed of 218 places in 204 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:15:23] [INFO ] Deduced a trap composed of 123 places in 200 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:15:23] [INFO ] Deduced a trap composed of 129 places in 198 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:15:26] [INFO ] Deduced a trap composed of 131 places in 183 ms of which 31 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 804 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:15:34] [INFO ] Deduced a trap composed of 127 places in 201 ms of which 42 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/364 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 804 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 364/1160 variables, and 57 constraints, problems are : Problem set: 0 solved, 804 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/366 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 804/804 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 804 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 804 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 804 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 804 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:15:54] [INFO ] Deduced a trap composed of 118 places in 210 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:15:54] [INFO ] Deduced a trap composed of 208 places in 183 ms of which 35 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/364 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 804 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 364/1160 variables, and 59 constraints, problems are : Problem set: 0 solved, 804 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/366 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/804 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60460ms problems are : Problem set: 0 solved, 804 unsolved
Search for dead transitions found 0 dead transitions in 60461ms
Starting structural reductions in SI_LTL mode, iteration 1 : 366/528 places, 806/968 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 106972 ms. Remains : 366/528 places, 806/968 transitions.
Stuttering acceptance computed with spot in 277 ms :[(OR (NOT p1) p0), (NOT p1), p0, (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (AND (NOT p1) p0), p0]
Running random walk in product with property : PolyORBLF-PT-S02J06T06-LTLFireability-10
Stuttering criterion allowed to conclude after 701 steps with 1 reset in 7 ms.
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T06-LTLFireability-10 finished in 107278 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(p0))'
Support contains 2 out of 528 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 528/528 places, 968/968 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 528 transition count 914
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 474 transition count 914
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 108 place count 474 transition count 854
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 228 place count 414 transition count 854
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 231 place count 411 transition count 851
Iterating global reduction 2 with 3 rules applied. Total rules applied 234 place count 411 transition count 851
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 330 place count 363 transition count 803
Applied a total of 330 rules in 56 ms. Remains 363 /528 variables (removed 165) and now considering 803/968 (removed 165) transitions.
Running 801 sub problems to find dead transitions.
[2025-06-03 20:16:12] [INFO ] Flow matrix only has 791 transitions (discarded 12 similar events)
// Phase 1: matrix 791 rows 363 cols
[2025-06-03 20:16:12] [INFO ] Computed 42 invariants in 13 ms
[2025-06-03 20:16:12] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/361 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 801 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:16:19] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:16:19] [INFO ] Deduced a trap composed of 46 places in 84 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:16:19] [INFO ] Deduced a trap composed of 46 places in 67 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:16:19] [INFO ] Deduced a trap composed of 47 places in 63 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:16:19] [INFO ] Deduced a trap composed of 47 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-03 20:16:19] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:16:19] [INFO ] Deduced a trap composed of 119 places in 201 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:16:19] [INFO ] Deduced a trap composed of 46 places in 200 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:16:20] [INFO ] Deduced a trap composed of 120 places in 194 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:16:21] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:16:22] [INFO ] Deduced a trap composed of 26 places in 180 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:16:23] [INFO ] Deduced a trap composed of 55 places in 189 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:16:25] [INFO ] Deduced a trap composed of 216 places in 212 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:16:26] [INFO ] Deduced a trap composed of 125 places in 201 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:16:27] [INFO ] Deduced a trap composed of 95 places in 203 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:16:27] [INFO ] Deduced a trap composed of 128 places in 191 ms of which 31 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 801 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 9.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 9.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 4.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 (/ 1.0 3.0))
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 1.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 1.0)
(s216 0.0)
(s217 0.0)
(s218 1.0)
(s219 1.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 1.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 1.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 6.0)
(s274 6.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 (/ 1.0 3.0))
(s287 1.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 (/ 2.0 3.0))
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 1.0)
(s329 1.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 1.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 1.0)
(s346 0.0)
(s347 0.0)
(s348 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 361/1154 variables, and 56 constraints, problems are : Problem set: 0 solved, 801 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/363 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 801/801 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 801 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/361 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 801 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 361/1154 variables, and 56 constraints, problems are : Problem set: 0 solved, 801 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/363 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/801 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40519ms problems are : Problem set: 0 solved, 801 unsolved
Search for dead transitions found 0 dead transitions in 40521ms
[2025-06-03 20:16:53] [INFO ] Flow matrix only has 791 transitions (discarded 12 similar events)
[2025-06-03 20:16:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 20:16:54] [INFO ] Implicit Places using invariants in 1313 ms returned []
[2025-06-03 20:16:54] [INFO ] Flow matrix only has 791 transitions (discarded 12 similar events)
[2025-06-03 20:16:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 20:16:55] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 20:17:00] [INFO ] Implicit Places using invariants and state equation in 5870 ms returned []
Implicit Place search using SMT with State Equation took 7187 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 20:17:00] [INFO ] Redundant transitions in 10 ms returned []
Running 801 sub problems to find dead transitions.
[2025-06-03 20:17:00] [INFO ] Flow matrix only has 791 transitions (discarded 12 similar events)
[2025-06-03 20:17:00] [INFO ] Invariant cache hit.
[2025-06-03 20:17:00] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/361 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 801 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:17:06] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:17:06] [INFO ] Deduced a trap composed of 46 places in 97 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:17:06] [INFO ] Deduced a trap composed of 47 places in 77 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:17:06] [INFO ] Deduced a trap composed of 47 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-03 20:17:07] [INFO ] Deduced a trap composed of 95 places in 217 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:17:07] [INFO ] Deduced a trap composed of 47 places in 320 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:17:07] [INFO ] Deduced a trap composed of 114 places in 226 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:17:07] [INFO ] Deduced a trap composed of 46 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:17:07] [INFO ] Deduced a trap composed of 25 places in 141 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:17:08] [INFO ] Deduced a trap composed of 46 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-03 20:17:10] [INFO ] Deduced a trap composed of 120 places in 209 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:17:11] [INFO ] Deduced a trap composed of 26 places in 212 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:17:11] [INFO ] Deduced a trap composed of 55 places in 202 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:17:14] [INFO ] Deduced a trap composed of 206 places in 200 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:17:15] [INFO ] Deduced a trap composed of 119 places in 253 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:17:15] [INFO ] Deduced a trap composed of 128 places in 182 ms of which 31 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 801 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:17:23] [INFO ] Deduced a trap composed of 125 places in 209 ms of which 40 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 801 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 361/1154 variables, and 57 constraints, problems are : Problem set: 0 solved, 801 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/363 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 801/801 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 801 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/361 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 801 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:17:44] [INFO ] Deduced a trap composed of 216 places in 191 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:17:58] [INFO ] Deduced a trap composed of 130 places in 238 ms of which 61 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 801 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 361/1154 variables, and 59 constraints, problems are : Problem set: 0 solved, 801 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/363 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/801 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60551ms problems are : Problem set: 0 solved, 801 unsolved
Search for dead transitions found 0 dead transitions in 60553ms
Starting structural reductions in SI_LTL mode, iteration 1 : 363/528 places, 803/968 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 108341 ms. Remains : 363/528 places, 803/968 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J06T06-LTLFireability-11
Stuttering criterion allowed to conclude after 162 steps with 0 reset in 3 ms.
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T06-LTLFireability-11 finished in 108400 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((p0||(p1&&X(p2)))))'
Support contains 5 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 968/968 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 522 transition count 962
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 522 transition count 962
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 516 transition count 956
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 516 transition count 956
Applied a total of 24 rules in 24 ms. Remains 516 /528 variables (removed 12) and now considering 956/968 (removed 12) transitions.
Running 954 sub problems to find dead transitions.
[2025-06-03 20:18:01] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
// Phase 1: matrix 944 rows 516 cols
[2025-06-03 20:18:01] [INFO ] Computed 42 invariants in 20 ms
[2025-06-03 20:18:01] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:18:10] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:18:10] [INFO ] Deduced a trap composed of 72 places in 84 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:18:10] [INFO ] Deduced a trap composed of 72 places in 82 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:18:10] [INFO ] Deduced a trap composed of 72 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-03 20:18:10] [INFO ] Deduced a trap composed of 72 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-03 20:18:11] [INFO ] Deduced a trap composed of 72 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-03 20:18:11] [INFO ] Deduced a trap composed of 72 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-03 20:18:11] [INFO ] Deduced a trap composed of 37 places in 160 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:18:12] [INFO ] Deduced a trap composed of 241 places in 299 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:18:12] [INFO ] Deduced a trap composed of 121 places in 240 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:18:19] [INFO ] Deduced a trap composed of 233 places in 278 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:18:21] [INFO ] Deduced a trap composed of 246 places in 290 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:18:21] [INFO ] Deduced a trap composed of 86 places in 254 ms of which 54 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/1460 variables, and 53 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/1460 variables, and 53 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40559ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 40561ms
[2025-06-03 20:18:41] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 20:18:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 20:18:42] [INFO ] Implicit Places using invariants in 955 ms returned []
[2025-06-03 20:18:42] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 20:18:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 20:18:43] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 20:18:50] [INFO ] Implicit Places using invariants and state equation in 7587 ms returned []
Implicit Place search using SMT with State Equation took 8546 ms to find 0 implicit places.
Running 954 sub problems to find dead transitions.
[2025-06-03 20:18:50] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 20:18:50] [INFO ] Invariant cache hit.
[2025-06-03 20:18:50] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:18:59] [INFO ] Deduced a trap composed of 15 places in 161 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:18:59] [INFO ] Deduced a trap composed of 72 places in 104 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:18:59] [INFO ] Deduced a trap composed of 72 places in 79 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:18:59] [INFO ] Deduced a trap composed of 72 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-03 20:18:59] [INFO ] Deduced a trap composed of 72 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-03 20:18:59] [INFO ] Deduced a trap composed of 72 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-03 20:19:00] [INFO ] Deduced a trap composed of 72 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-03 20:19:00] [INFO ] Deduced a trap composed of 37 places in 156 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:19:01] [INFO ] Deduced a trap composed of 241 places in 282 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:19:01] [INFO ] Deduced a trap composed of 121 places in 259 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:19:02] [INFO ] Deduced a trap composed of 246 places in 256 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:19:03] [INFO ] Deduced a trap composed of 86 places in 230 ms of which 50 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 12/52 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:19:16] [INFO ] Deduced a trap composed of 337 places in 283 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:19:18] [INFO ] Deduced a trap composed of 348 places in 307 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:19:20] [INFO ] Deduced a trap composed of 233 places in 273 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:19:21] [INFO ] Deduced a trap composed of 266 places in 282 ms of which 89 ms to minimize.
SMT process timed out in 30673ms, After SMT, problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 30677ms
Starting structural reductions in LTL mode, iteration 1 : 516/528 places, 956/968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 79816 ms. Remains : 516/528 places, 956/968 transitions.
Stuttering acceptance computed with spot in 117 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : PolyORBLF-PT-S02J06T06-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T06-LTLFireability-12 finished in 79957 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((p0||X(p0)))&&G((p0||F(p1)))))))'
Support contains 2 out of 528 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 528/528 places, 968/968 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 522 transition count 962
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 522 transition count 962
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 516 transition count 956
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 516 transition count 956
Applied a total of 24 rules in 22 ms. Remains 516 /528 variables (removed 12) and now considering 956/968 (removed 12) transitions.
Running 954 sub problems to find dead transitions.
[2025-06-03 20:19:21] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 20:19:21] [INFO ] Invariant cache hit.
[2025-06-03 20:19:21] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:19:30] [INFO ] Deduced a trap composed of 15 places in 173 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:19:30] [INFO ] Deduced a trap composed of 72 places in 113 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:19:30] [INFO ] Deduced a trap composed of 72 places in 86 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:19:30] [INFO ] Deduced a trap composed of 72 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-03 20:19:30] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:19:30] [INFO ] Deduced a trap composed of 72 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-03 20:19:30] [INFO ] Deduced a trap composed of 72 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-03 20:19:31] [INFO ] Deduced a trap composed of 37 places in 154 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:19:31] [INFO ] Deduced a trap composed of 241 places in 295 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:19:32] [INFO ] Deduced a trap composed of 121 places in 273 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:19:33] [INFO ] Deduced a trap composed of 246 places in 276 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:19:34] [INFO ] Deduced a trap composed of 86 places in 246 ms of which 50 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/1460 variables, and 52 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 12/52 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:19:58] [INFO ] Deduced a trap composed of 233 places in 294 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:19:59] [INFO ] Deduced a trap composed of 266 places in 273 ms of which 71 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/1460 variables, and 54 constraints, problems are : Problem set: 0 solved, 954 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40479ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 40481ms
[2025-06-03 20:20:01] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 20:20:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 20:20:03] [INFO ] Implicit Places using invariants in 1299 ms returned []
[2025-06-03 20:20:03] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 20:20:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 20:20:03] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 20:20:09] [INFO ] Implicit Places using invariants and state equation in 6440 ms returned []
Implicit Place search using SMT with State Equation took 7761 ms to find 0 implicit places.
Running 954 sub problems to find dead transitions.
[2025-06-03 20:20:09] [INFO ] Flow matrix only has 944 transitions (discarded 12 similar events)
[2025-06-03 20:20:09] [INFO ] Invariant cache hit.
[2025-06-03 20:20:09] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:20:18] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:20:18] [INFO ] Deduced a trap composed of 72 places in 116 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:20:18] [INFO ] Deduced a trap composed of 72 places in 79 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:20:18] [INFO ] Deduced a trap composed of 72 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-03 20:20:18] [INFO ] Deduced a trap composed of 72 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-03 20:20:19] [INFO ] Deduced a trap composed of 72 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-03 20:20:19] [INFO ] Deduced a trap composed of 72 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-03 20:20:19] [INFO ] Deduced a trap composed of 37 places in 157 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:20:20] [INFO ] Deduced a trap composed of 241 places in 270 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:20:20] [INFO ] Deduced a trap composed of 121 places in 286 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:20:21] [INFO ] Deduced a trap composed of 246 places in 275 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:20:23] [INFO ] Deduced a trap composed of 86 places in 248 ms of which 51 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 12/52 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:20:35] [INFO ] Deduced a trap composed of 337 places in 267 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:20:37] [INFO ] Deduced a trap composed of 348 places in 312 ms of which 93 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/1460 variables, and 54 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:20:59] [INFO ] Deduced a trap composed of 266 places in 274 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 20:21:08] [INFO ] Deduced a trap composed of 42 places in 286 ms of which 43 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/1460 variables, and 56 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/516 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60523ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 60524ms
Starting structural reductions in LTL mode, iteration 1 : 516/528 places, 956/968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 108792 ms. Remains : 516/528 places, 956/968 transitions.
Stuttering acceptance computed with spot in 264 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), true]
Running random walk in product with property : PolyORBLF-PT-S02J06T06-LTLFireability-15
Entered a terminal (fully accepting) state of product in 2497 steps with 4 reset in 11 ms.
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T06-LTLFireability-15 finished in 109090 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)))'
[2025-06-03 20:21:10] [INFO ] Flatten gal took : 31 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16426331259215644803
[2025-06-03 20:21:10] [INFO ] Computing symmetric may disable matrix : 968 transitions.
[2025-06-03 20:21:10] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 20:21:10] [INFO ] Computing symmetric may enable matrix : 968 transitions.
[2025-06-03 20:21:10] [INFO ] Applying decomposition
[2025-06-03 20:21:10] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 20:21:10] [INFO ] Flatten gal took : 55 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/graph8876130559857003383.txt' '-o' '/tmp/graph8876130559857003383.bin' '-w' '/tmp/graph8876130559857003383.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8876130559857003383.bin' '-l' '-1' '-v' '-w' '/tmp/graph8876130559857003383.weights' '-q' '0' '-e' '0.001'
[2025-06-03 20:21:10] [INFO ] Decomposing Gal with order
[2025-06-03 20:21:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 20:21:10] [INFO ] Computing Do-Not-Accords matrix : 968 transitions.
[2025-06-03 20:21:10] [INFO ] Computation of Completed DNA matrix. took 26 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 20:21:10] [INFO ] Removed a total of 797 redundant transitions.
[2025-06-03 20:21:10] [INFO ] Built C files in 301ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16426331259215644803
Running compilation step : cd /tmp/ltsmin16426331259215644803;'/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-03 20:21:10] [INFO ] Flatten gal took : 142 ms
[2025-06-03 20:21:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 139 labels/synchronizations in 25 ms.
[2025-06-03 20:21:11] [INFO ] Time to serialize gal into /tmp/LTLFireability13692333029963993123.gal : 8 ms
[2025-06-03 20:21:11] [INFO ] Time to serialize properties into /tmp/LTLFireability14623984202357179884.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/LTLFireability13692333029963993123.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14623984202357179884.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...278
Read 1 LTL properties
Checking formula 0 : !((G(F("((((i14.u85.QueueJobE_4<1)&&(i14.u85.QueueJobE_1<1))&&((i14.u85.QueueJobE_2<1)&&(i14.u85.QueueJobE_6<1)))&&((i14.u85.QueueJobE...192
Formula 0 simplified : FG!"((((i14.u85.QueueJobE_4<1)&&(i14.u85.QueueJobE_1<1))&&((i14.u85.QueueJobE_2<1)&&(i14.u85.QueueJobE_6<1)))&&((i14.u85.QueueJobE_3...186
Compilation finished in 3040 ms.
Running link step : cd /tmp/ltsmin16426331259215644803;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin16426331259215644803;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t18, t37, t56, t64, t97, t121, t133, t153, t183, t265, t297, t298, t302, t321, t348, t366, t3...1296
Computing Next relation with stutter on 1260 deadlock states
Detected timeout of ITS tools.
[2025-06-03 20:50:36] [INFO ] Flatten gal took : 161 ms
[2025-06-03 20:50:36] [INFO ] Time to serialize gal into /tmp/LTLFireability5105539598528098375.gal : 26 ms
[2025-06-03 20:50:36] [INFO ] Time to serialize properties into /tmp/LTLFireability13133755325974864086.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5105539598528098375.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13133755325974864086.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...298
Read 1 LTL properties
Checking formula 0 : !((G(F("((((QueueJobE_4<1)&&(QueueJobE_1<1))&&((QueueJobE_2<1)&&(QueueJobE_6<1)))&&((QueueJobE_3<1)&&(QueueJobE_5<1)))"))))
Formula 0 simplified : FG!"((((QueueJobE_4<1)&&(QueueJobE_1<1))&&((QueueJobE_2<1)&&(QueueJobE_6<1)))&&((QueueJobE_3<1)&&(QueueJobE_5<1)))"

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.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="PolyORBLF-PT-S02J06T06"
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 PolyORBLF-PT-S02J06T06, 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 r156-tall-174881254000436"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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