fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r072-tall-174860066900140
Last Updated
June 24, 2025

About the Execution of ITS-Tools for DLCround-PT-04b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 934820.00 0.00 0.00 FFFTFFFFFFFFFFTF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 984K
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 547K 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 DLCround-PT-04b-LTLFireability-00
FORMULA_NAME DLCround-PT-04b-LTLFireability-01
FORMULA_NAME DLCround-PT-04b-LTLFireability-02
FORMULA_NAME DLCround-PT-04b-LTLFireability-03
FORMULA_NAME DLCround-PT-04b-LTLFireability-04
FORMULA_NAME DLCround-PT-04b-LTLFireability-05
FORMULA_NAME DLCround-PT-04b-LTLFireability-06
FORMULA_NAME DLCround-PT-04b-LTLFireability-07
FORMULA_NAME DLCround-PT-04b-LTLFireability-08
FORMULA_NAME DLCround-PT-04b-LTLFireability-09
FORMULA_NAME DLCround-PT-04b-LTLFireability-10
FORMULA_NAME DLCround-PT-04b-LTLFireability-11
FORMULA_NAME DLCround-PT-04b-LTLFireability-12
FORMULA_NAME DLCround-PT-04b-LTLFireability-13
FORMULA_NAME DLCround-PT-04b-LTLFireability-14
FORMULA_NAME DLCround-PT-04b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748665130134

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-04b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-31 04:18:51] [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-05-31 04:18:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 04:18:51] [INFO ] Load time of PNML (sax parser for PT used): 141 ms
[2025-05-31 04:18:51] [INFO ] Transformed 1680 places.
[2025-05-31 04:18:51] [INFO ] Transformed 2364 transitions.
[2025-05-31 04:18:51] [INFO ] Found NUPN structural information;
[2025-05-31 04:18:51] [INFO ] Parsed PT model containing 1680 places and 2364 transitions and 6156 arcs in 250 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA DLCround-PT-04b-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 1680 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1680/1680 places, 2364/2364 transitions.
Discarding 279 places :
Symmetric choice reduction at 0 with 279 rule applications. Total rules 279 place count 1401 transition count 2085
Iterating global reduction 0 with 279 rules applied. Total rules applied 558 place count 1401 transition count 2085
Discarding 211 places :
Symmetric choice reduction at 0 with 211 rule applications. Total rules 769 place count 1190 transition count 1874
Iterating global reduction 0 with 211 rules applied. Total rules applied 980 place count 1190 transition count 1874
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 985 place count 1190 transition count 1869
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 1026 place count 1149 transition count 1804
Iterating global reduction 1 with 41 rules applied. Total rules applied 1067 place count 1149 transition count 1804
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 1095 place count 1121 transition count 1776
Iterating global reduction 1 with 28 rules applied. Total rules applied 1123 place count 1121 transition count 1776
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 1126 place count 1121 transition count 1773
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1138 place count 1109 transition count 1761
Iterating global reduction 2 with 12 rules applied. Total rules applied 1150 place count 1109 transition count 1761
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 1160 place count 1099 transition count 1751
Iterating global reduction 2 with 10 rules applied. Total rules applied 1170 place count 1099 transition count 1751
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 1180 place count 1089 transition count 1741
Iterating global reduction 2 with 10 rules applied. Total rules applied 1190 place count 1089 transition count 1741
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 1198 place count 1081 transition count 1733
Iterating global reduction 2 with 8 rules applied. Total rules applied 1206 place count 1081 transition count 1733
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1211 place count 1076 transition count 1728
Iterating global reduction 2 with 5 rules applied. Total rules applied 1216 place count 1076 transition count 1728
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1221 place count 1071 transition count 1723
Iterating global reduction 2 with 5 rules applied. Total rules applied 1226 place count 1071 transition count 1723
Applied a total of 1226 rules in 690 ms. Remains 1071 /1680 variables (removed 609) and now considering 1723/2364 (removed 641) transitions.
// Phase 1: matrix 1723 rows 1071 cols
[2025-05-31 04:18:52] [INFO ] Computed 69 invariants in 36 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:18:53] [INFO ] Implicit Places using invariants in 554 ms returned []
[2025-05-31 04:18:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:18:53] [INFO ] Implicit Places using invariants and state equation in 852 ms returned []
Implicit Place search using SMT with State Equation took 1440 ms to find 0 implicit places.
Running 1722 sub problems to find dead transitions.
[2025-05-31 04:18:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1070/2794 variables, and 0 constraints, problems are : Problem set: 0 solved, 1722 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 0/69 constraints, State Equation: 0/1071 constraints, PredecessorRefiner: 1722/1722 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1722 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 1070/2794 variables, and 0 constraints, problems are : Problem set: 0 solved, 1722 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 0/69 constraints, State Equation: 0/1071 constraints, PredecessorRefiner: 0/1722 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60632ms problems are : Problem set: 0 solved, 1722 unsolved
Search for dead transitions found 0 dead transitions in 60650ms
Starting structural reductions in LTL mode, iteration 1 : 1071/1680 places, 1723/2364 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62809 ms. Remains : 1071/1680 places, 1723/2364 transitions.
Support contains 48 out of 1071 places after structural reductions.
[2025-05-31 04:19:54] [INFO ] Flatten gal took : 117 ms
[2025-05-31 04:19:54] [INFO ] Flatten gal took : 74 ms
[2025-05-31 04:19:55] [INFO ] Input system was already deterministic with 1723 transitions.
RANDOM walk for 40000 steps (8 resets) in 1532 ms. (26 steps per ms) remains 4/41 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 4/4 properties
[2025-05-31 04:19:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 431/440 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/440 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 631/1071 variables, 62/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1071 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1723/2794 variables, 1071/1140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2794 variables, 0/1140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/2794 variables, 0/1140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2794/2794 variables, and 1140 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1451 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, State Equation: 1071/1071 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 431/440 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/440 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 631/1071 variables, 62/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1071 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1723/2794 variables, 1071/1140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2794 variables, 4/1144 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 04:19:58] [INFO ] Deduced a trap along path composed of 5 places in 36 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2794 variables, 1/1145 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2794 variables, 0/1145 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/2794 variables, 0/1145 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2794/2794 variables, and 1145 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2187 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, State Equation: 1071/1071 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 3654ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 411 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=205 )
Parikh walk visited 4 properties in 699 ms.
FORMULA DLCround-PT-04b-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 149 stabilizing places and 149 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 1071 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1071/1071 places, 1723/1723 transitions.
Graph (trivial) has 997 edges and 1071 vertex of which 290 / 1071 are part of one of the 25 SCC in 3 ms
Free SCC test removed 265 places
Ensure Unique test removed 284 transitions
Reduce isomorphic transitions removed 284 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 204 transitions
Trivial Post-agglo rules discarded 204 transitions
Performed 204 trivial Post agglomeration. Transition count delta: 204
Iterating post reduction 0 with 204 rules applied. Total rules applied 205 place count 805 transition count 1234
Reduce places removed 204 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 233 rules applied. Total rules applied 438 place count 601 transition count 1205
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 21 rules applied. Total rules applied 459 place count 582 transition count 1203
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 460 place count 581 transition count 1203
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 73 Pre rules applied. Total rules applied 460 place count 581 transition count 1130
Deduced a syphon composed of 73 places in 3 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 606 place count 508 transition count 1130
Discarding 44 places :
Symmetric choice reduction at 4 with 44 rule applications. Total rules 650 place count 464 transition count 948
Iterating global reduction 4 with 44 rules applied. Total rules applied 694 place count 464 transition count 948
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 697 place count 464 transition count 945
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 697 place count 464 transition count 939
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 709 place count 458 transition count 939
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 710 place count 457 transition count 931
Iterating global reduction 5 with 1 rules applied. Total rules applied 711 place count 457 transition count 931
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 712 place count 457 transition count 930
Performed 169 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 169 places in 1 ms
Reduce places removed 169 places and 0 transitions.
Iterating global reduction 6 with 338 rules applied. Total rules applied 1050 place count 288 transition count 757
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1056 place count 288 transition count 751
Discarding 16 places :
Symmetric choice reduction at 7 with 16 rule applications. Total rules 1072 place count 272 transition count 638
Iterating global reduction 7 with 16 rules applied. Total rules applied 1088 place count 272 transition count 638
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 1101 place count 272 transition count 625
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 1105 place count 270 transition count 623
Performed 17 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 8 with 34 rules applied. Total rules applied 1139 place count 253 transition count 725
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1140 place count 253 transition count 724
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 1144 place count 249 transition count 678
Iterating global reduction 9 with 4 rules applied. Total rules applied 1148 place count 249 transition count 678
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 9 with 21 rules applied. Total rules applied 1169 place count 249 transition count 657
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 10 with 23 rules applied. Total rules applied 1192 place count 249 transition count 634
Discarding 8 places :
Symmetric choice reduction at 10 with 8 rule applications. Total rules 1200 place count 241 transition count 618
Iterating global reduction 10 with 8 rules applied. Total rules applied 1208 place count 241 transition count 618
Discarding 8 places :
Symmetric choice reduction at 10 with 8 rule applications. Total rules 1216 place count 233 transition count 552
Iterating global reduction 10 with 8 rules applied. Total rules applied 1224 place count 233 transition count 552
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 1232 place count 233 transition count 544
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1233 place count 232 transition count 543
Applied a total of 1233 rules in 246 ms. Remains 232 /1071 variables (removed 839) and now considering 543/1723 (removed 1180) transitions.
[2025-05-31 04:20:01] [INFO ] Flow matrix only has 522 transitions (discarded 21 similar events)
// Phase 1: matrix 522 rows 232 cols
[2025-05-31 04:20:01] [INFO ] Computed 69 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:20:01] [INFO ] Implicit Places using invariants in 105 ms returned []
[2025-05-31 04:20:01] [INFO ] Flow matrix only has 522 transitions (discarded 21 similar events)
[2025-05-31 04:20:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:20:01] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-05-31 04:20:01] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 04:20:01] [INFO ] Redundant transitions in 27 ms returned []
Running 492 sub problems to find dead transitions.
[2025-05-31 04:20:01] [INFO ] Flow matrix only has 522 transitions (discarded 21 similar events)
[2025-05-31 04:20:01] [INFO ] Invariant cache hit.
[2025-05-31 04:20:01] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/230 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 2 (OVERLAPS) 2/232 variables, 61/69 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 4 (OVERLAPS) 521/753 variables, 232/301 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/753 variables, 40/341 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/753 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 492 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 753/754 variables, and 341 constraints, problems are : Problem set: 0 solved, 492 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, State Equation: 232/232 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 492/492 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 492 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/230 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 2 (OVERLAPS) 2/232 variables, 61/69 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 4 (OVERLAPS) 521/753 variables, 232/301 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/753 variables, 40/341 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/753 variables, 492/833 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/753 variables, 0/833 constraints. Problems are: Problem set: 0 solved, 492 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 753/754 variables, and 833 constraints, problems are : Problem set: 0 solved, 492 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, State Equation: 232/232 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 492/492 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60238ms problems are : Problem set: 0 solved, 492 unsolved
Search for dead transitions found 0 dead transitions in 60240ms
Starting structural reductions in SI_LTL mode, iteration 1 : 232/1071 places, 543/1723 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60854 ms. Remains : 232/1071 places, 543/1723 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p0)]
Running random walk in product with property : DLCround-PT-04b-LTLFireability-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA DLCround-PT-04b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-04b-LTLFireability-00 finished in 61081 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F(G((X(p0)||F(p1))))||G(p2))))))'
Support contains 4 out of 1071 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1071/1071 places, 1723/1723 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1050 transition count 1695
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1050 transition count 1695
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 57 place count 1035 transition count 1679
Iterating global reduction 0 with 15 rules applied. Total rules applied 72 place count 1035 transition count 1679
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 80 place count 1027 transition count 1664
Iterating global reduction 0 with 8 rules applied. Total rules applied 88 place count 1027 transition count 1664
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 89 place count 1027 transition count 1663
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 93 place count 1023 transition count 1659
Iterating global reduction 1 with 4 rules applied. Total rules applied 97 place count 1023 transition count 1659
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 100 place count 1020 transition count 1656
Iterating global reduction 1 with 3 rules applied. Total rules applied 103 place count 1020 transition count 1656
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 104 place count 1019 transition count 1655
Iterating global reduction 1 with 1 rules applied. Total rules applied 105 place count 1019 transition count 1655
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 106 place count 1018 transition count 1654
Iterating global reduction 1 with 1 rules applied. Total rules applied 107 place count 1018 transition count 1654
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 108 place count 1017 transition count 1653
Iterating global reduction 1 with 1 rules applied. Total rules applied 109 place count 1017 transition count 1653
Applied a total of 109 rules in 319 ms. Remains 1017 /1071 variables (removed 54) and now considering 1653/1723 (removed 70) transitions.
// Phase 1: matrix 1653 rows 1017 cols
[2025-05-31 04:21:02] [INFO ] Computed 69 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:21:02] [INFO ] Implicit Places using invariants in 384 ms returned []
[2025-05-31 04:21:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:21:03] [INFO ] Implicit Places using invariants and state equation in 769 ms returned []
Implicit Place search using SMT with State Equation took 1157 ms to find 0 implicit places.
Running 1652 sub problems to find dead transitions.
[2025-05-31 04:21:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1016/2670 variables, and 0 constraints, problems are : Problem set: 0 solved, 1652 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/69 constraints, State Equation: 0/1017 constraints, PredecessorRefiner: 1652/1652 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1652 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1016/2670 variables, and 0 constraints, problems are : Problem set: 0 solved, 1652 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/69 constraints, State Equation: 0/1017 constraints, PredecessorRefiner: 0/1652 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60400ms problems are : Problem set: 0 solved, 1652 unsolved
Search for dead transitions found 0 dead transitions in 60405ms
Starting structural reductions in LTL mode, iteration 1 : 1017/1071 places, 1653/1723 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61887 ms. Remains : 1017/1071 places, 1653/1723 transitions.
Stuttering acceptance computed with spot in 286 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : DLCround-PT-04b-LTLFireability-01
Stuttering criterion allowed to conclude after 80795 steps with 11 reset in 362 ms.
FORMULA DLCround-PT-04b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-04b-LTLFireability-01 finished in 62566 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)&&X((p1&&X(X(X((p0||F(p2))))))))))'
Support contains 3 out of 1071 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1071/1071 places, 1723/1723 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 1049 transition count 1694
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 1049 transition count 1694
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 59 place count 1034 transition count 1678
Iterating global reduction 0 with 15 rules applied. Total rules applied 74 place count 1034 transition count 1678
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 82 place count 1026 transition count 1663
Iterating global reduction 0 with 8 rules applied. Total rules applied 90 place count 1026 transition count 1663
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 91 place count 1026 transition count 1662
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 96 place count 1021 transition count 1657
Iterating global reduction 1 with 5 rules applied. Total rules applied 101 place count 1021 transition count 1657
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 105 place count 1017 transition count 1653
Iterating global reduction 1 with 4 rules applied. Total rules applied 109 place count 1017 transition count 1653
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 111 place count 1015 transition count 1651
Iterating global reduction 1 with 2 rules applied. Total rules applied 113 place count 1015 transition count 1651
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 115 place count 1013 transition count 1649
Iterating global reduction 1 with 2 rules applied. Total rules applied 117 place count 1013 transition count 1649
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 119 place count 1011 transition count 1647
Iterating global reduction 1 with 2 rules applied. Total rules applied 121 place count 1011 transition count 1647
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 122 place count 1010 transition count 1646
Iterating global reduction 1 with 1 rules applied. Total rules applied 123 place count 1010 transition count 1646
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 124 place count 1009 transition count 1645
Iterating global reduction 1 with 1 rules applied. Total rules applied 125 place count 1009 transition count 1645
Applied a total of 125 rules in 237 ms. Remains 1009 /1071 variables (removed 62) and now considering 1645/1723 (removed 78) transitions.
// Phase 1: matrix 1645 rows 1009 cols
[2025-05-31 04:22:04] [INFO ] Computed 69 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:22:04] [INFO ] Implicit Places using invariants in 337 ms returned []
[2025-05-31 04:22:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:22:05] [INFO ] Implicit Places using invariants and state equation in 807 ms returned []
Implicit Place search using SMT with State Equation took 1146 ms to find 0 implicit places.
Running 1644 sub problems to find dead transitions.
[2025-05-31 04:22:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1008/2654 variables, and 0 constraints, problems are : Problem set: 0 solved, 1644 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/69 constraints, State Equation: 0/1009 constraints, PredecessorRefiner: 1644/1644 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1644 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1008/2654 variables, and 0 constraints, problems are : Problem set: 0 solved, 1644 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/69 constraints, State Equation: 0/1009 constraints, PredecessorRefiner: 0/1644 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60397ms problems are : Problem set: 0 solved, 1644 unsolved
Search for dead transitions found 0 dead transitions in 60403ms
Starting structural reductions in LTL mode, iteration 1 : 1009/1071 places, 1645/1723 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61793 ms. Remains : 1009/1071 places, 1645/1723 transitions.
Stuttering acceptance computed with spot in 420 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (AND (NOT p0) (NOT p2))), true, (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p2)]
Running random walk in product with property : DLCround-PT-04b-LTLFireability-02
Entered a terminal (fully accepting) state of product in 514 steps with 2 reset in 4 ms.
FORMULA DLCround-PT-04b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-04b-LTLFireability-02 finished in 62257 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||X(p1)))&&F(p2)))'
Support contains 3 out of 1071 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1071/1071 places, 1723/1723 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 1048 transition count 1693
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 1048 transition count 1693
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 62 place count 1032 transition count 1676
Iterating global reduction 0 with 16 rules applied. Total rules applied 78 place count 1032 transition count 1676
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 87 place count 1023 transition count 1660
Iterating global reduction 0 with 9 rules applied. Total rules applied 96 place count 1023 transition count 1660
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 97 place count 1023 transition count 1659
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 102 place count 1018 transition count 1654
Iterating global reduction 1 with 5 rules applied. Total rules applied 107 place count 1018 transition count 1654
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 111 place count 1014 transition count 1650
Iterating global reduction 1 with 4 rules applied. Total rules applied 115 place count 1014 transition count 1650
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 117 place count 1012 transition count 1648
Iterating global reduction 1 with 2 rules applied. Total rules applied 119 place count 1012 transition count 1648
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 121 place count 1010 transition count 1646
Iterating global reduction 1 with 2 rules applied. Total rules applied 123 place count 1010 transition count 1646
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 125 place count 1008 transition count 1644
Iterating global reduction 1 with 2 rules applied. Total rules applied 127 place count 1008 transition count 1644
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 128 place count 1007 transition count 1643
Iterating global reduction 1 with 1 rules applied. Total rules applied 129 place count 1007 transition count 1643
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 130 place count 1006 transition count 1642
Iterating global reduction 1 with 1 rules applied. Total rules applied 131 place count 1006 transition count 1642
Applied a total of 131 rules in 219 ms. Remains 1006 /1071 variables (removed 65) and now considering 1642/1723 (removed 81) transitions.
// Phase 1: matrix 1642 rows 1006 cols
[2025-05-31 04:23:06] [INFO ] Computed 69 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:23:07] [INFO ] Implicit Places using invariants in 344 ms returned []
[2025-05-31 04:23:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:23:08] [INFO ] Implicit Places using invariants and state equation in 825 ms returned []
Implicit Place search using SMT with State Equation took 1171 ms to find 0 implicit places.
Running 1641 sub problems to find dead transitions.
[2025-05-31 04:23:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1005/2648 variables, and 0 constraints, problems are : Problem set: 0 solved, 1641 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 0/69 constraints, State Equation: 0/1006 constraints, PredecessorRefiner: 1641/1641 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1641 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1005/2648 variables, and 0 constraints, problems are : Problem set: 0 solved, 1641 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 0/69 constraints, State Equation: 0/1006 constraints, PredecessorRefiner: 0/1641 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60386ms problems are : Problem set: 0 solved, 1641 unsolved
Search for dead transitions found 0 dead transitions in 60392ms
Starting structural reductions in LTL mode, iteration 1 : 1006/1071 places, 1642/1723 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61788 ms. Remains : 1006/1071 places, 1642/1723 transitions.
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DLCround-PT-04b-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 325 ms.
Product exploration explored 100000 steps with 50000 reset in 354 ms.
Computed a total of 133 stabilizing places and 133 stable transitions
Computed a total of 133 stabilizing places and 133 stable transitions
Detected a total of 133/1006 stabilizing places and 133/1642 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p2), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p2)), (X (X (NOT p0))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 19 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DLCround-PT-04b-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-04b-LTLFireability-03 finished in 62702 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(G((p0 U p1)))&&F(p2))))'
Support contains 4 out of 1071 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1071/1071 places, 1723/1723 transitions.
Graph (trivial) has 991 edges and 1071 vertex of which 276 / 1071 are part of one of the 24 SCC in 2 ms
Free SCC test removed 252 places
Ensure Unique test removed 268 transitions
Reduce isomorphic transitions removed 268 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 209 transitions
Trivial Post-agglo rules discarded 209 transitions
Performed 209 trivial Post agglomeration. Transition count delta: 209
Iterating post reduction 0 with 209 rules applied. Total rules applied 210 place count 818 transition count 1245
Reduce places removed 209 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 238 rules applied. Total rules applied 448 place count 609 transition count 1216
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 467 place count 590 transition count 1216
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 75 Pre rules applied. Total rules applied 467 place count 590 transition count 1141
Deduced a syphon composed of 75 places in 2 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 150 rules applied. Total rules applied 617 place count 515 transition count 1141
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 657 place count 475 transition count 967
Iterating global reduction 3 with 40 rules applied. Total rules applied 697 place count 475 transition count 967
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 699 place count 475 transition count 965
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 699 place count 475 transition count 959
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 711 place count 469 transition count 959
Performed 172 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 172 places in 1 ms
Reduce places removed 172 places and 0 transitions.
Iterating global reduction 4 with 344 rules applied. Total rules applied 1055 place count 297 transition count 782
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 1062 place count 297 transition count 775
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 1079 place count 280 transition count 654
Iterating global reduction 5 with 17 rules applied. Total rules applied 1096 place count 280 transition count 654
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 1110 place count 280 transition count 640
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 1116 place count 277 transition count 637
Performed 18 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 6 with 36 rules applied. Total rules applied 1152 place count 259 transition count 743
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1154 place count 259 transition count 741
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 1159 place count 254 transition count 685
Iterating global reduction 7 with 5 rules applied. Total rules applied 1164 place count 254 transition count 685
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 1185 place count 254 transition count 664
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 8 with 22 rules applied. Total rules applied 1207 place count 254 transition count 642
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 1215 place count 246 transition count 626
Iterating global reduction 8 with 8 rules applied. Total rules applied 1223 place count 246 transition count 626
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 1231 place count 238 transition count 560
Iterating global reduction 8 with 8 rules applied. Total rules applied 1239 place count 238 transition count 560
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 1247 place count 238 transition count 552
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1248 place count 238 transition count 552
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1249 place count 237 transition count 551
Applied a total of 1249 rules in 151 ms. Remains 237 /1071 variables (removed 834) and now considering 551/1723 (removed 1172) transitions.
[2025-05-31 04:24:09] [INFO ] Flow matrix only has 531 transitions (discarded 20 similar events)
// Phase 1: matrix 531 rows 237 cols
[2025-05-31 04:24:09] [INFO ] Computed 69 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:24:09] [INFO ] Implicit Places using invariants in 115 ms returned []
[2025-05-31 04:24:09] [INFO ] Flow matrix only has 531 transitions (discarded 20 similar events)
[2025-05-31 04:24:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:24:09] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-05-31 04:24:09] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 04:24:09] [INFO ] Redundant transitions in 14 ms returned []
Running 499 sub problems to find dead transitions.
[2025-05-31 04:24:09] [INFO ] Flow matrix only has 531 transitions (discarded 20 similar events)
[2025-05-31 04:24:09] [INFO ] Invariant cache hit.
[2025-05-31 04:24:09] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 2 (OVERLAPS) 2/237 variables, 61/69 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 4 (OVERLAPS) 530/767 variables, 237/306 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/767 variables, 40/346 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/767 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 499 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 767/768 variables, and 346 constraints, problems are : Problem set: 0 solved, 499 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, State Equation: 237/237 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 499/499 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 499 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 2 (OVERLAPS) 2/237 variables, 61/69 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 4 (OVERLAPS) 530/767 variables, 237/306 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/767 variables, 40/346 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/767 variables, 499/845 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/767 variables, 0/845 constraints. Problems are: Problem set: 0 solved, 499 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 767/768 variables, and 845 constraints, problems are : Problem set: 0 solved, 499 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, State Equation: 237/237 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 499/499 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60189ms problems are : Problem set: 0 solved, 499 unsolved
Search for dead transitions found 0 dead transitions in 60190ms
Starting structural reductions in SI_LTL mode, iteration 1 : 237/1071 places, 551/1723 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60739 ms. Remains : 237/1071 places, 551/1723 transitions.
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p1)]
Running random walk in product with property : DLCround-PT-04b-LTLFireability-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-04b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-04b-LTLFireability-06 finished in 60948 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 1071 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1071/1071 places, 1723/1723 transitions.
Graph (trivial) has 997 edges and 1071 vertex of which 290 / 1071 are part of one of the 25 SCC in 2 ms
Free SCC test removed 265 places
Ensure Unique test removed 284 transitions
Reduce isomorphic transitions removed 284 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 204 transitions
Trivial Post-agglo rules discarded 204 transitions
Performed 204 trivial Post agglomeration. Transition count delta: 204
Iterating post reduction 0 with 204 rules applied. Total rules applied 205 place count 805 transition count 1234
Reduce places removed 204 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 233 rules applied. Total rules applied 438 place count 601 transition count 1205
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 21 rules applied. Total rules applied 459 place count 582 transition count 1203
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 460 place count 581 transition count 1203
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 74 Pre rules applied. Total rules applied 460 place count 581 transition count 1129
Deduced a syphon composed of 74 places in 5 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 4 with 148 rules applied. Total rules applied 608 place count 507 transition count 1129
Discarding 44 places :
Symmetric choice reduction at 4 with 44 rule applications. Total rules 652 place count 463 transition count 947
Iterating global reduction 4 with 44 rules applied. Total rules applied 696 place count 463 transition count 947
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 699 place count 463 transition count 944
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 699 place count 463 transition count 938
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 711 place count 457 transition count 938
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 712 place count 456 transition count 930
Iterating global reduction 5 with 1 rules applied. Total rules applied 713 place count 456 transition count 930
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 714 place count 456 transition count 929
Performed 168 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 168 places in 0 ms
Reduce places removed 168 places and 0 transitions.
Iterating global reduction 6 with 336 rules applied. Total rules applied 1050 place count 288 transition count 757
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1056 place count 288 transition count 751
Discarding 16 places :
Symmetric choice reduction at 7 with 16 rule applications. Total rules 1072 place count 272 transition count 638
Iterating global reduction 7 with 16 rules applied. Total rules applied 1088 place count 272 transition count 638
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 1101 place count 272 transition count 625
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 1105 place count 270 transition count 623
Performed 17 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 8 with 34 rules applied. Total rules applied 1139 place count 253 transition count 725
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1140 place count 253 transition count 724
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 1144 place count 249 transition count 678
Iterating global reduction 9 with 4 rules applied. Total rules applied 1148 place count 249 transition count 678
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 9 with 21 rules applied. Total rules applied 1169 place count 249 transition count 657
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 10 with 22 rules applied. Total rules applied 1191 place count 249 transition count 635
Discarding 8 places :
Symmetric choice reduction at 10 with 8 rule applications. Total rules 1199 place count 241 transition count 619
Iterating global reduction 10 with 8 rules applied. Total rules applied 1207 place count 241 transition count 619
Discarding 8 places :
Symmetric choice reduction at 10 with 8 rule applications. Total rules 1215 place count 233 transition count 553
Iterating global reduction 10 with 8 rules applied. Total rules applied 1223 place count 233 transition count 553
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 1231 place count 233 transition count 545
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1232 place count 232 transition count 544
Applied a total of 1232 rules in 130 ms. Remains 232 /1071 variables (removed 839) and now considering 544/1723 (removed 1179) transitions.
[2025-05-31 04:25:10] [INFO ] Flow matrix only has 523 transitions (discarded 21 similar events)
// Phase 1: matrix 523 rows 232 cols
[2025-05-31 04:25:10] [INFO ] Computed 69 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:25:10] [INFO ] Implicit Places using invariants in 111 ms returned []
[2025-05-31 04:25:10] [INFO ] Flow matrix only has 523 transitions (discarded 21 similar events)
[2025-05-31 04:25:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:25:10] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-05-31 04:25:10] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 04:25:10] [INFO ] Redundant transitions in 4 ms returned []
Running 495 sub problems to find dead transitions.
[2025-05-31 04:25:10] [INFO ] Flow matrix only has 523 transitions (discarded 21 similar events)
[2025-05-31 04:25:10] [INFO ] Invariant cache hit.
[2025-05-31 04:25:10] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 495 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/230 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 495 unsolved
At refinement iteration 2 (OVERLAPS) 2/232 variables, 61/69 constraints. Problems are: Problem set: 0 solved, 495 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 495 unsolved
At refinement iteration 4 (OVERLAPS) 522/754 variables, 232/301 constraints. Problems are: Problem set: 0 solved, 495 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/754 variables, 40/341 constraints. Problems are: Problem set: 0 solved, 495 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/754 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 495 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 754/755 variables, and 341 constraints, problems are : Problem set: 0 solved, 495 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, State Equation: 232/232 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 495/495 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 495 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 495 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/230 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 495 unsolved
At refinement iteration 2 (OVERLAPS) 2/232 variables, 61/69 constraints. Problems are: Problem set: 0 solved, 495 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 495 unsolved
At refinement iteration 4 (OVERLAPS) 522/754 variables, 232/301 constraints. Problems are: Problem set: 0 solved, 495 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/754 variables, 40/341 constraints. Problems are: Problem set: 0 solved, 495 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/754 variables, 495/836 constraints. Problems are: Problem set: 0 solved, 495 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/754 variables, 0/836 constraints. Problems are: Problem set: 0 solved, 495 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 754/755 variables, and 836 constraints, problems are : Problem set: 0 solved, 495 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, State Equation: 232/232 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 495/495 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60172ms problems are : Problem set: 0 solved, 495 unsolved
Search for dead transitions found 0 dead transitions in 60173ms
Starting structural reductions in SI_LTL mode, iteration 1 : 232/1071 places, 544/1723 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60662 ms. Remains : 232/1071 places, 544/1723 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-04b-LTLFireability-07
Stuttering criterion allowed to conclude after 27 steps with 0 reset in 3 ms.
FORMULA DLCround-PT-04b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-04b-LTLFireability-07 finished in 60784 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||F(p1)) U X(p2))&&X(X(X(p3)))))))'
Support contains 5 out of 1071 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1071/1071 places, 1723/1723 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1051 transition count 1696
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1051 transition count 1696
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 55 place count 1036 transition count 1680
Iterating global reduction 0 with 15 rules applied. Total rules applied 70 place count 1036 transition count 1680
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 79 place count 1027 transition count 1664
Iterating global reduction 0 with 9 rules applied. Total rules applied 88 place count 1027 transition count 1664
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 89 place count 1027 transition count 1663
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 94 place count 1022 transition count 1658
Iterating global reduction 1 with 5 rules applied. Total rules applied 99 place count 1022 transition count 1658
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 103 place count 1018 transition count 1654
Iterating global reduction 1 with 4 rules applied. Total rules applied 107 place count 1018 transition count 1654
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 109 place count 1016 transition count 1652
Iterating global reduction 1 with 2 rules applied. Total rules applied 111 place count 1016 transition count 1652
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 113 place count 1014 transition count 1650
Iterating global reduction 1 with 2 rules applied. Total rules applied 115 place count 1014 transition count 1650
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 117 place count 1012 transition count 1648
Iterating global reduction 1 with 2 rules applied. Total rules applied 119 place count 1012 transition count 1648
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 120 place count 1011 transition count 1647
Iterating global reduction 1 with 1 rules applied. Total rules applied 121 place count 1011 transition count 1647
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 122 place count 1010 transition count 1646
Iterating global reduction 1 with 1 rules applied. Total rules applied 123 place count 1010 transition count 1646
Applied a total of 123 rules in 219 ms. Remains 1010 /1071 variables (removed 61) and now considering 1646/1723 (removed 77) transitions.
// Phase 1: matrix 1646 rows 1010 cols
[2025-05-31 04:26:11] [INFO ] Computed 69 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:26:11] [INFO ] Implicit Places using invariants in 346 ms returned []
[2025-05-31 04:26:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:26:12] [INFO ] Implicit Places using invariants and state equation in 784 ms returned []
Implicit Place search using SMT with State Equation took 1132 ms to find 0 implicit places.
Running 1645 sub problems to find dead transitions.
[2025-05-31 04:26:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1009/2656 variables, and 0 constraints, problems are : Problem set: 0 solved, 1645 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/69 constraints, State Equation: 0/1010 constraints, PredecessorRefiner: 1645/1645 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1645 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1009/2656 variables, and 0 constraints, problems are : Problem set: 0 solved, 1645 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/69 constraints, State Equation: 0/1010 constraints, PredecessorRefiner: 0/1645 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60374ms problems are : Problem set: 0 solved, 1645 unsolved
Search for dead transitions found 0 dead transitions in 60378ms
Starting structural reductions in LTL mode, iteration 1 : 1010/1071 places, 1646/1723 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61734 ms. Remains : 1010/1071 places, 1646/1723 transitions.
Stuttering acceptance computed with spot in 367 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p3), (NOT p3), true, (NOT p1)]
Running random walk in product with property : DLCround-PT-04b-LTLFireability-08
Entered a terminal (fully accepting) state of product in 4976 steps with 1 reset in 20 ms.
FORMULA DLCround-PT-04b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-04b-LTLFireability-08 finished in 62161 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(X(X(G((p0||X(p1))))))&&F(p2))))'
Support contains 2 out of 1071 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1071/1071 places, 1723/1723 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 1049 transition count 1694
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 1049 transition count 1694
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 59 place count 1034 transition count 1678
Iterating global reduction 0 with 15 rules applied. Total rules applied 74 place count 1034 transition count 1678
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 83 place count 1025 transition count 1662
Iterating global reduction 0 with 9 rules applied. Total rules applied 92 place count 1025 transition count 1662
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 93 place count 1025 transition count 1661
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 98 place count 1020 transition count 1656
Iterating global reduction 1 with 5 rules applied. Total rules applied 103 place count 1020 transition count 1656
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 107 place count 1016 transition count 1652
Iterating global reduction 1 with 4 rules applied. Total rules applied 111 place count 1016 transition count 1652
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 113 place count 1014 transition count 1650
Iterating global reduction 1 with 2 rules applied. Total rules applied 115 place count 1014 transition count 1650
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 117 place count 1012 transition count 1648
Iterating global reduction 1 with 2 rules applied. Total rules applied 119 place count 1012 transition count 1648
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 121 place count 1010 transition count 1646
Iterating global reduction 1 with 2 rules applied. Total rules applied 123 place count 1010 transition count 1646
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 124 place count 1009 transition count 1645
Iterating global reduction 1 with 1 rules applied. Total rules applied 125 place count 1009 transition count 1645
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 126 place count 1008 transition count 1644
Iterating global reduction 1 with 1 rules applied. Total rules applied 127 place count 1008 transition count 1644
Applied a total of 127 rules in 227 ms. Remains 1008 /1071 variables (removed 63) and now considering 1644/1723 (removed 79) transitions.
// Phase 1: matrix 1644 rows 1008 cols
[2025-05-31 04:27:13] [INFO ] Computed 69 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:27:13] [INFO ] Implicit Places using invariants in 355 ms returned []
[2025-05-31 04:27:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:27:14] [INFO ] Implicit Places using invariants and state equation in 804 ms returned []
Implicit Place search using SMT with State Equation took 1171 ms to find 0 implicit places.
Running 1643 sub problems to find dead transitions.
[2025-05-31 04:27:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
(s309 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1007/2652 variables, and 0 constraints, problems are : Problem set: 0 solved, 1643 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 0/69 constraints, State Equation: 0/1008 constraints, PredecessorRefiner: 1643/1643 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1643 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 1007/2652 variables, and 0 constraints, problems are : Problem set: 0 solved, 1643 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/69 constraints, State Equation: 0/1008 constraints, PredecessorRefiner: 0/1643 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60370ms problems are : Problem set: 0 solved, 1643 unsolved
Search for dead transitions found 0 dead transitions in 60374ms
Starting structural reductions in LTL mode, iteration 1 : 1008/1071 places, 1644/1723 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61774 ms. Remains : 1008/1071 places, 1644/1723 transitions.
Stuttering acceptance computed with spot in 285 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (AND (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DLCround-PT-04b-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-04b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-04b-LTLFireability-09 finished in 62087 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(((p0 U p1)||X(p2))))||G(p3)))'
Support contains 6 out of 1071 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1071/1071 places, 1723/1723 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1050 transition count 1695
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1050 transition count 1695
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 57 place count 1035 transition count 1679
Iterating global reduction 0 with 15 rules applied. Total rules applied 72 place count 1035 transition count 1679
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 80 place count 1027 transition count 1664
Iterating global reduction 0 with 8 rules applied. Total rules applied 88 place count 1027 transition count 1664
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 89 place count 1027 transition count 1663
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 93 place count 1023 transition count 1659
Iterating global reduction 1 with 4 rules applied. Total rules applied 97 place count 1023 transition count 1659
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 100 place count 1020 transition count 1656
Iterating global reduction 1 with 3 rules applied. Total rules applied 103 place count 1020 transition count 1656
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 104 place count 1019 transition count 1655
Iterating global reduction 1 with 1 rules applied. Total rules applied 105 place count 1019 transition count 1655
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 106 place count 1018 transition count 1654
Iterating global reduction 1 with 1 rules applied. Total rules applied 107 place count 1018 transition count 1654
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 108 place count 1017 transition count 1653
Iterating global reduction 1 with 1 rules applied. Total rules applied 109 place count 1017 transition count 1653
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 110 place count 1016 transition count 1652
Iterating global reduction 1 with 1 rules applied. Total rules applied 111 place count 1016 transition count 1652
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 112 place count 1015 transition count 1651
Iterating global reduction 1 with 1 rules applied. Total rules applied 113 place count 1015 transition count 1651
Applied a total of 113 rules in 206 ms. Remains 1015 /1071 variables (removed 56) and now considering 1651/1723 (removed 72) transitions.
// Phase 1: matrix 1651 rows 1015 cols
[2025-05-31 04:28:15] [INFO ] Computed 69 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:28:15] [INFO ] Implicit Places using invariants in 335 ms returned []
[2025-05-31 04:28:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:28:16] [INFO ] Implicit Places using invariants and state equation in 748 ms returned []
Implicit Place search using SMT with State Equation took 1123 ms to find 0 implicit places.
Running 1650 sub problems to find dead transitions.
[2025-05-31 04:28:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1014/2666 variables, and 0 constraints, problems are : Problem set: 0 solved, 1650 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 0/69 constraints, State Equation: 0/1015 constraints, PredecessorRefiner: 1650/1650 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1650 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1014/2666 variables, and 0 constraints, problems are : Problem set: 0 solved, 1650 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 0/69 constraints, State Equation: 0/1015 constraints, PredecessorRefiner: 0/1650 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60369ms problems are : Problem set: 0 solved, 1650 unsolved
Search for dead transitions found 0 dead transitions in 60371ms
Starting structural reductions in LTL mode, iteration 1 : 1015/1071 places, 1651/1723 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61707 ms. Remains : 1015/1071 places, 1651/1723 transitions.
Stuttering acceptance computed with spot in 547 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p3)]
Running random walk in product with property : DLCround-PT-04b-LTLFireability-10
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-04b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-04b-LTLFireability-10 finished in 62282 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)&&F(G(p1))))'
Support contains 3 out of 1071 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1071/1071 places, 1723/1723 transitions.
Graph (trivial) has 995 edges and 1071 vertex of which 290 / 1071 are part of one of the 25 SCC in 2 ms
Free SCC test removed 265 places
Ensure Unique test removed 284 transitions
Reduce isomorphic transitions removed 284 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 204 transitions
Trivial Post-agglo rules discarded 204 transitions
Performed 204 trivial Post agglomeration. Transition count delta: 204
Iterating post reduction 0 with 204 rules applied. Total rules applied 205 place count 805 transition count 1234
Reduce places removed 204 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 233 rules applied. Total rules applied 438 place count 601 transition count 1205
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 21 rules applied. Total rules applied 459 place count 582 transition count 1203
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 461 place count 581 transition count 1202
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 462 place count 580 transition count 1202
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 73 Pre rules applied. Total rules applied 462 place count 580 transition count 1129
Deduced a syphon composed of 73 places in 2 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 5 with 146 rules applied. Total rules applied 608 place count 507 transition count 1129
Discarding 44 places :
Symmetric choice reduction at 5 with 44 rule applications. Total rules 652 place count 463 transition count 947
Iterating global reduction 5 with 44 rules applied. Total rules applied 696 place count 463 transition count 947
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 699 place count 463 transition count 944
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 6 Pre rules applied. Total rules applied 699 place count 463 transition count 938
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 711 place count 457 transition count 938
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 712 place count 456 transition count 930
Iterating global reduction 6 with 1 rules applied. Total rules applied 713 place count 456 transition count 930
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 714 place count 456 transition count 929
Performed 168 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 168 places in 0 ms
Reduce places removed 168 places and 0 transitions.
Iterating global reduction 7 with 336 rules applied. Total rules applied 1050 place count 288 transition count 757
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1056 place count 288 transition count 751
Discarding 15 places :
Symmetric choice reduction at 8 with 15 rule applications. Total rules 1071 place count 273 transition count 646
Iterating global reduction 8 with 15 rules applied. Total rules applied 1086 place count 273 transition count 646
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 1098 place count 273 transition count 634
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 1102 place count 271 transition count 632
Performed 17 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 9 with 34 rules applied. Total rules applied 1136 place count 254 transition count 734
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1137 place count 254 transition count 733
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 1141 place count 250 transition count 687
Iterating global reduction 10 with 4 rules applied. Total rules applied 1145 place count 250 transition count 687
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 10 with 21 rules applied. Total rules applied 1166 place count 250 transition count 666
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 11 with 22 rules applied. Total rules applied 1188 place count 250 transition count 644
Discarding 8 places :
Symmetric choice reduction at 11 with 8 rule applications. Total rules 1196 place count 242 transition count 628
Iterating global reduction 11 with 8 rules applied. Total rules applied 1204 place count 242 transition count 628
Discarding 8 places :
Symmetric choice reduction at 11 with 8 rule applications. Total rules 1212 place count 234 transition count 562
Iterating global reduction 11 with 8 rules applied. Total rules applied 1220 place count 234 transition count 562
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 11 with 8 rules applied. Total rules applied 1228 place count 234 transition count 554
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 1229 place count 234 transition count 554
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 1230 place count 234 transition count 553
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1231 place count 233 transition count 552
Applied a total of 1231 rules in 156 ms. Remains 233 /1071 variables (removed 838) and now considering 552/1723 (removed 1171) transitions.
[2025-05-31 04:29:17] [INFO ] Flow matrix only has 531 transitions (discarded 21 similar events)
// Phase 1: matrix 531 rows 233 cols
[2025-05-31 04:29:17] [INFO ] Computed 69 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:29:17] [INFO ] Implicit Places using invariants in 107 ms returned []
[2025-05-31 04:29:17] [INFO ] Flow matrix only has 531 transitions (discarded 21 similar events)
[2025-05-31 04:29:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:29:18] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-05-31 04:29:18] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 04:29:18] [INFO ] Redundant transitions in 3 ms returned []
Running 500 sub problems to find dead transitions.
[2025-05-31 04:29:18] [INFO ] Flow matrix only has 531 transitions (discarded 21 similar events)
[2025-05-31 04:29:18] [INFO ] Invariant cache hit.
[2025-05-31 04:29:18] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (OVERLAPS) 2/233 variables, 61/69 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 4 (OVERLAPS) 530/763 variables, 233/302 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/763 variables, 40/342 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/763 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 500 unsolved
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 763/764 variables, and 342 constraints, problems are : Problem set: 0 solved, 500 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, State Equation: 233/233 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 500/500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 500 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (OVERLAPS) 2/233 variables, 61/69 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 4 (OVERLAPS) 530/763 variables, 233/302 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/763 variables, 40/342 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/763 variables, 500/842 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/763 variables, 0/842 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 763/764 variables, and 842 constraints, problems are : Problem set: 0 solved, 500 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, State Equation: 233/233 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 500/500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60183ms problems are : Problem set: 0 solved, 500 unsolved
Search for dead transitions found 0 dead transitions in 60184ms
Starting structural reductions in SI_LTL mode, iteration 1 : 233/1071 places, 552/1723 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60684 ms. Remains : 233/1071 places, 552/1723 transitions.
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DLCround-PT-04b-LTLFireability-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-04b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-04b-LTLFireability-11 finished in 60834 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)||(F(p1)&&X((p2 U p3)))))'
Support contains 6 out of 1071 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1071/1071 places, 1723/1723 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1050 transition count 1702
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1050 transition count 1702
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 57 place count 1035 transition count 1686
Iterating global reduction 0 with 15 rules applied. Total rules applied 72 place count 1035 transition count 1686
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 81 place count 1026 transition count 1670
Iterating global reduction 0 with 9 rules applied. Total rules applied 90 place count 1026 transition count 1670
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 91 place count 1026 transition count 1669
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 96 place count 1021 transition count 1664
Iterating global reduction 1 with 5 rules applied. Total rules applied 101 place count 1021 transition count 1664
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 105 place count 1017 transition count 1660
Iterating global reduction 1 with 4 rules applied. Total rules applied 109 place count 1017 transition count 1660
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 111 place count 1015 transition count 1658
Iterating global reduction 1 with 2 rules applied. Total rules applied 113 place count 1015 transition count 1658
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 115 place count 1013 transition count 1656
Iterating global reduction 1 with 2 rules applied. Total rules applied 117 place count 1013 transition count 1656
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 119 place count 1011 transition count 1654
Iterating global reduction 1 with 2 rules applied. Total rules applied 121 place count 1011 transition count 1654
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 122 place count 1010 transition count 1653
Iterating global reduction 1 with 1 rules applied. Total rules applied 123 place count 1010 transition count 1653
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 124 place count 1009 transition count 1652
Iterating global reduction 1 with 1 rules applied. Total rules applied 125 place count 1009 transition count 1652
Applied a total of 125 rules in 213 ms. Remains 1009 /1071 variables (removed 62) and now considering 1652/1723 (removed 71) transitions.
// Phase 1: matrix 1652 rows 1009 cols
[2025-05-31 04:30:18] [INFO ] Computed 69 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:30:18] [INFO ] Implicit Places using invariants in 330 ms returned []
[2025-05-31 04:30:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:30:19] [INFO ] Implicit Places using invariants and state equation in 816 ms returned []
Implicit Place search using SMT with State Equation took 1148 ms to find 0 implicit places.
Running 1651 sub problems to find dead transitions.
[2025-05-31 04:30:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 1008/2661 variables, and 0 constraints, problems are : Problem set: 0 solved, 1651 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 0/69 constraints, State Equation: 0/1009 constraints, PredecessorRefiner: 1651/1651 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1651 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1008/2661 variables, and 0 constraints, problems are : Problem set: 0 solved, 1651 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/69 constraints, State Equation: 0/1009 constraints, PredecessorRefiner: 0/1651 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60342ms problems are : Problem set: 0 solved, 1651 unsolved
Search for dead transitions found 0 dead transitions in 60345ms
Starting structural reductions in LTL mode, iteration 1 : 1009/1071 places, 1652/1723 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61715 ms. Remains : 1009/1071 places, 1652/1723 transitions.
Stuttering acceptance computed with spot in 299 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (NOT p1), (NOT p3), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p3)), true, (NOT p0)]
Running random walk in product with property : DLCround-PT-04b-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-04b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-04b-LTLFireability-12 finished in 62041 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||F(p1)))))'
Support contains 2 out of 1071 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1071/1071 places, 1723/1723 transitions.
Graph (trivial) has 994 edges and 1071 vertex of which 308 / 1071 are part of one of the 24 SCC in 1 ms
Free SCC test removed 284 places
Ensure Unique test removed 306 transitions
Reduce isomorphic transitions removed 306 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 194 transitions
Trivial Post-agglo rules discarded 194 transitions
Performed 194 trivial Post agglomeration. Transition count delta: 194
Iterating post reduction 0 with 194 rules applied. Total rules applied 195 place count 786 transition count 1222
Reduce places removed 194 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 223 rules applied. Total rules applied 418 place count 592 transition count 1193
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 21 rules applied. Total rules applied 439 place count 573 transition count 1191
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 440 place count 572 transition count 1191
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 71 Pre rules applied. Total rules applied 440 place count 572 transition count 1120
Deduced a syphon composed of 71 places in 2 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 4 with 142 rules applied. Total rules applied 582 place count 501 transition count 1120
Discarding 46 places :
Symmetric choice reduction at 4 with 46 rule applications. Total rules 628 place count 455 transition count 929
Iterating global reduction 4 with 46 rules applied. Total rules applied 674 place count 455 transition count 929
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 677 place count 455 transition count 926
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 677 place count 455 transition count 920
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 689 place count 449 transition count 920
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 690 place count 448 transition count 912
Iterating global reduction 5 with 1 rules applied. Total rules applied 691 place count 448 transition count 912
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 692 place count 448 transition count 911
Performed 164 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 164 places in 0 ms
Reduce places removed 164 places and 0 transitions.
Iterating global reduction 6 with 328 rules applied. Total rules applied 1020 place count 284 transition count 743
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1026 place count 284 transition count 737
Discarding 17 places :
Symmetric choice reduction at 7 with 17 rule applications. Total rules 1043 place count 267 transition count 616
Iterating global reduction 7 with 17 rules applied. Total rules applied 1060 place count 267 transition count 616
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 1075 place count 267 transition count 601
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1077 place count 266 transition count 600
Performed 15 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 8 with 30 rules applied. Total rules applied 1107 place count 251 transition count 690
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1110 place count 248 transition count 654
Iterating global reduction 8 with 3 rules applied. Total rules applied 1113 place count 248 transition count 654
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 8 with 16 rules applied. Total rules applied 1129 place count 248 transition count 638
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 9 with 24 rules applied. Total rules applied 1153 place count 248 transition count 614
Discarding 10 places :
Symmetric choice reduction at 9 with 10 rule applications. Total rules 1163 place count 238 transition count 594
Iterating global reduction 9 with 10 rules applied. Total rules applied 1173 place count 238 transition count 594
Discarding 10 places :
Symmetric choice reduction at 9 with 10 rule applications. Total rules 1183 place count 228 transition count 512
Iterating global reduction 9 with 10 rules applied. Total rules applied 1193 place count 228 transition count 512
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 9 with 10 rules applied. Total rules applied 1203 place count 228 transition count 502
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1204 place count 227 transition count 501
Applied a total of 1204 rules in 135 ms. Remains 227 /1071 variables (removed 844) and now considering 501/1723 (removed 1222) transitions.
[2025-05-31 04:31:20] [INFO ] Flow matrix only has 483 transitions (discarded 18 similar events)
// Phase 1: matrix 483 rows 227 cols
[2025-05-31 04:31:20] [INFO ] Computed 69 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:31:20] [INFO ] Implicit Places using invariants in 102 ms returned []
[2025-05-31 04:31:20] [INFO ] Flow matrix only has 483 transitions (discarded 18 similar events)
[2025-05-31 04:31:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:31:20] [INFO ] State equation strengthened by 37 read => feed constraints.
[2025-05-31 04:31:20] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 04:31:20] [INFO ] Redundant transitions in 3 ms returned []
Running 452 sub problems to find dead transitions.
[2025-05-31 04:31:20] [INFO ] Flow matrix only has 483 transitions (discarded 18 similar events)
[2025-05-31 04:31:20] [INFO ] Invariant cache hit.
[2025-05-31 04:31:20] [INFO ] State equation strengthened by 37 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 2 (OVERLAPS) 2/227 variables, 61/69 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 4 (OVERLAPS) 482/709 variables, 227/296 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/709 variables, 37/333 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/709 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 452 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 709/710 variables, and 333 constraints, problems are : Problem set: 0 solved, 452 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, State Equation: 227/227 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 452/452 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 452 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 2 (OVERLAPS) 2/227 variables, 61/69 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 4 (OVERLAPS) 482/709 variables, 227/296 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/709 variables, 37/333 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/709 variables, 452/785 constraints. Problems are: Problem set: 0 solved, 452 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 04:32:08] [INFO ] Deduced a trap along path composed of 5 places in 44 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/709 variables, 1/786 constraints. Problems are: Problem set: 0 solved, 452 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 709/710 variables, and 786 constraints, problems are : Problem set: 0 solved, 452 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, State Equation: 227/227 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 452/452 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60158ms problems are : Problem set: 0 solved, 452 unsolved
Search for dead transitions found 0 dead transitions in 60159ms
Starting structural reductions in SI_LTL mode, iteration 1 : 227/1071 places, 501/1723 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60631 ms. Remains : 227/1071 places, 501/1723 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DLCround-PT-04b-LTLFireability-13
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-04b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-04b-LTLFireability-13 finished in 60721 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(F(p0))||(p1 U (p2||G(p1))))))'
Support contains 3 out of 1071 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1071/1071 places, 1723/1723 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1051 transition count 1696
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1051 transition count 1696
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 53 place count 1038 transition count 1683
Iterating global reduction 0 with 13 rules applied. Total rules applied 66 place count 1038 transition count 1683
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 73 place count 1031 transition count 1669
Iterating global reduction 0 with 7 rules applied. Total rules applied 80 place count 1031 transition count 1669
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 84 place count 1027 transition count 1665
Iterating global reduction 0 with 4 rules applied. Total rules applied 88 place count 1027 transition count 1665
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 91 place count 1024 transition count 1662
Iterating global reduction 0 with 3 rules applied. Total rules applied 94 place count 1024 transition count 1662
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 96 place count 1022 transition count 1660
Iterating global reduction 0 with 2 rules applied. Total rules applied 98 place count 1022 transition count 1660
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 100 place count 1020 transition count 1658
Iterating global reduction 0 with 2 rules applied. Total rules applied 102 place count 1020 transition count 1658
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 104 place count 1018 transition count 1656
Iterating global reduction 0 with 2 rules applied. Total rules applied 106 place count 1018 transition count 1656
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 107 place count 1017 transition count 1655
Iterating global reduction 0 with 1 rules applied. Total rules applied 108 place count 1017 transition count 1655
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 109 place count 1016 transition count 1654
Iterating global reduction 0 with 1 rules applied. Total rules applied 110 place count 1016 transition count 1654
Applied a total of 110 rules in 210 ms. Remains 1016 /1071 variables (removed 55) and now considering 1654/1723 (removed 69) transitions.
// Phase 1: matrix 1654 rows 1016 cols
[2025-05-31 04:32:21] [INFO ] Computed 69 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:32:21] [INFO ] Implicit Places using invariants in 336 ms returned []
[2025-05-31 04:32:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:32:22] [INFO ] Implicit Places using invariants and state equation in 835 ms returned []
Implicit Place search using SMT with State Equation took 1195 ms to find 0 implicit places.
Running 1653 sub problems to find dead transitions.
[2025-05-31 04:32:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1015/2670 variables, and 0 constraints, problems are : Problem set: 0 solved, 1653 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/69 constraints, State Equation: 0/1016 constraints, PredecessorRefiner: 1653/1653 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1653 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1015/2670 variables, and 0 constraints, problems are : Problem set: 0 solved, 1653 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 0/69 constraints, State Equation: 0/1016 constraints, PredecessorRefiner: 0/1653 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60398ms problems are : Problem set: 0 solved, 1653 unsolved
Search for dead transitions found 0 dead transitions in 60407ms
Starting structural reductions in LTL mode, iteration 1 : 1016/1071 places, 1654/1723 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61816 ms. Remains : 1016/1071 places, 1654/1723 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : DLCround-PT-04b-LTLFireability-14
Product exploration explored 100000 steps with 50000 reset in 296 ms.
Product exploration explored 100000 steps with 50000 reset in 291 ms.
Computed a total of 133 stabilizing places and 133 stable transitions
Computed a total of 133 stabilizing places and 133 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 20 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DLCround-PT-04b-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-04b-LTLFireability-14 finished in 62632 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))'
Support contains 4 out of 1071 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1071/1071 places, 1723/1723 transitions.
Graph (trivial) has 986 edges and 1071 vertex of which 289 / 1071 are part of one of the 25 SCC in 1 ms
Free SCC test removed 264 places
Ensure Unique test removed 283 transitions
Reduce isomorphic transitions removed 283 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 202 place count 806 transition count 1238
Reduce places removed 201 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 230 rules applied. Total rules applied 432 place count 605 transition count 1209
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 21 rules applied. Total rules applied 453 place count 586 transition count 1207
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 3 with 4 rules applied. Total rules applied 457 place count 585 transition count 1204
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 460 place count 582 transition count 1204
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 73 Pre rules applied. Total rules applied 460 place count 582 transition count 1131
Deduced a syphon composed of 73 places in 2 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 5 with 146 rules applied. Total rules applied 606 place count 509 transition count 1131
Discarding 43 places :
Symmetric choice reduction at 5 with 43 rule applications. Total rules 649 place count 466 transition count 950
Iterating global reduction 5 with 43 rules applied. Total rules applied 692 place count 466 transition count 950
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 695 place count 466 transition count 947
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 6 Pre rules applied. Total rules applied 695 place count 466 transition count 941
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 707 place count 460 transition count 941
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 708 place count 459 transition count 933
Iterating global reduction 6 with 1 rules applied. Total rules applied 709 place count 459 transition count 933
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 710 place count 459 transition count 932
Performed 167 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 167 places in 0 ms
Reduce places removed 167 places and 0 transitions.
Iterating global reduction 7 with 334 rules applied. Total rules applied 1044 place count 292 transition count 762
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 1049 place count 292 transition count 757
Discarding 15 places :
Symmetric choice reduction at 8 with 15 rule applications. Total rules 1064 place count 277 transition count 649
Iterating global reduction 8 with 15 rules applied. Total rules applied 1079 place count 277 transition count 649
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 1091 place count 277 transition count 637
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 1095 place count 275 transition count 635
Performed 17 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 9 with 34 rules applied. Total rules applied 1129 place count 258 transition count 737
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1130 place count 258 transition count 736
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 1134 place count 254 transition count 690
Iterating global reduction 10 with 4 rules applied. Total rules applied 1138 place count 254 transition count 690
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 10 with 21 rules applied. Total rules applied 1159 place count 254 transition count 669
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 11 with 22 rules applied. Total rules applied 1181 place count 254 transition count 647
Discarding 7 places :
Symmetric choice reduction at 11 with 7 rule applications. Total rules 1188 place count 247 transition count 633
Iterating global reduction 11 with 7 rules applied. Total rules applied 1195 place count 247 transition count 633
Discarding 7 places :
Symmetric choice reduction at 11 with 7 rule applications. Total rules 1202 place count 240 transition count 575
Iterating global reduction 11 with 7 rules applied. Total rules applied 1209 place count 240 transition count 575
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 11 with 7 rules applied. Total rules applied 1216 place count 240 transition count 568
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 1217 place count 240 transition count 568
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1218 place count 239 transition count 567
Applied a total of 1218 rules in 183 ms. Remains 239 /1071 variables (removed 832) and now considering 567/1723 (removed 1156) transitions.
[2025-05-31 04:33:24] [INFO ] Flow matrix only has 545 transitions (discarded 22 similar events)
// Phase 1: matrix 545 rows 239 cols
[2025-05-31 04:33:24] [INFO ] Computed 69 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:33:24] [INFO ] Implicit Places using invariants in 214 ms returned []
[2025-05-31 04:33:24] [INFO ] Flow matrix only has 545 transitions (discarded 22 similar events)
[2025-05-31 04:33:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:33:24] [INFO ] State equation strengthened by 32 read => feed constraints.
[2025-05-31 04:33:24] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 583 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 04:33:24] [INFO ] Redundant transitions in 4 ms returned []
Running 514 sub problems to find dead transitions.
[2025-05-31 04:33:24] [INFO ] Flow matrix only has 545 transitions (discarded 22 similar events)
[2025-05-31 04:33:24] [INFO ] Invariant cache hit.
[2025-05-31 04:33:24] [INFO ] State equation strengthened by 32 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 514 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 514 unsolved
At refinement iteration 2 (OVERLAPS) 2/239 variables, 61/69 constraints. Problems are: Problem set: 0 solved, 514 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 514 unsolved
At refinement iteration 4 (OVERLAPS) 544/783 variables, 239/308 constraints. Problems are: Problem set: 0 solved, 514 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/783 variables, 32/340 constraints. Problems are: Problem set: 0 solved, 514 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/783 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 514 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 783/784 variables, and 340 constraints, problems are : Problem set: 0 solved, 514 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, State Equation: 239/239 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 514/514 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 514 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 514 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 514 unsolved
At refinement iteration 2 (OVERLAPS) 2/239 variables, 61/69 constraints. Problems are: Problem set: 0 solved, 514 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 514 unsolved
At refinement iteration 4 (OVERLAPS) 544/783 variables, 239/308 constraints. Problems are: Problem set: 0 solved, 514 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/783 variables, 32/340 constraints. Problems are: Problem set: 0 solved, 514 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/783 variables, 514/854 constraints. Problems are: Problem set: 0 solved, 514 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/783 variables, 0/854 constraints. Problems are: Problem set: 0 solved, 514 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 783/784 variables, and 854 constraints, problems are : Problem set: 0 solved, 514 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, State Equation: 239/239 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 514/514 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60183ms problems are : Problem set: 0 solved, 514 unsolved
Search for dead transitions found 0 dead transitions in 60184ms
Starting structural reductions in SI_LTL mode, iteration 1 : 239/1071 places, 567/1723 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60964 ms. Remains : 239/1071 places, 567/1723 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), true, p0]
Running random walk in product with property : DLCround-PT-04b-LTLFireability-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-04b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-04b-LTLFireability-15 finished in 61077 ms.
All properties solved by simple procedures.
Total runtime 933621 ms.

BK_STOP 1748666064954

--------------------
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="DLCround-PT-04b"
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 DLCround-PT-04b, 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 r072-tall-174860066900140"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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