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.r066-tall-177946967700475.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 CopsAndRobbers-PT-CRL025X003, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tall-177946967700475
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 7.9K Mar 6 13:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Mar 6 13:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Mar 6 13:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 6 13:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K Mar 15 08:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 08:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Mar 15 08:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 08:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 6 13:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Mar 6 13:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Mar 6 13:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Mar 6 13:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 15 08:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 15 08:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 11 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 133K 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 CopsAndRobbers-PT-CRL025X003-LTLCardinality-00
FORMULA_NAME CopsAndRobbers-PT-CRL025X003-LTLCardinality-01
FORMULA_NAME CopsAndRobbers-PT-CRL025X003-LTLCardinality-02
FORMULA_NAME CopsAndRobbers-PT-CRL025X003-LTLCardinality-03
FORMULA_NAME CopsAndRobbers-PT-CRL025X003-LTLCardinality-04
FORMULA_NAME CopsAndRobbers-PT-CRL025X003-LTLCardinality-05
FORMULA_NAME CopsAndRobbers-PT-CRL025X003-LTLCardinality-06
FORMULA_NAME CopsAndRobbers-PT-CRL025X003-LTLCardinality-07
FORMULA_NAME CopsAndRobbers-PT-CRL025X003-LTLCardinality-08
FORMULA_NAME CopsAndRobbers-PT-CRL025X003-LTLCardinality-09
FORMULA_NAME CopsAndRobbers-PT-CRL025X003-LTLCardinality-10
FORMULA_NAME CopsAndRobbers-PT-CRL025X003-LTLCardinality-11
FORMULA_NAME CopsAndRobbers-PT-CRL025X003-LTLCardinality-12
FORMULA_NAME CopsAndRobbers-PT-CRL025X003-LTLCardinality-13
FORMULA_NAME CopsAndRobbers-PT-CRL025X003-LTLCardinality-14
FORMULA_NAME CopsAndRobbers-PT-CRL025X003-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779531061193

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CopsAndRobbers-PT-CRL025X003
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-23 10:11:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-23 10:11:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 10:11:02] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2026-05-23 10:11:02] [INFO ] Transformed 135 places.
[2026-05-23 10:11:02] [INFO ] Transformed 179 transitions.
[2026-05-23 10:11:02] [INFO ] Parsed PT model containing 135 places and 179 transitions and 834 arcs in 155 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CopsAndRobbers-PT-CRL025X003-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CopsAndRobbers-PT-CRL025X003-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 179/179 transitions.
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 115 transition count 179
Applied a total of 20 rules in 25 ms. Remains 115 /135 variables (removed 20) and now considering 179/179 (removed 0) transitions.
Running 129 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4595182618357286995.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3132020215792558496.kers'
[2026-05-23 10:11:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4595182618357286995.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3132020215792558496.kers]
Culling duplicate invariants (modulo rational): removing 25 columns.
Culled 25 columns in 0 ms.
// Phase 1: matrix 179 rows 90 cols 519 entries
Finished phase 1 with 87 SingleSign rule and 0 generalized
[2026-05-23 10:11:02] [INFO ] Computed 28 invariants in 0 ms
Computed 28 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3132020215792558496.kers
Total runtime 1 ms.
[2026-05-23 10:11:02] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 2/110 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 179/289 variables, 110/138 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 50/188 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 5/294 variables, 5/193 constraints. Problems are: Problem set: 0 solved, 129 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 294/294 variables, and 193 constraints, problems are : Problem set: 0 solved, 129 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 115/115 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 2/110 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 179/289 variables, 110/138 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 50/188 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 109/297 constraints. Problems are: Problem set: 0 solved, 129 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 289/294 variables, and 297 constraints, problems are : Problem set: 0 solved, 129 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 110/115 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 109/129 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40192ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 40206ms
[2026-05-23 10:11:42] [INFO ] Invariant cache hit.
[2026-05-23 10:11:43] [INFO ] Implicit Places using invariants in 103 ms returned []
[2026-05-23 10:11:43] [INFO ] Invariant cache hit.
[2026-05-23 10:11:43] [INFO ] State equation strengthened by 50 read => feed constraints.
[2026-05-23 10:11:43] [INFO ] Implicit Places using invariants and state equation in 788 ms returned []
Implicit Place search using SMT with State Equation took 898 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 115/135 places, 179/179 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41180 ms. Remains : 115/135 places, 179/179 transitions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 179/179 transitions.
Applied a total of 0 rules in 3 ms. Remains 115 /115 variables (removed 0) and now considering 179/179 (removed 0) transitions.
Skipped dead transition search.
[2026-05-23 10:11:43] [INFO ] Invariant cache hit.
[2026-05-23 10:11:43] [INFO ] Implicit Places using invariants in 91 ms returned []
[2026-05-23 10:11:43] [INFO ] Invariant cache hit.
[2026-05-23 10:11:43] [INFO ] State equation strengthened by 50 read => feed constraints.
[2026-05-23 10:11:44] [INFO ] Implicit Places using invariants and state equation in 777 ms returned []
Implicit Place search using SMT with State Equation took 875 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 879 ms. Remains : 115/115 places, 179/179 transitions.
Support contains 47 out of 115 places after structural reductions.
[2026-05-23 10:11:44] [INFO ] Flatten gal took : 34 ms
[2026-05-23 10:11:44] [INFO ] Flatten gal took : 16 ms
[2026-05-23 10:11:44] [INFO ] Input system was already deterministic with 179 transitions.
Support contains 43 out of 115 places (down from 47) after GAL structural reductions.
RANDOM walk for 40002 steps (8 resets) in 1071 ms. (37 steps per ms) remains 9/36 properties
BEST_FIRST walk for 40001 steps (8 resets) in 397 ms. (100 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40001 steps (8 resets) in 228 ms. (174 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (11 resets) in 141 ms. (281 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (9 resets) in 141 ms. (281 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 194 ms. (205 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (10 resets) in 183 ms. (217 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 106 ms. (373 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (9 resets) in 95 ms. (416 steps per ms) remains 7/7 properties
[2026-05-23 10:11:45] [INFO ] Invariant cache hit.
[2026-05-23 10:11:45] [INFO ] State equation strengthened by 50 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
At refinement iteration 1 (OVERLAPS) 32/41 variables, 6/6 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/6 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 23/64 variables, 22/28 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/28 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 137/201 variables, 64/92 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 8/100 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 0/100 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 92/293 variables, 50/150 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/293 variables, 42/192 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/293 variables, 0/192 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/294 variables, 1/193 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/294 variables, 0/193 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/294 variables, 0/193 constraints. Problems are: Problem set: 4 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 294/294 variables, and 193 constraints, problems are : Problem set: 4 solved, 3 unsolved in 199 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 115/115 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 32/37 variables, 2/2 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 1/3 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 27/64 variables, 26/29 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/29 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 137/201 variables, 64/93 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 8/101 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 3/104 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/104 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 92/293 variables, 50/154 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/293 variables, 42/196 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/293 variables, 1/197 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/293 variables, 0/197 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 1/294 variables, 1/198 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/294 variables, 0/198 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/294 variables, 0/198 constraints. Problems are: Problem set: 4 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 294/294 variables, and 198 constraints, problems are : Problem set: 4 solved, 3 unsolved in 1356 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 115/115 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 3/7 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 1560ms problems are : Problem set: 4 solved, 3 unsolved
Parikh walk visited 0 properties in 451 ms.
Support contains 5 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 179/179 transitions.
Graph (complete) has 550 edges and 115 vertex of which 114 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 114 transition count 178
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 113 transition count 178
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 112 transition count 177
Applied a total of 5 rules in 25 ms. Remains 112 /115 variables (removed 3) and now considering 177/179 (removed 2) transitions.
Running 127 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4787216503029878265.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17824187147163578355.kers'
[2026-05-23 10:11:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4787216503029878265.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17824187147163578355.kers]
Culling duplicate invariants (modulo rational): removing 25 columns.
Culled 25 columns in 0 ms.
// Phase 1: matrix 177 rows 87 cols 513 entries
Finished phase 1 with 84 SingleSign rule and 0 generalized
[2026-05-23 10:11:47] [INFO ] Computed 28 invariants in 0 ms
Computed 28 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-17824187147163578355.kers
Total runtime 3 ms.
[2026-05-23 10:11:47] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (OVERLAPS) 2/108 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (OVERLAPS) 177/285 variables, 108/136 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 50/186 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (OVERLAPS) 4/289 variables, 4/190 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 127 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 289/289 variables, and 191 constraints, problems are : Problem set: 0 solved, 127 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 112/112 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 127 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (OVERLAPS) 2/108 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (OVERLAPS) 177/285 variables, 108/136 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 50/186 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 111/297 constraints. Problems are: Problem set: 0 solved, 127 unsolved
SMT process timed out in 40137ms, After SMT, problems are : Problem set: 0 solved, 127 unsolved
Search for dead transitions found 0 dead transitions in 40137ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40163 ms. Remains : 112/115 places, 177/179 transitions.
RANDOM walk for 40006 steps (9 resets) in 387 ms. (103 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (9 resets) in 121 ms. (327 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (10 resets) in 105 ms. (377 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (12 resets) in 108 ms. (366 steps per ms) remains 2/3 properties
[2026-05-23 10:12:28] [INFO ] Invariant cache hit.
[2026-05-23 10:12:28] [INFO ] State equation strengthened by 50 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 30/33 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 27/60 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 131/191 variables, 60/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 4/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 96/287 variables, 50/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/287 variables, 46/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/287 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/289 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/289 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/289 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 190 constraints, problems are : Problem set: 0 solved, 2 unsolved in 247 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 112/112 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 30/33 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 27/60 variables, 26/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 131/191 variables, 60/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 4/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 96/287 variables, 50/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/287 variables, 46/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/287 variables, 2/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/287 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/289 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/289 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/289 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 195 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1586 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 112/112 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 1838ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 374 ms.
Support contains 3 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 177/177 transitions.
Graph (complete) has 545 edges and 112 vertex of which 110 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 110 /112 variables (removed 2) and now considering 177/177 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 110/112 places, 177/177 transitions.
RANDOM walk for 40005 steps (9 resets) in 98 ms. (404 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (9 resets) in 92 ms. (430 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (9 resets) in 142 ms. (279 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 754277 steps, run timeout after 3001 ms. (steps per millisecond=251 ) properties seen :0 out of 2
Probabilistic random walk after 754277 steps, saw 291240 distinct states, run finished after 3005 ms. (steps per millisecond=251 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-531510668893058390.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5861225872817365294.kers'
[2026-05-23 10:12:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-531510668893058390.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5861225872817365294.kers]
Culling duplicate invariants (modulo rational): removing 25 columns.
Culled 25 columns in 0 ms.
// Phase 1: matrix 177 rows 85 cols 509 entries
Finished phase 1 with 82 SingleSign rule and 0 generalized
[2026-05-23 10:12:33] [INFO ] Computed 28 invariants in 0 ms
Computed 28 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5861225872817365294.kers
Total runtime 1 ms.
[2026-05-23 10:12:33] [INFO ] State equation strengthened by 50 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 30/33 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 27/60 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 131/191 variables, 60/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 4/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 96/287 variables, 50/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/287 variables, 46/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/287 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/287 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 188 constraints, problems are : Problem set: 0 solved, 2 unsolved in 151 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 110/110 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 30/33 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 27/60 variables, 26/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 131/191 variables, 60/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 4/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 96/287 variables, 50/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/287 variables, 46/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/287 variables, 2/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/287 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/287 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 193 constraints, problems are : Problem set: 0 solved, 2 unsolved in 637 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 110/110 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 811ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 362 ms.
Support contains 3 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 177/177 transitions.
Applied a total of 0 rules in 7 ms. Remains 110 /110 variables (removed 0) and now considering 177/177 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 110/110 places, 177/177 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 177/177 transitions.
Applied a total of 0 rules in 6 ms. Remains 110 /110 variables (removed 0) and now considering 177/177 (removed 0) transitions.
[2026-05-23 10:12:34] [INFO ] Invariant cache hit.
[2026-05-23 10:12:34] [INFO ] Implicit Places using invariants in 84 ms returned []
[2026-05-23 10:12:34] [INFO ] Invariant cache hit.
[2026-05-23 10:12:34] [INFO ] State equation strengthened by 50 read => feed constraints.
[2026-05-23 10:12:36] [INFO ] Implicit Places using invariants and state equation in 1553 ms returned []
Implicit Place search using SMT with State Equation took 1640 ms to find 0 implicit places.
[2026-05-23 10:12:36] [INFO ] Redundant transitions in 7 ms returned []
Running 127 sub problems to find dead transitions.
[2026-05-23 10:12:36] [INFO ] Invariant cache hit.
[2026-05-23 10:12:36] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (OVERLAPS) 2/108 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (OVERLAPS) 177/285 variables, 108/136 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 50/186 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (OVERLAPS) 2/287 variables, 2/188 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 9 (OVERLAPS) 0/287 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 127 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 287/287 variables, and 189 constraints, problems are : Problem set: 0 solved, 127 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 110/110 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 127 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (OVERLAPS) 2/108 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (OVERLAPS) 177/285 variables, 108/136 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 50/186 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 119/305 constraints. Problems are: Problem set: 0 solved, 127 unsolved
SMT process timed out in 60054ms, After SMT, problems are : Problem set: 0 solved, 127 unsolved
Search for dead transitions found 0 dead transitions in 60055ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61719 ms. Remains : 110/110 places, 177/177 transitions.
FORMULA CopsAndRobbers-PT-CRL025X003-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA CopsAndRobbers-PT-CRL025X003-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 4 atomic propositions for a total of 12 simplifications.
Computed a total of 4 stabilizing places and 51 stable transitions
Graph (complete) has 750 edges and 115 vertex of which 110 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
FORMULA CopsAndRobbers-PT-CRL025X003-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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&&X(G(p1))))))'
Support contains 2 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 179/179 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 110 transition count 179
Applied a total of 5 rules in 3 ms. Remains 110 /115 variables (removed 5) and now considering 179/179 (removed 0) transitions.
Running 129 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10848478966514668485.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10563035352967753159.kers'
[2026-05-23 10:13:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10848478966514668485.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10563035352967753159.kers]
Culling duplicate invariants (modulo rational): removing 25 columns.
Culled 25 columns in 0 ms.
// Phase 1: matrix 179 rows 85 cols 509 entries
Finished phase 1 with 82 SingleSign rule and 0 generalized
[2026-05-23 10:13:36] [INFO ] Computed 28 invariants in 0 ms
Computed 28 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10563035352967753159.kers
Total runtime 1 ms.
[2026-05-23 10:13:36] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 2/110 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 179/289 variables, 110/138 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 50/188 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 129 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 289/289 variables, and 188 constraints, problems are : Problem set: 0 solved, 129 unsolved in 20012 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 110/110 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 2/110 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 179/289 variables, 110/138 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 50/188 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 129/317 constraints. Problems are: Problem set: 0 solved, 129 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 289/289 variables, and 317 constraints, problems are : Problem set: 0 solved, 129 unsolved in 20011 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 110/110 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40048ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 40049ms
[2026-05-23 10:14:16] [INFO ] Invariant cache hit.
[2026-05-23 10:14:17] [INFO ] Implicit Places using invariants in 86 ms returned []
[2026-05-23 10:14:17] [INFO ] Invariant cache hit.
[2026-05-23 10:14:17] [INFO ] State equation strengthened by 50 read => feed constraints.
[2026-05-23 10:14:18] [INFO ] Implicit Places using invariants and state equation in 1273 ms returned []
Implicit Place search using SMT with State Equation took 1362 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 110/115 places, 179/179 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41416 ms. Remains : 110/115 places, 179/179 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&&X(G(p1))))))'
Stuttering acceptance computed with spot in 254 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CopsAndRobbers-PT-CRL025X003-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 37 steps with 1 reset in 2 ms.
FORMULA CopsAndRobbers-PT-CRL025X003-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-CRL025X003-LTLCardinality-00 finished in 41752 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((!p0&&X((p1&&(p2 U p0)))))))'
Support contains 3 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 179/179 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 110 transition count 179
Applied a total of 5 rules in 3 ms. Remains 110 /115 variables (removed 5) and now considering 179/179 (removed 0) transitions.
Skipped dead transition search.
[2026-05-23 10:14:18] [INFO ] Invariant cache hit.
[2026-05-23 10:14:18] [INFO ] Implicit Places using invariants in 77 ms returned []
[2026-05-23 10:14:18] [INFO ] Invariant cache hit.
[2026-05-23 10:14:18] [INFO ] State equation strengthened by 50 read => feed constraints.
[2026-05-23 10:14:19] [INFO ] Implicit Places using invariants and state equation in 1213 ms returned []
Implicit Place search using SMT with State Equation took 1291 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 110/115 places, 179/179 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1295 ms. Remains : 110/115 places, 179/179 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((!p0&&X((p1&&(p2 U p0)))))))'
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CopsAndRobbers-PT-CRL025X003-LTLCardinality-01
Product exploration explored 100000 steps with 0 reset in 257 ms.
Stack based approach found an accepted trace after 254 steps with 0 reset with depth 255 and stack size 255 in 1 ms.
FORMULA CopsAndRobbers-PT-CRL025X003-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property CopsAndRobbers-PT-CRL025X003-LTLCardinality-01 finished in 1800 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G((p0||X(p1)))||(p0&&F(p2))||(X(p1)&&F(p2))))))'
Support contains 6 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 179/179 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 111 transition count 179
Applied a total of 4 rules in 6 ms. Remains 111 /115 variables (removed 4) and now considering 179/179 (removed 0) transitions.
Running 129 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2906407613677325467.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10642836679137689954.kers'
[2026-05-23 10:14:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2906407613677325467.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10642836679137689954.kers]
Culling duplicate invariants (modulo rational): removing 25 columns.
Culled 25 columns in 0 ms.
// Phase 1: matrix 179 rows 86 cols 511 entries
Finished phase 1 with 83 SingleSign rule and 0 generalized
[2026-05-23 10:14:20] [INFO ] Computed 28 invariants in 1 ms
Computed 28 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10642836679137689954.kers
Total runtime 2 ms.
[2026-05-23 10:14:20] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 2/110 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 179/289 variables, 110/138 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 50/188 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 1/290 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 129 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 290/290 variables, and 189 constraints, problems are : Problem set: 0 solved, 129 unsolved in 20011 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 111/111 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 2/110 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 179/289 variables, 110/138 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 50/188 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 125/313 constraints. Problems are: Problem set: 0 solved, 129 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 289/290 variables, and 313 constraints, problems are : Problem set: 0 solved, 129 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 110/111 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 125/129 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40061ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 40062ms
[2026-05-23 10:15:00] [INFO ] Invariant cache hit.
[2026-05-23 10:15:00] [INFO ] Implicit Places using invariants in 79 ms returned []
[2026-05-23 10:15:00] [INFO ] Invariant cache hit.
[2026-05-23 10:15:00] [INFO ] State equation strengthened by 50 read => feed constraints.
[2026-05-23 10:15:01] [INFO ] Implicit Places using invariants and state equation in 1242 ms returned []
Implicit Place search using SMT with State Equation took 1323 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 111/115 places, 179/179 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41392 ms. Remains : 111/115 places, 179/179 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G((p0||X(p1)))||(p0&&F(p2))||(X(p1)&&F(p2))))))'
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CopsAndRobbers-PT-CRL025X003-LTLCardinality-02
Stuttering criterion allowed to conclude after 267 steps with 3 reset in 1 ms.
FORMULA CopsAndRobbers-PT-CRL025X003-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-CRL025X003-LTLCardinality-02 finished in 41615 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)&&(p0||X((p1 U (p2||G(p1)))))))))'
Support contains 6 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 179/179 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 110 transition count 179
Applied a total of 5 rules in 5 ms. Remains 110 /115 variables (removed 5) and now considering 179/179 (removed 0) transitions.
Running 129 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17403719454721197791.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2682206723222547546.kers'
[2026-05-23 10:15:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17403719454721197791.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2682206723222547546.kers]
Culling duplicate invariants (modulo rational): removing 25 columns.
Culled 25 columns in 0 ms.
// Phase 1: matrix 179 rows 85 cols 509 entries
Finished phase 1 with 82 SingleSign rule and 0 generalized
[2026-05-23 10:15:02] [INFO ] Computed 28 invariants in 0 ms
Computed 28 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2682206723222547546.kers
Total runtime 1 ms.
[2026-05-23 10:15:02] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 2/110 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 179/289 variables, 110/138 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 50/188 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 129 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 289/289 variables, and 188 constraints, problems are : Problem set: 0 solved, 129 unsolved in 20009 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 110/110 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 2/110 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 179/289 variables, 110/138 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 50/188 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 129/317 constraints. Problems are: Problem set: 0 solved, 129 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 289/289 variables, and 317 constraints, problems are : Problem set: 0 solved, 129 unsolved in 20010 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 110/110 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40046ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 40048ms
[2026-05-23 10:15:42] [INFO ] Invariant cache hit.
[2026-05-23 10:15:42] [INFO ] Implicit Places using invariants in 81 ms returned []
[2026-05-23 10:15:42] [INFO ] Invariant cache hit.
[2026-05-23 10:15:42] [INFO ] State equation strengthened by 50 read => feed constraints.
[2026-05-23 10:15:43] [INFO ] Implicit Places using invariants and state equation in 1421 ms returned []
Implicit Place search using SMT with State Equation took 1504 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 110/115 places, 179/179 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41558 ms. Remains : 110/115 places, 179/179 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)&&(p0||X((p1 U (p2||G(p1)))))))))'
Stuttering acceptance computed with spot in 207 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p1)), true]
Running random walk in product with property : CopsAndRobbers-PT-CRL025X003-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA CopsAndRobbers-PT-CRL025X003-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-CRL025X003-LTLCardinality-05 finished in 41793 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))'
Support contains 1 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 179/179 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 110 transition count 179
Applied a total of 5 rules in 5 ms. Remains 110 /115 variables (removed 5) and now considering 179/179 (removed 0) transitions.
Skipped dead transition search.
[2026-05-23 10:15:43] [INFO ] Invariant cache hit.
[2026-05-23 10:15:43] [INFO ] Implicit Places using invariants in 79 ms returned []
[2026-05-23 10:15:43] [INFO ] Invariant cache hit.
[2026-05-23 10:15:43] [INFO ] State equation strengthened by 50 read => feed constraints.
[2026-05-23 10:15:44] [INFO ] Implicit Places using invariants and state equation in 1012 ms returned []
Implicit Place search using SMT with State Equation took 1092 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 110/115 places, 179/179 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1098 ms. Remains : 110/115 places, 179/179 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))'
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : CopsAndRobbers-PT-CRL025X003-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CopsAndRobbers-PT-CRL025X003-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-CRL025X003-LTLCardinality-06 finished in 1211 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((X(X(F(X(X(p0)))))&&X(p1)) U p2)))'
Support contains 5 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 179/179 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 110 transition count 179
Applied a total of 5 rules in 4 ms. Remains 110 /115 variables (removed 5) and now considering 179/179 (removed 0) transitions.
Skipped dead transition search.
[2026-05-23 10:15:45] [INFO ] Invariant cache hit.
[2026-05-23 10:15:45] [INFO ] Implicit Places using invariants in 81 ms returned []
[2026-05-23 10:15:45] [INFO ] Invariant cache hit.
[2026-05-23 10:15:45] [INFO ] State equation strengthened by 50 read => feed constraints.
[2026-05-23 10:15:46] [INFO ] Implicit Places using invariants and state equation in 1540 ms returned []
Implicit Place search using SMT with State Equation took 1623 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 110/115 places, 179/179 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1628 ms. Remains : 110/115 places, 179/179 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((X(X(F(X(X(p0)))))&&X(p1)) U p2)))'
Stuttering acceptance computed with spot in 221 ms :[(NOT p2), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CopsAndRobbers-PT-CRL025X003-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 48 steps with 0 reset in 0 ms.
FORMULA CopsAndRobbers-PT-CRL025X003-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-CRL025X003-LTLCardinality-07 finished in 1886 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||(G(p1) U G(p2)))))'
Support contains 6 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 179/179 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 110 transition count 179
Applied a total of 5 rules in 3 ms. Remains 110 /115 variables (removed 5) and now considering 179/179 (removed 0) transitions.
Skipped dead transition search.
[2026-05-23 10:15:46] [INFO ] Invariant cache hit.
[2026-05-23 10:15:47] [INFO ] Implicit Places using invariants in 83 ms returned []
[2026-05-23 10:15:47] [INFO ] Invariant cache hit.
[2026-05-23 10:15:47] [INFO ] State equation strengthened by 50 read => feed constraints.
[2026-05-23 10:15:48] [INFO ] Implicit Places using invariants and state equation in 1105 ms returned []
Implicit Place search using SMT with State Equation took 1202 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 110/115 places, 179/179 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1206 ms. Remains : 110/115 places, 179/179 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||(G(p1) U G(p2)))))'
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CopsAndRobbers-PT-CRL025X003-LTLCardinality-08
Product exploration explored 100000 steps with 47152 reset in 274 ms.
Product exploration explored 100000 steps with 47190 reset in 286 ms.
Computed a total of 4 stabilizing places and 51 stable transitions
Computed a total of 4 stabilizing places and 51 stable transitions
Knowledge based reduction with 11 factoid took 188 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
RANDOM walk for 40005 steps (8 resets) in 96 ms. (412 steps per ms) remains 1/4 properties
BEST_FIRST walk for 538 steps (0 resets) in 6 ms. (76 steps per ms) remains 0/1 properties
Knowledge based reduction with 11 factoid took 212 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Knowledge-based reduction took 572 ms.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 110 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 179/179 transitions.
Applied a total of 0 rules in 2 ms. Remains 110 /110 variables (removed 0) and now considering 179/179 (removed 0) transitions.
Skipped dead transition search.
[2026-05-23 10:15:49] [INFO ] Invariant cache hit.
[2026-05-23 10:15:49] [INFO ] Implicit Places using invariants in 100 ms returned []
[2026-05-23 10:15:49] [INFO ] Invariant cache hit.
[2026-05-23 10:15:49] [INFO ] State equation strengthened by 50 read => feed constraints.
[2026-05-23 10:15:50] [INFO ] Implicit Places using invariants and state equation in 1078 ms returned []
Implicit Place search using SMT with State Equation took 1181 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1183 ms. Remains : 110/110 places, 179/179 transitions.
Computed a total of 4 stabilizing places and 51 stable transitions
Computed a total of 4 stabilizing places and 51 stable transitions
Knowledge based reduction with 4 factoid took 164 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (9 resets) in 175 ms. (227 steps per ms) remains 1/4 properties
BEST_FIRST walk for 612 steps (0 resets) in 5 ms. (102 steps per ms) remains 0/1 properties
Knowledge based reduction with 4 factoid took 192 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Knowledge-based reduction took 513 ms.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 47258 reset in 222 ms.
Product exploration explored 100000 steps with 47133 reset in 272 ms.
Spot run failed in 69 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/ltsmin13382215559003271816
[2026-05-23 10:15:52] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13382215559003271816
Running compilation step : cd /tmp/ltsmin13382215559003271816;'/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 382 ms.
Running link step : cd /tmp/ltsmin13382215559003271816;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin13382215559003271816;'/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/stateBased12895711583612311341.hoa' '--buchi-type=spotba'
LTSmin run took 727 ms.
FORMULA CopsAndRobbers-PT-CRL025X003-LTLCardinality-08 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CopsAndRobbers-PT-CRL025X003-LTLCardinality-08 finished in 6324 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' '!(((p0 U X(p1))&&(F(p2) U X(p3))))'
Support contains 6 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 179/179 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 114 transition count 179
Applied a total of 1 rules in 5 ms. Remains 114 /115 variables (removed 1) and now considering 179/179 (removed 0) transitions.
Running 129 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2409376522718183370.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14177249755799163938.kers'
[2026-05-23 10:15:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2409376522718183370.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14177249755799163938.kers]
Culling duplicate invariants (modulo rational): removing 25 columns.
Culled 25 columns in 0 ms.
// Phase 1: matrix 179 rows 89 cols 517 entries
Finished phase 1 with 86 SingleSign rule and 0 generalized
[2026-05-23 10:15:53] [INFO ] Computed 28 invariants in 0 ms
Computed 28 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14177249755799163938.kers
Total runtime 1 ms.
[2026-05-23 10:15:53] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 2/110 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 179/289 variables, 110/138 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 50/188 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 4/293 variables, 4/192 constraints. Problems are: Problem set: 0 solved, 129 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 293/293 variables, and 192 constraints, problems are : Problem set: 0 solved, 129 unsolved in 20013 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 114/114 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 2/110 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 179/289 variables, 110/138 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 50/188 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 113/301 constraints. Problems are: Problem set: 0 solved, 129 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 289/293 variables, and 301 constraints, problems are : Problem set: 0 solved, 129 unsolved in 20010 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 110/114 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 113/129 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40044ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 40045ms
[2026-05-23 10:16:33] [INFO ] Invariant cache hit.
[2026-05-23 10:16:33] [INFO ] Implicit Places using invariants in 85 ms returned []
[2026-05-23 10:16:33] [INFO ] Invariant cache hit.
[2026-05-23 10:16:33] [INFO ] State equation strengthened by 50 read => feed constraints.
[2026-05-23 10:16:34] [INFO ] Implicit Places using invariants and state equation in 1442 ms returned []
Implicit Place search using SMT with State Equation took 1529 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 114/115 places, 179/179 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41581 ms. Remains : 114/115 places, 179/179 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' '!(((p0 U X(p1))&&(F(p2) U X(p3))))'
Stuttering acceptance computed with spot in 279 ms :[(OR (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p3), (NOT p1), true, (NOT p2)]
Running random walk in product with property : CopsAndRobbers-PT-CRL025X003-LTLCardinality-11
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 1 ms.
FORMULA CopsAndRobbers-PT-CRL025X003-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CopsAndRobbers-PT-CRL025X003-LTLCardinality-11 finished in 41899 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 2 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 179/179 transitions.
Graph (complete) has 750 edges and 115 vertex of which 110 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 0 output transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 110 transition count 178
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 109 transition count 178
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 108 transition count 177
Applied a total of 5 rules in 16 ms. Remains 108 /115 variables (removed 7) and now considering 177/179 (removed 2) transitions.
Running 127 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7946447972892496901.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6079591054666804051.kers'
[2026-05-23 10:16:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7946447972892496901.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6079591054666804051.kers]
Culling duplicate invariants (modulo rational): removing 25 columns.
Culled 25 columns in 0 ms.
// Phase 1: matrix 177 rows 83 cols 505 entries
Finished phase 1 with 80 SingleSign rule and 0 generalized
[2026-05-23 10:16:35] [INFO ] Computed 28 invariants in 1 ms
Computed 28 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6079591054666804051.kers
Total runtime 2 ms.
[2026-05-23 10:16:35] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (OVERLAPS) 2/108 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (OVERLAPS) 177/285 variables, 108/136 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 50/186 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (OVERLAPS) 0/285 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 186 constraints, problems are : Problem set: 0 solved, 127 unsolved in 19240 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 108/108 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 127 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (OVERLAPS) 2/108 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (OVERLAPS) 177/285 variables, 108/136 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 50/186 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 127/313 constraints. Problems are: Problem set: 0 solved, 127 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 285/285 variables, and 313 constraints, problems are : Problem set: 0 solved, 127 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 108/108 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39288ms problems are : Problem set: 0 solved, 127 unsolved
Search for dead transitions found 0 dead transitions in 39289ms
[2026-05-23 10:17:14] [INFO ] Invariant cache hit.
[2026-05-23 10:17:14] [INFO ] Implicit Places using invariants in 82 ms returned []
[2026-05-23 10:17:14] [INFO ] Invariant cache hit.
[2026-05-23 10:17:14] [INFO ] State equation strengthened by 50 read => feed constraints.
[2026-05-23 10:17:15] [INFO ] Implicit Places using invariants and state equation in 1329 ms returned []
Implicit Place search using SMT with State Equation took 1412 ms to find 0 implicit places.
[2026-05-23 10:17:15] [INFO ] Redundant transitions in 9 ms returned []
Skipped dead transition search.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/115 places, 177/179 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 40736 ms. Remains : 108/115 places, 177/179 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 50 ms :[(NOT p0)]
Running random walk in product with property : CopsAndRobbers-PT-CRL025X003-LTLCardinality-12
Product exploration explored 100000 steps with 0 reset in 193 ms.
Stack based approach found an accepted trace after 204 steps with 0 reset with depth 205 and stack size 205 in 1 ms.
FORMULA CopsAndRobbers-PT-CRL025X003-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property CopsAndRobbers-PT-CRL025X003-LTLCardinality-12 finished in 41010 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(p0)))||F(p1)))'
Support contains 2 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 179/179 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 110 transition count 179
Applied a total of 5 rules in 1 ms. Remains 110 /115 variables (removed 5) and now considering 179/179 (removed 0) transitions.
Running 129 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14015642463753869873.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1779313177283363856.kers'
[2026-05-23 10:17:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14015642463753869873.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1779313177283363856.kers]
Culling duplicate invariants (modulo rational): removing 25 columns.
Culled 25 columns in 0 ms.
// Phase 1: matrix 179 rows 85 cols 509 entries
Finished phase 1 with 82 SingleSign rule and 0 generalized
[2026-05-23 10:17:16] [INFO ] Computed 28 invariants in 1 ms
Computed 28 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1779313177283363856.kers
Total runtime 2 ms.
[2026-05-23 10:17:16] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 2/110 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 179/289 variables, 110/138 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 50/188 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 129 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 289/289 variables, and 188 constraints, problems are : Problem set: 0 solved, 129 unsolved in 20012 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 110/110 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 2/110 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 179/289 variables, 110/138 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 50/188 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 129/317 constraints. Problems are: Problem set: 0 solved, 129 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 289/289 variables, and 317 constraints, problems are : Problem set: 0 solved, 129 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 110/110 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40055ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 40056ms
[2026-05-23 10:17:56] [INFO ] Invariant cache hit.
[2026-05-23 10:17:56] [INFO ] Implicit Places using invariants in 86 ms returned []
[2026-05-23 10:17:56] [INFO ] Invariant cache hit.
[2026-05-23 10:17:56] [INFO ] State equation strengthened by 50 read => feed constraints.
[2026-05-23 10:17:57] [INFO ] Implicit Places using invariants and state equation in 1241 ms returned []
Implicit Place search using SMT with State Equation took 1337 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 110/115 places, 179/179 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41395 ms. Remains : 110/115 places, 179/179 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(p0)))||F(p1)))'
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CopsAndRobbers-PT-CRL025X003-LTLCardinality-14
Product exploration explored 100000 steps with 0 reset in 153 ms.
Stack based approach found an accepted trace after 434 steps with 0 reset with depth 435 and stack size 435 in 1 ms.
FORMULA CopsAndRobbers-PT-CRL025X003-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property CopsAndRobbers-PT-CRL025X003-LTLCardinality-14 finished in 41715 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 2 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 179/179 transitions.
Graph (complete) has 750 edges and 115 vertex of which 110 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 110 transition count 178
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 109 transition count 178
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 108 transition count 177
Applied a total of 5 rules in 15 ms. Remains 108 /115 variables (removed 7) and now considering 177/179 (removed 2) transitions.
Running 127 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17777036182107051388.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7305475436366574211.kers'
[2026-05-23 10:17:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17777036182107051388.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7305475436366574211.kers]
Culling duplicate invariants (modulo rational): removing 25 columns.
Culled 25 columns in 0 ms.
// Phase 1: matrix 177 rows 83 cols 505 entries
Finished phase 1 with 80 SingleSign rule and 0 generalized
[2026-05-23 10:17:57] [INFO ] Computed 28 invariants in 0 ms
Computed 28 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7305475436366574211.kers
Total runtime 1 ms.
[2026-05-23 10:17:57] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (OVERLAPS) 2/108 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (OVERLAPS) 177/285 variables, 108/136 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 50/186 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (OVERLAPS) 0/285 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 186 constraints, problems are : Problem set: 0 solved, 127 unsolved in 19155 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 108/108 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 127 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (OVERLAPS) 2/108 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (OVERLAPS) 177/285 variables, 108/136 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 50/186 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 127/313 constraints. Problems are: Problem set: 0 solved, 127 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 285/285 variables, and 313 constraints, problems are : Problem set: 0 solved, 127 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 108/108 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39203ms problems are : Problem set: 0 solved, 127 unsolved
Search for dead transitions found 0 dead transitions in 39204ms
[2026-05-23 10:18:37] [INFO ] Invariant cache hit.
[2026-05-23 10:18:37] [INFO ] Implicit Places using invariants in 79 ms returned []
[2026-05-23 10:18:37] [INFO ] Invariant cache hit.
[2026-05-23 10:18:37] [INFO ] State equation strengthened by 50 read => feed constraints.
[2026-05-23 10:18:38] [INFO ] Implicit Places using invariants and state equation in 1337 ms returned []
Implicit Place search using SMT with State Equation took 1430 ms to find 0 implicit places.
[2026-05-23 10:18:38] [INFO ] Redundant transitions in 7 ms returned []
Skipped dead transition search.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/115 places, 177/179 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 40662 ms. Remains : 108/115 places, 177/179 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Stuttering acceptance computed with spot in 94 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CopsAndRobbers-PT-CRL025X003-LTLCardinality-15
Product exploration explored 100000 steps with 0 reset in 200 ms.
Stack based approach found an accepted trace after 204 steps with 0 reset with depth 205 and stack size 205 in 1 ms.
FORMULA CopsAndRobbers-PT-CRL025X003-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property CopsAndRobbers-PT-CRL025X003-LTLCardinality-15 finished in 40995 ms.
All properties solved by simple procedures.
Total runtime 456539 ms.

BK_STOP 1779531518894

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CopsAndRobbers-PT-CRL025X003"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is CopsAndRobbers-PT-CRL025X003, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r066-tall-177946967700475"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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