About the Execution of ITS-Tools for NoC3x3-PT-8B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 860.932 | 963556.00 | 1207104.00 | 3281.30 | FTFFFFFFFFTFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r194-tall-177969914100380.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is NoC3x3-PT-8B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-tall-177969914100380
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.4M
-rw-r--r-- 1 mcc users 7.2K Mar 8 06:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Mar 8 06:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Mar 8 06:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 8 06:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 16 08:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 16 08:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 16 08:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 16 08:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 8 06:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Mar 8 06:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Mar 8 06:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 8 06:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 16 08:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 16 08:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 3.0M Mar 3 18:30 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 NoC3x3-PT-8B-LTLFireability-00
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-01
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-02
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-03
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-04
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-05
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-06
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-07
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-08
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-09
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-10
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-11
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-12
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-13
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-14
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1779768785982
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-8B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-26 04:13:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-26 04:13:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 04:13:07] [INFO ] Load time of PNML (sax parser for PT used): 375 ms
[2026-05-26 04:13:07] [INFO ] Transformed 9140 places.
[2026-05-26 04:13:07] [INFO ] Transformed 14577 transitions.
[2026-05-26 04:13:07] [INFO ] Found NUPN structural information;
[2026-05-26 04:13:07] [INFO ] Parsed PT model containing 9140 places and 14577 transitions and 30726 arcs in 581 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA NoC3x3-PT-8B-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-8B-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-8B-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 9140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9140/9140 places, 14577/14577 transitions.
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 9107 transition count 14577
Discarding 5502 places :
Symmetric choice reduction at 1 with 5502 rule applications. Total rules 5535 place count 3605 transition count 9075
Iterating global reduction 1 with 5502 rules applied. Total rules applied 11037 place count 3605 transition count 9075
Ensure Unique test removed 3052 transitions
Reduce isomorphic transitions removed 3052 transitions.
Iterating post reduction 1 with 3052 rules applied. Total rules applied 14089 place count 3605 transition count 6023
Discarding 1995 places :
Symmetric choice reduction at 2 with 1995 rule applications. Total rules 16084 place count 1610 transition count 4028
Iterating global reduction 2 with 1995 rules applied. Total rules applied 18079 place count 1610 transition count 4028
Ensure Unique test removed 1866 transitions
Reduce isomorphic transitions removed 1866 transitions.
Iterating post reduction 2 with 1866 rules applied. Total rules applied 19945 place count 1610 transition count 2162
Discarding 66 places :
Symmetric choice reduction at 3 with 66 rule applications. Total rules 20011 place count 1544 transition count 2096
Iterating global reduction 3 with 66 rules applied. Total rules applied 20077 place count 1544 transition count 2096
Applied a total of 20077 rules in 1359 ms. Remains 1544 /9140 variables (removed 7596) and now considering 2096/14577 (removed 12481) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-532466896608704258.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7678772708951842678.kers'
[2026-05-26 04:13:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-532466896608704258.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7678772708951842678.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 2096 rows 1544 cols 5514 entries
Finished phase 1 with 1478 SingleSign rule and 0 generalized
[2026-05-26 04:13:09] [INFO ] Computed 66 invariants in 9 ms
Computed 66 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-7678772708951842678.kers
Total runtime 12 ms.
[2026-05-26 04:13:10] [INFO ] Implicit Places using invariants in 793 ms returned []
[2026-05-26 04:13:10] [INFO ] Invariant cache hit.
[2026-05-26 04:13:11] [INFO ] Implicit Places using invariants and state equation in 1303 ms returned []
Implicit Place search using SMT with State Equation took 2125 ms to find 0 implicit places.
Running 2095 sub problems to find dead transitions.
[2026-05-26 04:13:11] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1543/3640 variables, and 0 constraints, problems are : Problem set: 0 solved, 2095 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1544 constraints, PredecessorRefiner: 2095/2095 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2095 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1543/3640 variables, and 0 constraints, problems are : Problem set: 0 solved, 2095 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1544 constraints, PredecessorRefiner: 0/2095 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60634ms problems are : Problem set: 0 solved, 2095 unsolved
Search for dead transitions found 0 dead transitions in 60659ms
Starting structural reductions in LTL mode, iteration 1 : 1544/9140 places, 2096/14577 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64181 ms. Remains : 1544/9140 places, 2096/14577 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1544/1544 places, 2096/2096 transitions.
Applied a total of 0 rules in 45 ms. Remains 1544 /1544 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
[2026-05-26 04:14:12] [INFO ] Invariant cache hit.
[2026-05-26 04:14:13] [INFO ] Implicit Places using invariants in 520 ms returned []
[2026-05-26 04:14:13] [INFO ] Invariant cache hit.
[2026-05-26 04:14:14] [INFO ] Implicit Places using invariants and state equation in 1347 ms returned []
Implicit Place search using SMT with State Equation took 1869 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1915 ms. Remains : 1544/1544 places, 2096/2096 transitions.
Support contains 33 out of 1544 places after structural reductions.
[2026-05-26 04:14:14] [INFO ] Flatten gal took : 135 ms
[2026-05-26 04:14:14] [INFO ] Flatten gal took : 79 ms
[2026-05-26 04:14:14] [INFO ] Input system was already deterministic with 2096 transitions.
RANDOM walk for 40000 steps (15 resets) in 1494 ms. (26 steps per ms) remains 3/33 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 122 ms. (325 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 3/3 properties
[2026-05-26 04:14:15] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 166/169 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1308/1477 variables, 63/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1477 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2062/3539 variables, 1477/1543 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3539 variables, 0/1543 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 101/3640 variables, 67/1610 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3640 variables, 0/1610 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/3640 variables, 0/1610 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3640/3640 variables, and 1610 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1069 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 1544/1544 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 166/169 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1308/1477 variables, 63/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1477 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2062/3539 variables, 1477/1543 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3539 variables, 3/1546 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3539 variables, 2/1548 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3539 variables, 0/1548 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 101/3640 variables, 67/1615 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3640 variables, 0/1615 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/3640 variables, 0/1615 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3640/3640 variables, and 1615 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2486 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 1544/1544 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3571ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 770 ms.
Support contains 2 out of 1544 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1544/1544 places, 2096/2096 transitions.
Graph (trivial) has 1353 edges and 1544 vertex of which 491 / 1544 are part of one of the 33 SCC in 8 ms
Free SCC test removed 458 places
Drop transitions (Empty/Sink Transition effects.) removed 530 transitions
Reduce isomorphic transitions removed 530 transitions.
Graph (complete) has 2651 edges and 1086 vertex of which 1085 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 206 transitions
Trivial Post-agglo rules discarded 206 transitions
Performed 206 trivial Post agglomeration. Transition count delta: 206
Iterating post reduction 0 with 254 rules applied. Total rules applied 256 place count 1085 transition count 1312
Reduce places removed 206 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 231 rules applied. Total rules applied 487 place count 879 transition count 1287
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 18 rules applied. Total rules applied 505 place count 869 transition count 1279
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 509 place count 865 transition count 1279
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 94 Pre rules applied. Total rules applied 509 place count 865 transition count 1185
Deduced a syphon composed of 94 places in 2 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 4 with 188 rules applied. Total rules applied 697 place count 771 transition count 1185
Discarding 97 places :
Symmetric choice reduction at 4 with 97 rule applications. Total rules 794 place count 674 transition count 996
Iterating global reduction 4 with 97 rules applied. Total rules applied 891 place count 674 transition count 996
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 4 with 70 rules applied. Total rules applied 961 place count 674 transition count 926
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 961 place count 674 transition count 925
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 963 place count 673 transition count 925
Performed 225 Post agglomeration using F-continuation condition.Transition count delta: 225
Deduced a syphon composed of 225 places in 1 ms
Reduce places removed 225 places and 0 transitions.
Iterating global reduction 5 with 450 rules applied. Total rules applied 1413 place count 448 transition count 700
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 5 with 48 rules applied. Total rules applied 1461 place count 448 transition count 652
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 1467 place count 445 transition count 693
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1468 place count 445 transition count 692
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 1476 place count 445 transition count 684
Free-agglomeration rule applied 206 times.
Iterating global reduction 7 with 206 rules applied. Total rules applied 1682 place count 445 transition count 478
Reduce places removed 206 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (complete) has 789 edges and 239 vertex of which 232 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 0 output transitions
Iterating post reduction 7 with 220 rules applied. Total rules applied 1902 place count 232 transition count 465
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 1909 place count 232 transition count 458
Drop transitions (Redundant composition of simpler transitions.) removed 167 transitions
Redundant transition composition rules discarded 167 transitions
Iterating global reduction 9 with 167 rules applied. Total rules applied 2076 place count 232 transition count 291
Reduce places removed 8 places and 0 transitions.
Graph (complete) has 607 edges and 224 vertex of which 201 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.1 ms
Discarding 23 places :
Also discarding 0 output transitions
Iterating post reduction 9 with 9 rules applied. Total rules applied 2085 place count 201 transition count 291
Drop transitions (Empty/Sink Transition effects.) removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 10 with 23 rules applied. Total rules applied 2108 place count 201 transition count 268
Partial Free-agglomeration rule applied 25 times.
Drop transitions (Partial Free agglomeration) removed 25 transitions
Iterating global reduction 11 with 25 rules applied. Total rules applied 2133 place count 201 transition count 268
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 2134 place count 201 transition count 267
Applied a total of 2134 rules in 309 ms. Remains 201 /1544 variables (removed 1343) and now considering 267/2096 (removed 1829) transitions.
Running 258 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14738260730716955829.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12691589906160708730.kers'
[2026-05-26 04:14:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14738260730716955829.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12691589906160708730.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 267 rows 193 cols 1120 entries
Finished phase 1 with 143 SingleSign rule and 0 generalized
[2026-05-26 04:14:20] [INFO ] Computed 58 invariants in 1 ms
Computed 58 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-12691589906160708730.kers
Total runtime 5 ms.
[2026-05-26 04:14:20] [INFO ] State equation strengthened by 190 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (OVERLAPS) 1/201 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Problem TDEAD247 is UNSAT
At refinement iteration 3 (OVERLAPS) 267/468 variables, 201/259 constraints. Problems are: Problem set: 1 solved, 257 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/468 variables, 190/449 constraints. Problems are: Problem set: 1 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 0/449 constraints. Problems are: Problem set: 1 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 0/468 variables, 0/449 constraints. Problems are: Problem set: 1 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Real declared 468/468 variables, and 449 constraints, problems are : Problem set: 1 solved, 257 unsolved in 12119 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 201/201 constraints, ReadFeed: 190/190 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/201 variables, 58/58 constraints. Problems are: Problem set: 1 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 0/58 constraints. Problems are: Problem set: 1 solved, 257 unsolved
At refinement iteration 3 (OVERLAPS) 267/468 variables, 201/259 constraints. Problems are: Problem set: 1 solved, 257 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/468 variables, 190/449 constraints. Problems are: Problem set: 1 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 257/706 constraints. Problems are: Problem set: 1 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 1/707 constraints. Problems are: Problem set: 1 solved, 257 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 468/468 variables, and 707 constraints, problems are : Problem set: 1 solved, 257 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 201/201 constraints, ReadFeed: 190/190 constraints, PredecessorRefiner: 257/258 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 32211ms problems are : Problem set: 1 solved, 257 unsolved
Search for dead transitions found 1 dead transitions in 32213ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 201/1544 places, 266/2096 transitions.
Applied a total of 0 rules in 11 ms. Remains 201 /201 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32534 ms. Remains : 201/1544 places, 266/2096 transitions.
RANDOM walk for 17231 steps (4 resets) in 99 ms. (172 steps per ms) remains 0/2 properties
Computed a total of 199 stabilizing places and 317 stable transitions
Graph (complete) has 3236 edges and 1544 vertex of which 1543 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.36 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&G((F((G(F(p1))||(p2&&F(p1)))) U X(p3)))))'
Support contains 4 out of 1544 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1544/1544 places, 2096/2096 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 1521 transition count 2073
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 1521 transition count 2073
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 67 place count 1521 transition count 2052
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 74 place count 1514 transition count 2045
Iterating global reduction 1 with 7 rules applied. Total rules applied 81 place count 1514 transition count 2045
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 88 place count 1514 transition count 2038
Applied a total of 88 rules in 161 ms. Remains 1514 /1544 variables (removed 30) and now considering 2038/2096 (removed 58) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-291395399536636721.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13317583884676398990.kers'
[2026-05-26 04:14:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-291395399536636721.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13317583884676398990.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 2038 rows 1514 cols 5398 entries
Finished phase 1 with 1448 SingleSign rule and 0 generalized
[2026-05-26 04:14:53] [INFO ] Computed 66 invariants in 14 ms
Computed 66 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-13317583884676398990.kers
Total runtime 16 ms.
[2026-05-26 04:14:53] [INFO ] Implicit Places using invariants in 513 ms returned []
[2026-05-26 04:14:53] [INFO ] Invariant cache hit.
[2026-05-26 04:14:54] [INFO ] Implicit Places using invariants and state equation in 1286 ms returned []
Implicit Place search using SMT with State Equation took 1805 ms to find 0 implicit places.
Running 2037 sub problems to find dead transitions.
[2026-05-26 04:14:54] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1513/3552 variables, and 0 constraints, problems are : Problem set: 0 solved, 2037 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1514 constraints, PredecessorRefiner: 2037/2037 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2037 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1513/3552 variables, and 0 constraints, problems are : Problem set: 0 solved, 2037 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1514 constraints, PredecessorRefiner: 0/2037 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60466ms problems are : Problem set: 0 solved, 2037 unsolved
Search for dead transitions found 0 dead transitions in 60471ms
Starting structural reductions in LTL mode, iteration 1 : 1514/1544 places, 2038/2096 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62453 ms. Remains : 1514/1544 places, 2038/2096 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&G((F((G(F(p1))||(p2&&F(p1)))) U X(p3)))))'
Stuttering acceptance computed with spot in 453 ms :[(OR (NOT p3) (NOT p0)), (NOT p0), false, (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p3), (NOT p1), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-00
Stuttering criterion allowed to conclude after 6095 steps with 7 reset in 43 ms.
FORMULA NoC3x3-PT-8B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLFireability-00 finished in 63077 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1544 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1544/1544 places, 2096/2096 transitions.
Graph (trivial) has 1354 edges and 1544 vertex of which 491 / 1544 are part of one of the 33 SCC in 4 ms
Free SCC test removed 458 places
Ensure Unique test removed 496 transitions
Reduce isomorphic transitions removed 496 transitions.
Graph (complete) has 2684 edges and 1086 vertex of which 1085 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 206 transitions
Trivial Post-agglo rules discarded 206 transitions
Performed 206 trivial Post agglomeration. Transition count delta: 206
Iterating post reduction 0 with 254 rules applied. Total rules applied 256 place count 1084 transition count 1344
Reduce places removed 206 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 231 rules applied. Total rules applied 487 place count 878 transition count 1319
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 2 with 20 rules applied. Total rules applied 507 place count 868 transition count 1309
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 512 place count 863 transition count 1309
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 94 Pre rules applied. Total rules applied 512 place count 863 transition count 1215
Deduced a syphon composed of 94 places in 2 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 4 with 188 rules applied. Total rules applied 700 place count 769 transition count 1215
Discarding 98 places :
Symmetric choice reduction at 4 with 98 rule applications. Total rules 798 place count 671 transition count 1025
Iterating global reduction 4 with 98 rules applied. Total rules applied 896 place count 671 transition count 1025
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 4 with 70 rules applied. Total rules applied 966 place count 671 transition count 955
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 966 place count 671 transition count 954
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 968 place count 670 transition count 954
Performed 222 Post agglomeration using F-continuation condition.Transition count delta: 222
Deduced a syphon composed of 222 places in 0 ms
Reduce places removed 222 places and 0 transitions.
Iterating global reduction 5 with 444 rules applied. Total rules applied 1412 place count 448 transition count 732
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 5 with 48 rules applied. Total rules applied 1460 place count 448 transition count 684
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1461 place count 448 transition count 684
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1463 place count 446 transition count 682
Reduce places removed 9 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 6 with 33 rules applied. Total rules applied 1496 place count 437 transition count 658
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 7 with 48 rules applied. Total rules applied 1544 place count 413 transition count 634
Applied a total of 1544 rules in 150 ms. Remains 413 /1544 variables (removed 1131) and now considering 634/2096 (removed 1462) transitions.
[2026-05-26 04:15:56] [INFO ] Flow matrix only has 602 transitions (discarded 32 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7539727596858414976.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5719555304029081040.kers'
[2026-05-26 04:15:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7539727596858414976.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5719555304029081040.kers]
Normalized transition count is 601 out of 602 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 601 rows 413 cols 1853 entries
Finished phase 1 with 356 SingleSign rule and 0 generalized
[2026-05-26 04:15:56] [INFO ] Computed 57 invariants in 2 ms
Computed 57 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5719555304029081040.kers
Total runtime 2 ms.
[2026-05-26 04:15:56] [INFO ] Implicit Places using invariants in 179 ms returned []
[2026-05-26 04:15:56] [INFO ] Flow matrix only has 602 transitions (discarded 32 similar events)
[2026-05-26 04:15:56] [INFO ] Invariant cache hit.
[2026-05-26 04:15:56] [INFO ] State equation strengthened by 28 read => feed constraints.
[2026-05-26 04:15:56] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 568 ms to find 0 implicit places.
[2026-05-26 04:15:56] [INFO ] Redundant transitions in 33 ms returned []
Running 592 sub problems to find dead transitions.
[2026-05-26 04:15:56] [INFO ] Flow matrix only has 602 transitions (discarded 32 similar events)
[2026-05-26 04:15:56] [INFO ] Invariant cache hit.
[2026-05-26 04:15:56] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/404 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/404 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 2 (OVERLAPS) 9/413 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/413 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 4 (OVERLAPS) 601/1014 variables, 413/470 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1014 variables, 28/498 constraints. Problems are: Problem set: 0 solved, 592 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1014/1015 variables, and 498 constraints, problems are : Problem set: 0 solved, 592 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 413/413 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 592/592 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 592 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/404 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/404 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 2 (OVERLAPS) 9/413 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/413 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 4 (OVERLAPS) 601/1014 variables, 413/470 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1014 variables, 28/498 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1014 variables, 592/1090 constraints. Problems are: Problem set: 0 solved, 592 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1014/1015 variables, and 1090 constraints, problems are : Problem set: 0 solved, 592 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 413/413 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 592/592 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60110ms problems are : Problem set: 0 solved, 592 unsolved
Search for dead transitions found 0 dead transitions in 60112ms
Starting structural reductions in SI_LTL mode, iteration 1 : 413/1544 places, 634/2096 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60872 ms. Remains : 413/1544 places, 634/2096 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-8B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLFireability-02 finished in 60956 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((p0&&X(p1)))||(X(X(p3))&&p2))))'
Support contains 4 out of 1544 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1544/1544 places, 2096/2096 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 1519 transition count 2071
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 1519 transition count 2071
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 73 place count 1519 transition count 2048
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 79 place count 1513 transition count 2042
Iterating global reduction 1 with 6 rules applied. Total rules applied 85 place count 1513 transition count 2042
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 91 place count 1513 transition count 2036
Applied a total of 91 rules in 883 ms. Remains 1513 /1544 variables (removed 31) and now considering 2036/2096 (removed 60) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1959074483222026355.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-870280965632070279.kers'
[2026-05-26 04:16:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1959074483222026355.kers, --Pflows, --basisKERS=/tmp/petrispot-output-870280965632070279.kers]
Culled 0 columns in 4 ms.
// Phase 1: matrix 2036 rows 1513 cols 5394 entries
Finished phase 1 with 1447 SingleSign rule and 0 generalized
[2026-05-26 04:16:57] [INFO ] Computed 66 invariants in 16 ms
Computed 66 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-870280965632070279.kers
Total runtime 18 ms.
[2026-05-26 04:16:58] [INFO ] Implicit Places using invariants in 528 ms returned []
[2026-05-26 04:16:58] [INFO ] Invariant cache hit.
[2026-05-26 04:16:59] [INFO ] Implicit Places using invariants and state equation in 1262 ms returned []
Implicit Place search using SMT with State Equation took 1792 ms to find 0 implicit places.
Running 2035 sub problems to find dead transitions.
[2026-05-26 04:16:59] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1512/3549 variables, and 0 constraints, problems are : Problem set: 0 solved, 2035 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1513 constraints, PredecessorRefiner: 2035/2035 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2035 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1512/3549 variables, and 0 constraints, problems are : Problem set: 0 solved, 2035 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1513 constraints, PredecessorRefiner: 0/2035 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60438ms problems are : Problem set: 0 solved, 2035 unsolved
Search for dead transitions found 0 dead transitions in 60442ms
Starting structural reductions in LTL mode, iteration 1 : 1513/1544 places, 2036/2096 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63123 ms. Remains : 1513/1544 places, 2036/2096 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((p0&&X(p1)))||(X(X(p3))&&p2))))'
Stuttering acceptance computed with spot in 248 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), true, (NOT p1), (NOT p3), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-8B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLFireability-03 finished in 63424 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||F(p1))) U X(X(G(p2)))))'
Support contains 3 out of 1544 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1544/1544 places, 2096/2096 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1520 transition count 2072
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1520 transition count 2072
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 71 place count 1520 transition count 2049
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 76 place count 1515 transition count 2044
Iterating global reduction 1 with 5 rules applied. Total rules applied 81 place count 1515 transition count 2044
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 86 place count 1515 transition count 2039
Applied a total of 86 rules in 153 ms. Remains 1515 /1544 variables (removed 29) and now considering 2039/2096 (removed 57) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2979183837465560061.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4931928697422255933.kers'
[2026-05-26 04:18:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2979183837465560061.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4931928697422255933.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 2039 rows 1515 cols 5400 entries
Finished phase 1 with 1449 SingleSign rule and 0 generalized
[2026-05-26 04:18:00] [INFO ] Computed 66 invariants in 17 ms
Computed 66 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-4931928697422255933.kers
Total runtime 22 ms.
[2026-05-26 04:18:01] [INFO ] Implicit Places using invariants in 524 ms returned []
[2026-05-26 04:18:01] [INFO ] Invariant cache hit.
[2026-05-26 04:18:02] [INFO ] Implicit Places using invariants and state equation in 1270 ms returned []
Implicit Place search using SMT with State Equation took 1796 ms to find 0 implicit places.
Running 2038 sub problems to find dead transitions.
[2026-05-26 04:18:02] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1514/3554 variables, and 0 constraints, problems are : Problem set: 0 solved, 2038 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1515 constraints, PredecessorRefiner: 2038/2038 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2038 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1514/3554 variables, and 0 constraints, problems are : Problem set: 0 solved, 2038 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1515 constraints, PredecessorRefiner: 0/2038 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60445ms problems are : Problem set: 0 solved, 2038 unsolved
Search for dead transitions found 0 dead transitions in 60448ms
Starting structural reductions in LTL mode, iteration 1 : 1515/1544 places, 2039/2096 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62401 ms. Remains : 1515/1544 places, 2039/2096 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||F(p1))) U X(X(G(p2)))))'
Stuttering acceptance computed with spot in 293 ms :[(AND (NOT p1) p0 (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p0) p2)]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-04
Product exploration explored 100000 steps with 20008 reset in 289 ms.
Product exploration explored 100000 steps with 20033 reset in 327 ms.
Computed a total of 198 stabilizing places and 316 stable transitions
Graph (complete) has 3179 edges and 1515 vertex of which 1514 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.17 ms
Computed a total of 198 stabilizing places and 316 stable transitions
Knowledge based reduction with 14 factoid took 72 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (15 resets) in 301 ms. (132 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 140 ms. (283 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 124 ms. (320 steps per ms) remains 5/5 properties
[2026-05-26 04:19:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 169/172 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1276/1448 variables, 63/66 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1448 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1448 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 2005/3453 variables, 1448/1515 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3453 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 101/3554 variables, 67/1582 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3554 variables, 0/1582 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/3554 variables, 0/1582 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3554/3554 variables, and 1582 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2082 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 1515/1515 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 169/172 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1276/1448 variables, 63/66 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1448 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1448 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 2005/3453 variables, 1448/1515 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3453 variables, 5/1520 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3453 variables, 3/1523 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3453 variables, 1/1524 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3453 variables, 1/1525 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3453 variables, 0/1525 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 101/3554 variables, 67/1592 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3554 variables, 0/1592 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/3554 variables, 0/1592 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3554/3554 variables, and 1592 constraints, problems are : Problem set: 0 solved, 5 unsolved in 4403 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 1515/1515 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6496ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 5762 ms.
Support contains 3 out of 1515 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1515/1515 places, 2039/2039 transitions.
Graph (trivial) has 1294 edges and 1515 vertex of which 480 / 1515 are part of one of the 33 SCC in 1 ms
Free SCC test removed 447 places
Drop transitions (Empty/Sink Transition effects.) removed 508 transitions
Reduce isomorphic transitions removed 508 transitions.
Graph (complete) has 2616 edges and 1068 vertex of which 1067 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 247 rules applied. Total rules applied 249 place count 1067 transition count 1284
Reduce places removed 199 places and 0 transitions.
Iterating post reduction 1 with 199 rules applied. Total rules applied 448 place count 868 transition count 1284
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 448 place count 868 transition count 1188
Deduced a syphon composed of 96 places in 2 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 640 place count 772 transition count 1188
Discarding 96 places :
Symmetric choice reduction at 2 with 96 rule applications. Total rules 736 place count 676 transition count 1000
Iterating global reduction 2 with 96 rules applied. Total rules applied 832 place count 676 transition count 1000
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 2 with 70 rules applied. Total rules applied 902 place count 676 transition count 930
Performed 226 Post agglomeration using F-continuation condition.Transition count delta: 226
Deduced a syphon composed of 226 places in 0 ms
Reduce places removed 226 places and 0 transitions.
Iterating global reduction 3 with 452 rules applied. Total rules applied 1354 place count 450 transition count 704
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 3 with 48 rules applied. Total rules applied 1402 place count 450 transition count 656
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1408 place count 447 transition count 697
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1409 place count 447 transition count 696
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 1419 place count 447 transition count 686
Free-agglomeration rule applied 206 times.
Iterating global reduction 5 with 206 rules applied. Total rules applied 1625 place count 447 transition count 480
Reduce places removed 206 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (complete) has 791 edges and 241 vertex of which 234 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 220 rules applied. Total rules applied 1845 place count 234 transition count 467
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 1852 place count 234 transition count 460
Drop transitions (Redundant composition of simpler transitions.) removed 167 transitions
Redundant transition composition rules discarded 167 transitions
Iterating global reduction 7 with 167 rules applied. Total rules applied 2019 place count 234 transition count 293
Reduce places removed 8 places and 0 transitions.
Graph (complete) has 609 edges and 226 vertex of which 203 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.1 ms
Discarding 23 places :
Also discarding 0 output transitions
Iterating post reduction 7 with 9 rules applied. Total rules applied 2028 place count 203 transition count 293
Drop transitions (Empty/Sink Transition effects.) removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 8 with 23 rules applied. Total rules applied 2051 place count 203 transition count 270
Partial Free-agglomeration rule applied 25 times.
Drop transitions (Partial Free agglomeration) removed 25 transitions
Iterating global reduction 9 with 25 rules applied. Total rules applied 2076 place count 203 transition count 270
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 2077 place count 203 transition count 269
Applied a total of 2077 rules in 118 ms. Remains 203 /1515 variables (removed 1312) and now considering 269/2039 (removed 1770) transitions.
Running 260 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8361637257444716375.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6087908714146926763.kers'
[2026-05-26 04:19:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8361637257444716375.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6087908714146926763.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 269 rows 195 cols 1126 entries
Finished phase 1 with 145 SingleSign rule and 0 generalized
[2026-05-26 04:19:16] [INFO ] Computed 58 invariants in 1 ms
Computed 58 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6087908714146926763.kers
Total runtime 2 ms.
[2026-05-26 04:19:16] [INFO ] State equation strengthened by 189 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Problem TDEAD248 is UNSAT
At refinement iteration 3 (OVERLAPS) 269/472 variables, 203/261 constraints. Problems are: Problem set: 1 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/472 variables, 189/450 constraints. Problems are: Problem set: 1 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/472 variables, 0/450 constraints. Problems are: Problem set: 1 solved, 259 unsolved
At refinement iteration 6 (OVERLAPS) 0/472 variables, 0/450 constraints. Problems are: Problem set: 1 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Real declared 472/472 variables, and 450 constraints, problems are : Problem set: 1 solved, 259 unsolved in 11845 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 203/203 constraints, ReadFeed: 189/189 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 259 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 58/58 constraints. Problems are: Problem set: 1 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 0/58 constraints. Problems are: Problem set: 1 solved, 259 unsolved
At refinement iteration 3 (OVERLAPS) 269/472 variables, 203/261 constraints. Problems are: Problem set: 1 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/472 variables, 189/450 constraints. Problems are: Problem set: 1 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/472 variables, 259/709 constraints. Problems are: Problem set: 1 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/472 variables, 2/711 constraints. Problems are: Problem set: 1 solved, 259 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 472/472 variables, and 711 constraints, problems are : Problem set: 1 solved, 259 unsolved in 20013 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 203/203 constraints, ReadFeed: 189/189 constraints, PredecessorRefiner: 259/260 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 31928ms problems are : Problem set: 1 solved, 259 unsolved
Search for dead transitions found 1 dead transitions in 31928ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 203/1515 places, 268/2039 transitions.
Applied a total of 0 rules in 5 ms. Remains 203 /203 variables (removed 0) and now considering 268/268 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32052 ms. Remains : 203/1515 places, 268/2039 transitions.
RANDOM walk for 5534 steps (0 resets) in 36 ms. (149 steps per ms) remains 0/5 properties
Knowledge based reduction with 14 factoid took 153 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p1) p0 (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p0) p2)]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3292937268851585311.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18135006222097698468.kers'
[2026-05-26 04:19:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3292937268851585311.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18135006222097698468.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 2039 rows 1515 cols 5400 entries
Finished phase 1 with 1449 SingleSign rule and 0 generalized
[2026-05-26 04:19:48] [INFO ] Computed 66 invariants in 11 ms
Computed 66 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-18135006222097698468.kers
Total runtime 13 ms.
[2026-05-26 04:19:49] [INFO ] [Real]Absence check using 66 positive place invariants in 21 ms returned unsat
Proved EG (NOT p2) asserting that LTL formula F !(NOT p2) is false.
Negative knowledge disproves property using: (F p2)
Knowledge-based reduction took 45764 ms.
FORMULA NoC3x3-PT-8B-LTLFireability-04 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property NoC3x3-PT-8B-LTLFireability-04 finished in 109125 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U G(p1)) U (p2&&(p0 U G(p1))))))'
Support contains 3 out of 1544 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1544/1544 places, 2096/2096 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 1519 transition count 2071
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 1519 transition count 2071
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 73 place count 1519 transition count 2048
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 80 place count 1512 transition count 2041
Iterating global reduction 1 with 7 rules applied. Total rules applied 87 place count 1512 transition count 2041
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 94 place count 1512 transition count 2034
Applied a total of 94 rules in 160 ms. Remains 1512 /1544 variables (removed 32) and now considering 2034/2096 (removed 62) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9526081238462025449.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11875606610465871614.kers'
[2026-05-26 04:19:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9526081238462025449.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11875606610465871614.kers]
Culled 0 columns in 4 ms.
// Phase 1: matrix 2034 rows 1512 cols 5390 entries
Finished phase 1 with 1446 SingleSign rule and 0 generalized
[2026-05-26 04:19:49] [INFO ] Computed 66 invariants in 16 ms
Computed 66 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-11875606610465871614.kers
Total runtime 19 ms.
[2026-05-26 04:19:50] [INFO ] Implicit Places using invariants in 518 ms returned []
[2026-05-26 04:19:50] [INFO ] Invariant cache hit.
[2026-05-26 04:19:51] [INFO ] Implicit Places using invariants and state equation in 1249 ms returned []
Implicit Place search using SMT with State Equation took 1768 ms to find 0 implicit places.
Running 2033 sub problems to find dead transitions.
[2026-05-26 04:19:51] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1511/3546 variables, and 0 constraints, problems are : Problem set: 0 solved, 2033 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1512 constraints, PredecessorRefiner: 2033/2033 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2033 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1511/3546 variables, and 0 constraints, problems are : Problem set: 0 solved, 2033 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1512 constraints, PredecessorRefiner: 0/2033 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60435ms problems are : Problem set: 0 solved, 2033 unsolved
Search for dead transitions found 0 dead transitions in 60438ms
Starting structural reductions in LTL mode, iteration 1 : 1512/1544 places, 2034/2096 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62372 ms. Remains : 1512/1544 places, 2034/2096 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U G(p1)) U (p2&&(p0 U G(p1))))))'
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-05
Entered a terminal (fully accepting) state of product in 158 steps with 0 reset in 2 ms.
FORMULA NoC3x3-PT-8B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLFireability-05 finished in 62589 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(p1)&&(G(p2)||X(p3))))'
Support contains 4 out of 1544 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1544/1544 places, 2096/2096 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 1521 transition count 2073
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 1521 transition count 2073
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 67 place count 1521 transition count 2052
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 72 place count 1516 transition count 2047
Iterating global reduction 1 with 5 rules applied. Total rules applied 77 place count 1516 transition count 2047
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 82 place count 1516 transition count 2042
Applied a total of 82 rules in 147 ms. Remains 1516 /1544 variables (removed 28) and now considering 2042/2096 (removed 54) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8642225035182139950.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13664169554935931884.kers'
[2026-05-26 04:20:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8642225035182139950.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13664169554935931884.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 2042 rows 1516 cols 5406 entries
Finished phase 1 with 1450 SingleSign rule and 0 generalized
[2026-05-26 04:20:52] [INFO ] Computed 66 invariants in 18 ms
Computed 66 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-13664169554935931884.kers
Total runtime 22 ms.
[2026-05-26 04:20:52] [INFO ] Implicit Places using invariants in 536 ms returned []
[2026-05-26 04:20:52] [INFO ] Invariant cache hit.
[2026-05-26 04:20:54] [INFO ] Implicit Places using invariants and state equation in 1286 ms returned []
Implicit Place search using SMT with State Equation took 1823 ms to find 0 implicit places.
Running 2041 sub problems to find dead transitions.
[2026-05-26 04:20:54] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1515/3558 variables, and 0 constraints, problems are : Problem set: 0 solved, 2041 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1516 constraints, PredecessorRefiner: 2041/2041 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2041 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1515/3558 variables, and 0 constraints, problems are : Problem set: 0 solved, 2041 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1516 constraints, PredecessorRefiner: 0/2041 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60440ms problems are : Problem set: 0 solved, 2041 unsolved
Search for dead transitions found 0 dead transitions in 60446ms
Starting structural reductions in LTL mode, iteration 1 : 1516/1544 places, 2042/2096 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62429 ms. Remains : 1516/1544 places, 2042/2096 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(p1)&&(G(p2)||X(p3))))'
Stuttering acceptance computed with spot in 256 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p0), (NOT p1), (NOT p3), (AND (NOT p2) (NOT p3)), true, (NOT p2)]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-07
Stuttering criterion allowed to conclude after 2063 steps with 0 reset in 11 ms.
FORMULA NoC3x3-PT-8B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLFireability-07 finished in 62754 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 1544 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1544/1544 places, 2096/2096 transitions.
Graph (trivial) has 1352 edges and 1544 vertex of which 476 / 1544 are part of one of the 33 SCC in 2 ms
Free SCC test removed 443 places
Ensure Unique test removed 476 transitions
Reduce isomorphic transitions removed 476 transitions.
Graph (complete) has 2711 edges and 1101 vertex of which 1100 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 214 transitions
Trivial Post-agglo rules discarded 214 transitions
Performed 214 trivial Post agglomeration. Transition count delta: 214
Iterating post reduction 0 with 262 rules applied. Total rules applied 264 place count 1099 transition count 1356
Reduce places removed 214 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 241 rules applied. Total rules applied 505 place count 885 transition count 1329
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 2 with 21 rules applied. Total rules applied 526 place count 874 transition count 1319
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 7 rules applied. Total rules applied 533 place count 869 transition count 1317
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 537 place count 867 transition count 1315
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 94 Pre rules applied. Total rules applied 537 place count 867 transition count 1221
Deduced a syphon composed of 94 places in 2 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 5 with 188 rules applied. Total rules applied 725 place count 773 transition count 1221
Discarding 94 places :
Symmetric choice reduction at 5 with 94 rule applications. Total rules 819 place count 679 transition count 1038
Iterating global reduction 5 with 94 rules applied. Total rules applied 913 place count 679 transition count 1038
Ensure Unique test removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Iterating post reduction 5 with 66 rules applied. Total rules applied 979 place count 679 transition count 972
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 979 place count 679 transition count 971
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 981 place count 678 transition count 971
Performed 226 Post agglomeration using F-continuation condition.Transition count delta: 226
Deduced a syphon composed of 226 places in 0 ms
Reduce places removed 226 places and 0 transitions.
Iterating global reduction 6 with 452 rules applied. Total rules applied 1433 place count 452 transition count 745
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 6 with 50 rules applied. Total rules applied 1483 place count 452 transition count 695
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1485 place count 450 transition count 693
Reduce places removed 9 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 7 with 33 rules applied. Total rules applied 1518 place count 441 transition count 669
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 8 with 48 rules applied. Total rules applied 1566 place count 417 transition count 645
Applied a total of 1566 rules in 105 ms. Remains 417 /1544 variables (removed 1127) and now considering 645/2096 (removed 1451) transitions.
[2026-05-26 04:21:54] [INFO ] Flow matrix only has 613 transitions (discarded 32 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-249924770299543296.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17520593201601149443.kers'
[2026-05-26 04:21:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-249924770299543296.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17520593201601149443.kers]
Normalized transition count is 612 out of 613 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 612 rows 417 cols 1886 entries
Finished phase 1 with 360 SingleSign rule and 0 generalized
[2026-05-26 04:21:54] [INFO ] Computed 57 invariants in 2 ms
Computed 57 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17520593201601149443.kers
Total runtime 3 ms.
[2026-05-26 04:21:55] [INFO ] Implicit Places using invariants in 179 ms returned []
[2026-05-26 04:21:55] [INFO ] Flow matrix only has 613 transitions (discarded 32 similar events)
[2026-05-26 04:21:55] [INFO ] Invariant cache hit.
[2026-05-26 04:21:55] [INFO ] State equation strengthened by 28 read => feed constraints.
[2026-05-26 04:21:55] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 561 ms to find 0 implicit places.
[2026-05-26 04:21:55] [INFO ] Redundant transitions in 14 ms returned []
Running 607 sub problems to find dead transitions.
[2026-05-26 04:21:55] [INFO ] Flow matrix only has 613 transitions (discarded 32 similar events)
[2026-05-26 04:21:55] [INFO ] Invariant cache hit.
[2026-05-26 04:21:55] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/408 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 607 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/408 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 607 unsolved
At refinement iteration 2 (OVERLAPS) 9/417 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 607 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/417 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 607 unsolved
At refinement iteration 4 (OVERLAPS) 612/1029 variables, 417/474 constraints. Problems are: Problem set: 0 solved, 607 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1029 variables, 28/502 constraints. Problems are: Problem set: 0 solved, 607 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1029/1030 variables, and 502 constraints, problems are : Problem set: 0 solved, 607 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 417/417 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 607/607 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 607 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/408 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 607 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/408 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 607 unsolved
At refinement iteration 2 (OVERLAPS) 9/417 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 607 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/417 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 607 unsolved
At refinement iteration 4 (OVERLAPS) 612/1029 variables, 417/474 constraints. Problems are: Problem set: 0 solved, 607 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1029 variables, 28/502 constraints. Problems are: Problem set: 0 solved, 607 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1029 variables, 607/1109 constraints. Problems are: Problem set: 0 solved, 607 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1029/1030 variables, and 1109 constraints, problems are : Problem set: 0 solved, 607 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 417/417 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 607/607 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60092ms problems are : Problem set: 0 solved, 607 unsolved
Search for dead transitions found 0 dead transitions in 60095ms
Starting structural reductions in SI_LTL mode, iteration 1 : 417/1544 places, 645/2096 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60783 ms. Remains : 417/1544 places, 645/2096 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-8B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLFireability-08 finished in 60859 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(G(p1)))))'
Support contains 2 out of 1544 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1544/1544 places, 2096/2096 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 1519 transition count 2071
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 1519 transition count 2071
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 73 place count 1519 transition count 2048
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 79 place count 1513 transition count 2042
Iterating global reduction 1 with 6 rules applied. Total rules applied 85 place count 1513 transition count 2042
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 91 place count 1513 transition count 2036
Applied a total of 91 rules in 150 ms. Remains 1513 /1544 variables (removed 31) and now considering 2036/2096 (removed 60) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12061905486884942195.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6289340284594560526.kers'
[2026-05-26 04:22:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12061905486884942195.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6289340284594560526.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 2036 rows 1513 cols 5394 entries
Finished phase 1 with 1447 SingleSign rule and 0 generalized
[2026-05-26 04:22:55] [INFO ] Computed 66 invariants in 13 ms
Computed 66 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-6289340284594560526.kers
Total runtime 17 ms.
[2026-05-26 04:22:56] [INFO ] Implicit Places using invariants in 514 ms returned []
[2026-05-26 04:22:56] [INFO ] Invariant cache hit.
[2026-05-26 04:22:57] [INFO ] Implicit Places using invariants and state equation in 1278 ms returned []
Implicit Place search using SMT with State Equation took 1794 ms to find 0 implicit places.
Running 2035 sub problems to find dead transitions.
[2026-05-26 04:22:57] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1512/3549 variables, and 0 constraints, problems are : Problem set: 0 solved, 2035 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1513 constraints, PredecessorRefiner: 2035/2035 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2035 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1512/3549 variables, and 0 constraints, problems are : Problem set: 0 solved, 2035 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1513 constraints, PredecessorRefiner: 0/2035 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60431ms problems are : Problem set: 0 solved, 2035 unsolved
Search for dead transitions found 0 dead transitions in 60434ms
Starting structural reductions in LTL mode, iteration 1 : 1513/1544 places, 2036/2096 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62383 ms. Remains : 1513/1544 places, 2036/2096 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(G(p1)))))'
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-10
Product exploration explored 100000 steps with 50000 reset in 402 ms.
Product exploration explored 100000 steps with 50000 reset in 414 ms.
Computed a total of 198 stabilizing places and 316 stable transitions
Graph (complete) has 3176 edges and 1513 vertex of which 1512 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.14 ms
Computed a total of 198 stabilizing places and 316 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 6 factoid took 19 ms. Proved property starting from automaton with 4 states, 5 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 51 ms.
FORMULA NoC3x3-PT-8B-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-8B-LTLFireability-10 finished in 63462 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 2 out of 1544 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1544/1544 places, 2096/2096 transitions.
Graph (trivial) has 1352 edges and 1544 vertex of which 490 / 1544 are part of one of the 33 SCC in 1 ms
Free SCC test removed 457 places
Ensure Unique test removed 494 transitions
Reduce isomorphic transitions removed 494 transitions.
Graph (complete) has 2686 edges and 1087 vertex of which 1086 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 205 transitions
Trivial Post-agglo rules discarded 205 transitions
Performed 205 trivial Post agglomeration. Transition count delta: 205
Iterating post reduction 0 with 253 rules applied. Total rules applied 255 place count 1085 transition count 1347
Reduce places removed 205 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 232 rules applied. Total rules applied 487 place count 880 transition count 1320
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 2 with 21 rules applied. Total rules applied 508 place count 869 transition count 1310
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 513 place count 864 transition count 1310
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 94 Pre rules applied. Total rules applied 513 place count 864 transition count 1216
Deduced a syphon composed of 94 places in 2 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 4 with 188 rules applied. Total rules applied 701 place count 770 transition count 1216
Discarding 97 places :
Symmetric choice reduction at 4 with 97 rule applications. Total rules 798 place count 673 transition count 1027
Iterating global reduction 4 with 97 rules applied. Total rules applied 895 place count 673 transition count 1027
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 4 with 70 rules applied. Total rules applied 965 place count 673 transition count 957
Performed 224 Post agglomeration using F-continuation condition.Transition count delta: 224
Deduced a syphon composed of 224 places in 0 ms
Reduce places removed 224 places and 0 transitions.
Iterating global reduction 5 with 448 rules applied. Total rules applied 1413 place count 449 transition count 733
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 5 with 48 rules applied. Total rules applied 1461 place count 449 transition count 685
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1463 place count 447 transition count 683
Reduce places removed 9 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 6 with 33 rules applied. Total rules applied 1496 place count 438 transition count 659
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 7 with 48 rules applied. Total rules applied 1544 place count 414 transition count 635
Applied a total of 1544 rules in 82 ms. Remains 414 /1544 variables (removed 1130) and now considering 635/2096 (removed 1461) transitions.
[2026-05-26 04:23:59] [INFO ] Flow matrix only has 603 transitions (discarded 32 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6815825693756656565.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4414241992082108784.kers'
[2026-05-26 04:23:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6815825693756656565.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4414241992082108784.kers]
Normalized transition count is 602 out of 603 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 602 rows 414 cols 1853 entries
Finished phase 1 with 357 SingleSign rule and 0 generalized
[2026-05-26 04:23:59] [INFO ] Computed 57 invariants in 2 ms
Computed 57 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-4414241992082108784.kers
Total runtime 4 ms.
[2026-05-26 04:23:59] [INFO ] Implicit Places using invariants in 192 ms returned []
[2026-05-26 04:23:59] [INFO ] Flow matrix only has 603 transitions (discarded 32 similar events)
[2026-05-26 04:23:59] [INFO ] Invariant cache hit.
[2026-05-26 04:23:59] [INFO ] State equation strengthened by 28 read => feed constraints.
[2026-05-26 04:23:59] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 551 ms to find 0 implicit places.
[2026-05-26 04:23:59] [INFO ] Redundant transitions in 6 ms returned []
Running 592 sub problems to find dead transitions.
[2026-05-26 04:23:59] [INFO ] Flow matrix only has 603 transitions (discarded 32 similar events)
[2026-05-26 04:23:59] [INFO ] Invariant cache hit.
[2026-05-26 04:23:59] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/405 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/405 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 2 (OVERLAPS) 9/414 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/414 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 4 (OVERLAPS) 602/1016 variables, 414/471 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1016 variables, 28/499 constraints. Problems are: Problem set: 0 solved, 592 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1016/1017 variables, and 499 constraints, problems are : Problem set: 0 solved, 592 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 414/414 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 592/592 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 592 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/405 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/405 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 2 (OVERLAPS) 9/414 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/414 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 4 (OVERLAPS) 602/1016 variables, 414/471 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1016 variables, 28/499 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1016 variables, 592/1091 constraints. Problems are: Problem set: 0 solved, 592 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1016/1017 variables, and 1091 constraints, problems are : Problem set: 0 solved, 592 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 414/414 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 592/592 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60086ms problems are : Problem set: 0 solved, 592 unsolved
Search for dead transitions found 0 dead transitions in 60087ms
Starting structural reductions in SI_LTL mode, iteration 1 : 414/1544 places, 635/2096 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60732 ms. Remains : 414/1544 places, 635/2096 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-8B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLFireability-11 finished in 60854 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(G((p1||G((p2||X((X(p2) U (p2&&X(p2)))))))))))'
Support contains 3 out of 1544 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1544/1544 places, 2096/2096 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 1519 transition count 2071
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 1519 transition count 2071
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 73 place count 1519 transition count 2048
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 80 place count 1512 transition count 2041
Iterating global reduction 1 with 7 rules applied. Total rules applied 87 place count 1512 transition count 2041
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 94 place count 1512 transition count 2034
Applied a total of 94 rules in 151 ms. Remains 1512 /1544 variables (removed 32) and now considering 2034/2096 (removed 62) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8458631652745680028.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14263384267046126891.kers'
[2026-05-26 04:25:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8458631652745680028.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14263384267046126891.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 2034 rows 1512 cols 5390 entries
Finished phase 1 with 1446 SingleSign rule and 0 generalized
[2026-05-26 04:25:00] [INFO ] Computed 66 invariants in 11 ms
Computed 66 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-14263384267046126891.kers
Total runtime 16 ms.
[2026-05-26 04:25:00] [INFO ] Implicit Places using invariants in 524 ms returned []
[2026-05-26 04:25:00] [INFO ] Invariant cache hit.
[2026-05-26 04:25:02] [INFO ] Implicit Places using invariants and state equation in 1262 ms returned []
Implicit Place search using SMT with State Equation took 1788 ms to find 0 implicit places.
Running 2033 sub problems to find dead transitions.
[2026-05-26 04:25:02] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1511/3546 variables, and 0 constraints, problems are : Problem set: 0 solved, 2033 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1512 constraints, PredecessorRefiner: 2033/2033 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2033 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1511/3546 variables, and 0 constraints, problems are : Problem set: 0 solved, 2033 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1512 constraints, PredecessorRefiner: 0/2033 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60423ms problems are : Problem set: 0 solved, 2033 unsolved
Search for dead transitions found 0 dead transitions in 60426ms
Starting structural reductions in LTL mode, iteration 1 : 1512/1544 places, 2034/2096 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62370 ms. Remains : 1512/1544 places, 2034/2096 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(G((p1||G((p2||X((X(p2) U (p2&&X(p2)))))))))))'
Stuttering acceptance computed with spot in 821 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), true, (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0) p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-12
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-8B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLFireability-12 finished in 63256 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (p1&&F(p2)&&X(X(F(!p0))))))'
Support contains 3 out of 1544 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1544/1544 places, 2096/2096 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1520 transition count 2072
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1520 transition count 2072
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 70 place count 1520 transition count 2050
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 76 place count 1514 transition count 2044
Iterating global reduction 1 with 6 rules applied. Total rules applied 82 place count 1514 transition count 2044
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 88 place count 1514 transition count 2038
Applied a total of 88 rules in 162 ms. Remains 1514 /1544 variables (removed 30) and now considering 2038/2096 (removed 58) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10727405830321127675.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16094474767635277889.kers'
[2026-05-26 04:26:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10727405830321127675.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16094474767635277889.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 2038 rows 1514 cols 5398 entries
Finished phase 1 with 1448 SingleSign rule and 0 generalized
[2026-05-26 04:26:03] [INFO ] Computed 66 invariants in 16 ms
Computed 66 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-16094474767635277889.kers
Total runtime 21 ms.
[2026-05-26 04:26:03] [INFO ] Implicit Places using invariants in 519 ms returned []
[2026-05-26 04:26:04] [INFO ] Invariant cache hit.
[2026-05-26 04:26:05] [INFO ] Implicit Places using invariants and state equation in 1252 ms returned []
Implicit Place search using SMT with State Equation took 1773 ms to find 0 implicit places.
Running 2037 sub problems to find dead transitions.
[2026-05-26 04:26:05] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1513/3552 variables, and 0 constraints, problems are : Problem set: 0 solved, 2037 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1514 constraints, PredecessorRefiner: 2037/2037 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2037 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1513/3552 variables, and 0 constraints, problems are : Problem set: 0 solved, 2037 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1514 constraints, PredecessorRefiner: 0/2037 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60434ms problems are : Problem set: 0 solved, 2037 unsolved
Search for dead transitions found 0 dead transitions in 60440ms
Starting structural reductions in LTL mode, iteration 1 : 1514/1544 places, 2038/2096 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62385 ms. Remains : 1514/1544 places, 2038/2096 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (p1&&F(p2)&&X(X(F(!p0))))))'
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p0), (NOT p2), p0, p0]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-13
Stuttering criterion allowed to conclude after 3708 steps with 1 reset in 20 ms.
FORMULA NoC3x3-PT-8B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLFireability-13 finished in 62676 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(X(X(F(p1))))))'
Support contains 2 out of 1544 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1544/1544 places, 2096/2096 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 1519 transition count 2071
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 1519 transition count 2071
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 73 place count 1519 transition count 2048
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 80 place count 1512 transition count 2041
Iterating global reduction 1 with 7 rules applied. Total rules applied 87 place count 1512 transition count 2041
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 94 place count 1512 transition count 2034
Applied a total of 94 rules in 150 ms. Remains 1512 /1544 variables (removed 32) and now considering 2034/2096 (removed 62) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9049261707443008973.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1226173267452590156.kers'
[2026-05-26 04:27:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9049261707443008973.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1226173267452590156.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 2034 rows 1512 cols 5390 entries
Finished phase 1 with 1446 SingleSign rule and 0 generalized
[2026-05-26 04:27:06] [INFO ] Computed 66 invariants in 14 ms
Computed 66 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-1226173267452590156.kers
Total runtime 19 ms.
[2026-05-26 04:27:06] [INFO ] Implicit Places using invariants in 531 ms returned []
[2026-05-26 04:27:06] [INFO ] Invariant cache hit.
[2026-05-26 04:27:07] [INFO ] Implicit Places using invariants and state equation in 1240 ms returned []
Implicit Place search using SMT with State Equation took 1772 ms to find 0 implicit places.
Running 2033 sub problems to find dead transitions.
[2026-05-26 04:27:07] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1511/3546 variables, and 0 constraints, problems are : Problem set: 0 solved, 2033 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1512 constraints, PredecessorRefiner: 2033/2033 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2033 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1511/3546 variables, and 0 constraints, problems are : Problem set: 0 solved, 2033 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1512 constraints, PredecessorRefiner: 0/2033 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60445ms problems are : Problem set: 0 solved, 2033 unsolved
Search for dead transitions found 0 dead transitions in 60448ms
Starting structural reductions in LTL mode, iteration 1 : 1512/1544 places, 2034/2096 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62376 ms. Remains : 1512/1544 places, 2034/2096 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(X(X(F(p1))))))'
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-14
Stuttering criterion allowed to conclude after 18384 steps with 120 reset in 47 ms.
FORMULA NoC3x3-PT-8B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLFireability-14 finished in 62651 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 1544 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1544/1544 places, 2096/2096 transitions.
Graph (trivial) has 1354 edges and 1544 vertex of which 491 / 1544 are part of one of the 33 SCC in 1 ms
Free SCC test removed 458 places
Ensure Unique test removed 496 transitions
Reduce isomorphic transitions removed 496 transitions.
Graph (complete) has 2684 edges and 1086 vertex of which 1085 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 204 transitions
Trivial Post-agglo rules discarded 204 transitions
Performed 204 trivial Post agglomeration. Transition count delta: 204
Iterating post reduction 0 with 252 rules applied. Total rules applied 254 place count 1084 transition count 1346
Reduce places removed 204 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 231 rules applied. Total rules applied 485 place count 880 transition count 1319
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 2 with 21 rules applied. Total rules applied 506 place count 869 transition count 1309
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 6 rules applied. Total rules applied 512 place count 864 transition count 1308
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 513 place count 863 transition count 1308
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 94 Pre rules applied. Total rules applied 513 place count 863 transition count 1214
Deduced a syphon composed of 94 places in 2 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 5 with 188 rules applied. Total rules applied 701 place count 769 transition count 1214
Discarding 98 places :
Symmetric choice reduction at 5 with 98 rule applications. Total rules 799 place count 671 transition count 1024
Iterating global reduction 5 with 98 rules applied. Total rules applied 897 place count 671 transition count 1024
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 5 with 70 rules applied. Total rules applied 967 place count 671 transition count 954
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 967 place count 671 transition count 953
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 969 place count 670 transition count 953
Performed 222 Post agglomeration using F-continuation condition.Transition count delta: 222
Deduced a syphon composed of 222 places in 0 ms
Reduce places removed 222 places and 0 transitions.
Iterating global reduction 6 with 444 rules applied. Total rules applied 1413 place count 448 transition count 731
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 6 with 48 rules applied. Total rules applied 1461 place count 448 transition count 683
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1463 place count 446 transition count 681
Reduce places removed 9 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 7 with 33 rules applied. Total rules applied 1496 place count 437 transition count 657
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 8 with 48 rules applied. Total rules applied 1544 place count 413 transition count 633
Applied a total of 1544 rules in 88 ms. Remains 413 /1544 variables (removed 1131) and now considering 633/2096 (removed 1463) transitions.
[2026-05-26 04:28:08] [INFO ] Flow matrix only has 601 transitions (discarded 32 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12249054215910333620.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2641456033067428346.kers'
[2026-05-26 04:28:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12249054215910333620.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2641456033067428346.kers]
Normalized transition count is 600 out of 601 initially.
Culled 0 columns in 1 ms.
// Phase 1: matrix 600 rows 413 cols 1849 entries
Finished phase 1 with 356 SingleSign rule and 0 generalized
[2026-05-26 04:28:08] [INFO ] Computed 57 invariants in 7 ms
Computed 57 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-2641456033067428346.kers
Total runtime 8 ms.
[2026-05-26 04:28:08] [INFO ] Implicit Places using invariants in 176 ms returned []
[2026-05-26 04:28:08] [INFO ] Flow matrix only has 601 transitions (discarded 32 similar events)
[2026-05-26 04:28:08] [INFO ] Invariant cache hit.
[2026-05-26 04:28:09] [INFO ] State equation strengthened by 28 read => feed constraints.
[2026-05-26 04:28:09] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 552 ms to find 0 implicit places.
[2026-05-26 04:28:09] [INFO ] Redundant transitions in 4 ms returned []
Running 591 sub problems to find dead transitions.
[2026-05-26 04:28:09] [INFO ] Flow matrix only has 601 transitions (discarded 32 similar events)
[2026-05-26 04:28:09] [INFO ] Invariant cache hit.
[2026-05-26 04:28:09] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/404 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/404 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 2 (OVERLAPS) 9/413 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/413 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 4 (OVERLAPS) 600/1013 variables, 413/470 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1013 variables, 28/498 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1013/1014 variables, and 498 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 413/413 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 591/591 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 591 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/404 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/404 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 2 (OVERLAPS) 9/413 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/413 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 4 (OVERLAPS) 600/1013 variables, 413/470 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1013 variables, 28/498 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1013 variables, 591/1089 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1013/1014 variables, and 1089 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 413/413 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 591/591 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60102ms problems are : Problem set: 0 solved, 591 unsolved
Search for dead transitions found 0 dead transitions in 60103ms
Starting structural reductions in SI_LTL mode, iteration 1 : 413/1544 places, 633/2096 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60752 ms. Remains : 413/1544 places, 633/2096 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-8B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLFireability-15 finished in 60865 ms.
All properties solved by simple procedures.
Total runtime 962117 ms.
BK_STOP 1779769749538
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NoC3x3-PT-8B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is NoC3x3-PT-8B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r194-tall-177969914100380"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-8B.tgz
mv NoC3x3-PT-8B execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;