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.r050-smll-177946901100148.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 Champagne-PT-H10T0R, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r050-smll-177946901100148
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 928K
-rw-r--r-- 1 mcc users 8.5K Mar 6 10:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Mar 6 10:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Mar 6 10:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Mar 6 10:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 08:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 08:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 08:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 08:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Mar 6 10:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Mar 6 10:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Mar 6 10:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 6 10:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 08:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 08:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 517K 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 Champagne-PT-H10T0R-LTLFireability-00
FORMULA_NAME Champagne-PT-H10T0R-LTLFireability-01
FORMULA_NAME Champagne-PT-H10T0R-LTLFireability-02
FORMULA_NAME Champagne-PT-H10T0R-LTLFireability-03
FORMULA_NAME Champagne-PT-H10T0R-LTLFireability-04
FORMULA_NAME Champagne-PT-H10T0R-LTLFireability-05
FORMULA_NAME Champagne-PT-H10T0R-LTLFireability-06
FORMULA_NAME Champagne-PT-H10T0R-LTLFireability-07
FORMULA_NAME Champagne-PT-H10T0R-LTLFireability-08
FORMULA_NAME Champagne-PT-H10T0R-LTLFireability-09
FORMULA_NAME Champagne-PT-H10T0R-LTLFireability-10
FORMULA_NAME Champagne-PT-H10T0R-LTLFireability-11
FORMULA_NAME Champagne-PT-H10T0R-LTLFireability-12
FORMULA_NAME Champagne-PT-H10T0R-LTLFireability-13
FORMULA_NAME Champagne-PT-H10T0R-LTLFireability-14
FORMULA_NAME Champagne-PT-H10T0R-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779541234883

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Champagne-PT-H10T0R
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-23 13:00:37] [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-23 13:00:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 13:00:37] [INFO ] Load time of PNML (sax parser for PT used): 399 ms
[2026-05-23 13:00:37] [INFO ] Transformed 1259 places.
[2026-05-23 13:00:37] [INFO ] Transformed 2192 transitions.
[2026-05-23 13:00:37] [INFO ] Found NUPN structural information;
[2026-05-23 13:00:38] [INFO ] Parsed PT model containing 1259 places and 2192 transitions and 6374 arcs in 668 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Champagne-PT-H10T0R-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H10T0R-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H10T0R-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 1259 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1259/1259 places, 2192/2192 transitions.
Discarding 311 places :
Symmetric choice reduction at 0 with 311 rule applications. Total rules 311 place count 948 transition count 1881
Iterating global reduction 0 with 311 rules applied. Total rules applied 622 place count 948 transition count 1881
Discarding 182 places :
Symmetric choice reduction at 0 with 182 rule applications. Total rules 804 place count 766 transition count 1699
Iterating global reduction 0 with 182 rules applied. Total rules applied 986 place count 766 transition count 1699
Discarding 118 places :
Symmetric choice reduction at 0 with 118 rule applications. Total rules 1104 place count 648 transition count 1342
Iterating global reduction 0 with 118 rules applied. Total rules applied 1222 place count 648 transition count 1342
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 0 with 44 rules applied. Total rules applied 1266 place count 648 transition count 1298
Applied a total of 1266 rules in 534 ms. Remains 648 /1259 variables (removed 611) and now considering 1298/2192 (removed 894) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8729002813273943332.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3005485745534181218.kers'
[2026-05-23 13:00:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8729002813273943332.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3005485745534181218.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1298 rows 648 cols 4044 entries
Finished phase 1 with 585 SingleSign rule and 0 generalized
[2026-05-23 13:00:39] [INFO ] Computed 63 invariants in 10 ms
Computed 63 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-3005485745534181218.kers
Total runtime 14 ms.
[2026-05-23 13:00:40] [INFO ] Implicit Places using invariants in 1215 ms returned []
[2026-05-23 13:00:40] [INFO ] Invariant cache hit.
[2026-05-23 13:00:41] [INFO ] Implicit Places using invariants and state equation in 1588 ms returned []
Implicit Place search using SMT with State Equation took 2889 ms to find 0 implicit places.
Running 1297 sub problems to find dead transitions.
[2026-05-23 13:00:41] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 647/1946 variables, and 0 constraints, problems are : Problem set: 0 solved, 1297 unsolved in 30114 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/648 constraints, PredecessorRefiner: 1297/1296 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1297 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 647/1946 variables, and 0 constraints, problems are : Problem set: 0 solved, 1297 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/648 constraints, PredecessorRefiner: 1/1296 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61149ms problems are : Problem set: 0 solved, 1297 unsolved
Search for dead transitions found 0 dead transitions in 61212ms
Starting structural reductions in LTL mode, iteration 1 : 648/1259 places, 1298/2192 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64726 ms. Remains : 648/1259 places, 1298/2192 transitions.
Starting structural reductions in LTL mode, iteration 0 : 648/648 places, 1298/1298 transitions.
Applied a total of 0 rules in 37 ms. Remains 648 /648 variables (removed 0) and now considering 1298/1298 (removed 0) transitions.
[2026-05-23 13:01:43] [INFO ] Invariant cache hit.
[2026-05-23 13:01:43] [INFO ] Implicit Places using invariants in 670 ms returned []
[2026-05-23 13:01:43] [INFO ] Invariant cache hit.
[2026-05-23 13:01:45] [INFO ] Implicit Places using invariants and state equation in 1156 ms returned []
Implicit Place search using SMT with State Equation took 1829 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1868 ms. Remains : 648/648 places, 1298/1298 transitions.
Support contains 46 out of 648 places after structural reductions.
[2026-05-23 13:01:45] [INFO ] Flatten gal took : 259 ms
[2026-05-23 13:01:45] [INFO ] Flatten gal took : 135 ms
[2026-05-23 13:01:46] [INFO ] Input system was already deterministic with 1298 transitions.
Support contains 44 out of 648 places (down from 46) after GAL structural reductions.
RANDOM walk for 40000 steps (49 resets) in 2440 ms. (16 steps per ms) remains 1/31 properties
BEST_FIRST walk for 40004 steps (8 resets) in 210 ms. (189 steps per ms) remains 1/1 properties
[2026-05-23 13:01:46] [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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/47 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 601/648 variables, 60/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/648 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1298/1946 variables, 648/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1946 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/1946 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1946/1946 variables, and 711 constraints, problems are : Problem set: 0 solved, 1 unsolved in 722 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 648/648 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/47 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 601/648 variables, 60/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/648 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1298/1946 variables, 648/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1946 variables, 1/712 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1946 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1946 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1946/1946 variables, and 712 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1163 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 648/648 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1904ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 187 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=31 )
Parikh walk visited 1 properties in 21 ms.
Computed a total of 65 stabilizing places and 65 stable 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((G(p0) U (p1&&G(p0)))))'
Support contains 3 out of 648 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 648/648 places, 1298/1298 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 627 transition count 1147
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 627 transition count 1147
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 55 place count 627 transition count 1134
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 62 place count 620 transition count 1121
Iterating global reduction 1 with 7 rules applied. Total rules applied 69 place count 620 transition count 1121
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 71 place count 620 transition count 1119
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 74 place count 617 transition count 1102
Iterating global reduction 2 with 3 rules applied. Total rules applied 77 place count 617 transition count 1102
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 79 place count 617 transition count 1100
Applied a total of 79 rules in 510 ms. Remains 617 /648 variables (removed 31) and now considering 1100/1298 (removed 198) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16008660376270353728.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-356550024093141617.kers'
[2026-05-23 13:01:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16008660376270353728.kers, --Pflows, --basisKERS=/tmp/petrispot-output-356550024093141617.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1100 rows 617 cols 3316 entries
Finished phase 1 with 554 SingleSign rule and 0 generalized
[2026-05-23 13:01:50] [INFO ] Computed 63 invariants in 7 ms
Computed 63 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-356550024093141617.kers
Total runtime 10 ms.
[2026-05-23 13:01:50] [INFO ] Implicit Places using invariants in 553 ms returned []
[2026-05-23 13:01:50] [INFO ] Invariant cache hit.
[2026-05-23 13:01:51] [INFO ] Implicit Places using invariants and state equation in 878 ms returned []
Implicit Place search using SMT with State Equation took 1435 ms to find 0 implicit places.
Running 1099 sub problems to find dead transitions.
[2026-05-23 13:01:51] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 616/1717 variables, and 0 constraints, problems are : Problem set: 0 solved, 1099 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/617 constraints, PredecessorRefiner: 1099/1098 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1099 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 616/1717 variables, and 0 constraints, problems are : Problem set: 0 solved, 1099 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/617 constraints, PredecessorRefiner: 1/1098 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60510ms problems are : Problem set: 0 solved, 1099 unsolved
Search for dead transitions found 0 dead transitions in 60517ms
Starting structural reductions in LTL mode, iteration 1 : 617/648 places, 1100/1298 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62470 ms. Remains : 617/648 places, 1100/1298 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((G(p0) U (p1&&G(p0)))))'
Stuttering acceptance computed with spot in 489 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Champagne-PT-H10T0R-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA Champagne-PT-H10T0R-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H10T0R-LTLFireability-00 finished in 63120 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((G(p1)||p0))))'
Support contains 5 out of 648 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 648/648 places, 1298/1298 transitions.
Graph (trivial) has 594 edges and 648 vertex of which 69 / 648 are part of one of the 15 SCC in 8 ms
Free SCC test removed 54 places
Ensure Unique test removed 58 transitions
Reduce isomorphic transitions removed 58 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 72 place count 593 transition count 1168
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 1 with 192 rules applied. Total rules applied 264 place count 522 transition count 1047
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 2 with 60 rules applied. Total rules applied 324 place count 462 transition count 1047
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 324 place count 462 transition count 1003
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 412 place count 418 transition count 1003
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 429 place count 401 transition count 867
Iterating global reduction 3 with 17 rules applied. Total rules applied 446 place count 401 transition count 867
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 458 place count 401 transition count 855
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 458 place count 401 transition count 853
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 462 place count 399 transition count 853
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 463 place count 398 transition count 846
Iterating global reduction 4 with 1 rules applied. Total rules applied 464 place count 398 transition count 846
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 465 place count 398 transition count 845
Performed 213 Post agglomeration using F-continuation condition.Transition count delta: 213
Deduced a syphon composed of 213 places in 1 ms
Reduce places removed 213 places and 0 transitions.
Iterating global reduction 5 with 426 rules applied. Total rules applied 891 place count 185 transition count 632
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 893 place count 183 transition count 616
Iterating global reduction 5 with 2 rules applied. Total rules applied 895 place count 183 transition count 616
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 897 place count 183 transition count 614
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 899 place count 181 transition count 612
Applied a total of 899 rules in 423 ms. Remains 181 /648 variables (removed 467) and now considering 612/1298 (removed 686) transitions.
[2026-05-23 13:02:53] [INFO ] Flow matrix only has 203 transitions (discarded 409 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7028495618605173439.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16943270333227981718.kers'
[2026-05-23 13:02:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7028495618605173439.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16943270333227981718.kers]
Normalized transition count is 202 out of 203 initially.
Culling duplicate invariants (modulo rational): removing 13 columns.
Culled 13 columns in 0 ms.
// Phase 1: matrix 202 rows 168 cols 564 entries
Finished phase 1 with 118 SingleSign rule and 0 generalized
[2026-05-23 13:02:53] [INFO ] Computed 63 invariants in 1 ms
Computed 63 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16943270333227981718.kers
Total runtime 2 ms.
[2026-05-23 13:02:53] [INFO ] Implicit Places using invariants in 249 ms returned []
[2026-05-23 13:02:53] [INFO ] Flow matrix only has 203 transitions (discarded 409 similar events)
[2026-05-23 13:02:53] [INFO ] Invariant cache hit.
[2026-05-23 13:02:53] [INFO ] Implicit Places using invariants and state equation in 520 ms returned []
Implicit Place search using SMT with State Equation took 773 ms to find 0 implicit places.
[2026-05-23 13:02:53] [INFO ] Redundant transitions in 65 ms returned []
Running 484 sub problems to find dead transitions.
[2026-05-23 13:02:53] [INFO ] Flow matrix only has 203 transitions (discarded 409 similar events)
[2026-05-23 13:02:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/177 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 2 (OVERLAPS) 4/181 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 4 (OVERLAPS) 202/383 variables, 181/244 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 484 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 383/384 variables, and 244 constraints, problems are : Problem set: 0 solved, 484 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 181/181 constraints, PredecessorRefiner: 484/483 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 484 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/177 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 2 (OVERLAPS) 4/181 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 4 (OVERLAPS) 202/383 variables, 181/244 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 483/727 constraints. Problems are: Problem set: 0 solved, 484 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 484 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 383/384 variables, and 727 constraints, problems are : Problem set: 0 solved, 484 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 181/181 constraints, PredecessorRefiner: 484/483 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60181ms problems are : Problem set: 0 solved, 484 unsolved
Search for dead transitions found 0 dead transitions in 60185ms
Starting structural reductions in SI_LTL mode, iteration 1 : 181/648 places, 612/1298 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61459 ms. Remains : 181/648 places, 612/1298 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((G(p1)||p0))))'
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Champagne-PT-H10T0R-LTLFireability-01
Stuttering criterion allowed to conclude after 973 steps with 7 reset in 46 ms.
FORMULA Champagne-PT-H10T0R-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H10T0R-LTLFireability-01 finished in 61688 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 648 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 648/648 places, 1298/1298 transitions.
Graph (trivial) has 603 edges and 648 vertex of which 73 / 648 are part of one of the 16 SCC in 2 ms
Free SCC test removed 57 places
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 73 place count 590 transition count 1164
Reduce places removed 72 places and 0 transitions.
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 1 with 193 rules applied. Total rules applied 266 place count 518 transition count 1043
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 2 with 60 rules applied. Total rules applied 326 place count 458 transition count 1043
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 326 place count 458 transition count 999
Deduced a syphon composed of 44 places in 4 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 414 place count 414 transition count 999
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 432 place count 396 transition count 838
Iterating global reduction 3 with 18 rules applied. Total rules applied 450 place count 396 transition count 838
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 464 place count 396 transition count 824
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 464 place count 396 transition count 821
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 470 place count 393 transition count 821
Performed 212 Post agglomeration using F-continuation condition.Transition count delta: 212
Deduced a syphon composed of 212 places in 1 ms
Reduce places removed 212 places and 0 transitions.
Iterating global reduction 4 with 424 rules applied. Total rules applied 894 place count 181 transition count 609
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 896 place count 179 transition count 593
Iterating global reduction 4 with 2 rules applied. Total rules applied 898 place count 179 transition count 593
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 900 place count 179 transition count 591
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 902 place count 177 transition count 589
Applied a total of 902 rules in 226 ms. Remains 177 /648 variables (removed 471) and now considering 589/1298 (removed 709) transitions.
[2026-05-23 13:03:54] [INFO ] Flow matrix only has 166 transitions (discarded 423 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5021443623541447763.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8906233593800803359.kers'
[2026-05-23 13:03:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5021443623541447763.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8906233593800803359.kers]
Normalized transition count is 165 out of 166 initially.
Culling duplicate invariants (modulo rational): removing 14 columns.
Culled 14 columns in 0 ms.
// Phase 1: matrix 165 rows 163 cols 426 entries
Finished phase 1 with 114 SingleSign rule and 0 generalized
[2026-05-23 13:03:54] [INFO ] Computed 63 invariants in 2 ms
Computed 63 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-8906233593800803359.kers
Total runtime 3 ms.
[2026-05-23 13:03:54] [INFO ] Implicit Places using invariants in 363 ms returned []
[2026-05-23 13:03:54] [INFO ] Flow matrix only has 166 transitions (discarded 423 similar events)
[2026-05-23 13:03:54] [INFO ] Invariant cache hit.
[2026-05-23 13:03:55] [INFO ] Implicit Places using invariants and state equation in 453 ms returned []
Implicit Place search using SMT with State Equation took 818 ms to find 0 implicit places.
[2026-05-23 13:03:55] [INFO ] Redundant transitions in 13 ms returned []
Running 460 sub problems to find dead transitions.
[2026-05-23 13:03:55] [INFO ] Flow matrix only has 166 transitions (discarded 423 similar events)
[2026-05-23 13:03:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/175 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 2/177 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 165/342 variables, 177/240 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 342/343 variables, and 240 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 177/177 constraints, PredecessorRefiner: 460/459 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/175 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 2/177 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 165/342 variables, 177/240 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 459/699 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 342/343 variables, and 699 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 177/177 constraints, PredecessorRefiner: 460/459 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60154ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 60157ms
Starting structural reductions in SI_LTL mode, iteration 1 : 177/648 places, 589/1298 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61226 ms. Remains : 177/648 places, 589/1298 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 48 ms :[(NOT p0)]
Running random walk in product with property : Champagne-PT-H10T0R-LTLFireability-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA Champagne-PT-H10T0R-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H10T0R-LTLFireability-03 finished in 61318 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(X(G(p0))))'
Support contains 1 out of 648 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 648/648 places, 1298/1298 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 626 transition count 1133
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 626 transition count 1133
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 59 place count 626 transition count 1118
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 65 place count 620 transition count 1106
Iterating global reduction 1 with 6 rules applied. Total rules applied 71 place count 620 transition count 1106
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 73 place count 620 transition count 1104
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 76 place count 617 transition count 1087
Iterating global reduction 2 with 3 rules applied. Total rules applied 79 place count 617 transition count 1087
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 81 place count 617 transition count 1085
Applied a total of 81 rules in 107 ms. Remains 617 /648 variables (removed 31) and now considering 1085/1298 (removed 213) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14689472474349783803.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16412428175930226145.kers'
[2026-05-23 13:04:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14689472474349783803.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16412428175930226145.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1085 rows 617 cols 3258 entries
Finished phase 1 with 554 SingleSign rule and 0 generalized
[2026-05-23 13:04:55] [INFO ] Computed 63 invariants in 8 ms
Computed 63 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-16412428175930226145.kers
Total runtime 10 ms.
[2026-05-23 13:04:56] [INFO ] Implicit Places using invariants in 536 ms returned []
[2026-05-23 13:04:56] [INFO ] Invariant cache hit.
[2026-05-23 13:04:57] [INFO ] Implicit Places using invariants and state equation in 951 ms returned []
Implicit Place search using SMT with State Equation took 1497 ms to find 0 implicit places.
Running 1084 sub problems to find dead transitions.
[2026-05-23 13:04:57] [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 616/1702 variables, and 0 constraints, problems are : Problem set: 0 solved, 1084 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/617 constraints, PredecessorRefiner: 1084/1083 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1084 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 616/1702 variables, and 0 constraints, problems are : Problem set: 0 solved, 1084 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/617 constraints, PredecessorRefiner: 1/1083 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60390ms problems are : Problem set: 0 solved, 1084 unsolved
Search for dead transitions found 0 dead transitions in 60396ms
Starting structural reductions in LTL mode, iteration 1 : 617/648 places, 1085/1298 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62005 ms. Remains : 617/648 places, 1085/1298 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(X(G(p0))))'
Stuttering acceptance computed with spot in 178 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Champagne-PT-H10T0R-LTLFireability-04
Entered a terminal (fully accepting) state of product in 35 steps with 0 reset in 1 ms.
FORMULA Champagne-PT-H10T0R-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H10T0R-LTLFireability-04 finished in 62245 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)&&F(p1)))&&F(p2)))'
Support contains 4 out of 648 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 648/648 places, 1298/1298 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 627 transition count 1156
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 627 transition count 1156
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 55 place count 627 transition count 1143
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 62 place count 620 transition count 1130
Iterating global reduction 1 with 7 rules applied. Total rules applied 69 place count 620 transition count 1130
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 71 place count 620 transition count 1128
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 74 place count 617 transition count 1111
Iterating global reduction 2 with 3 rules applied. Total rules applied 77 place count 617 transition count 1111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 79 place count 617 transition count 1109
Applied a total of 79 rules in 104 ms. Remains 617 /648 variables (removed 31) and now considering 1109/1298 (removed 189) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5615538024236120606.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7866790514724284816.kers'
[2026-05-23 13:05:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5615538024236120606.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7866790514724284816.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1109 rows 617 cols 3354 entries
Finished phase 1 with 554 SingleSign rule and 0 generalized
[2026-05-23 13:05:57] [INFO ] Computed 63 invariants in 10 ms
Computed 63 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-7866790514724284816.kers
Total runtime 13 ms.
[2026-05-23 13:05:58] [INFO ] Implicit Places using invariants in 591 ms returned []
[2026-05-23 13:05:58] [INFO ] Invariant cache hit.
[2026-05-23 13:05:59] [INFO ] Implicit Places using invariants and state equation in 1211 ms returned []
Implicit Place search using SMT with State Equation took 1805 ms to find 0 implicit places.
Running 1108 sub problems to find dead transitions.
[2026-05-23 13:05: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 616/1726 variables, and 0 constraints, problems are : Problem set: 0 solved, 1108 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/617 constraints, PredecessorRefiner: 1108/1107 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1108 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 616/1726 variables, and 0 constraints, problems are : Problem set: 0 solved, 1108 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/617 constraints, PredecessorRefiner: 1/1107 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60386ms problems are : Problem set: 0 solved, 1108 unsolved
Search for dead transitions found 0 dead transitions in 60391ms
Starting structural reductions in LTL mode, iteration 1 : 617/648 places, 1109/1298 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62313 ms. Remains : 617/648 places, 1109/1298 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)&&F(p1)))&&F(p2)))'
Stuttering acceptance computed with spot in 289 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p0), (NOT p1)]
Running random walk in product with property : Champagne-PT-H10T0R-LTLFireability-05
Stuttering criterion allowed to conclude after 672 steps with 0 reset in 5 ms.
FORMULA Champagne-PT-H10T0R-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H10T0R-LTLFireability-05 finished in 62663 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(X((X(p0) U ((p1&&X(p0))||X(G(p0)))))))'
Support contains 3 out of 648 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 648/648 places, 1298/1298 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 627 transition count 1138
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 627 transition count 1138
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 56 place count 627 transition count 1124
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 62 place count 621 transition count 1112
Iterating global reduction 1 with 6 rules applied. Total rules applied 68 place count 621 transition count 1112
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 70 place count 621 transition count 1110
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 72 place count 619 transition count 1097
Iterating global reduction 2 with 2 rules applied. Total rules applied 74 place count 619 transition count 1097
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 75 place count 619 transition count 1096
Applied a total of 75 rules in 66 ms. Remains 619 /648 variables (removed 29) and now considering 1096/1298 (removed 202) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7413760367392244109.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1739126542693952686.kers'
[2026-05-23 13:07:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7413760367392244109.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1739126542693952686.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1096 rows 619 cols 3298 entries
Finished phase 1 with 556 SingleSign rule and 0 generalized
[2026-05-23 13:07:00] [INFO ] Computed 63 invariants in 7 ms
Computed 63 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-1739126542693952686.kers
Total runtime 10 ms.
[2026-05-23 13:07:01] [INFO ] Implicit Places using invariants in 506 ms returned []
[2026-05-23 13:07:01] [INFO ] Invariant cache hit.
[2026-05-23 13:07:02] [INFO ] Implicit Places using invariants and state equation in 952 ms returned []
Implicit Place search using SMT with State Equation took 1462 ms to find 0 implicit places.
Running 1095 sub problems to find dead transitions.
[2026-05-23 13:07: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 618/1715 variables, and 0 constraints, problems are : Problem set: 0 solved, 1095 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/619 constraints, PredecessorRefiner: 1095/1094 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1095 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 618/1715 variables, and 0 constraints, problems are : Problem set: 0 solved, 1095 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/619 constraints, PredecessorRefiner: 1/1094 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60381ms problems are : Problem set: 0 solved, 1095 unsolved
Search for dead transitions found 0 dead transitions in 60385ms
Starting structural reductions in LTL mode, iteration 1 : 619/648 places, 1096/1298 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61919 ms. Remains : 619/648 places, 1096/1298 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(X((X(p0) U (X(G(p0))||(p1&&X(p0)))))))'
Stuttering acceptance computed with spot in 232 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : Champagne-PT-H10T0R-LTLFireability-06
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA Champagne-PT-H10T0R-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H10T0R-LTLFireability-06 finished in 62213 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(((p1&&X(p2))||p0))))'
Support contains 6 out of 648 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 648/648 places, 1298/1298 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 627 transition count 1154
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 627 transition count 1154
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 55 place count 627 transition count 1141
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 62 place count 620 transition count 1128
Iterating global reduction 1 with 7 rules applied. Total rules applied 69 place count 620 transition count 1128
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 71 place count 620 transition count 1126
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 74 place count 617 transition count 1109
Iterating global reduction 2 with 3 rules applied. Total rules applied 77 place count 617 transition count 1109
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 79 place count 617 transition count 1107
Applied a total of 79 rules in 98 ms. Remains 617 /648 variables (removed 31) and now considering 1107/1298 (removed 191) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16662780808330019160.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3471946497257437584.kers'
[2026-05-23 13:08:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16662780808330019160.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3471946497257437584.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1107 rows 617 cols 3346 entries
Finished phase 1 with 554 SingleSign rule and 0 generalized
[2026-05-23 13:08:02] [INFO ] Computed 63 invariants in 7 ms
Computed 63 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-3471946497257437584.kers
Total runtime 9 ms.
[2026-05-23 13:08:03] [INFO ] Implicit Places using invariants in 573 ms returned []
[2026-05-23 13:08:03] [INFO ] Invariant cache hit.
[2026-05-23 13:08:04] [INFO ] Implicit Places using invariants and state equation in 1098 ms returned []
Implicit Place search using SMT with State Equation took 1674 ms to find 0 implicit places.
Running 1106 sub problems to find dead transitions.
[2026-05-23 13:08:04] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 616/1724 variables, and 0 constraints, problems are : Problem set: 0 solved, 1106 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/617 constraints, PredecessorRefiner: 1106/1105 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1106 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 616/1724 variables, and 0 constraints, problems are : Problem set: 0 solved, 1106 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/617 constraints, PredecessorRefiner: 1/1105 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60266ms problems are : Problem set: 0 solved, 1106 unsolved
Search for dead transitions found 0 dead transitions in 60268ms
Starting structural reductions in LTL mode, iteration 1 : 617/648 places, 1107/1298 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62046 ms. Remains : 617/648 places, 1107/1298 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(((p1&&X(p2))||p0))))'
Stuttering acceptance computed with spot in 174 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Champagne-PT-H10T0R-LTLFireability-07
Product exploration explored 100000 steps with 50000 reset in 584 ms.
Product exploration explored 100000 steps with 50000 reset in 527 ms.
Computed a total of 62 stabilizing places and 62 stable transitions
Computed a total of 62 stabilizing places and 62 stable transitions
Knowledge based reduction with 12 factoid took 63 ms. Proved property starting from automaton with 3 states, 5 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 90 ms.
FORMULA Champagne-PT-H10T0R-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Champagne-PT-H10T0R-LTLFireability-07 finished in 63477 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 U (G(!p0)||(!p0&&G(p1))))))&&F(!p2))||G(F((!p0 U (G(!p0)||(!p0&&G(p1))))))))'
Support contains 5 out of 648 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 648/648 places, 1298/1298 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 627 transition count 1156
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 627 transition count 1156
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 55 place count 627 transition count 1143
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 62 place count 620 transition count 1130
Iterating global reduction 1 with 7 rules applied. Total rules applied 69 place count 620 transition count 1130
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 71 place count 620 transition count 1128
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 74 place count 617 transition count 1111
Iterating global reduction 2 with 3 rules applied. Total rules applied 77 place count 617 transition count 1111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 79 place count 617 transition count 1109
Applied a total of 79 rules in 58 ms. Remains 617 /648 variables (removed 31) and now considering 1109/1298 (removed 189) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15819414119063955155.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12140198360307957098.kers'
[2026-05-23 13:09:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15819414119063955155.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12140198360307957098.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1109 rows 617 cols 3354 entries
Finished phase 1 with 554 SingleSign rule and 0 generalized
[2026-05-23 13:09:06] [INFO ] Computed 63 invariants in 4 ms
Computed 63 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-12140198360307957098.kers
Total runtime 6 ms.
[2026-05-23 13:09:06] [INFO ] Implicit Places using invariants in 339 ms returned []
[2026-05-23 13:09:06] [INFO ] Invariant cache hit.
[2026-05-23 13:09:07] [INFO ] Implicit Places using invariants and state equation in 955 ms returned []
Implicit Place search using SMT with State Equation took 1298 ms to find 0 implicit places.
Running 1108 sub problems to find dead transitions.
[2026-05-23 13:09:07] [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 616/1726 variables, and 0 constraints, problems are : Problem set: 0 solved, 1108 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/617 constraints, PredecessorRefiner: 1108/1107 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1108 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 616/1726 variables, and 0 constraints, problems are : Problem set: 0 solved, 1108 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/617 constraints, PredecessorRefiner: 1/1107 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60394ms problems are : Problem set: 0 solved, 1108 unsolved
Search for dead transitions found 0 dead transitions in 60397ms
Starting structural reductions in LTL mode, iteration 1 : 617/648 places, 1109/1298 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61762 ms. Remains : 617/648 places, 1109/1298 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 U (G(!p0)||(!p0&&G(p1))))))||(X(F((!p0 U (G(!p0)||(!p0&&G(p1))))))&&F(p2))))'
Stuttering acceptance computed with spot in 324 ms :[p0, p0, (AND p0 (NOT p2)), (AND (NOT p1) p0), (AND p0 (NOT p2)), (AND (NOT p2) (NOT p1) p0)]
Running random walk in product with property : Champagne-PT-H10T0R-LTLFireability-08
Product exploration explored 100000 steps with 141 reset in 854 ms.
Product exploration explored 100000 steps with 143 reset in 709 ms.
Computed a total of 62 stabilizing places and 62 stable transitions
Computed a total of 62 stabilizing places and 62 stable transitions
Knowledge based reduction with 18 factoid took 66 ms. Reduced automaton from 6 states, 18 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
RANDOM walk for 29989 steps (39 resets) in 382 ms. (78 steps per ms) remains 0/6 properties
Knowledge based reduction with 18 factoid took 132 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[p0, p0, (AND p0 (NOT p1))]
Knowledge-based reduction took 474 ms.
Stuttering acceptance computed with spot in 114 ms :[p0, p0, (AND p0 (NOT p1))]
Support contains 3 out of 617 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 617/617 places, 1109/1109 transitions.
Applied a total of 0 rules in 14 ms. Remains 617 /617 variables (removed 0) and now considering 1109/1109 (removed 0) transitions.
[2026-05-23 13:10:10] [INFO ] Invariant cache hit.
[2026-05-23 13:10:10] [INFO ] Implicit Places using invariants in 379 ms returned []
[2026-05-23 13:10:10] [INFO ] Invariant cache hit.
[2026-05-23 13:10:11] [INFO ] Implicit Places using invariants and state equation in 933 ms returned []
Implicit Place search using SMT with State Equation took 1315 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1330 ms. Remains : 617/617 places, 1109/1109 transitions.
Computed a total of 62 stabilizing places and 62 stable transitions
Computed a total of 62 stabilizing places and 62 stable transitions
Knowledge based reduction with 11 factoid took 59 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
RANDOM walk for 31244 steps (42 resets) in 284 ms. (109 steps per ms) remains 0/6 properties
Knowledge based reduction with 11 factoid took 182 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[p0, p0, (AND p0 (NOT p1))]
Knowledge-based reduction took 520 ms.
Stuttering acceptance computed with spot in 136 ms :[p0, p0, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 150 ms :[p0, p0, (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 142 reset in 678 ms.
Product exploration explored 100000 steps with 141 reset in 505 ms.
Spot run failed in 164 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin15945559210252430921
[2026-05-23 13:10:14] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15945559210252430921
Running compilation step : cd /tmp/ltsmin15945559210252430921;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15945559210252430921;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15945559210252430921;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 3 out of 617 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 617/617 places, 1109/1109 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 616 transition count 1097
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 616 transition count 1097
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 616 transition count 1096
Applied a total of 3 rules in 25 ms. Remains 616 /617 variables (removed 1) and now considering 1096/1109 (removed 13) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11666115771121612272.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1124164400194464374.kers'
[2026-05-23 13:10:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11666115771121612272.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1124164400194464374.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1096 rows 616 cols 3304 entries
Finished phase 1 with 553 SingleSign rule and 0 generalized
[2026-05-23 13:10:17] [INFO ] Computed 63 invariants in 4 ms
Computed 63 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-1124164400194464374.kers
Total runtime 6 ms.
[2026-05-23 13:10:17] [INFO ] Implicit Places using invariants in 523 ms returned []
[2026-05-23 13:10:17] [INFO ] Invariant cache hit.
[2026-05-23 13:10:18] [INFO ] Implicit Places using invariants and state equation in 1153 ms returned []
Implicit Place search using SMT with State Equation took 1679 ms to find 0 implicit places.
Running 1095 sub problems to find dead transitions.
[2026-05-23 13:10:18] [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 615/1712 variables, and 0 constraints, problems are : Problem set: 0 solved, 1095 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/616 constraints, PredecessorRefiner: 1095/1094 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1095 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 615/1712 variables, and 0 constraints, problems are : Problem set: 0 solved, 1095 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/616 constraints, PredecessorRefiner: 1/1094 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60411ms problems are : Problem set: 0 solved, 1095 unsolved
Search for dead transitions found 0 dead transitions in 60414ms
Starting structural reductions in LTL mode, iteration 1 : 616/617 places, 1096/1109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62129 ms. Remains : 616/617 places, 1096/1109 transitions.
Built C files in :
/tmp/ltsmin13396388210383643932
[2026-05-23 13:11:19] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13396388210383643932
Running compilation step : cd /tmp/ltsmin13396388210383643932;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13396388210383643932;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13396388210383643932;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-23 13:11:22] [INFO ] Flatten gal took : 56 ms
[2026-05-23 13:11:22] [INFO ] Flatten gal took : 43 ms
[2026-05-23 13:11:22] [INFO ] Time to serialize gal into /tmp/LTL7352811052756055604.gal : 14 ms
[2026-05-23 13:11:22] [INFO ] Time to serialize properties into /tmp/LTL17524058100885394209.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7352811052756055604.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15394643300914773210.hoa' '-atoms' '/tmp/LTL17524058100885394209.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17524058100885394209.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15394643300914773210.hoa
Detected timeout of ITS tools.
[2026-05-23 13:11:37] [INFO ] Flatten gal took : 37 ms
[2026-05-23 13:11:37] [INFO ] Flatten gal took : 35 ms
[2026-05-23 13:11:37] [INFO ] Time to serialize gal into /tmp/LTL11804579055974714691.gal : 11 ms
[2026-05-23 13:11:37] [INFO ] Time to serialize properties into /tmp/LTL17039427896951317083.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11804579055974714691.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17039427896951317083.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((G(F((!("((p327==1)&&(p652==1))"))U((G(!("((p327==1)&&(p652==1))")))||((!("((p327==1)&&(p652==1))"))&&(G("(p957!=1)")))))))||((X(F(...307
Formula 0 simplified : FG(F!"(p957!=1)" U "((p327==1)&&(p652==1))") & (G!"((p422!=1)||(p595!=1))" | XG(F!"(p957!=1)" U "((p327==1)&&(p652==1))"))
Detected timeout of ITS tools.
[2026-05-23 13:11:52] [INFO ] Flatten gal took : 31 ms
[2026-05-23 13:11:52] [INFO ] Applying decomposition
[2026-05-23 13:11:52] [INFO ] Flatten gal took : 31 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph7081603063240562399.txt' '-o' '/tmp/graph7081603063240562399.bin' '-w' '/tmp/graph7081603063240562399.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7081603063240562399.bin' '-l' '-1' '-v' '-w' '/tmp/graph7081603063240562399.weights' '-q' '0' '-e' '0.001'
[2026-05-23 13:11:53] [INFO ] Decomposing Gal with order
[2026-05-23 13:11:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 13:11:53] [INFO ] Removed a total of 1070 redundant transitions.
[2026-05-23 13:11:53] [INFO ] Flatten gal took : 167 ms
[2026-05-23 13:11:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 48 ms.
[2026-05-23 13:11:53] [INFO ] Time to serialize gal into /tmp/LTL1640018738030192643.gal : 20 ms
[2026-05-23 13:11:53] [INFO ] Time to serialize properties into /tmp/LTL12338228948591354643.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1640018738030192643.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12338228948591354643.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((G(F((!("((i18.u60.p327==1)&&(i33.u112.p652==1))"))U((G(!("((i18.u60.p327==1)&&(i33.u112.p652==1))")))||((!("((i18.u60.p327==1)&&(i...444
Formula 0 simplified : FG(F!"(i36.u158.p957!=1)" U "((i18.u60.p327==1)&&(i33.u112.p652==1))") & (G!"((i22.u75.p422!=1)||(i31.u104.p595!=1))" | XG(F!"(i36.u...214
Reverse transition relation is NOT exact ! Due to transitions t9, t79, t119, t159, t210, t283, t394, i0.t533, i1.t606, i2.t648, i3.t657, i4.t638, i5.t626, ...1522
Computing Next relation with stutter on 1.26664e+15 deadlock states
Detected timeout of ITS tools.
Treatment of property Champagne-PT-H10T0R-LTLFireability-08 finished in 182412 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 p1)||X(p2))) U (p3||X(X(G(p3))))))'
Support contains 5 out of 648 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 648/648 places, 1298/1298 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 627 transition count 1143
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 627 transition count 1143
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 56 place count 627 transition count 1129
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 62 place count 621 transition count 1117
Iterating global reduction 1 with 6 rules applied. Total rules applied 68 place count 621 transition count 1117
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 70 place count 621 transition count 1115
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 73 place count 618 transition count 1098
Iterating global reduction 2 with 3 rules applied. Total rules applied 76 place count 618 transition count 1098
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 78 place count 618 transition count 1096
Applied a total of 78 rules in 56 ms. Remains 618 /648 variables (removed 30) and now considering 1096/1298 (removed 202) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3005382109167304003.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12686165970747600623.kers'
[2026-05-23 13:12:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3005382109167304003.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12686165970747600623.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1096 rows 618 cols 3300 entries
Finished phase 1 with 555 SingleSign rule and 0 generalized
[2026-05-23 13:12:08] [INFO ] Computed 63 invariants in 7 ms
Computed 63 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-12686165970747600623.kers
Total runtime 10 ms.
[2026-05-23 13:12:09] [INFO ] Implicit Places using invariants in 491 ms returned []
[2026-05-23 13:12:09] [INFO ] Invariant cache hit.
[2026-05-23 13:12:10] [INFO ] Implicit Places using invariants and state equation in 916 ms returned []
Implicit Place search using SMT with State Equation took 1410 ms to find 0 implicit places.
Running 1095 sub problems to find dead transitions.
[2026-05-23 13:12:10] [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 617/1714 variables, and 0 constraints, problems are : Problem set: 0 solved, 1095 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/618 constraints, PredecessorRefiner: 1095/1094 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1095 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 617/1714 variables, and 0 constraints, problems are : Problem set: 0 solved, 1095 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/618 constraints, PredecessorRefiner: 1/1094 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60379ms problems are : Problem set: 0 solved, 1095 unsolved
Search for dead transitions found 0 dead transitions in 60382ms
Starting structural reductions in LTL mode, iteration 1 : 618/648 places, 1096/1298 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61854 ms. Remains : 618/648 places, 1096/1298 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 p1)||X(p2))) U (p3||X(X(G(p3))))))'
Stuttering acceptance computed with spot in 762 ms :[(NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (NOT p3), true, (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : Champagne-PT-H10T0R-LTLFireability-09
Product exploration explored 100000 steps with 28734 reset in 371 ms.
Product exploration explored 100000 steps with 28626 reset in 426 ms.
Computed a total of 62 stabilizing places and 62 stable transitions
Computed a total of 62 stabilizing places and 62 stable transitions
Knowledge based reduction with 33 factoid took 281 ms. Reduced automaton from 14 states, 37 edges and 4 AP (stutter sensitive) to 14 states, 37 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (55 resets) in 487 ms. (81 steps per ms) remains 5/22 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 5/5 properties
[2026-05-23 13:13:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 73/78 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 540/618 variables, 58/63 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/618 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1096/1714 variables, 618/681 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1714 variables, 0/681 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/1714 variables, 0/681 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1714/1714 variables, and 681 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1705 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 618/618 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 73/78 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 540/618 variables, 58/63 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/618 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1096/1714 variables, 618/681 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1714 variables, 5/686 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1714 variables, 0/686 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/1714 variables, 0/686 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1714/1714 variables, and 686 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2097 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 618/618 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3815ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Finished Parikh walk after 386 steps, including 1 resets, run visited all 5 properties in 13 ms. (steps per millisecond=29 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 5 properties in 17 ms.
Knowledge based reduction with 33 factoid took 830 ms. Reduced automaton from 14 states, 37 edges and 4 AP (stutter sensitive) to 14 states, 37 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 763 ms :[(NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (NOT p3), true, (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
[2026-05-23 13:13:18] [INFO ] Invariant cache hit.
[2026-05-23 13:13:19] [INFO ] [Real]Absence check using 63 positive place invariants in 37 ms returned unsat
Proved EG (NOT p3) asserting that LTL formula F !(NOT p3) is false.
Negative knowledge disproves property using: (F p3)
Knowledge-based reduction took 7159 ms.
FORMULA Champagne-PT-H10T0R-LTLFireability-09 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property Champagne-PT-H10T0R-LTLFireability-09 finished in 70666 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((X(!F(p0)) U p1)))'
Support contains 2 out of 648 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 648/648 places, 1298/1298 transitions.
Graph (trivial) has 596 edges and 648 vertex of which 69 / 648 are part of one of the 15 SCC in 3 ms
Free SCC test removed 54 places
Ensure Unique test removed 58 transitions
Reduce isomorphic transitions removed 58 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 73 transitions
Trivial Post-agglo rules discarded 73 transitions
Performed 73 trivial Post agglomeration. Transition count delta: 73
Iterating post reduction 0 with 73 rules applied. Total rules applied 74 place count 593 transition count 1166
Reduce places removed 73 places and 0 transitions.
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 1 with 194 rules applied. Total rules applied 268 place count 520 transition count 1045
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 2 with 60 rules applied. Total rules applied 328 place count 460 transition count 1045
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 328 place count 460 transition count 1002
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 414 place count 417 transition count 1002
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 431 place count 400 transition count 858
Iterating global reduction 3 with 17 rules applied. Total rules applied 448 place count 400 transition count 858
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 460 place count 400 transition count 846
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 460 place count 400 transition count 843
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 466 place count 397 transition count 843
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 467 place count 396 transition count 836
Iterating global reduction 4 with 1 rules applied. Total rules applied 468 place count 396 transition count 836
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 469 place count 396 transition count 835
Performed 213 Post agglomeration using F-continuation condition.Transition count delta: 213
Deduced a syphon composed of 213 places in 0 ms
Reduce places removed 213 places and 0 transitions.
Iterating global reduction 5 with 426 rules applied. Total rules applied 895 place count 183 transition count 622
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 897 place count 181 transition count 606
Iterating global reduction 5 with 2 rules applied. Total rules applied 899 place count 181 transition count 606
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 901 place count 181 transition count 604
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 903 place count 179 transition count 602
Applied a total of 903 rules in 213 ms. Remains 179 /648 variables (removed 469) and now considering 602/1298 (removed 696) transitions.
[2026-05-23 13:13:19] [INFO ] Flow matrix only has 188 transitions (discarded 414 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7082264594169459789.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11898902503829541472.kers'
[2026-05-23 13:13:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7082264594169459789.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11898902503829541472.kers]
Normalized transition count is 187 out of 188 initially.
Culling duplicate invariants (modulo rational): removing 13 columns.
Culled 13 columns in 0 ms.
// Phase 1: matrix 187 rows 166 cols 508 entries
Finished phase 1 with 116 SingleSign rule and 0 generalized
[2026-05-23 13:13:19] [INFO ] Computed 63 invariants in 2 ms
Computed 63 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11898902503829541472.kers
Total runtime 3 ms.
[2026-05-23 13:13:19] [INFO ] Implicit Places using invariants in 422 ms returned []
[2026-05-23 13:13:19] [INFO ] Flow matrix only has 188 transitions (discarded 414 similar events)
[2026-05-23 13:13:19] [INFO ] Invariant cache hit.
[2026-05-23 13:13:20] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 851 ms to find 0 implicit places.
[2026-05-23 13:13:20] [INFO ] Redundant transitions in 41 ms returned []
Running 474 sub problems to find dead transitions.
[2026-05-23 13:13:20] [INFO ] Flow matrix only has 188 transitions (discarded 414 similar events)
[2026-05-23 13:13:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/175 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 2 (OVERLAPS) 4/179 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 4 (OVERLAPS) 187/366 variables, 179/242 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 474 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 366/367 variables, and 242 constraints, problems are : Problem set: 0 solved, 474 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 474/473 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 474 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/175 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 2 (OVERLAPS) 4/179 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 4 (OVERLAPS) 187/366 variables, 179/242 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 473/715 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 474 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 366/367 variables, and 715 constraints, problems are : Problem set: 0 solved, 474 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 474/473 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60159ms problems are : Problem set: 0 solved, 474 unsolved
Search for dead transitions found 0 dead transitions in 60161ms
Starting structural reductions in SI_LTL mode, iteration 1 : 179/648 places, 602/1298 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61278 ms. Remains : 179/648 places, 602/1298 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((X(!F(p0)) U p1)))'
Stuttering acceptance computed with spot in 57 ms :[(NOT p1)]
Running random walk in product with property : Champagne-PT-H10T0R-LTLFireability-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA Champagne-PT-H10T0R-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H10T0R-LTLFireability-10 finished in 61382 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(X((!p0&&F(G(p1))))) U ((!p0&&X(X((!p0&&F(G(p1))))))||X(X(G((!p0&&F(G(p1)))))))) U (G((X(X((!p0&&F(G(p1))))) U ((!p0&&X(X((!p0&&F(G(p1))))))||X(X(G((!p0&&F(G(p1)))))))))||(p2&&(X(X((!p0&&F(G(p1))))) U ((!p0&&X(X((!p0&&F(G(p1))))))||X(X(G((!p0&&F(G(p1))))))))))))'
Support contains 4 out of 648 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 648/648 places, 1298/1298 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 626 transition count 1146
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 626 transition count 1146
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 58 place count 626 transition count 1132
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 65 place count 619 transition count 1119
Iterating global reduction 1 with 7 rules applied. Total rules applied 72 place count 619 transition count 1119
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 74 place count 619 transition count 1117
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 77 place count 616 transition count 1100
Iterating global reduction 2 with 3 rules applied. Total rules applied 80 place count 616 transition count 1100
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 82 place count 616 transition count 1098
Applied a total of 82 rules in 90 ms. Remains 616 /648 variables (removed 32) and now considering 1098/1298 (removed 200) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10577903331494512422.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2616876776826627476.kers'
[2026-05-23 13:14:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10577903331494512422.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2616876776826627476.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1098 rows 616 cols 3312 entries
Finished phase 1 with 553 SingleSign rule and 0 generalized
[2026-05-23 13:14:20] [INFO ] Computed 63 invariants in 8 ms
Computed 63 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-2616876776826627476.kers
Total runtime 14 ms.
[2026-05-23 13:14:21] [INFO ] Implicit Places using invariants in 575 ms returned []
[2026-05-23 13:14:21] [INFO ] Invariant cache hit.
[2026-05-23 13:14:22] [INFO ] Implicit Places using invariants and state equation in 1141 ms returned []
Implicit Place search using SMT with State Equation took 1736 ms to find 0 implicit places.
Running 1097 sub problems to find dead transitions.
[2026-05-23 13:14:22] [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 615/1714 variables, and 0 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/616 constraints, PredecessorRefiner: 1097/1096 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1097 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 615/1714 variables, and 0 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/616 constraints, PredecessorRefiner: 1/1096 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60462ms problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 60465ms
Starting structural reductions in LTL mode, iteration 1 : 616/648 places, 1098/1298 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62297 ms. Remains : 616/648 places, 1098/1298 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(X((!p0&&F(G(p1))))) U (X(X(G((!p0&&F(G(p1))))))||(!p0&&X(X((!p0&&F(G(p1)))))))) U (G((X(X((!p0&&F(G(p1))))) U ((!p0&&X(X((!p0&&F(G(p1))))))||X(X(G((!p0&&F(G(p1)))))))))||(p2&&(X(X((!p0&&F(G(p1))))) U ((!p0&&X(X((!p0&&F(G(p1))))))||X(X(G((!p0&&F(G(p1))))))))))))'
Stuttering acceptance computed with spot in 395 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), true, (NOT p1)]
Running random walk in product with property : Champagne-PT-H10T0R-LTLFireability-11
Product exploration explored 100000 steps with 145 reset in 678 ms.
Stack based approach found an accepted trace after 56567 steps with 80 reset with depth 706 and stack size 706 in 446 ms.
FORMULA Champagne-PT-H10T0R-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Champagne-PT-H10T0R-LTLFireability-11 finished in 63916 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((G(F(p1))||p0))))'
Support contains 3 out of 648 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 648/648 places, 1298/1298 transitions.
Graph (trivial) has 597 edges and 648 vertex of which 73 / 648 are part of one of the 16 SCC in 2 ms
Free SCC test removed 57 places
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 72 place count 590 transition count 1165
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 1 with 191 rules applied. Total rules applied 263 place count 519 transition count 1045
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 2 with 60 rules applied. Total rules applied 323 place count 459 transition count 1045
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 323 place count 459 transition count 1002
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 409 place count 416 transition count 1002
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 427 place count 398 transition count 852
Iterating global reduction 3 with 18 rules applied. Total rules applied 445 place count 398 transition count 852
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 458 place count 398 transition count 839
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 458 place count 398 transition count 836
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 464 place count 395 transition count 836
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 465 place count 394 transition count 829
Iterating global reduction 4 with 1 rules applied. Total rules applied 466 place count 394 transition count 829
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 467 place count 394 transition count 828
Performed 211 Post agglomeration using F-continuation condition.Transition count delta: 211
Deduced a syphon composed of 211 places in 1 ms
Reduce places removed 211 places and 0 transitions.
Iterating global reduction 5 with 422 rules applied. Total rules applied 889 place count 183 transition count 617
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 891 place count 181 transition count 601
Iterating global reduction 5 with 2 rules applied. Total rules applied 893 place count 181 transition count 601
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 895 place count 181 transition count 599
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 897 place count 179 transition count 597
Applied a total of 897 rules in 159 ms. Remains 179 /648 variables (removed 469) and now considering 597/1298 (removed 701) transitions.
[2026-05-23 13:15:24] [INFO ] Flow matrix only has 185 transitions (discarded 412 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15836125942056378132.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6077043521394692305.kers'
[2026-05-23 13:15:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15836125942056378132.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6077043521394692305.kers]
Normalized transition count is 184 out of 185 initially.
Culling duplicate invariants (modulo rational): removing 14 columns.
Culled 14 columns in 0 ms.
// Phase 1: matrix 184 rows 165 cols 496 entries
Finished phase 1 with 116 SingleSign rule and 0 generalized
[2026-05-23 13:15:24] [INFO ] Computed 63 invariants in 2 ms
Computed 63 P flows in 30 ms.
Exported basis to /tmp/petrispot-output-6077043521394692305.kers
Total runtime 31 ms.
[2026-05-23 13:15:25] [INFO ] Implicit Places using invariants in 299 ms returned []
[2026-05-23 13:15:25] [INFO ] Flow matrix only has 185 transitions (discarded 412 similar events)
[2026-05-23 13:15:25] [INFO ] Invariant cache hit.
[2026-05-23 13:15:25] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 588 ms to find 0 implicit places.
[2026-05-23 13:15:25] [INFO ] Redundant transitions in 8 ms returned []
Running 469 sub problems to find dead transitions.
[2026-05-23 13:15:25] [INFO ] Flow matrix only has 185 transitions (discarded 412 similar events)
[2026-05-23 13:15:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 2 (OVERLAPS) 3/179 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 4 (OVERLAPS) 184/363 variables, 179/242 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 469 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 363/364 variables, and 242 constraints, problems are : Problem set: 0 solved, 469 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 469/468 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 469 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 2 (OVERLAPS) 3/179 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 4 (OVERLAPS) 184/363 variables, 179/242 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 468/710 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 469 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 363/364 variables, and 710 constraints, problems are : Problem set: 0 solved, 469 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 469/468 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60103ms problems are : Problem set: 0 solved, 469 unsolved
Search for dead transitions found 0 dead transitions in 60104ms
Starting structural reductions in SI_LTL mode, iteration 1 : 179/648 places, 597/1298 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60869 ms. Remains : 179/648 places, 597/1298 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((G(F(p1))||p0))))'
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Champagne-PT-H10T0R-LTLFireability-12
Stuttering criterion allowed to conclude after 605 steps with 4 reset in 15 ms.
FORMULA Champagne-PT-H10T0R-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H10T0R-LTLFireability-12 finished in 61025 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((G(p0)||(p1&&F(G(p2))))))'
Support contains 4 out of 648 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 648/648 places, 1298/1298 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 627 transition count 1137
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 627 transition count 1137
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 56 place count 627 transition count 1123
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 62 place count 621 transition count 1111
Iterating global reduction 1 with 6 rules applied. Total rules applied 68 place count 621 transition count 1111
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 69 place count 621 transition count 1110
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 72 place count 618 transition count 1093
Iterating global reduction 2 with 3 rules applied. Total rules applied 75 place count 618 transition count 1093
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 77 place count 618 transition count 1091
Applied a total of 77 rules in 91 ms. Remains 618 /648 variables (removed 30) and now considering 1091/1298 (removed 207) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12493296222696557080.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18107924581200289382.kers'
[2026-05-23 13:16:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12493296222696557080.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18107924581200289382.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1091 rows 618 cols 3278 entries
Finished phase 1 with 555 SingleSign rule and 0 generalized
[2026-05-23 13:16:25] [INFO ] Computed 63 invariants in 9 ms
Computed 63 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-18107924581200289382.kers
Total runtime 10 ms.
[2026-05-23 13:16:26] [INFO ] Implicit Places using invariants in 546 ms returned []
[2026-05-23 13:16:26] [INFO ] Invariant cache hit.
[2026-05-23 13:16:27] [INFO ] Implicit Places using invariants and state equation in 916 ms returned []
Implicit Place search using SMT with State Equation took 1465 ms to find 0 implicit places.
Running 1090 sub problems to find dead transitions.
[2026-05-23 13:16:27] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 617/1709 variables, and 0 constraints, problems are : Problem set: 0 solved, 1090 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/618 constraints, PredecessorRefiner: 1090/1089 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1090 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 617/1709 variables, and 0 constraints, problems are : Problem set: 0 solved, 1090 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/618 constraints, PredecessorRefiner: 1/1089 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60389ms problems are : Problem set: 0 solved, 1090 unsolved
Search for dead transitions found 0 dead transitions in 60392ms
Starting structural reductions in LTL mode, iteration 1 : 618/648 places, 1091/1298 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61953 ms. Remains : 618/648 places, 1091/1298 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((G(p0)||(p1&&F(G(p2))))))'
Stuttering acceptance computed with spot in 282 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p0), (NOT p2), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : Champagne-PT-H10T0R-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Champagne-PT-H10T0R-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H10T0R-LTLFireability-13 finished in 62286 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 U (G(!p0)||(!p0&&G(p1))))))&&F(!p2))||G(F((!p0 U (G(!p0)||(!p0&&G(p1))))))))'
Spot run failed in 85 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-23 13:17:28] [INFO ] Flatten gal took : 61 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2036339022610913475
[2026-05-23 13:17:28] [INFO ] Computing symmetric may disable matrix : 1298 transitions.
[2026-05-23 13:17:28] [INFO ] Applying decomposition
[2026-05-23 13:17:28] [INFO ] Computation of Complete disable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 13:17:28] [INFO ] Computing symmetric may enable matrix : 1298 transitions.
[2026-05-23 13:17:28] [INFO ] Flatten gal took : 32 ms
[2026-05-23 13:17:28] [INFO ] Computation of Complete enable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph15210385163882285699.txt' '-o' '/tmp/graph15210385163882285699.bin' '-w' '/tmp/graph15210385163882285699.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15210385163882285699.bin' '-l' '-1' '-v' '-w' '/tmp/graph15210385163882285699.weights' '-q' '0' '-e' '0.001'
[2026-05-23 13:17:28] [INFO ] Decomposing Gal with order
[2026-05-23 13:17:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 13:17:28] [INFO ] Removed a total of 1326 redundant transitions.
[2026-05-23 13:17:28] [INFO ] Flatten gal took : 101 ms
[2026-05-23 13:17:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 159 labels/synchronizations in 29 ms.
[2026-05-23 13:17:28] [INFO ] Time to serialize gal into /tmp/LTLFireability12038398689475467930.gal : 15 ms
[2026-05-23 13:17:28] [INFO ] Time to serialize properties into /tmp/LTLFireability4819124639139875464.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12038398689475467930.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4819124639139875464.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((((X(F((!("((i7.u61.p327==1)&&(i22.u115.p652==1))"))U((G(!("((i7.u61.p327==1)&&(i22.u115.p652==1))")))||((!("((i7.u61.p327==1)&&(i22...453
Formula 0 simplified : FG(F!"(i24.i1.i1.u164.p957!=1)" U "((i7.u61.p327==1)&&(i22.u115.p652==1))") & (G"((i15.u76.p422==1)&&(i20.u105.p595==1))" | XG(F!"(i...223
[2026-05-23 13:17:28] [INFO ] Computing Do-Not-Accords matrix : 1298 transitions.
[2026-05-23 13:17:28] [INFO ] Computation of Completed DNA matrix. took 60 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 13:17:28] [INFO ] Built C files in 694ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2036339022610913475
Running compilation step : cd /tmp/ltsmin2036339022610913475;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 6640 ms.
Running link step : cd /tmp/ltsmin2036339022610913475;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 161 ms.
Running LTSmin : cd /tmp/ltsmin2036339022610913475;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '((X(<>((!(LTLAPp0==true) U ([](!(LTLAPp0==true))||(!(LTLAPp0==true)&&[]((LTLAPp1==true)))))))&&<>(!(LTLAPp2==true)))||[](<>((!(LTLAPp0==true) U ([](!(LTLAPp0==true))||(!(LTLAPp0==true)&&[]((LTLAPp1==true))))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t119, t159, t210, t283, i0.u41.t545, i1.t586, i2.t657, i2.t467, i2.u69.t471, i3.t648, i3.t416...1718
Computing Next relation with stutter on 5.54653e+17 deadlock states
138 unique states visited
137 strongly connected components in search stack
140 transitions explored
138 items max in DFS search stack
9275 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,92.9516,1846232,1,0,3.79173e+06,837,10458,8.40079e+06,359,3253,3530471
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Champagne-PT-H10T0R-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1117247 ms.

BK_STOP 1779542354579

--------------------
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="Champagne-PT-H10T0R"
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 Champagne-PT-H10T0R, 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 r050-smll-177946901100148"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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