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.r098-tall-177955695500372.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 DiscoveryGPU-PT-14b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-tall-177955695500372
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 5.8K Mar 6 16:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Mar 6 16:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.8K Mar 6 16:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 26K Mar 6 16:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 09:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 09:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 09:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 09:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Mar 6 16:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K Mar 6 16:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 6 16:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 105K Mar 6 16:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 104K 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 DiscoveryGPU-PT-14b-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-14b-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-14b-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-14b-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-14b-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-14b-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-14b-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-14b-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-14b-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-14b-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-14b-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-14b-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-14b-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-14b-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-14b-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-14b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779604167846

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-14b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-24 06:29:29] [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-24 06:29:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 06:29:29] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2026-05-24 06:29:29] [INFO ] Transformed 408 places.
[2026-05-24 06:29:29] [INFO ] Transformed 434 transitions.
[2026-05-24 06:29:29] [INFO ] Found NUPN structural information;
[2026-05-24 06:29:29] [INFO ] Parsed PT model containing 408 places and 434 transitions and 1135 arcs in 184 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DiscoveryGPU-PT-14b-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-14b-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-14b-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 408 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 408/408 places, 434/434 transitions.
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 380 transition count 434
Discarding 64 places :
Symmetric choice reduction at 1 with 64 rule applications. Total rules 92 place count 316 transition count 370
Iterating global reduction 1 with 64 rules applied. Total rules applied 156 place count 316 transition count 370
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 167 place count 305 transition count 359
Iterating global reduction 1 with 11 rules applied. Total rules applied 178 place count 305 transition count 359
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 186 place count 297 transition count 351
Iterating global reduction 1 with 8 rules applied. Total rules applied 194 place count 297 transition count 351
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 202 place count 289 transition count 343
Iterating global reduction 1 with 8 rules applied. Total rules applied 210 place count 289 transition count 343
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 216 place count 283 transition count 331
Iterating global reduction 1 with 6 rules applied. Total rules applied 222 place count 283 transition count 331
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 227 place count 278 transition count 326
Iterating global reduction 1 with 5 rules applied. Total rules applied 232 place count 278 transition count 326
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 236 place count 274 transition count 322
Iterating global reduction 1 with 4 rules applied. Total rules applied 240 place count 274 transition count 322
Applied a total of 240 rules in 110 ms. Remains 274 /408 variables (removed 134) and now considering 322/434 (removed 112) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14500090817698126367.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3491896643101462113.kers'
[2026-05-24 06:29:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14500090817698126367.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3491896643101462113.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 322 rows 274 cols 863 entries
Finished phase 1 with 272 SingleSign rule and 0 generalized
[2026-05-24 06:29:29] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3491896643101462113.kers
Total runtime 2 ms.
[2026-05-24 06:29:29] [INFO ] Implicit Places using invariants in 263 ms returned []
[2026-05-24 06:29:29] [INFO ] Invariant cache hit.
[2026-05-24 06:29:30] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 512 ms to find 0 implicit places.
Running 321 sub problems to find dead transitions.
[2026-05-24 06:29:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (OVERLAPS) 1/274 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (OVERLAPS) 322/596 variables, 274/276 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/596 variables, 14/290 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/596 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (OVERLAPS) 0/596 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Real declared 596/596 variables, and 290 constraints, problems are : Problem set: 0 solved, 321 unsolved in 26442 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 321 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (OVERLAPS) 1/274 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (OVERLAPS) 322/596 variables, 274/290 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/596 variables, 321/611 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/596 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (OVERLAPS) 0/596 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Int declared 596/596 variables, and 611 constraints, problems are : Problem set: 0 solved, 321 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56637ms problems are : Problem set: 0 solved, 321 unsolved
Search for dead transitions found 0 dead transitions in 56651ms
Starting structural reductions in LTL mode, iteration 1 : 274/408 places, 322/434 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57305 ms. Remains : 274/408 places, 322/434 transitions.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 322/322 transitions.
Applied a total of 0 rules in 5 ms. Remains 274 /274 variables (removed 0) and now considering 322/322 (removed 0) transitions.
[2026-05-24 06:30:26] [INFO ] Invariant cache hit.
[2026-05-24 06:30:27] [INFO ] Implicit Places using invariants in 271 ms returned []
[2026-05-24 06:30:27] [INFO ] Invariant cache hit.
[2026-05-24 06:30:27] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 447 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 453 ms. Remains : 274/274 places, 322/322 transitions.
Support contains 37 out of 274 places after structural reductions.
[2026-05-24 06:30:27] [INFO ] Flatten gal took : 42 ms
[2026-05-24 06:30:27] [INFO ] Flatten gal took : 20 ms
[2026-05-24 06:30:27] [INFO ] Input system was already deterministic with 322 transitions.
Support contains 36 out of 274 places (down from 37) after GAL structural reductions.
RANDOM walk for 40000 steps (87 resets) in 939 ms. (42 steps per ms) remains 1/30 properties
BEST_FIRST walk for 28504 steps (7 resets) in 71 ms. (395 steps per ms) remains 0/1 properties
FORMULA DiscoveryGPU-PT-14b-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 45 stabilizing places and 45 stable transitions
Graph (complete) has 542 edges and 274 vertex of which 268 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.12 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(F((X(F(p0))||G(p1))))))'
Support contains 3 out of 274 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 322/322 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 259 transition count 305
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 259 transition count 305
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 37 place count 252 transition count 298
Iterating global reduction 0 with 7 rules applied. Total rules applied 44 place count 252 transition count 298
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 50 place count 246 transition count 292
Iterating global reduction 0 with 6 rules applied. Total rules applied 56 place count 246 transition count 292
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 60 place count 242 transition count 287
Iterating global reduction 0 with 4 rules applied. Total rules applied 64 place count 242 transition count 287
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 68 place count 238 transition count 280
Iterating global reduction 0 with 4 rules applied. Total rules applied 72 place count 238 transition count 280
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 76 place count 234 transition count 276
Iterating global reduction 0 with 4 rules applied. Total rules applied 80 place count 234 transition count 276
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 83 place count 231 transition count 273
Iterating global reduction 0 with 3 rules applied. Total rules applied 86 place count 231 transition count 273
Applied a total of 86 rules in 41 ms. Remains 231 /274 variables (removed 43) and now considering 273/322 (removed 49) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1681334887229707078.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17642630731667146512.kers'
[2026-05-24 06:30:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1681334887229707078.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17642630731667146512.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 273 rows 231 cols 740 entries
Finished phase 1 with 229 SingleSign rule and 0 generalized
[2026-05-24 06:30:28] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17642630731667146512.kers
Total runtime 2 ms.
[2026-05-24 06:30:28] [INFO ] Implicit Places using invariants in 104 ms returned []
[2026-05-24 06:30:28] [INFO ] Invariant cache hit.
[2026-05-24 06:30:28] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
Running 272 sub problems to find dead transitions.
[2026-05-24 06:30:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (OVERLAPS) 1/231 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (OVERLAPS) 273/504 variables, 231/233 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/504 variables, 14/247 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/504 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 6 (OVERLAPS) 0/504 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 272 unsolved
No progress, stopping.
After SMT solving in domain Real declared 504/504 variables, and 247 constraints, problems are : Problem set: 0 solved, 272 unsolved in 19408 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 272 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (OVERLAPS) 1/231 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (OVERLAPS) 273/504 variables, 231/247 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/504 variables, 272/519 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/504 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 7 (OVERLAPS) 0/504 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 272 unsolved
No progress, stopping.
After SMT solving in domain Int declared 504/504 variables, and 519 constraints, problems are : Problem set: 0 solved, 272 unsolved in 25670 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45138ms problems are : Problem set: 0 solved, 272 unsolved
Search for dead transitions found 0 dead transitions in 45143ms
Starting structural reductions in LTL mode, iteration 1 : 231/274 places, 273/322 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45551 ms. Remains : 231/274 places, 273/322 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(F((X(F(p0))||G(p1))))))'
Stuttering acceptance computed with spot in 261 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLFireability-01
Product exploration explored 100000 steps with 25000 reset in 184 ms.
Product exploration explored 100000 steps with 25000 reset in 125 ms.
Computed a total of 44 stabilizing places and 44 stable transitions
Graph (complete) has 470 edges and 231 vertex of which 230 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 44 stabilizing places and 44 stable transitions
Knowledge based reduction with 1 factoid took 45 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (86 resets) in 240 ms. (165 steps per ms) remains 1/4 properties
BEST_FIRST walk for 32370 steps (7 resets) in 70 ms. (455 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 138 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 486 ms.
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 273/273 transitions.
Applied a total of 0 rules in 11 ms. Remains 231 /231 variables (removed 0) and now considering 273/273 (removed 0) transitions.
[2026-05-24 06:31:15] [INFO ] Invariant cache hit.
[2026-05-24 06:31:15] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-05-24 06:31:15] [INFO ] Invariant cache hit.
[2026-05-24 06:31:15] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 235 ms. Remains : 231/231 places, 273/273 transitions.
Computed a total of 44 stabilizing places and 44 stable transitions
Graph (complete) has 470 edges and 231 vertex of which 230 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 44 stabilizing places and 44 stable transitions
Knowledge based reduction with 1 factoid took 39 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (86 resets) in 184 ms. (216 steps per ms) remains 1/4 properties
BEST_FIRST walk for 33235 steps (6 resets) in 44 ms. (738 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 69 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 348 ms.
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 88 ms.
Product exploration explored 100000 steps with 25000 reset in 105 ms.
Spot run failed in 78 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/ltsmin2644118982653317095
[2026-05-24 06:31:16] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2644118982653317095
Running compilation step : cd /tmp/ltsmin2644118982653317095;'/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'
Compilation finished in 524 ms.
Running link step : cd /tmp/ltsmin2644118982653317095;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin2644118982653317095;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased18299445085961885624.hoa' '--buchi-type=spotba'
LTSmin run took 49 ms.
FORMULA DiscoveryGPU-PT-14b-LTLFireability-01 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DiscoveryGPU-PT-14b-LTLFireability-01 finished in 48720 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||X(p0)||(p1&&X(p2)))))'
Support contains 5 out of 274 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 322/322 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 259 transition count 305
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 259 transition count 305
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 38 place count 251 transition count 297
Iterating global reduction 0 with 8 rules applied. Total rules applied 46 place count 251 transition count 297
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 53 place count 244 transition count 290
Iterating global reduction 0 with 7 rules applied. Total rules applied 60 place count 244 transition count 290
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 65 place count 239 transition count 283
Iterating global reduction 0 with 5 rules applied. Total rules applied 70 place count 239 transition count 283
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 75 place count 234 transition count 275
Iterating global reduction 0 with 5 rules applied. Total rules applied 80 place count 234 transition count 275
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 85 place count 229 transition count 270
Iterating global reduction 0 with 5 rules applied. Total rules applied 90 place count 229 transition count 270
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 93 place count 226 transition count 267
Iterating global reduction 0 with 3 rules applied. Total rules applied 96 place count 226 transition count 267
Applied a total of 96 rules in 18 ms. Remains 226 /274 variables (removed 48) and now considering 267/322 (removed 55) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5778250695453077196.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17540318628553249329.kers'
[2026-05-24 06:31:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5778250695453077196.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17540318628553249329.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 267 rows 226 cols 722 entries
Finished phase 1 with 224 SingleSign rule and 0 generalized
[2026-05-24 06:31:17] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17540318628553249329.kers
Total runtime 1 ms.
[2026-05-24 06:31:17] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-05-24 06:31:17] [INFO ] Invariant cache hit.
[2026-05-24 06:31:17] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
Running 266 sub problems to find dead transitions.
[2026-05-24 06:31:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (OVERLAPS) 1/226 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (OVERLAPS) 267/493 variables, 226/228 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/493 variables, 14/242 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/493 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (OVERLAPS) 0/493 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 266 unsolved
No progress, stopping.
After SMT solving in domain Real declared 493/493 variables, and 242 constraints, problems are : Problem set: 0 solved, 266 unsolved in 18363 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 266 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (OVERLAPS) 1/226 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (OVERLAPS) 267/493 variables, 226/242 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/493 variables, 266/508 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/493 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 7 (OVERLAPS) 0/493 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 266 unsolved
No progress, stopping.
After SMT solving in domain Int declared 493/493 variables, and 508 constraints, problems are : Problem set: 0 solved, 266 unsolved in 23361 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41770ms problems are : Problem set: 0 solved, 266 unsolved
Search for dead transitions found 0 dead transitions in 41773ms
Starting structural reductions in LTL mode, iteration 1 : 226/274 places, 267/322 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42018 ms. Remains : 226/274 places, 267/322 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||X(p0)||(p1&&X(p2)))))'
Stuttering acceptance computed with spot in 168 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLFireability-02
Entered a terminal (fully accepting) state of product in 687 steps with 1 reset in 8 ms.
FORMULA DiscoveryGPU-PT-14b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLFireability-02 finished in 42239 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((G(p1)||p0)))))'
Support contains 6 out of 274 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 322/322 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 259 transition count 305
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 259 transition count 305
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 37 place count 252 transition count 298
Iterating global reduction 0 with 7 rules applied. Total rules applied 44 place count 252 transition count 298
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 50 place count 246 transition count 292
Iterating global reduction 0 with 6 rules applied. Total rules applied 56 place count 246 transition count 292
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 60 place count 242 transition count 287
Iterating global reduction 0 with 4 rules applied. Total rules applied 64 place count 242 transition count 287
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 67 place count 239 transition count 282
Iterating global reduction 0 with 3 rules applied. Total rules applied 70 place count 239 transition count 282
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 73 place count 236 transition count 279
Iterating global reduction 0 with 3 rules applied. Total rules applied 76 place count 236 transition count 279
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 78 place count 234 transition count 277
Iterating global reduction 0 with 2 rules applied. Total rules applied 80 place count 234 transition count 277
Applied a total of 80 rules in 16 ms. Remains 234 /274 variables (removed 40) and now considering 277/322 (removed 45) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5906630141335511650.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-912614824934206173.kers'
[2026-05-24 06:31:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5906630141335511650.kers, --Pflows, --basisKERS=/tmp/petrispot-output-912614824934206173.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 277 rows 234 cols 750 entries
Finished phase 1 with 232 SingleSign rule and 0 generalized
[2026-05-24 06:31:59] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-912614824934206173.kers
Total runtime 1 ms.
[2026-05-24 06:31:59] [INFO ] Implicit Places using invariants in 72 ms returned []
[2026-05-24 06:31:59] [INFO ] Invariant cache hit.
[2026-05-24 06:31:59] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2026-05-24 06:31:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (OVERLAPS) 1/234 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 277/511 variables, 234/236 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/511 variables, 14/250 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/511 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/511 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 511/511 variables, and 250 constraints, problems are : Problem set: 0 solved, 276 unsolved in 19320 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (OVERLAPS) 1/234 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 277/511 variables, 234/250 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/511 variables, 276/526 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/511 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/511 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 511/511 variables, and 526 constraints, problems are : Problem set: 0 solved, 276 unsolved in 23736 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43086ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 43086ms
Starting structural reductions in LTL mode, iteration 1 : 234/274 places, 277/322 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43306 ms. Remains : 234/274 places, 277/322 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((G(p1)||p0)))))'
Stuttering acceptance computed with spot in 231 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLFireability-03
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-14b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLFireability-03 finished in 43579 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((((p0&&F(p1)) U X(p2)) U X(p0))))'
Support contains 4 out of 274 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 322/322 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 260 transition count 306
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 260 transition count 306
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 36 place count 252 transition count 298
Iterating global reduction 0 with 8 rules applied. Total rules applied 44 place count 252 transition count 298
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 50 place count 246 transition count 292
Iterating global reduction 0 with 6 rules applied. Total rules applied 56 place count 246 transition count 292
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 60 place count 242 transition count 287
Iterating global reduction 0 with 4 rules applied. Total rules applied 64 place count 242 transition count 287
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 68 place count 238 transition count 280
Iterating global reduction 0 with 4 rules applied. Total rules applied 72 place count 238 transition count 280
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 76 place count 234 transition count 276
Iterating global reduction 0 with 4 rules applied. Total rules applied 80 place count 234 transition count 276
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 83 place count 231 transition count 273
Iterating global reduction 0 with 3 rules applied. Total rules applied 86 place count 231 transition count 273
Applied a total of 86 rules in 23 ms. Remains 231 /274 variables (removed 43) and now considering 273/322 (removed 49) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1240710460206550141.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17628206602096813113.kers'
[2026-05-24 06:32:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1240710460206550141.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17628206602096813113.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 273 rows 231 cols 738 entries
Finished phase 1 with 229 SingleSign rule and 0 generalized
[2026-05-24 06:32:43] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17628206602096813113.kers
Total runtime 2 ms.
[2026-05-24 06:32:43] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-05-24 06:32:43] [INFO ] Invariant cache hit.
[2026-05-24 06:32:43] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
Running 272 sub problems to find dead transitions.
[2026-05-24 06:32:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (OVERLAPS) 1/231 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (OVERLAPS) 273/504 variables, 231/233 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/504 variables, 14/247 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/504 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 6 (OVERLAPS) 0/504 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 272 unsolved
No progress, stopping.
After SMT solving in domain Real declared 504/504 variables, and 247 constraints, problems are : Problem set: 0 solved, 272 unsolved in 19082 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 272 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (OVERLAPS) 1/231 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (OVERLAPS) 273/504 variables, 231/247 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/504 variables, 272/519 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/504 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 7 (OVERLAPS) 0/504 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 272 unsolved
No progress, stopping.
After SMT solving in domain Int declared 504/504 variables, and 519 constraints, problems are : Problem set: 0 solved, 272 unsolved in 22355 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41481ms problems are : Problem set: 0 solved, 272 unsolved
Search for dead transitions found 0 dead transitions in 41481ms
Starting structural reductions in LTL mode, iteration 1 : 231/274 places, 273/322 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41725 ms. Remains : 231/274 places, 273/322 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((((p0&&F(p1)) U X(p2)) U X(p0))))'
Stuttering acceptance computed with spot in 343 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, true, (NOT p1), (AND p0 (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLFireability-05
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-14b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLFireability-05 finished in 42109 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F(p1)))'
Support contains 2 out of 274 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 322/322 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 259 transition count 305
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 259 transition count 305
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 37 place count 252 transition count 298
Iterating global reduction 0 with 7 rules applied. Total rules applied 44 place count 252 transition count 298
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 50 place count 246 transition count 292
Iterating global reduction 0 with 6 rules applied. Total rules applied 56 place count 246 transition count 292
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 60 place count 242 transition count 286
Iterating global reduction 0 with 4 rules applied. Total rules applied 64 place count 242 transition count 286
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 68 place count 238 transition count 280
Iterating global reduction 0 with 4 rules applied. Total rules applied 72 place count 238 transition count 280
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 76 place count 234 transition count 276
Iterating global reduction 0 with 4 rules applied. Total rules applied 80 place count 234 transition count 276
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 82 place count 232 transition count 274
Iterating global reduction 0 with 2 rules applied. Total rules applied 84 place count 232 transition count 274
Applied a total of 84 rules in 25 ms. Remains 232 /274 variables (removed 42) and now considering 274/322 (removed 48) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6721438706271229646.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18315868765524976050.kers'
[2026-05-24 06:33:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6721438706271229646.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18315868765524976050.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 274 rows 232 cols 741 entries
Finished phase 1 with 230 SingleSign rule and 0 generalized
[2026-05-24 06:33:25] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-18315868765524976050.kers
Total runtime 10 ms.
[2026-05-24 06:33:25] [INFO ] Implicit Places using invariants in 77 ms returned []
[2026-05-24 06:33:25] [INFO ] Invariant cache hit.
[2026-05-24 06:33:25] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
Running 273 sub problems to find dead transitions.
[2026-05-24 06:33:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 1 (OVERLAPS) 1/232 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 3 (OVERLAPS) 274/506 variables, 232/234 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/506 variables, 14/248 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/506 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 6 (OVERLAPS) 0/506 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 273 unsolved
No progress, stopping.
After SMT solving in domain Real declared 506/506 variables, and 248 constraints, problems are : Problem set: 0 solved, 273 unsolved in 19325 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 273/273 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 273 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 1 (OVERLAPS) 1/232 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 4 (OVERLAPS) 274/506 variables, 232/248 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/506 variables, 273/521 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/506 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 7 (OVERLAPS) 0/506 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 273 unsolved
No progress, stopping.
After SMT solving in domain Int declared 506/506 variables, and 521 constraints, problems are : Problem set: 0 solved, 273 unsolved in 24386 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 273/273 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43746ms problems are : Problem set: 0 solved, 273 unsolved
Search for dead transitions found 0 dead transitions in 43747ms
Starting structural reductions in LTL mode, iteration 1 : 232/274 places, 274/322 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43992 ms. Remains : 232/274 places, 274/322 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F(p1)))'
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-14b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLFireability-06 finished in 44148 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 274 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 274/274 places, 322/322 transitions.
Graph (complete) has 542 edges and 274 vertex of which 268 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 267 transition count 273
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 85 place count 225 transition count 273
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 85 place count 225 transition count 229
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 173 place count 181 transition count 229
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 181 place count 173 transition count 219
Iterating global reduction 2 with 8 rules applied. Total rules applied 189 place count 173 transition count 219
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 194 place count 168 transition count 214
Iterating global reduction 2 with 5 rules applied. Total rules applied 199 place count 168 transition count 214
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 202 place count 165 transition count 208
Iterating global reduction 2 with 3 rules applied. Total rules applied 205 place count 165 transition count 208
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 208 place count 162 transition count 205
Iterating global reduction 2 with 3 rules applied. Total rules applied 211 place count 162 transition count 205
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 339 place count 98 transition count 141
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 351 place count 86 transition count 118
Iterating global reduction 2 with 12 rules applied. Total rules applied 363 place count 86 transition count 118
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 375 place count 74 transition count 105
Iterating global reduction 2 with 12 rules applied. Total rules applied 387 place count 74 transition count 105
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 399 place count 62 transition count 81
Iterating global reduction 2 with 12 rules applied. Total rules applied 411 place count 62 transition count 81
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 423 place count 50 transition count 69
Iterating global reduction 2 with 12 rules applied. Total rules applied 435 place count 50 transition count 69
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 447 place count 38 transition count 45
Iterating global reduction 2 with 12 rules applied. Total rules applied 459 place count 38 transition count 45
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 471 place count 26 transition count 33
Iterating global reduction 2 with 12 rules applied. Total rules applied 483 place count 26 transition count 33
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 484 place count 25 transition count 31
Iterating global reduction 2 with 1 rules applied. Total rules applied 485 place count 25 transition count 31
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 486 place count 24 transition count 30
Iterating global reduction 2 with 1 rules applied. Total rules applied 487 place count 24 transition count 30
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 488 place count 24 transition count 29
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 490 place count 22 transition count 27
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 25 edges and 20 vertex of which 17 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 7 rules applied. Total rules applied 497 place count 17 transition count 20
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 501 place count 13 transition count 20
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 507 place count 10 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 509 place count 9 transition count 16
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 511 place count 9 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 512 place count 8 transition count 13
Applied a total of 512 rules in 86 ms. Remains 8 /274 variables (removed 266) and now considering 13/322 (removed 309) transitions.
[2026-05-24 06:34:09] [INFO ] Flow matrix only has 10 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8859700567404637190.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7691332190907128335.kers'
[2026-05-24 06:34:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8859700567404637190.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7691332190907128335.kers]
Normalized transition count is 9 out of 10 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 9 rows 8 cols 16 entries
Finished phase 1 with 8 SingleSign rule and 0 generalized
[2026-05-24 06:34:09] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7691332190907128335.kers
Total runtime 0 ms.
[2026-05-24 06:34:09] [INFO ] Implicit Places using invariants in 17 ms returned []
[2026-05-24 06:34:09] [INFO ] Flow matrix only has 10 transitions (discarded 3 similar events)
[2026-05-24 06:34:09] [INFO ] Invariant cache hit.
[2026-05-24 06:34:09] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2026-05-24 06:34:09] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
[2026-05-24 06:34:09] [INFO ] Flow matrix only has 10 transitions (discarded 3 similar events)
[2026-05-24 06:34:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 9/14 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 3/17 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 0/17 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 17/18 variables, and 8 constraints, problems are : Problem set: 0 solved, 8 unsolved in 103 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 9/14 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 3/17 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/17 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/17 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 17/18 variables, and 16 constraints, problems are : Problem set: 0 solved, 8 unsolved in 69 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 184ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 184ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/274 places, 13/322 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 331 ms. Remains : 8/274 places, 13/322 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)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 92 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLFireability-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-14b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLFireability-07 finished in 447 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((F(p0)&&G(p1))) U X((p0||G(p2))))))'
Support contains 3 out of 274 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 322/322 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 260 transition count 306
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 260 transition count 306
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 253 transition count 299
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 253 transition count 299
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 48 place count 247 transition count 293
Iterating global reduction 0 with 6 rules applied. Total rules applied 54 place count 247 transition count 293
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 58 place count 243 transition count 287
Iterating global reduction 0 with 4 rules applied. Total rules applied 62 place count 243 transition count 287
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 65 place count 240 transition count 283
Iterating global reduction 0 with 3 rules applied. Total rules applied 68 place count 240 transition count 283
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 71 place count 237 transition count 280
Iterating global reduction 0 with 3 rules applied. Total rules applied 74 place count 237 transition count 280
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 236 transition count 279
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 236 transition count 279
Applied a total of 76 rules in 45 ms. Remains 236 /274 variables (removed 38) and now considering 279/322 (removed 43) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14863956881335771615.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14687544613381261547.kers'
[2026-05-24 06:34:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14863956881335771615.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14687544613381261547.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 279 rows 236 cols 753 entries
Finished phase 1 with 234 SingleSign rule and 0 generalized
[2026-05-24 06:34:09] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14687544613381261547.kers
Total runtime 1 ms.
[2026-05-24 06:34:09] [INFO ] Implicit Places using invariants in 169 ms returned []
[2026-05-24 06:34:09] [INFO ] Invariant cache hit.
[2026-05-24 06:34:10] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
Running 278 sub problems to find dead transitions.
[2026-05-24 06:34:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 3 (OVERLAPS) 279/515 variables, 236/238 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/515 variables, 14/252 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/515 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 6 (OVERLAPS) 0/515 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 278 unsolved
No progress, stopping.
After SMT solving in domain Real declared 515/515 variables, and 252 constraints, problems are : Problem set: 0 solved, 278 unsolved in 19591 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 278 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 4 (OVERLAPS) 279/515 variables, 236/252 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/515 variables, 278/530 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/515 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 7 (OVERLAPS) 0/515 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 278 unsolved
No progress, stopping.
After SMT solving in domain Int declared 515/515 variables, and 530 constraints, problems are : Problem set: 0 solved, 278 unsolved in 27531 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47164ms problems are : Problem set: 0 solved, 278 unsolved
Search for dead transitions found 0 dead transitions in 47164ms
Starting structural reductions in LTL mode, iteration 1 : 236/274 places, 279/322 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47542 ms. Remains : 236/274 places, 279/322 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((F(p0)&&G(p1))) U X((p0||G(p2))))))'
Stuttering acceptance computed with spot in 403 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLFireability-08
Stuttering criterion allowed to conclude after 467 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-14b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLFireability-08 finished in 48001 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 2 out of 274 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 274/274 places, 322/322 transitions.
Graph (complete) has 542 edges and 274 vertex of which 269 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 268 transition count 275
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 83 place count 227 transition count 275
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 83 place count 227 transition count 230
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 173 place count 182 transition count 230
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 181 place count 174 transition count 220
Iterating global reduction 2 with 8 rules applied. Total rules applied 189 place count 174 transition count 220
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 195 place count 168 transition count 214
Iterating global reduction 2 with 6 rules applied. Total rules applied 201 place count 168 transition count 214
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 205 place count 164 transition count 207
Iterating global reduction 2 with 4 rules applied. Total rules applied 209 place count 164 transition count 207
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 213 place count 160 transition count 202
Iterating global reduction 2 with 4 rules applied. Total rules applied 217 place count 160 transition count 202
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 218 place count 159 transition count 201
Iterating global reduction 2 with 1 rules applied. Total rules applied 219 place count 159 transition count 201
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 2 with 124 rules applied. Total rules applied 343 place count 97 transition count 139
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 356 place count 84 transition count 114
Iterating global reduction 2 with 13 rules applied. Total rules applied 369 place count 84 transition count 114
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 382 place count 71 transition count 100
Iterating global reduction 2 with 13 rules applied. Total rules applied 395 place count 71 transition count 100
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 407 place count 59 transition count 76
Iterating global reduction 2 with 12 rules applied. Total rules applied 419 place count 59 transition count 76
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 431 place count 47 transition count 64
Iterating global reduction 2 with 12 rules applied. Total rules applied 443 place count 47 transition count 64
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 454 place count 36 transition count 42
Iterating global reduction 2 with 11 rules applied. Total rules applied 465 place count 36 transition count 42
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 476 place count 25 transition count 31
Iterating global reduction 2 with 11 rules applied. Total rules applied 487 place count 25 transition count 31
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 488 place count 24 transition count 29
Iterating global reduction 2 with 1 rules applied. Total rules applied 489 place count 24 transition count 29
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 490 place count 23 transition count 28
Iterating global reduction 2 with 1 rules applied. Total rules applied 491 place count 23 transition count 28
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 492 place count 23 transition count 27
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 494 place count 23 transition count 27
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 496 place count 21 transition count 25
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 22 edges and 19 vertex of which 16 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 500 place count 16 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 501 place count 15 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 501 place count 15 transition count 20
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 503 place count 14 transition count 20
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 507 place count 12 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 509 place count 11 transition count 18
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 511 place count 11 transition count 16
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 514 place count 8 transition count 13
Applied a total of 514 rules in 43 ms. Remains 8 /274 variables (removed 266) and now considering 13/322 (removed 309) transitions.
[2026-05-24 06:34:57] [INFO ] Flow matrix only has 10 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2697358238960121240.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-491818022600954530.kers'
[2026-05-24 06:34:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2697358238960121240.kers, --Pflows, --basisKERS=/tmp/petrispot-output-491818022600954530.kers]
Normalized transition count is 9 out of 10 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 9 rows 8 cols 16 entries
Finished phase 1 with 8 SingleSign rule and 0 generalized
[2026-05-24 06:34:57] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-491818022600954530.kers
Total runtime 0 ms.
[2026-05-24 06:34:57] [INFO ] Implicit Places using invariants in 14 ms returned []
[2026-05-24 06:34:57] [INFO ] Flow matrix only has 10 transitions (discarded 3 similar events)
[2026-05-24 06:34:57] [INFO ] Invariant cache hit.
[2026-05-24 06:34:57] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
[2026-05-24 06:34:57] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2026-05-24 06:34:57] [INFO ] Flow matrix only has 10 transitions (discarded 3 similar events)
[2026-05-24 06:34:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 9/14 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 3/17 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 0/17 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 17/18 variables, and 8 constraints, problems are : Problem set: 0 solved, 6 unsolved in 47 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 9/14 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 3/17 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/17 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 17/18 variables, and 14 constraints, problems are : Problem set: 0 solved, 6 unsolved in 45 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 96ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 96ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/274 places, 13/322 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 174 ms. Remains : 8/274 places, 13/322 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)&&F(p1))))'
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLFireability-09
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-14b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLFireability-09 finished in 302 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 U X((X(p1)||F(p2))))) U p0)))'
Support contains 4 out of 274 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 322/322 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 260 transition count 306
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 260 transition count 306
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 253 transition count 299
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 253 transition count 299
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 49 place count 246 transition count 292
Iterating global reduction 0 with 7 rules applied. Total rules applied 56 place count 246 transition count 292
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 61 place count 241 transition count 285
Iterating global reduction 0 with 5 rules applied. Total rules applied 66 place count 241 transition count 285
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 71 place count 236 transition count 277
Iterating global reduction 0 with 5 rules applied. Total rules applied 76 place count 236 transition count 277
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 81 place count 231 transition count 272
Iterating global reduction 0 with 5 rules applied. Total rules applied 86 place count 231 transition count 272
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 89 place count 228 transition count 269
Iterating global reduction 0 with 3 rules applied. Total rules applied 92 place count 228 transition count 269
Applied a total of 92 rules in 33 ms. Remains 228 /274 variables (removed 46) and now considering 269/322 (removed 53) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11258278826147536655.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9636405773652465346.kers'
[2026-05-24 06:34:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11258278826147536655.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9636405773652465346.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 269 rows 228 cols 728 entries
Finished phase 1 with 226 SingleSign rule and 0 generalized
[2026-05-24 06:34:58] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9636405773652465346.kers
Total runtime 1 ms.
[2026-05-24 06:34:58] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-05-24 06:34:58] [INFO ] Invariant cache hit.
[2026-05-24 06:34:58] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
Running 268 sub problems to find dead transitions.
[2026-05-24 06:34:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (OVERLAPS) 269/497 variables, 228/230 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/497 variables, 14/244 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (OVERLAPS) 0/497 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Real declared 497/497 variables, and 244 constraints, problems are : Problem set: 0 solved, 268 unsolved in 18814 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 269/497 variables, 228/244 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 268/512 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (OVERLAPS) 0/497 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Int declared 497/497 variables, and 512 constraints, problems are : Problem set: 0 solved, 268 unsolved in 25934 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44788ms problems are : Problem set: 0 solved, 268 unsolved
Search for dead transitions found 0 dead transitions in 44789ms
Starting structural reductions in LTL mode, iteration 1 : 228/274 places, 269/322 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45036 ms. Remains : 228/274 places, 269/322 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 X((X(p1)||F(p2))))) U p0)))'
Stuttering acceptance computed with spot in 306 ms :[(NOT p0), (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLFireability-10
Product exploration explored 100000 steps with 22280 reset in 134 ms.
Product exploration explored 100000 steps with 22162 reset in 129 ms.
Computed a total of 44 stabilizing places and 44 stable transitions
Graph (complete) has 462 edges and 228 vertex of which 227 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 44 stabilizing places and 44 stable transitions
Knowledge based reduction with 4 factoid took 57 ms. Reduced automaton from 9 states, 15 edges and 3 AP (stutter sensitive) to 9 states, 15 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (86 resets) in 162 ms. (245 steps per ms) remains 2/8 properties
BEST_FIRST walk for 36621 steps (7 resets) in 71 ms. (508 steps per ms) remains 0/2 properties
Knowledge based reduction with 4 factoid took 143 ms. Reduced automaton from 9 states, 15 edges and 3 AP (stutter sensitive) to 9 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 351 ms :[(NOT p0), (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
[2026-05-24 06:35:44] [INFO ] Invariant cache hit.
[2026-05-24 06:35:44] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-24 06:35:44] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2026-05-24 06:35:44] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 06:35:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2026-05-24 06:35:44] [INFO ] [Nat]Absence check using state equation in 168 ms returned sat
[2026-05-24 06:35:44] [INFO ] Computed and/alt/rep : 263/384/263 causal constraints (skipped 5 transitions) in 12 ms.
[2026-05-24 06:35:45] [INFO ] Added : 183 causal constraints over 37 iterations in 948 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 2121 ms.
Stuttering acceptance computed with spot in 327 ms :[(NOT p0), (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 269/269 transitions.
Applied a total of 0 rules in 6 ms. Remains 228 /228 variables (removed 0) and now considering 269/269 (removed 0) transitions.
[2026-05-24 06:35:46] [INFO ] Invariant cache hit.
[2026-05-24 06:35:46] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-05-24 06:35:46] [INFO ] Invariant cache hit.
[2026-05-24 06:35:46] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 226 ms. Remains : 228/228 places, 269/269 transitions.
Computed a total of 44 stabilizing places and 44 stable transitions
Graph (complete) has 462 edges and 228 vertex of which 227 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 44 stabilizing places and 44 stable transitions
Knowledge based reduction with 4 factoid took 60 ms. Reduced automaton from 9 states, 15 edges and 3 AP (stutter sensitive) to 9 states, 15 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (86 resets) in 235 ms. (169 steps per ms) remains 2/8 properties
BEST_FIRST walk for 39467 steps (8 resets) in 58 ms. (668 steps per ms) remains 0/2 properties
Knowledge based reduction with 4 factoid took 138 ms. Reduced automaton from 9 states, 15 edges and 3 AP (stutter sensitive) to 9 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 388 ms :[(NOT p0), (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
[2026-05-24 06:35:47] [INFO ] Invariant cache hit.
[2026-05-24 06:35:47] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-24 06:35:47] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2026-05-24 06:35:47] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 06:35:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2026-05-24 06:35:47] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2026-05-24 06:35:47] [INFO ] Computed and/alt/rep : 263/384/263 causal constraints (skipped 5 transitions) in 15 ms.
[2026-05-24 06:35:48] [INFO ] Added : 183 causal constraints over 37 iterations in 823 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 2052 ms.
Stuttering acceptance computed with spot in 387 ms :[(NOT p0), (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 378 ms :[(NOT p0), (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 22217 reset in 113 ms.
Product exploration explored 100000 steps with 22359 reset in 214 ms.
Spot run failed in 49 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/ltsmin12553974899801673465
[2026-05-24 06:35:49] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12553974899801673465
Running compilation step : cd /tmp/ltsmin12553974899801673465;'/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'
Compilation finished in 417 ms.
Running link step : cd /tmp/ltsmin12553974899801673465;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin12553974899801673465;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased16894089671297943993.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 269/269 transitions.
Applied a total of 0 rules in 6 ms. Remains 228 /228 variables (removed 0) and now considering 269/269 (removed 0) transitions.
[2026-05-24 06:36:04] [INFO ] Invariant cache hit.
[2026-05-24 06:36:04] [INFO ] Implicit Places using invariants in 66 ms returned []
[2026-05-24 06:36:04] [INFO ] Invariant cache hit.
[2026-05-24 06:36:04] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 227 ms. Remains : 228/228 places, 269/269 transitions.
Built C files in :
/tmp/ltsmin8877769068655539779
[2026-05-24 06:36:04] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8877769068655539779
Running compilation step : cd /tmp/ltsmin8877769068655539779;'/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'
Compilation finished in 426 ms.
Running link step : cd /tmp/ltsmin8877769068655539779;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin8877769068655539779;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased12797018754474208372.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-24 06:36:19] [INFO ] Flatten gal took : 11 ms
[2026-05-24 06:36:19] [INFO ] Flatten gal took : 11 ms
[2026-05-24 06:36:19] [INFO ] Time to serialize gal into /tmp/LTL3757389669522744551.gal : 4 ms
[2026-05-24 06:36:19] [INFO ] Time to serialize properties into /tmp/LTL232935163693010530.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3757389669522744551.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5564235312938314532.hoa' '-atoms' '/tmp/LTL232935163693010530.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...316
Loading property file /tmp/LTL232935163693010530.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5564235312938314532.hoa
Detected timeout of ITS tools.
[2026-05-24 06:36:34] [INFO ] Flatten gal took : 10 ms
[2026-05-24 06:36:34] [INFO ] Flatten gal took : 9 ms
[2026-05-24 06:36:34] [INFO ] Time to serialize gal into /tmp/LTL17021910389960931734.gal : 2 ms
[2026-05-24 06:36:34] [INFO ] Time to serialize properties into /tmp/LTL8186704469654539419.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17021910389960931734.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8186704469654539419.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...276
Read 1 LTL properties
Checking formula 0 : !((X((G(("((p213==1)&&(p406==1))")U(X((X("(p160==1)"))||(F("(p198!=1)"))))))U("((p213==1)&&(p406==1))"))))
Formula 0 simplified : X(F(!"((p213==1)&&(p406==1))" R X(X!"(p160==1)" & G!"(p198!=1)")) R !"((p213==1)&&(p406==1))")
Detected timeout of ITS tools.
[2026-05-24 06:36:50] [INFO ] Flatten gal took : 16 ms
[2026-05-24 06:36:50] [INFO ] Applying decomposition
[2026-05-24 06:36:50] [INFO ] Flatten gal took : 15 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/graph15730920316619726743.txt' '-o' '/tmp/graph15730920316619726743.bin' '-w' '/tmp/graph15730920316619726743.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15730920316619726743.bin' '-l' '-1' '-v' '-w' '/tmp/graph15730920316619726743.weights' '-q' '0' '-e' '0.001'
[2026-05-24 06:36:50] [INFO ] Decomposing Gal with order
[2026-05-24 06:36:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 06:36:50] [INFO ] Removed a total of 108 redundant transitions.
[2026-05-24 06:36:50] [INFO ] Flatten gal took : 65 ms
[2026-05-24 06:36:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 6 ms.
[2026-05-24 06:36:50] [INFO ] Time to serialize gal into /tmp/LTL11162393105779857814.gal : 4 ms
[2026-05-24 06:36:50] [INFO ] Time to serialize properties into /tmp/LTL10046396366698107638.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/LTL11162393105779857814.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10046396366698107638.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...256
Read 1 LTL properties
Checking formula 0 : !((X((G(("((i12.u43.p213==1)&&(i2.u78.p406==1))")U(X((X("(u31.p160==1)"))||(F("(i11.u39.p198!=1)"))))))U("((i12.u43.p213==1)&&(i2.u78....169
Formula 0 simplified : X(F(!"((i12.u43.p213==1)&&(i2.u78.p406==1))" R X(X!"(u31.p160==1)" & G!"(i11.u39.p198!=1)")) R !"((i12.u43.p213==1)&&(i2.u78.p406==1...159
Detected timeout of ITS tools.
Treatment of property DiscoveryGPU-PT-14b-LTLFireability-10 finished in 127326 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 274 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 274/274 places, 322/322 transitions.
Graph (complete) has 542 edges and 274 vertex of which 268 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 267 transition count 274
Reduce places removed 41 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 226 transition count 273
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 85 place count 225 transition count 273
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 85 place count 225 transition count 228
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 175 place count 180 transition count 228
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 183 place count 172 transition count 218
Iterating global reduction 3 with 8 rules applied. Total rules applied 191 place count 172 transition count 218
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 197 place count 166 transition count 212
Iterating global reduction 3 with 6 rules applied. Total rules applied 203 place count 166 transition count 212
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 207 place count 162 transition count 205
Iterating global reduction 3 with 4 rules applied. Total rules applied 211 place count 162 transition count 205
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 215 place count 158 transition count 200
Iterating global reduction 3 with 4 rules applied. Total rules applied 219 place count 158 transition count 200
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 220 place count 157 transition count 199
Iterating global reduction 3 with 1 rules applied. Total rules applied 221 place count 157 transition count 199
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 3 with 126 rules applied. Total rules applied 347 place count 94 transition count 136
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 359 place count 82 transition count 113
Iterating global reduction 3 with 12 rules applied. Total rules applied 371 place count 82 transition count 113
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 383 place count 70 transition count 100
Iterating global reduction 3 with 12 rules applied. Total rules applied 395 place count 70 transition count 100
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 407 place count 58 transition count 76
Iterating global reduction 3 with 12 rules applied. Total rules applied 419 place count 58 transition count 76
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 431 place count 46 transition count 64
Iterating global reduction 3 with 12 rules applied. Total rules applied 443 place count 46 transition count 64
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 455 place count 34 transition count 40
Iterating global reduction 3 with 12 rules applied. Total rules applied 467 place count 34 transition count 40
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 479 place count 22 transition count 28
Iterating global reduction 3 with 12 rules applied. Total rules applied 491 place count 22 transition count 28
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 492 place count 21 transition count 26
Iterating global reduction 3 with 1 rules applied. Total rules applied 493 place count 21 transition count 26
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 494 place count 20 transition count 25
Iterating global reduction 3 with 1 rules applied. Total rules applied 495 place count 20 transition count 25
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 496 place count 20 transition count 24
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 498 place count 18 transition count 22
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 19 edges and 16 vertex of which 13 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 7 rules applied. Total rules applied 505 place count 13 transition count 15
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 509 place count 9 transition count 15
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 513 place count 7 transition count 13
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 514 place count 7 transition count 12
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 516 place count 5 transition count 10
Applied a total of 516 rules in 33 ms. Remains 5 /274 variables (removed 269) and now considering 10/322 (removed 312) transitions.
[2026-05-24 06:37:05] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12318148794344182933.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11073696637242716113.kers'
[2026-05-24 06:37:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12318148794344182933.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11073696637242716113.kers]
Normalized transition count is 7 out of 8 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 7 rows 5 cols 11 entries
Finished phase 1 with 5 SingleSign rule and 0 generalized
[2026-05-24 06:37:05] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11073696637242716113.kers
Total runtime 0 ms.
[2026-05-24 06:37:05] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-24 06:37:05] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
[2026-05-24 06:37:05] [INFO ] Invariant cache hit.
[2026-05-24 06:37:05] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2026-05-24 06:37:05] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2026-05-24 06:37:05] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
[2026-05-24 06:37:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 3/12 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/13 variables, and 5 constraints, problems are : Problem set: 0 solved, 5 unsolved in 66 ms.
Refiners :[State Equation: 5/5 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 3/12 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/12 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/13 variables, and 10 constraints, problems are : Problem set: 0 solved, 5 unsolved in 53 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 120ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 120ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5/274 places, 10/322 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 222 ms. Remains : 5/274 places, 10/322 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 32 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLFireability-11
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-14b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLFireability-11 finished in 288 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 (F(p1) U X((p0 U G(p2))))))'
Support contains 4 out of 274 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 322/322 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 260 transition count 307
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 260 transition count 307
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 253 transition count 300
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 253 transition count 300
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 48 place count 247 transition count 294
Iterating global reduction 0 with 6 rules applied. Total rules applied 54 place count 247 transition count 294
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 59 place count 242 transition count 287
Iterating global reduction 0 with 5 rules applied. Total rules applied 64 place count 242 transition count 287
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 69 place count 237 transition count 279
Iterating global reduction 0 with 5 rules applied. Total rules applied 74 place count 237 transition count 279
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 79 place count 232 transition count 274
Iterating global reduction 0 with 5 rules applied. Total rules applied 84 place count 232 transition count 274
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 87 place count 229 transition count 271
Iterating global reduction 0 with 3 rules applied. Total rules applied 90 place count 229 transition count 271
Applied a total of 90 rules in 19 ms. Remains 229 /274 variables (removed 45) and now considering 271/322 (removed 51) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11936183711256151173.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8462958717369952901.kers'
[2026-05-24 06:37:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11936183711256151173.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8462958717369952901.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 271 rows 229 cols 732 entries
Finished phase 1 with 227 SingleSign rule and 0 generalized
[2026-05-24 06:37:05] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8462958717369952901.kers
Total runtime 2 ms.
[2026-05-24 06:37:05] [INFO ] Implicit Places using invariants in 112 ms returned []
[2026-05-24 06:37:05] [INFO ] Invariant cache hit.
[2026-05-24 06:37:05] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
Running 270 sub problems to find dead transitions.
[2026-05-24 06:37:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (OVERLAPS) 271/500 variables, 229/231 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 14/245 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (OVERLAPS) 0/500 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 245 constraints, problems are : Problem set: 0 solved, 270 unsolved in 18974 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 271/500 variables, 229/245 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 270/515 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (OVERLAPS) 0/500 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 515 constraints, problems are : Problem set: 0 solved, 270 unsolved in 25941 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44954ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 44955ms
Starting structural reductions in LTL mode, iteration 1 : 229/274 places, 271/322 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45241 ms. Remains : 229/274 places, 271/322 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 (F(p1) U X((p0 U G(p2))))))'
Stuttering acceptance computed with spot in 507 ms :[false, (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p1) p2 (NOT p0)), false, false, (AND (NOT p0) (NOT p2)), (AND (NOT p1) p2 (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2) p0), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLFireability-12
Product exploration explored 100000 steps with 3924 reset in 183 ms.
Stack based approach found an accepted trace after 377 steps with 13 reset with depth 95 and stack size 95 in 1 ms.
FORMULA DiscoveryGPU-PT-14b-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLFireability-12 finished in 45996 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Support contains 4 out of 274 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 274/274 places, 322/322 transitions.
Graph (complete) has 542 edges and 274 vertex of which 269 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 268 transition count 275
Reduce places removed 41 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 227 transition count 274
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 85 place count 226 transition count 274
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 85 place count 226 transition count 229
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 175 place count 181 transition count 229
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 181 place count 175 transition count 222
Iterating global reduction 3 with 6 rules applied. Total rules applied 187 place count 175 transition count 222
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 190 place count 172 transition count 219
Iterating global reduction 3 with 3 rules applied. Total rules applied 193 place count 172 transition count 219
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 195 place count 170 transition count 215
Iterating global reduction 3 with 2 rules applied. Total rules applied 197 place count 170 transition count 215
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 199 place count 168 transition count 213
Iterating global reduction 3 with 2 rules applied. Total rules applied 201 place count 168 transition count 213
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 331 place count 103 transition count 148
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 341 place count 93 transition count 129
Iterating global reduction 3 with 10 rules applied. Total rules applied 351 place count 93 transition count 129
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 361 place count 83 transition count 118
Iterating global reduction 3 with 10 rules applied. Total rules applied 371 place count 83 transition count 118
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 380 place count 74 transition count 100
Iterating global reduction 3 with 9 rules applied. Total rules applied 389 place count 74 transition count 100
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 398 place count 65 transition count 91
Iterating global reduction 3 with 9 rules applied. Total rules applied 407 place count 65 transition count 91
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 416 place count 56 transition count 73
Iterating global reduction 3 with 9 rules applied. Total rules applied 425 place count 56 transition count 73
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 434 place count 47 transition count 64
Iterating global reduction 3 with 9 rules applied. Total rules applied 443 place count 47 transition count 64
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 444 place count 46 transition count 62
Iterating global reduction 3 with 1 rules applied. Total rules applied 445 place count 46 transition count 62
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 446 place count 45 transition count 61
Iterating global reduction 3 with 1 rules applied. Total rules applied 447 place count 45 transition count 61
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 449 place count 45 transition count 59
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 451 place count 43 transition count 57
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 50 edges and 41 vertex of which 38 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 3 with 13 rules applied. Total rules applied 464 place count 38 transition count 44
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 475 place count 28 transition count 43
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 487 place count 22 transition count 37
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 490 place count 22 transition count 34
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 5 with 5 rules applied. Total rules applied 495 place count 17 transition count 29
Applied a total of 495 rules in 32 ms. Remains 17 /274 variables (removed 257) and now considering 29/322 (removed 293) transitions.
[2026-05-24 06:37:51] [INFO ] Flow matrix only has 21 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17677861561238685976.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11462564971787398891.kers'
[2026-05-24 06:37:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17677861561238685976.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11462564971787398891.kers]
Normalized transition count is 20 out of 21 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 20 rows 17 cols 33 entries
Finished phase 1 with 17 SingleSign rule and 0 generalized
[2026-05-24 06:37:51] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11462564971787398891.kers
Total runtime 0 ms.
[2026-05-24 06:37:51] [INFO ] Implicit Places using invariants in 18 ms returned []
[2026-05-24 06:37:51] [INFO ] Flow matrix only has 21 transitions (discarded 8 similar events)
[2026-05-24 06:37:51] [INFO ] Invariant cache hit.
[2026-05-24 06:37:51] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2026-05-24 06:37:51] [INFO ] Redundant transitions in 0 ms returned []
Running 17 sub problems to find dead transitions.
[2026-05-24 06:37:51] [INFO ] Flow matrix only has 21 transitions (discarded 8 similar events)
[2026-05-24 06:37:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 18/30 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 7/37 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 0/37 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 37/38 variables, and 17 constraints, problems are : Problem set: 0 solved, 17 unsolved in 142 ms.
Refiners :[State Equation: 17/17 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 18/30 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 17/29 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 7/37 variables, 5/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/37 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 37/38 variables, and 34 constraints, problems are : Problem set: 0 solved, 17 unsolved in 149 ms.
Refiners :[State Equation: 17/17 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 293ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 293ms
Starting structural reductions in SI_LTL mode, iteration 1 : 17/274 places, 29/322 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 374 ms. Remains : 17/274 places, 29/322 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Stuttering acceptance computed with spot in 83 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLFireability-13
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-14b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLFireability-13 finished in 492 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 U X((X(p1)||F(p2))))) U p0)))'
Spot run failed in 49 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-24 06:37:52] [INFO ] Flatten gal took : 17 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11333976801638995240
[2026-05-24 06:37:52] [INFO ] Computing symmetric may disable matrix : 322 transitions.
[2026-05-24 06:37:52] [INFO ] Applying decomposition
[2026-05-24 06:37:52] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 06:37:52] [INFO ] Computing symmetric may enable matrix : 322 transitions.
[2026-05-24 06:37:52] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 06:37:52] [INFO ] Flatten gal took : 13 ms
[2026-05-24 06:37:52] [INFO ] Computing Do-Not-Accords matrix : 322 transitions.
[2026-05-24 06:37:52] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 06:37:52] [INFO ] Built C files in 70ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11333976801638995240
Running compilation step : cd /tmp/ltsmin11333976801638995240;'/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'
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/graph13444503844844812747.txt' '-o' '/tmp/graph13444503844844812747.bin' '-w' '/tmp/graph13444503844844812747.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13444503844844812747.bin' '-l' '-1' '-v' '-w' '/tmp/graph13444503844844812747.weights' '-q' '0' '-e' '0.001'
[2026-05-24 06:37:52] [INFO ] Decomposing Gal with order
[2026-05-24 06:37:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 06:37:52] [INFO ] Removed a total of 120 redundant transitions.
[2026-05-24 06:37:52] [INFO ] Flatten gal took : 43 ms
[2026-05-24 06:37:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 4 ms.
[2026-05-24 06:37:52] [INFO ] Time to serialize gal into /tmp/LTLFireability5750551008800195701.gal : 3 ms
[2026-05-24 06:37:52] [INFO ] Time to serialize properties into /tmp/LTLFireability4958661850561873198.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5750551008800195701.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4958661850561873198.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...276
Read 1 LTL properties
Checking formula 0 : !((X((G(("((i13.u53.p213==1)&&(i2.u98.p406==1))")U(X((X("(i3.u43.p160==1)"))||(F("(i12.i0.u51.p198!=1)"))))))U("((i13.u53.p213==1)&&(i...175
Formula 0 simplified : X(F(!"((i13.u53.p213==1)&&(i2.u98.p406==1))" R X(X!"(i3.u43.p160==1)" & G!"(i12.i0.u51.p198!=1)")) R !"((i13.u53.p213==1)&&(i2.u98.p...165
Compilation finished in 672 ms.
Running link step : cd /tmp/ltsmin11333976801638995240;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin11333976801638995240;'/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 X((X((LTLAPp1==true))||<>((LTLAPp2==true)))))) U (LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-24 07:00:45] [INFO ] Applying decomposition
[2026-05-24 07:00:46] [INFO ] Flatten gal took : 216 ms
[2026-05-24 07:00:46] [INFO ] Decomposing Gal with order
[2026-05-24 07:00:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 07:00:46] [INFO ] Removed a total of 121 redundant transitions.
[2026-05-24 07:00:46] [INFO ] Flatten gal took : 159 ms
[2026-05-24 07:00:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 874 labels/synchronizations in 232 ms.
[2026-05-24 07:00:47] [INFO ] Time to serialize gal into /tmp/LTLFireability5122686686313998655.gal : 44 ms
[2026-05-24 07:00:47] [INFO ] Time to serialize properties into /tmp/LTLFireability17940283651653197504.ltl : 13 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/LTLFireability5122686686313998655.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17940283651653197504.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((G(("((i0.i0.i0.i0.i0.i0.i0.u21.p213==1)&&(i1.u30.p406==1))")U(X((X("(i0.i0.i0.i0.i0.i0.i0.i0.i0.u19.p160==1)"))||(F("(i0.i0.i0.i...250
Formula 0 simplified : X(F(!"((i0.i0.i0.i0.i0.i0.i0.u21.p213==1)&&(i1.u30.p406==1))" R X(X!"(i0.i0.i0.i0.i0.i0.i0.i0.i0.u19.p160==1)" & G!"(i0.i0.i0.i0.i0....240
Reverse transition relation is NOT exact ! Due to transitions t217, t230, t249, t298, i0.t16, i0.t11, i0.u27.t18, i0.u27.t20, i0.i0.t26, i0.i0.t32, i0.i0.u...2188
Computing Next relation with stutter on 1 deadlock states
Detected timeout of ITS tools.
[2026-05-24 07:23:34] [INFO ] Flatten gal took : 84 ms
[2026-05-24 07:23:35] [INFO ] Input system was already deterministic with 322 transitions.
[2026-05-24 07:23:35] [INFO ] Transformed 274 places.
[2026-05-24 07:23:35] [INFO ] Transformed 322 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2026-05-24 07:23:35] [INFO ] Time to serialize gal into /tmp/LTLFireability2960526484315760510.gal : 6 ms
[2026-05-24 07:23:35] [INFO ] Time to serialize properties into /tmp/LTLFireability463306905965322183.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/LTLFireability2960526484315760510.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability463306905965322183.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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...341
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X((G(("((p213==1)&&(p406==1))")U(X((X("(p160==1)"))||(F("(p198!=1)"))))))U("((p213==1)&&(p406==1))"))))
Formula 0 simplified : X(F(!"((p213==1)&&(p406==1))" R X(X!"(p160==1)" & G!"(p198!=1)")) R !"((p213==1)&&(p406==1))")

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.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="DiscoveryGPU-PT-14b"
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 DiscoveryGPU-PT-14b, 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 r098-tall-177955695500372"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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