Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r254-tall-174931339800411.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 ErlangenMainframeV0-PT-1302, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931339800411
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 79M
-rw-r--r-- 1 mcc users 6.6K Jun 6 09:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Jun 6 09:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Jun 6 09:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Jun 6 09:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Jun 6 12:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 6 12:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Jun 6 12:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 6 12:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 13K Jun 6 09:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Jun 6 09:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Jun 6 09:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 6 09:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 6 12:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 12:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 5 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 79M Jun 5 20:08 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 ErlangenMainframeV0-PT-1302-LTLCardinality-00
FORMULA_NAME ErlangenMainframeV0-PT-1302-LTLCardinality-01
FORMULA_NAME ErlangenMainframeV0-PT-1302-LTLCardinality-02
FORMULA_NAME ErlangenMainframeV0-PT-1302-LTLCardinality-03
FORMULA_NAME ErlangenMainframeV0-PT-1302-LTLCardinality-04
FORMULA_NAME ErlangenMainframeV0-PT-1302-LTLCardinality-05
FORMULA_NAME ErlangenMainframeV0-PT-1302-LTLCardinality-06
FORMULA_NAME ErlangenMainframeV0-PT-1302-LTLCardinality-07
FORMULA_NAME ErlangenMainframeV0-PT-1302-LTLCardinality-08
FORMULA_NAME ErlangenMainframeV0-PT-1302-LTLCardinality-09
FORMULA_NAME ErlangenMainframeV0-PT-1302-LTLCardinality-10
FORMULA_NAME ErlangenMainframeV0-PT-1302-LTLCardinality-11
FORMULA_NAME ErlangenMainframeV0-PT-1302-LTLCardinality-12
FORMULA_NAME ErlangenMainframeV0-PT-1302-LTLCardinality-13
FORMULA_NAME ErlangenMainframeV0-PT-1302-LTLCardinality-14
FORMULA_NAME ErlangenMainframeV0-PT-1302-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1749381967574

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV0-PT-1302
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-08 11:26:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-08 11:26:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-08 11:26:11] [INFO ] Load time of PNML (sax parser for PT used): 2822 ms
[2025-06-08 11:26:11] [INFO ] Transformed 297 places.
[2025-06-08 11:26:12] [INFO ] Transformed 55594 transitions.
[2025-06-08 11:26:12] [INFO ] Found NUPN structural information;
[2025-06-08 11:26:12] [INFO ] Parsed PT model containing 297 places and 55594 transitions and 1622818 arcs in 3448 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA ErlangenMainframeV0-PT-1302-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1302-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1302-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA ErlangenMainframeV0-PT-1302-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 297 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 297/297 places, 55594/55594 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 240 transition count 55537
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 240 transition count 55537
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 143 place count 211 transition count 55508
Iterating global reduction 0 with 29 rules applied. Total rules applied 172 place count 211 transition count 55508
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 178 place count 205 transition count 37588
Ensure Unique test removed 4 places
Iterating global reduction 0 with 10 rules applied. Total rules applied 188 place count 201 transition count 37588
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 193 place count 196 transition count 2772
Iterating global reduction 0 with 5 rules applied. Total rules applied 198 place count 196 transition count 2772
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 199 place count 195 transition count 2770
Iterating global reduction 0 with 1 rules applied. Total rules applied 200 place count 195 transition count 2770
Applied a total of 200 rules in 6341 ms. Remains 195 /297 variables (removed 102) and now considering 2770/55594 (removed 52824) transitions.
// Phase 1: matrix 2770 rows 195 cols
[2025-06-08 11:26:19] [INFO ] Computed 28 invariants in 73 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 11:26:21] [INFO ] Implicit Places using invariants in 1993 ms returned []
[2025-06-08 11:26:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 11:26:23] [INFO ] Implicit Places using invariants and state equation in 2600 ms returned []
Implicit Place search using SMT with State Equation took 4639 ms to find 0 implicit places.
Running 2769 sub problems to find dead transitions.
[2025-06-08 11:26:23] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2769 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 194/2965 variables, and 13 constraints, problems are : Problem set: 0 solved, 2769 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 0/15 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 0/195 constraints, PredecessorRefiner: 2769/150 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2769 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2769 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2769 unsolved
At refinement iteration 2 (OVERLAPS) 1/195 variables, 15/28 constraints. Problems are: Problem set: 0 solved, 2769 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:27:24] [INFO ] Deduced a trap composed of 27 places in 1392 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:27:25] [INFO ] Deduced a trap composed of 29 places in 1261 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:27:27] [INFO ] Deduced a trap composed of 32 places in 1333 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:27:28] [INFO ] Deduced a trap composed of 36 places in 1171 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:27:29] [INFO ] Deduced a trap composed of 37 places in 1285 ms of which 21 ms to minimize.
SMT process timed out in 65762ms, After SMT, problems are : Problem set: 0 solved, 2769 unsolved
Search for dead transitions found 0 dead transitions in 65811ms
Starting structural reductions in LTL mode, iteration 1 : 195/297 places, 2770/55594 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 76830 ms. Remains : 195/297 places, 2770/55594 transitions.
Support contains 45 out of 195 places after structural reductions.
[2025-06-08 11:27:30] [INFO ] Flatten gal took : 681 ms
[2025-06-08 11:27:31] [INFO ] Flatten gal took : 449 ms
[2025-06-08 11:27:31] [INFO ] Input system was already deterministic with 2770 transitions.
Support contains 44 out of 195 places (down from 45) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2045 ms. (19 steps per ms) remains 0/25 properties
FORMULA ErlangenMainframeV0-PT-1302-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ErlangenMainframeV0-PT-1302-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 27 stabilizing places and 27 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 195 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 195/195 places, 2770/2770 transitions.
Graph (trivial) has 143 edges and 195 vertex of which 6 / 195 are part of one of the 3 SCC in 4 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 191 transition count 2738
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 57 place count 163 transition count 2738
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 57 place count 163 transition count 2724
Deduced a syphon composed of 14 places in 3 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 85 place count 149 transition count 2724
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 101 place count 133 transition count 1209
Ensure Unique test removed 4 places
Iterating global reduction 2 with 20 rules applied. Total rules applied 121 place count 129 transition count 1209
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 121 place count 129 transition count 1204
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 131 place count 124 transition count 1204
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 137 place count 118 transition count 220
Ensure Unique test removed 2 places
Iterating global reduction 2 with 8 rules applied. Total rules applied 145 place count 116 transition count 220
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 148 place count 113 transition count 170
Iterating global reduction 2 with 3 rules applied. Total rules applied 151 place count 113 transition count 170
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 251 place count 63 transition count 120
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 256 place count 58 transition count 89
Ensure Unique test removed 3 places
Iterating global reduction 2 with 8 rules applied. Total rules applied 264 place count 55 transition count 89
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 266 place count 55 transition count 87
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 269 place count 52 transition count 80
Iterating global reduction 3 with 3 rules applied. Total rules applied 272 place count 52 transition count 80
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 274 place count 51 transition count 79
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 280 place count 48 transition count 90
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 3 with 15 rules applied. Total rules applied 295 place count 48 transition count 75
Applied a total of 295 rules in 292 ms. Remains 48 /195 variables (removed 147) and now considering 75/2770 (removed 2695) transitions.
[2025-06-08 11:27:33] [INFO ] Flow matrix only has 53 transitions (discarded 22 similar events)
// Phase 1: matrix 53 rows 48 cols
[2025-06-08 11:27:33] [INFO ] Computed 19 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 11:27:33] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-06-08 11:27:33] [INFO ] Flow matrix only has 53 transitions (discarded 22 similar events)
[2025-06-08 11:27:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 11:27:33] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-08 11:27:33] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 11:27:33] [INFO ] Redundant transitions in 1 ms returned []
Running 73 sub problems to find dead transitions.
[2025-06-08 11:27:33] [INFO ] Flow matrix only has 53 transitions (discarded 22 similar events)
[2025-06-08 11:27:33] [INFO ] Invariant cache hit.
[2025-06-08 11:27:33] [INFO ] State equation strengthened by 12 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/48 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (OVERLAPS) 52/100 variables, 48/67 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 11/78 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (OVERLAPS) 1/101 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 0/101 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 101/101 variables, and 79 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1577 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 48/48 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/48 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (OVERLAPS) 52/100 variables, 48/67 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 11/78 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 73/151 constraints. Problems are: Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:27:35] [INFO ] Deduced a trap along path composed of 3 places in 33 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 1/101 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/101 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 10 (OVERLAPS) 0/101 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 101/101 variables, and 153 constraints, problems are : Problem set: 0 solved, 73 unsolved in 2593 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 48/48 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 4189ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 4190ms
Starting structural reductions in SI_LTL mode, iteration 1 : 48/195 places, 75/2770 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4598 ms. Remains : 48/195 places, 75/2770 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-1302-LTLCardinality-00
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 3 ms.
FORMULA ErlangenMainframeV0-PT-1302-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1302-LTLCardinality-00 finished in 4812 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' '!((((!p0||G(p1)) U X(!p2)) U p3))'
Support contains 7 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 2770/2770 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 176 transition count 1252
Ensure Unique test removed 4 places
Iterating global reduction 0 with 23 rules applied. Total rules applied 42 place count 172 transition count 1252
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 53 place count 161 transition count 285
Iterating global reduction 0 with 11 rules applied. Total rules applied 64 place count 161 transition count 285
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 70 place count 155 transition count 252
Ensure Unique test removed 4 places
Iterating global reduction 0 with 10 rules applied. Total rules applied 80 place count 151 transition count 252
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 84 place count 147 transition count 192
Iterating global reduction 0 with 4 rules applied. Total rules applied 88 place count 147 transition count 192
Applied a total of 88 rules in 35 ms. Remains 147 /195 variables (removed 48) and now considering 192/2770 (removed 2578) transitions.
// Phase 1: matrix 192 rows 147 cols
[2025-06-08 11:27:37] [INFO ] Computed 20 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 11:27:37] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-06-08 11:27:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 11:27:38] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Running 191 sub problems to find dead transitions.
[2025-06-08 11:27:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 191 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:27:39] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:27:39] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:27:39] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (OVERLAPS) 192/339 variables, 147/170 constraints. Problems are: Problem set: 0 solved, 191 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:27:41] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 8 (OVERLAPS) 0/339 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Real declared 339/339 variables, and 171 constraints, problems are : Problem set: 0 solved, 191 unsolved in 9088 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 191 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 191 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:27:47] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 6 (OVERLAPS) 192/339 variables, 147/172 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 191/363 constraints. Problems are: Problem set: 0 solved, 191 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:27:49] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:27:50] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:27:50] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:27:50] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:27:50] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:27:50] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:27:50] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:27:50] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:27:50] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 9/372 constraints. Problems are: Problem set: 0 solved, 191 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:27:52] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:27:52] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/339 variables, 2/374 constraints. Problems are: Problem set: 0 solved, 191 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:27:55] [INFO ] Deduced a trap along path composed of 3 places in 55 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:27:55] [INFO ] Deduced a trap along path composed of 14 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:27:56] [INFO ] Deduced a trap along path composed of 6 places in 35 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/339 variables, 3/377 constraints. Problems are: Problem set: 0 solved, 191 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:28:00] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/339 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/339 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 13 (OVERLAPS) 0/339 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Int declared 339/339 variables, and 378 constraints, problems are : Problem set: 0 solved, 191 unsolved in 27818 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 36934ms problems are : Problem set: 0 solved, 191 unsolved
Search for dead transitions found 0 dead transitions in 36935ms
Starting structural reductions in LTL mode, iteration 1 : 147/195 places, 192/2770 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37151 ms. Remains : 147/195 places, 192/2770 transitions.
Stuttering acceptance computed with spot in 249 ms :[(NOT p3), p2, p2, (AND (NOT p1) p2), true, (NOT p1)]
Running random walk in product with property : ErlangenMainframeV0-PT-1302-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 8991 steps with 0 reset in 56 ms.
FORMULA ErlangenMainframeV0-PT-1302-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1302-LTLCardinality-01 finished in 37489 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' '!((p0 U X(p0)))'
Support contains 2 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 2770/2770 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 172 transition count 1248
Ensure Unique test removed 4 places
Iterating global reduction 0 with 27 rules applied. Total rules applied 50 place count 168 transition count 1248
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 63 place count 155 transition count 279
Iterating global reduction 0 with 13 rules applied. Total rules applied 76 place count 155 transition count 279
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 84 place count 147 transition count 244
Ensure Unique test removed 5 places
Iterating global reduction 0 with 13 rules applied. Total rules applied 97 place count 142 transition count 244
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 102 place count 137 transition count 182
Iterating global reduction 0 with 5 rules applied. Total rules applied 107 place count 137 transition count 182
Applied a total of 107 rules in 35 ms. Remains 137 /195 variables (removed 58) and now considering 182/2770 (removed 2588) transitions.
// Phase 1: matrix 182 rows 137 cols
[2025-06-08 11:28:15] [INFO ] Computed 19 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 11:28:15] [INFO ] Implicit Places using invariants in 71 ms returned []
[2025-06-08 11:28:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 11:28:15] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2025-06-08 11:28:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:28:16] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:28:16] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/319 variables, 137/158 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (OVERLAPS) 0/319 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 319/319 variables, and 158 constraints, problems are : Problem set: 0 solved, 181 unsolved in 7335 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:28:23] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (OVERLAPS) 182/319 variables, 137/159 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 181/340 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:28:25] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:28:25] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:28:25] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 3/343 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:28:28] [INFO ] Deduced a trap along path composed of 6 places in 41 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:28:28] [INFO ] Deduced a trap along path composed of 11 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:28:28] [INFO ] Deduced a trap along path composed of 6 places in 16 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/319 variables, 3/346 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/319 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (OVERLAPS) 0/319 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Int declared 319/319 variables, and 346 constraints, problems are : Problem set: 0 solved, 181 unsolved in 16609 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 23965ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 23965ms
Starting structural reductions in LTL mode, iteration 1 : 137/195 places, 182/2770 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24173 ms. Remains : 137/195 places, 182/2770 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), true, (NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-1302-LTLCardinality-03
Product exploration explored 100000 steps with 33333 reset in 120 ms.
Product exploration explored 100000 steps with 33333 reset in 168 ms.
Computed a total of 25 stabilizing places and 25 stable transitions
Computed a total of 25 stabilizing places and 25 stable transitions
Detected a total of 25/137 stabilizing places and 25/182 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 19 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ErlangenMainframeV0-PT-1302-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ErlangenMainframeV0-PT-1302-LTLCardinality-03 finished in 24661 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(X(!p0))) U (p1 U G((F(p2) U p3))))))'
Support contains 7 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 2770/2770 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 176 transition count 1283
Ensure Unique test removed 3 places
Iterating global reduction 0 with 22 rules applied. Total rules applied 41 place count 173 transition count 1283
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 52 place count 162 transition count 379
Iterating global reduction 0 with 11 rules applied. Total rules applied 63 place count 162 transition count 379
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 69 place count 156 transition count 316
Ensure Unique test removed 5 places
Iterating global reduction 0 with 11 rules applied. Total rules applied 80 place count 151 transition count 316
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 85 place count 146 transition count 192
Iterating global reduction 0 with 5 rules applied. Total rules applied 90 place count 146 transition count 192
Applied a total of 90 rules in 31 ms. Remains 146 /195 variables (removed 49) and now considering 192/2770 (removed 2578) transitions.
// Phase 1: matrix 192 rows 146 cols
[2025-06-08 11:28:40] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 11:28:40] [INFO ] Implicit Places using invariants in 103 ms returned [105]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 106 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 145/195 places, 192/2770 transitions.
Applied a total of 0 rules in 2 ms. Remains 145 /145 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 139 ms. Remains : 145/195 places, 192/2770 transitions.
Stuttering acceptance computed with spot in 1380 ms :[(NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) p0), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND (NOT p2) p0 (NOT p3)), (AND (NOT p2) p0), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p2) p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND (NOT p2) p0), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) p0), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (NOT p2), (NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : ErlangenMainframeV0-PT-1302-LTLCardinality-04
Product exploration explored 100000 steps with 14248 reset in 98 ms.
Product exploration explored 100000 steps with 14305 reset in 139 ms.
Computed a total of 25 stabilizing places and 25 stable transitions
Computed a total of 25 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND p3 p2 p1 p0), (X p2), (X p3), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p3 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) p1)))), (X (X p1)), (X (X (NOT (AND p3 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 351 ms. Reduced automaton from 32 states, 95 edges and 4 AP (stutter sensitive) to 32 states, 95 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1356 ms :[(NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) p0), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND (NOT p2) p0 (NOT p3)), (AND (NOT p2) p0), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p2) p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND (NOT p2) p0), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) p0), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (NOT p2), (NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3))]
RANDOM walk for 40000 steps (8 resets) in 1009 ms. (39 steps per ms) remains 5/31 properties
BEST_FIRST walk for 40002 steps (8 resets) in 163 ms. (243 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 61 ms. (645 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 77 ms. (512 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 77 ms. (512 steps per ms) remains 5/5 properties
// Phase 1: matrix 192 rows 145 cols
[2025-06-08 11:28:43] [INFO ] Computed 19 invariants in 1 ms
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/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 101/108 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 37/145 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 192/337 variables, 145/164 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/337 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 164 constraints, problems are : Problem set: 0 solved, 5 unsolved in 193 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 101/108 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 37/145 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:28:44] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 192/337 variables, 145/165 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/337 variables, 5/170 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:28:44] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/337 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/337 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/337 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 337/337 variables, and 171 constraints, problems are : Problem set: 0 solved, 5 unsolved in 653 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 857ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Finished Parikh walk after 92 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=46 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 5 properties in 117 ms.
Knowledge obtained : [(AND p3 p2 p1 p0), (X p2), (X p3), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p3 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) p1)))), (X (X p1)), (X (X (NOT (AND p3 (NOT p2)))))]
False Knowledge obtained : [(F (NOT (OR p1 p3))), (F (NOT (OR p2 (NOT p0)))), (F (NOT (OR p1 p2 (NOT p3) (NOT p0)))), (F (NOT (OR p1 p0))), (F (NOT (OR p2 (NOT p3) (NOT p0)))), (F (NOT (OR p1 p2 p3 (NOT p0)))), (F (NOT (OR (NOT p1) p2 (NOT p0)))), (F (NOT (OR p1 p2 p3 p0))), (F (NOT p2)), (F (NOT p1)), (F (NOT (OR (NOT p1) p2 (NOT p3)))), (F (NOT (OR (NOT p1) p2))), (F (NOT p0)), (F (NOT p3)), (F (NOT (OR (NOT p1) p2 p3 (NOT p0)))), (F (NOT (OR p1 p2 p3))), (F (NOT (OR (NOT p1) p3 (NOT p0)))), (F (NOT (OR p3 (NOT p0)))), (F (NOT (OR (NOT p1) p0))), (F (NOT (OR (NOT p1) p2 p3 p0))), (F (NOT (OR p2 (NOT p3)))), (F (NOT (OR p2 p3))), (F (NOT (OR (NOT p1) p3))), (F (NOT (OR (NOT p1) p3 p0))), (F (NOT (OR p1 p3 p0))), (F (NOT (OR p1 (NOT p0)))), (F (NOT (OR p1 p2 (NOT p3)))), (F (NOT (OR p1 p3 (NOT p0)))), (F (NOT (OR p2 p3 (NOT p0)))), (F (NOT (AND p1 p0))), (F (NOT (OR (NOT p1) p2 p3)))]
Knowledge based reduction with 17 factoid took 1522 ms. Reduced automaton from 32 states, 95 edges and 4 AP (stutter sensitive) to 32 states, 95 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1330 ms :[(NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) p0), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND (NOT p2) p0 (NOT p3)), (AND (NOT p2) p0), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p2) p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND (NOT p2) p0), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) p0), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (NOT p2), (NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 1274 ms :[(NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) p0), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND (NOT p2) p0 (NOT p3)), (AND (NOT p2) p0), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p2) p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND (NOT p2) p0), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) p0), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (NOT p2), (NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3))]
Support contains 7 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 192/192 transitions.
Applied a total of 0 rules in 1 ms. Remains 145 /145 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2025-06-08 11:28:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 11:28:49] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-08 11:28:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 11:28:49] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
Running 191 sub problems to find dead transitions.
[2025-06-08 11:28:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (OVERLAPS) 1/145 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 191 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:28:50] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:28:50] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (OVERLAPS) 192/337 variables, 145/166 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 6 (OVERLAPS) 0/337 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 166 constraints, problems are : Problem set: 0 solved, 191 unsolved in 8062 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 191 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (OVERLAPS) 1/145 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 191 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:28:57] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (OVERLAPS) 192/337 variables, 145/167 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 191/358 constraints. Problems are: Problem set: 0 solved, 191 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:29:01] [INFO ] Deduced a trap along path composed of 13 places in 28 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/337 variables, 1/359 constraints. Problems are: Problem set: 0 solved, 191 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:29:05] [INFO ] Deduced a trap along path composed of 6 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/337 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/337 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 10 (OVERLAPS) 0/337 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Int declared 337/337 variables, and 360 constraints, problems are : Problem set: 0 solved, 191 unsolved in 24088 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 32180ms problems are : Problem set: 0 solved, 191 unsolved
Search for dead transitions found 0 dead transitions in 32181ms
Finished structural reductions in LTL mode , in 1 iterations and 32355 ms. Remains : 145/145 places, 192/192 transitions.
Computed a total of 25 stabilizing places and 25 stable transitions
Computed a total of 25 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND p2 p3 p1 p0), (X p2), (X p3), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (X (X p3)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X p1)), (X (X (NOT (AND p1 (NOT p2) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 359 ms. Reduced automaton from 32 states, 95 edges and 4 AP (stutter sensitive) to 32 states, 95 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1512 ms :[(NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) p0), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND (NOT p2) p0 (NOT p3)), (AND (NOT p2) p0), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p2) p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND (NOT p2) p0), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) p0), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (NOT p2), (NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3))]
RANDOM walk for 40000 steps (8 resets) in 368 ms. (108 steps per ms) remains 10/31 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 58 ms. (678 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 56 ms. (701 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 75 ms. (526 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 33 ms. (1176 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 10/10 properties
[2025-06-08 11:29:23] [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/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 101/108 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 37/145 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 192/337 variables, 145/164 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/337 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 164 constraints, problems are : Problem set: 0 solved, 10 unsolved in 282 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 101/108 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:29:24] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:29:24] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:29:24] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 37/145 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:29:24] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 192/337 variables, 145/168 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/337 variables, 10/178 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:29:24] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:29:24] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:29:24] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/337 variables, 3/181 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/337 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 0/337 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 337/337 variables, and 181 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1089 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1377ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 8 different solutions.
Finished Parikh walk after 2370 steps, including 30 resets, run visited all 10 properties in 16 ms. (steps per millisecond=148 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 10 properties in 18 ms.
Knowledge obtained : [(AND p2 p3 p1 p0), (X p2), (X p3), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (X (X p3)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X p1)), (X (X (NOT (AND p1 (NOT p2) (NOT p3)))))]
False Knowledge obtained : [(F (NOT (OR p2 (NOT p3) (NOT p0)))), (F (NOT (OR p2 p3 (NOT p1) p0))), (F (NOT (OR p2 (NOT p3) (NOT p1)))), (F (NOT (OR p3 p1 p0))), (F (NOT (OR p2 (NOT p0)))), (F (NOT (OR p2 (NOT p3) p1 (NOT p0)))), (F (NOT (OR p1 (NOT p0)))), (F (NOT (OR p2 (NOT p1)))), (F (NOT p2)), (F (NOT p0)), (F (NOT (OR p2 p3 p1))), (F (NOT (OR p2 p3 p1 p0))), (F (NOT p3)), (F (NOT (OR p1 p0))), (F (NOT (OR p3 (NOT p1) (NOT p0)))), (F (NOT (OR p3 p1 (NOT p0)))), (F (NOT (OR p2 p3 (NOT p1) (NOT p0)))), (F (NOT (OR p3 p1))), (F (NOT (OR p3 (NOT p1)))), (F (NOT (OR p2 (NOT p3) p1))), (F (NOT (OR p2 p3))), (F (NOT (OR p3 (NOT p1) p0))), (F (NOT (OR p2 p3 (NOT p0)))), (F (NOT (AND p1 p0))), (F (NOT (OR p2 (NOT p1) (NOT p0)))), (F (NOT (OR p2 (NOT p3)))), (F (NOT (OR p2 p3 p1 (NOT p0)))), (F (NOT (OR p2 p3 (NOT p1)))), (F (NOT (OR p3 (NOT p0)))), (F (NOT (OR (NOT p1) p0))), (F (NOT p1))]
Knowledge based reduction with 17 factoid took 1679 ms. Reduced automaton from 32 states, 95 edges and 4 AP (stutter sensitive) to 32 states, 95 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1549 ms :[(NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) p0), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND (NOT p2) p0 (NOT p3)), (AND (NOT p2) p0), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p2) p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND (NOT p2) p0), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) p0), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (NOT p2), (NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 1595 ms :[(NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) p0), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND (NOT p2) p0 (NOT p3)), (AND (NOT p2) p0), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p2) p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND (NOT p2) p0), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) p0), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (NOT p2), (NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 1612 ms :[(NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) p0), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND (NOT p2) p0 (NOT p3)), (AND (NOT p2) p0), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p2) p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND (NOT p2) p0), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) p0), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (NOT p2), (NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 14299 reset in 92 ms.
Product exploration explored 100000 steps with 14253 reset in 96 ms.
Applying partial POR strategy [false, false, false, false, false, false, false, false, false, false, false, false, false, false, true, false, true, false, true, true, true, true, true, true, true, true, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 1550 ms :[(NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) p0), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND (NOT p2) p0 (NOT p3)), (AND (NOT p2) p0), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p2) p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND (NOT p2) p0), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) p0), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (NOT p2), (NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3))]
Support contains 7 out of 145 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 145/145 places, 192/192 transitions.
Graph (trivial) has 112 edges and 145 vertex of which 6 / 145 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 142 transition count 189
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 13 Pre rules applied. Total rules applied 13 place count 142 transition count 200
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 26 place count 142 transition count 200
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 30 place count 138 transition count 196
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 34 place count 138 transition count 196
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 68 places in 0 ms
Iterating global reduction 1 with 47 rules applied. Total rules applied 81 place count 138 transition count 196
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 98 place count 121 transition count 164
Deduced a syphon composed of 53 places in 0 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 115 place count 121 transition count 164
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 117 place count 121 transition count 162
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 119 place count 119 transition count 160
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 121 place count 119 transition count 160
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 62 places in 0 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 132 place count 119 transition count 182
Deduced a syphon composed of 62 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 160 place count 119 transition count 154
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 169 place count 110 transition count 145
Deduced a syphon composed of 53 places in 0 ms
Iterating global reduction 2 with 9 rules applied. Total rules applied 178 place count 110 transition count 145
Deduced a syphon composed of 53 places in 0 ms
Applied a total of 178 rules in 46 ms. Remains 110 /145 variables (removed 35) and now considering 145/192 (removed 47) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 11:29:33] [INFO ] Redundant transitions in 21 ms returned []
Running 144 sub problems to find dead transitions.
[2025-06-08 11:29:33] [INFO ] Flow matrix only has 132 transitions (discarded 13 similar events)
// Phase 1: matrix 132 rows 110 cols
[2025-06-08 11:29:33] [INFO ] Computed 19 invariants in 1 ms
[2025-06-08 11:29:33] [INFO ] State equation strengthened by 26 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/110 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:29:34] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:29:34] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
Problem TDEAD4 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:29:34] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 2 ms to minimize.
Problem TDEAD6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:29:34] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 2 ms to minimize.
Problem TDEAD8 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:29:34] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 2 ms to minimize.
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:29:34] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:29:34] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 2 ms to minimize.
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:29:34] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 2 ms to minimize.
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:29:34] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:29:34] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 2 ms to minimize.
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:29:35] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 2 ms to minimize.
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:29:35] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 2 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:29:35] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:29:35] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 2 ms to minimize.
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:29:35] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:29:35] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
Problem TDEAD53 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:29:35] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 2 ms to minimize.
Problem TDEAD54 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD81 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:29:35] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
Problem TDEAD82 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:29:35] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 2 ms to minimize.
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD143 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 19/38 constraints. Problems are: Problem set: 67 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/38 constraints. Problems are: Problem set: 67 solved, 77 unsolved
At refinement iteration 4 (OVERLAPS) 131/241 variables, 110/148 constraints. Problems are: Problem set: 67 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 25/173 constraints. Problems are: Problem set: 67 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 0/173 constraints. Problems are: Problem set: 67 solved, 77 unsolved
At refinement iteration 7 (OVERLAPS) 1/242 variables, 1/174 constraints. Problems are: Problem set: 67 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 0/174 constraints. Problems are: Problem set: 67 solved, 77 unsolved
At refinement iteration 9 (OVERLAPS) 0/242 variables, 0/174 constraints. Problems are: Problem set: 67 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 174 constraints, problems are : Problem set: 67 solved, 77 unsolved in 4664 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 110/110 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 67 solved, 77 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 67 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 54/110 variables, 19/19 constraints. Problems are: Problem set: 67 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 19/38 constraints. Problems are: Problem set: 67 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/38 constraints. Problems are: Problem set: 67 solved, 77 unsolved
At refinement iteration 4 (OVERLAPS) 131/241 variables, 110/148 constraints. Problems are: Problem set: 67 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 25/173 constraints. Problems are: Problem set: 67 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 77/250 constraints. Problems are: Problem set: 67 solved, 77 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:29:40] [INFO ] Deduced a trap along path composed of 3 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 1/251 constraints. Problems are: Problem set: 67 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 0/251 constraints. Problems are: Problem set: 67 solved, 77 unsolved
At refinement iteration 9 (OVERLAPS) 1/242 variables, 1/252 constraints. Problems are: Problem set: 67 solved, 77 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 0/252 constraints. Problems are: Problem set: 67 solved, 77 unsolved
At refinement iteration 11 (OVERLAPS) 0/242 variables, 0/252 constraints. Problems are: Problem set: 67 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 252 constraints, problems are : Problem set: 67 solved, 77 unsolved in 10221 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 110/110 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 77/144 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 14907ms problems are : Problem set: 67 solved, 77 unsolved
Search for dead transitions found 67 dead transitions in 14908ms
Found 67 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 67 transitions
Dead transitions reduction (with SMT) removed 67 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 110/145 places, 78/192 transitions.
Graph (complete) has 462 edges and 110 vertex of which 57 are kept as prefixes of interest. Removing 53 places using SCC suffix rule.4 ms
Discarding 53 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 57 transition count 91
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 15 ms. Remains 57 /110 variables (removed 53) and now considering 91/78 (removed -13) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 57/145 places, 91/192 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 15000 ms. Remains : 57/145 places, 91/192 transitions.
Built C files in :
/tmp/ltsmin1689735778912013214
[2025-06-08 11:29:48] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1689735778912013214
Running compilation step : cd /tmp/ltsmin1689735778912013214;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 395 ms.
Running link step : cd /tmp/ltsmin1689735778912013214;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin1689735778912013214;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7626892417224621782.hoa' '--buchi-type=spotba'
LTSmin run took 123 ms.
FORMULA ErlangenMainframeV0-PT-1302-LTLCardinality-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ErlangenMainframeV0-PT-1302-LTLCardinality-04 finished in 69359 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)&&X(X(F(p1)))))))'
Support contains 4 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 2770/2770 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 174 transition count 1281
Ensure Unique test removed 3 places
Iterating global reduction 0 with 24 rules applied. Total rules applied 45 place count 171 transition count 1281
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 57 place count 159 transition count 376
Iterating global reduction 0 with 12 rules applied. Total rules applied 69 place count 159 transition count 376
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 77 place count 151 transition count 310
Ensure Unique test removed 5 places
Iterating global reduction 0 with 13 rules applied. Total rules applied 90 place count 146 transition count 310
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 95 place count 141 transition count 186
Iterating global reduction 0 with 5 rules applied. Total rules applied 100 place count 141 transition count 186
Applied a total of 100 rules in 47 ms. Remains 141 /195 variables (removed 54) and now considering 186/2770 (removed 2584) transitions.
// Phase 1: matrix 186 rows 141 cols
[2025-06-08 11:29:49] [INFO ] Computed 20 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 11:29:49] [INFO ] Implicit Places using invariants in 59 ms returned [103]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 60 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 140/195 places, 186/2770 transitions.
Applied a total of 0 rules in 2 ms. Remains 140 /140 variables (removed 0) and now considering 186/186 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 109 ms. Remains : 140/195 places, 186/2770 transitions.
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : ErlangenMainframeV0-PT-1302-LTLCardinality-06
Product exploration explored 100000 steps with 20000 reset in 69 ms.
Product exploration explored 100000 steps with 20000 reset in 63 ms.
Computed a total of 25 stabilizing places and 25 stable transitions
Computed a total of 25 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 66 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 328 steps (0 resets) in 6 ms. (46 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X (X p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 2 factoid took 99 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 209 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 140 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 186/186 transitions.
Applied a total of 0 rules in 4 ms. Remains 140 /140 variables (removed 0) and now considering 186/186 (removed 0) transitions.
// Phase 1: matrix 186 rows 140 cols
[2025-06-08 11:29:50] [INFO ] Computed 19 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 11:29:50] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-08 11:29:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 11:29:50] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
Running 185 sub problems to find dead transitions.
[2025-06-08 11:29:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/140 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:29:52] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:29:52] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 186/326 variables, 140/161 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:29:54] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:29:54] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 2/163 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (OVERLAPS) 0/326 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 163 constraints, problems are : Problem set: 0 solved, 185 unsolved in 8729 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/140 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:30:00] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (OVERLAPS) 186/326 variables, 140/164 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 185/349 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:30:01] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:30:01] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/326 variables, 2/351 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:30:04] [INFO ] Deduced a trap along path composed of 13 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/326 variables, 1/352 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:30:08] [INFO ] Deduced a trap along path composed of 5 places in 27 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/326 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/326 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 11 (OVERLAPS) 0/326 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 353 constraints, problems are : Problem set: 0 solved, 185 unsolved in 22807 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 31555ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 31556ms
Finished structural reductions in LTL mode , in 1 iterations and 31702 ms. Remains : 140/140 places, 186/186 transitions.
Computed a total of 25 stabilizing places and 25 stable transitions
Computed a total of 25 stabilizing places and 25 stable transitions
Knowledge obtained : [p1]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 67 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 555 steps (0 resets) in 6 ms. (79 steps per ms) remains 0/1 properties
Knowledge obtained : [p1]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 1 factoid took 79 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 156 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 20000 reset in 61 ms.
Product exploration explored 100000 steps with 20000 reset in 63 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 184 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 186/186 transitions.
Graph (trivial) has 111 edges and 140 vertex of which 6 / 140 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 137 transition count 183
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 17 Pre rules applied. Total rules applied 10 place count 137 transition count 198
Deduced a syphon composed of 26 places in 1 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 27 place count 137 transition count 198
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 34 place count 130 transition count 191
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 41 place count 130 transition count 191
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 129 transition count 189
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 129 transition count 189
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 68 places in 0 ms
Iterating global reduction 1 with 48 rules applied. Total rules applied 91 place count 129 transition count 189
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 104 place count 116 transition count 157
Deduced a syphon composed of 58 places in 0 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 117 place count 116 transition count 157
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 120 place count 116 transition count 154
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 123 place count 113 transition count 151
Deduced a syphon composed of 55 places in 0 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 126 place count 113 transition count 151
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -42
Deduced a syphon composed of 69 places in 0 ms
Iterating global reduction 2 with 14 rules applied. Total rules applied 140 place count 113 transition count 193
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 141 place count 112 transition count 191
Deduced a syphon composed of 68 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 142 place count 112 transition count 191
Deduced a syphon composed of 68 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 43 transitions
Redundant transition composition rules discarded 43 transitions
Iterating global reduction 2 with 43 rules applied. Total rules applied 185 place count 112 transition count 148
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 198 place count 99 transition count 135
Deduced a syphon composed of 55 places in 0 ms
Iterating global reduction 2 with 13 rules applied. Total rules applied 211 place count 99 transition count 135
Deduced a syphon composed of 55 places in 0 ms
Applied a total of 211 rules in 50 ms. Remains 99 /140 variables (removed 41) and now considering 135/186 (removed 51) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 11:30:23] [INFO ] Redundant transitions in 3 ms returned []
Running 133 sub problems to find dead transitions.
[2025-06-08 11:30:23] [INFO ] Flow matrix only has 116 transitions (discarded 19 similar events)
// Phase 1: matrix 116 rows 99 cols
[2025-06-08 11:30:23] [INFO ] Computed 19 invariants in 0 ms
[2025-06-08 11:30:23] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 133 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:30:24] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:30:24] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 2 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:30:24] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 2 ms to minimize.
Problem TDEAD4 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:30:24] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:30:24] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 2 ms to minimize.
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:30:24] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:30:24] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:30:24] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:30:24] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 2 ms to minimize.
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:30:24] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 2 ms to minimize.
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:30:24] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:30:24] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:30:24] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:30:24] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 2 ms to minimize.
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:30:24] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:30:24] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:30:24] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:30:24] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
Problem TDEAD70 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:30:24] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 19/38 constraints. Problems are: Problem set: 73 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/38 constraints. Problems are: Problem set: 73 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 115/214 variables, 99/137 constraints. Problems are: Problem set: 73 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 24/161 constraints. Problems are: Problem set: 73 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/161 constraints. Problems are: Problem set: 73 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 1/215 variables, 1/162 constraints. Problems are: Problem set: 73 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 0/162 constraints. Problems are: Problem set: 73 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/215 variables, 0/162 constraints. Problems are: Problem set: 73 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 215/215 variables, and 162 constraints, problems are : Problem set: 73 solved, 60 unsolved in 3367 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 99/99 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 73 solved, 60 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 73 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 56/99 variables, 19/19 constraints. Problems are: Problem set: 73 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 19/38 constraints. Problems are: Problem set: 73 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/38 constraints. Problems are: Problem set: 73 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 115/214 variables, 99/137 constraints. Problems are: Problem set: 73 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 24/161 constraints. Problems are: Problem set: 73 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 60/221 constraints. Problems are: Problem set: 73 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 0/221 constraints. Problems are: Problem set: 73 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 1/215 variables, 1/222 constraints. Problems are: Problem set: 73 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/215 variables, 0/222 constraints. Problems are: Problem set: 73 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/215 variables, 0/222 constraints. Problems are: Problem set: 73 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 215/215 variables, and 222 constraints, problems are : Problem set: 73 solved, 60 unsolved in 4209 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 99/99 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/133 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7595ms problems are : Problem set: 73 solved, 60 unsolved
Search for dead transitions found 73 dead transitions in 7595ms
Found 73 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 73 transitions
Dead transitions reduction (with SMT) removed 73 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 99/140 places, 62/186 transitions.
Graph (complete) has 375 edges and 99 vertex of which 44 are kept as prefixes of interest. Removing 55 places using SCC suffix rule.1 ms
Discarding 55 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 44 /99 variables (removed 55) and now considering 62/62 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 44/140 places, 62/186 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7661 ms. Remains : 44/140 places, 62/186 transitions.
Built C files in :
/tmp/ltsmin15230489969728317979
[2025-06-08 11:30:31] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15230489969728317979
Running compilation step : cd /tmp/ltsmin15230489969728317979;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 281 ms.
Running link step : cd /tmp/ltsmin15230489969728317979;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin15230489969728317979;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4731811165990553764.hoa' '--buchi-type=spotba'
LTSmin run took 2628 ms.
FORMULA ErlangenMainframeV0-PT-1302-LTLCardinality-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ErlangenMainframeV0-PT-1302-LTLCardinality-06 finished in 44725 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 195 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 195/195 places, 2770/2770 transitions.
Graph (trivial) has 144 edges and 195 vertex of which 6 / 195 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 191 transition count 2737
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 59 place count 162 transition count 2737
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 59 place count 162 transition count 2723
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 87 place count 148 transition count 2723
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 103 place count 132 transition count 1239
Ensure Unique test removed 3 places
Iterating global reduction 2 with 19 rules applied. Total rules applied 122 place count 129 transition count 1239
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 122 place count 129 transition count 1233
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 134 place count 123 transition count 1233
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 138 place count 119 transition count 417
Ensure Unique test removed 2 places
Iterating global reduction 2 with 6 rules applied. Total rules applied 144 place count 117 transition count 417
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 145 place count 116 transition count 289
Iterating global reduction 2 with 1 rules applied. Total rules applied 146 place count 116 transition count 289
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 250 place count 64 transition count 237
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 256 place count 58 transition count 138
Ensure Unique test removed 3 places
Iterating global reduction 2 with 9 rules applied. Total rules applied 265 place count 55 transition count 138
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 268 place count 55 transition count 135
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 271 place count 52 transition count 79
Iterating global reduction 3 with 3 rules applied. Total rules applied 274 place count 52 transition count 79
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 278 place count 50 transition count 86
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 290 place count 50 transition count 74
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 291 place count 50 transition count 74
Applied a total of 291 rules in 165 ms. Remains 50 /195 variables (removed 145) and now considering 74/2770 (removed 2696) transitions.
[2025-06-08 11:30:34] [INFO ] Flow matrix only has 55 transitions (discarded 19 similar events)
// Phase 1: matrix 55 rows 50 cols
[2025-06-08 11:30:34] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 11:30:34] [INFO ] Implicit Places using invariants in 44 ms returned [40]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 46 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/195 places, 74/2770 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 48 transition count 73
Applied a total of 2 rules in 3 ms. Remains 48 /49 variables (removed 1) and now considering 73/74 (removed 1) transitions.
[2025-06-08 11:30:34] [INFO ] Flow matrix only has 54 transitions (discarded 19 similar events)
// Phase 1: matrix 54 rows 48 cols
[2025-06-08 11:30:34] [INFO ] Computed 19 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 11:30:34] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-06-08 11:30:34] [INFO ] Flow matrix only has 54 transitions (discarded 19 similar events)
[2025-06-08 11:30:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 11:30:34] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-08 11:30:34] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 48/195 places, 73/2770 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 332 ms. Remains : 48/195 places, 73/2770 transitions.
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ErlangenMainframeV0-PT-1302-LTLCardinality-07
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV0-PT-1302-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1302-LTLCardinality-07 finished in 438 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 195 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 195/195 places, 2770/2770 transitions.
Graph (trivial) has 142 edges and 195 vertex of which 6 / 195 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 191 transition count 2739
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 55 place count 164 transition count 2739
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 55 place count 164 transition count 2725
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 83 place count 150 transition count 2725
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 98 place count 135 transition count 1211
Ensure Unique test removed 4 places
Iterating global reduction 2 with 19 rules applied. Total rules applied 117 place count 131 transition count 1211
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 117 place count 131 transition count 1206
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 127 place count 126 transition count 1206
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 133 place count 120 transition count 222
Ensure Unique test removed 2 places
Iterating global reduction 2 with 8 rules applied. Total rules applied 141 place count 118 transition count 222
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 144 place count 115 transition count 172
Iterating global reduction 2 with 3 rules applied. Total rules applied 147 place count 115 transition count 172
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 251 place count 63 transition count 120
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 256 place count 58 transition count 85
Ensure Unique test removed 2 places
Iterating global reduction 2 with 7 rules applied. Total rules applied 263 place count 56 transition count 85
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 266 place count 56 transition count 82
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 268 place count 54 transition count 76
Iterating global reduction 3 with 2 rules applied. Total rules applied 270 place count 54 transition count 76
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 276 place count 51 transition count 83
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 3 with 14 rules applied. Total rules applied 290 place count 51 transition count 69
Applied a total of 290 rules in 154 ms. Remains 51 /195 variables (removed 144) and now considering 69/2770 (removed 2701) transitions.
[2025-06-08 11:30:34] [INFO ] Flow matrix only has 50 transitions (discarded 19 similar events)
// Phase 1: matrix 50 rows 51 cols
[2025-06-08 11:30:34] [INFO ] Computed 20 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 11:30:34] [INFO ] Implicit Places using invariants in 51 ms returned [41]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 65 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/195 places, 69/2770 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 48 transition count 67
Applied a total of 4 rules in 2 ms. Remains 48 /50 variables (removed 2) and now considering 67/69 (removed 2) transitions.
[2025-06-08 11:30:34] [INFO ] Flow matrix only has 48 transitions (discarded 19 similar events)
// Phase 1: matrix 48 rows 48 cols
[2025-06-08 11:30:34] [INFO ] Computed 19 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 11:30:34] [INFO ] Implicit Places using invariants in 32 ms returned []
[2025-06-08 11:30:34] [INFO ] Flow matrix only has 48 transitions (discarded 19 similar events)
[2025-06-08 11:30:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 11:30:34] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-08 11:30:34] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 48/195 places, 67/2770 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 323 ms. Remains : 48/195 places, 67/2770 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-1302-LTLCardinality-08
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV0-PT-1302-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1302-LTLCardinality-08 finished in 367 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)))'
Support contains 2 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 2770/2770 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 173 transition count 2272
Ensure Unique test removed 4 places
Iterating global reduction 0 with 26 rules applied. Total rules applied 48 place count 169 transition count 2272
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 61 place count 156 transition count 343
Iterating global reduction 0 with 13 rules applied. Total rules applied 74 place count 156 transition count 343
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 82 place count 148 transition count 308
Ensure Unique test removed 5 places
Iterating global reduction 0 with 13 rules applied. Total rules applied 95 place count 143 transition count 308
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 100 place count 138 transition count 184
Iterating global reduction 0 with 5 rules applied. Total rules applied 105 place count 138 transition count 184
Applied a total of 105 rules in 44 ms. Remains 138 /195 variables (removed 57) and now considering 184/2770 (removed 2586) transitions.
// Phase 1: matrix 184 rows 138 cols
[2025-06-08 11:30:34] [INFO ] Computed 19 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 11:30:34] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-08 11:30:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 11:30:35] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
Running 183 sub problems to find dead transitions.
[2025-06-08 11:30:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (OVERLAPS) 1/138 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:30:36] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:30:36] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (OVERLAPS) 184/322 variables, 138/159 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 6 (OVERLAPS) 0/322 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 183 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 159 constraints, problems are : Problem set: 0 solved, 183 unsolved in 7419 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 138/138 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 183 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (OVERLAPS) 1/138 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:30:43] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (OVERLAPS) 184/322 variables, 138/160 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 183/343 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:30:44] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:30:45] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 2/345 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:30:47] [INFO ] Deduced a trap along path composed of 11 places in 40 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:30:47] [INFO ] Deduced a trap along path composed of 6 places in 18 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 2/347 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:30:52] [INFO ] Deduced a trap along path composed of 6 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 11:30:54] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/322 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 12 (OVERLAPS) 0/322 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 183 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 349 constraints, problems are : Problem set: 0 solved, 183 unsolved in 24833 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 138/138 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 32272ms problems are : Problem set: 0 solved, 183 unsolved
Search for dead transitions found 0 dead transitions in 32272ms
Starting structural reductions in LTL mode, iteration 1 : 138/195 places, 184/2770 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32493 ms. Remains : 138/195 places, 184/2770 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-1302-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 6878 steps with 0 reset in 17 ms.
FORMULA ErlangenMainframeV0-PT-1302-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1302-LTLCardinality-09 finished in 32605 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)||X(F((p1&&F(p2))))))'
Support contains 6 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 2770/2770 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 174 transition count 1250
Ensure Unique test removed 4 places
Iterating global reduction 0 with 25 rules applied. Total rules applied 46 place count 170 transition count 1250
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 58 place count 158 transition count 282
Iterating global reduction 0 with 12 rules applied. Total rules applied 70 place count 158 transition count 282
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 77 place count 151 transition count 248
Ensure Unique test removed 4 places
Iterating global reduction 0 with 11 rules applied. Total rules applied 88 place count 147 transition count 248
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 91 place count 144 transition count 192
Iterating global reduction 0 with 3 rules applied. Total rules applied 94 place count 144 transition count 192
Applied a total of 94 rules in 35 ms. Remains 144 /195 variables (removed 51) and now considering 192/2770 (removed 2578) transitions.
// Phase 1: matrix 192 rows 144 cols
[2025-06-08 11:31:07] [INFO ] Computed 20 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 11:31:07] [INFO ] Implicit Places using invariants in 64 ms returned [106]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 65 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 143/195 places, 192/2770 transitions.
Applied a total of 0 rules in 1 ms. Remains 143 /143 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 102 ms. Remains : 143/195 places, 192/2770 transitions.
Stuttering acceptance computed with spot in 184 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : ErlangenMainframeV0-PT-1302-LTLCardinality-12
Product exploration explored 100000 steps with 0 reset in 178 ms.
Stack based approach found an accepted trace after 302 steps with 0 reset with depth 303 and stack size 285 in 1 ms.
FORMULA ErlangenMainframeV0-PT-1302-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV0-PT-1302-LTLCardinality-12 finished in 485 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&&X(p1))))))'
Support contains 3 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 2770/2770 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 174 transition count 1250
Ensure Unique test removed 4 places
Iterating global reduction 0 with 25 rules applied. Total rules applied 46 place count 170 transition count 1250
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 58 place count 158 transition count 282
Iterating global reduction 0 with 12 rules applied. Total rules applied 70 place count 158 transition count 282
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 76 place count 152 transition count 250
Ensure Unique test removed 3 places
Iterating global reduction 0 with 9 rules applied. Total rules applied 85 place count 149 transition count 250
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 88 place count 146 transition count 194
Iterating global reduction 0 with 3 rules applied. Total rules applied 91 place count 146 transition count 194
Applied a total of 91 rules in 37 ms. Remains 146 /195 variables (removed 49) and now considering 194/2770 (removed 2576) transitions.
// Phase 1: matrix 194 rows 146 cols
[2025-06-08 11:31:08] [INFO ] Computed 21 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 11:31:08] [INFO ] Implicit Places using invariants in 63 ms returned [107]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 76 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 145/195 places, 194/2770 transitions.
Applied a total of 0 rules in 1 ms. Remains 145 /145 variables (removed 0) and now considering 194/194 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 114 ms. Remains : 145/195 places, 194/2770 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ErlangenMainframeV0-PT-1302-LTLCardinality-15
Product exploration explored 100000 steps with 5 reset in 192 ms.
Stack based approach found an accepted trace after 114 steps with 0 reset with depth 115 and stack size 115 in 1 ms.
FORMULA ErlangenMainframeV0-PT-1302-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV0-PT-1302-LTLCardinality-15 finished in 436 ms.
All properties solved by simple procedures.
Total runtime 299622 ms.

BK_STOP 1749382268461

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="ErlangenMainframeV0-PT-1302"
export BK_EXAMINATION="LTLCardinality"
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 ErlangenMainframeV0-PT-1302, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r254-tall-174931339800411"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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