Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r086-smll-174860102200274.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is FireWire-PT-05, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086-smll-174860102200274
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 91K May 29 14:32 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 FireWire-PT-05-CTLFireability-2024-12
FORMULA_NAME FireWire-PT-05-CTLFireability-2024-13
FORMULA_NAME FireWire-PT-05-CTLFireability-2024-14
FORMULA_NAME FireWire-PT-05-CTLFireability-2024-15
FORMULA_NAME FireWire-PT-05-CTLFireability-2025-00
FORMULA_NAME FireWire-PT-05-CTLFireability-2025-01
FORMULA_NAME FireWire-PT-05-CTLFireability-2025-02
FORMULA_NAME FireWire-PT-05-CTLFireability-2025-03
FORMULA_NAME FireWire-PT-05-CTLFireability-2025-04
FORMULA_NAME FireWire-PT-05-CTLFireability-2025-05
FORMULA_NAME FireWire-PT-05-CTLFireability-2025-06
FORMULA_NAME FireWire-PT-05-CTLFireability-2025-07
FORMULA_NAME FireWire-PT-05-CTLFireability-2025-08
FORMULA_NAME FireWire-PT-05-CTLFireability-2025-09
FORMULA_NAME FireWire-PT-05-CTLFireability-2025-10
FORMULA_NAME FireWire-PT-05-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1748848009764

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-02 07:06:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 07:06:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 07:06:52] [INFO ] Load time of PNML (sax parser for PT used): 173 ms
[2025-06-02 07:06:52] [INFO ] Transformed 114 places.
[2025-06-02 07:06:52] [INFO ] Transformed 373 transitions.
[2025-06-02 07:06:52] [INFO ] Found NUPN structural information;
[2025-06-02 07:06:52] [INFO ] Parsed PT model containing 114 places and 373 transitions and 1389 arcs in 373 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 22 ms.
Ensure Unique test removed 57 transitions
Reduce redundant transitions removed 57 transitions.
Support contains 77 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 316/316 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 113 transition count 314
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 113 transition count 314
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 113 transition count 313
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 9 place count 113 transition count 307
Applied a total of 9 rules in 47 ms. Remains 113 /114 variables (removed 1) and now considering 307/316 (removed 9) transitions.
[2025-06-02 07:06:52] [INFO ] Flow matrix only has 281 transitions (discarded 26 similar events)
// Phase 1: matrix 281 rows 113 cols
[2025-06-02 07:06:53] [INFO ] Computed 8 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:06:53] [INFO ] Implicit Places using invariants in 364 ms returned []
[2025-06-02 07:06:53] [INFO ] Flow matrix only has 281 transitions (discarded 26 similar events)
[2025-06-02 07:06:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:06:53] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 07:06:53] [INFO ] Implicit Places using invariants and state equation in 405 ms returned [13, 38, 65, 70]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 822 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 109/114 places, 307/316 transitions.
Applied a total of 0 rules in 9 ms. Remains 109 /109 variables (removed 0) and now considering 307/307 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 906 ms. Remains : 109/114 places, 307/316 transitions.
Support contains 77 out of 109 places after structural reductions.
[2025-06-02 07:06:54] [INFO ] Flatten gal took : 114 ms
[2025-06-02 07:06:54] [INFO ] Flatten gal took : 62 ms
[2025-06-02 07:06:54] [INFO ] Input system was already deterministic with 307 transitions.
RANDOM walk for 40000 steps (2245 resets) in 3187 ms. (12 steps per ms) remains 45/93 properties
BEST_FIRST walk for 4004 steps (11 resets) in 67 ms. (58 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (16 resets) in 24 ms. (160 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (58 resets) in 50 ms. (78 steps per ms) remains 44/45 properties
BEST_FIRST walk for 4003 steps (16 resets) in 70 ms. (56 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 96 ms. (41 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (56 resets) in 51 ms. (77 steps per ms) remains 43/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (152 resets) in 29 ms. (133 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (59 resets) in 26 ms. (148 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (11 resets) in 21 ms. (181 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (74 resets) in 25 ms. (153 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (14 resets) in 16 ms. (235 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (81 resets) in 68 ms. (58 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (19 resets) in 13 ms. (285 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (58 resets) in 21 ms. (182 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (51 resets) in 17 ms. (222 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (66 resets) in 19 ms. (200 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (51 resets) in 17 ms. (222 steps per ms) remains 42/43 properties
BEST_FIRST walk for 4004 steps (18 resets) in 25 ms. (154 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (57 resets) in 21 ms. (181 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (56 resets) in 34 ms. (114 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (10 resets) in 22 ms. (174 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 41/42 properties
BEST_FIRST walk for 4004 steps (9 resets) in 15 ms. (250 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4001 steps (146 resets) in 21 ms. (181 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (58 resets) in 63 ms. (62 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (154 resets) in 36 ms. (108 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (9 resets) in 18 ms. (210 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 49 ms. (80 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (55 resets) in 65 ms. (60 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (103 resets) in 38 ms. (102 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (103 resets) in 22 ms. (174 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (31 resets) in 27 ms. (143 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (114 resets) in 26 ms. (148 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (68 resets) in 23 ms. (166 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (9 resets) in 24 ms. (160 steps per ms) remains 41/41 properties
[2025-06-02 07:06:56] [INFO ] Flow matrix only has 281 transitions (discarded 26 similar events)
// Phase 1: matrix 281 rows 109 cols
[2025-06-02 07:06:56] [INFO ] Computed 4 invariants in 10 ms
[2025-06-02 07:06:56] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 41 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp75 is UNSAT
Problem AtomicPropp91 is UNSAT
At refinement iteration 1 (OVERLAPS) 50/104 variables, 4/4 constraints. Problems are: Problem set: 7 solved, 34 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:06:57] [INFO ] Deduced a trap composed of 15 places in 537 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:06:58] [INFO ] Deduced a trap composed of 22 places in 178 ms of which 25 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 2/6 constraints. Problems are: Problem set: 7 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 7 solved, 34 unsolved
At refinement iteration 4 (OVERLAPS) 278/382 variables, 104/110 constraints. Problems are: Problem set: 7 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/382 variables, 39/149 constraints. Problems are: Problem set: 7 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 0/149 constraints. Problems are: Problem set: 7 solved, 34 unsolved
At refinement iteration 7 (OVERLAPS) 6/388 variables, 4/153 constraints. Problems are: Problem set: 7 solved, 34 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 0/153 constraints. Problems are: Problem set: 7 solved, 34 unsolved
At refinement iteration 9 (OVERLAPS) 1/389 variables, 1/154 constraints. Problems are: Problem set: 7 solved, 34 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/389 variables, 0/154 constraints. Problems are: Problem set: 7 solved, 34 unsolved
At refinement iteration 11 (OVERLAPS) 1/390 variables, 1/155 constraints. Problems are: Problem set: 7 solved, 34 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 390/390 variables, and 155 constraints, problems are : Problem set: 7 solved, 34 unsolved in 5034 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 109/109 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 34 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 34 unsolved
Problem AtomicPropp10 is UNSAT
At refinement iteration 1 (OVERLAPS) 59/104 variables, 4/4 constraints. Problems are: Problem set: 8 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 2/6 constraints. Problems are: Problem set: 8 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 8 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 278/382 variables, 104/110 constraints. Problems are: Problem set: 8 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/382 variables, 39/149 constraints. Problems are: Problem set: 8 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 29/178 constraints. Problems are: Problem set: 8 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/382 variables, 0/178 constraints. Problems are: Problem set: 8 solved, 33 unsolved
At refinement iteration 8 (OVERLAPS) 6/388 variables, 4/182 constraints. Problems are: Problem set: 8 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/388 variables, 4/186 constraints. Problems are: Problem set: 8 solved, 33 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:05] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:06] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/388 variables, 2/188 constraints. Problems are: Problem set: 8 solved, 33 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 388/390 variables, and 188 constraints, problems are : Problem set: 8 solved, 33 unsolved in 5016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 108/109 constraints, ReadFeed: 39/40 constraints, PredecessorRefiner: 33/41 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10270ms problems are : Problem set: 8 solved, 33 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 43 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 307/307 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 109 transition count 303
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 108 transition count 303
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 108 transition count 302
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 107 transition count 302
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 106 transition count 304
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 11 place count 106 transition count 302
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 12 place count 106 transition count 301
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 14 place count 106 transition count 299
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 16 place count 104 transition count 299
Applied a total of 16 rules in 145 ms. Remains 104 /109 variables (removed 5) and now considering 299/307 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 145 ms. Remains : 104/109 places, 299/307 transitions.
RANDOM walk for 40000 steps (2403 resets) in 740 ms. (53 steps per ms) remains 27/33 properties
BEST_FIRST walk for 4003 steps (13 resets) in 36 ms. (108 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (16 resets) in 28 ms. (138 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (70 resets) in 35 ms. (111 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (63 resets) in 31 ms. (125 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (57 resets) in 25 ms. (154 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (10 resets) in 25 ms. (154 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4000 steps (8 resets) in 42 ms. (93 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4000 steps (8 resets) in 40 ms. (97 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (15 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (73 resets) in 21 ms. (181 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (59 resets) in 25 ms. (154 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (57 resets) in 24 ms. (160 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (62 resets) in 31 ms. (125 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (58 resets) in 23 ms. (166 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (61 resets) in 23 ms. (166 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (9 resets) in 22 ms. (174 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (213 resets) in 96 ms. (41 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (68 resets) in 39 ms. (100 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (211 resets) in 34 ms. (114 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (9 resets) in 22 ms. (173 steps per ms) remains 25/27 properties
BEST_FIRST walk for 4004 steps (150 resets) in 31 ms. (125 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (143 resets) in 26 ms. (148 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (133 resets) in 25 ms. (153 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
[2025-06-02 07:07:07] [INFO ] Flow matrix only has 275 transitions (discarded 24 similar events)
// Phase 1: matrix 275 rows 104 cols
[2025-06-02 07:07:07] [INFO ] Computed 4 invariants in 5 ms
[2025-06-02 07:07:07] [INFO ] State equation strengthened by 41 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 69/100 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 25 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:07] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:07] [INFO ] Deduced a trap composed of 22 places in 147 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 25 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:08] [INFO ] Deduced a trap composed of 22 places in 158 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 274/374 variables, 100/107 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 40/147 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (OVERLAPS) 5/379 variables, 4/151 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/379 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/379 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 11 (OVERLAPS) 0/379 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 379/379 variables, and 152 constraints, problems are : Problem set: 0 solved, 25 unsolved in 3443 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 104/104 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 69/100 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (OVERLAPS) 274/374 variables, 100/107 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 40/147 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 23/170 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (OVERLAPS) 5/379 variables, 4/174 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/379 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/379 variables, 2/177 constraints. Problems are: Problem set: 0 solved, 25 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:13] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:14] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/379 variables, 2/179 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/379 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 13 (OVERLAPS) 0/379 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 379/379 variables, and 179 constraints, problems are : Problem set: 0 solved, 25 unsolved in 8494 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 104/104 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12000ms problems are : Problem set: 0 solved, 25 unsolved
Fused 25 Parikh solutions to 24 different solutions.
Parikh walk visited 10 properties in 5721 ms.
Support contains 27 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 299/299 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 102 transition count 303
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 8 place count 102 transition count 299
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 102 transition count 297
Applied a total of 10 rules in 34 ms. Remains 102 /104 variables (removed 2) and now considering 297/299 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 102/104 places, 297/299 transitions.
RANDOM walk for 40000 steps (2415 resets) in 1259 ms. (31 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (13 resets) in 9 ms. (400 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (36 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (52 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (9 resets) in 8 ms. (444 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4003 steps (70 resets) in 8 ms. (444 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (69 resets) in 9 ms. (400 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4002 steps (81 resets) in 23 ms. (166 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (76 resets) in 11 ms. (333 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4001 steps (8 resets) in 7 ms. (500 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (65 resets) in 9 ms. (400 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (147 resets) in 11 ms. (333 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4002 steps (145 resets) in 12 ms. (307 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4002 steps (128 resets) in 9 ms. (400 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (9 resets) in 9 ms. (400 steps per ms) remains 14/14 properties
Finished probabilistic random walk after 363046 steps, run visited all 14 properties in 1710 ms. (steps per millisecond=212 )
Probabilistic random walk after 363046 steps, saw 81352 distinct states, run finished after 1717 ms. (steps per millisecond=211 ) properties seen :14
Successfully simplified 8 atomic propositions for a total of 16 simplifications.
[2025-06-02 07:07:27] [INFO ] Flatten gal took : 27 ms
[2025-06-02 07:07:27] [INFO ] Flatten gal took : 27 ms
[2025-06-02 07:07:27] [INFO ] Input system was already deterministic with 307 transitions.
Computed a total of 5 stabilizing places and 11 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 307/307 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 107 transition count 303
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 107 transition count 303
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 107 transition count 301
Applied a total of 6 rules in 9 ms. Remains 107 /109 variables (removed 2) and now considering 301/307 (removed 6) transitions.
[2025-06-02 07:07:27] [INFO ] Flow matrix only has 275 transitions (discarded 26 similar events)
// Phase 1: matrix 275 rows 107 cols
[2025-06-02 07:07:27] [INFO ] Computed 4 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:07:27] [INFO ] Implicit Places using invariants in 142 ms returned []
[2025-06-02 07:07:27] [INFO ] Flow matrix only has 275 transitions (discarded 26 similar events)
[2025-06-02 07:07:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:07:27] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 07:07:27] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 503 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2025-06-02 07:07:27] [INFO ] Flow matrix only has 275 transitions (discarded 26 similar events)
[2025-06-02 07:07:27] [INFO ] Invariant cache hit.
[2025-06-02 07:07:27] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:32] [INFO ] Deduced a trap composed of 37 places in 188 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:32] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:33] [INFO ] Deduced a trap composed of 22 places in 148 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 274/381 variables, 107/114 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 39/153 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:41] [INFO ] Deduced a trap composed of 22 places in 162 ms of which 22 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (OVERLAPS) 1/382 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 382/382 variables, and 155 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 274/381 variables, 107/115 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 39/154 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 300/454 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:08:09] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:08:13] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 2/456 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:08:24] [INFO ] Deduced a trap along path composed of 2 places in 38 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:08:24] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 381/382 variables, and 458 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 107/107 constraints, ReadFeed: 39/40 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60376ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 60382ms
Starting structural reductions in LTL mode, iteration 1 : 107/109 places, 301/307 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60898 ms. Remains : 107/109 places, 301/307 transitions.
[2025-06-02 07:08:28] [INFO ] Flatten gal took : 27 ms
[2025-06-02 07:08:28] [INFO ] Flatten gal took : 24 ms
[2025-06-02 07:08:28] [INFO ] Input system was already deterministic with 301 transitions.
[2025-06-02 07:08:28] [INFO ] Flatten gal took : 22 ms
[2025-06-02 07:08:28] [INFO ] Flatten gal took : 21 ms
[2025-06-02 07:08:28] [INFO ] Time to serialize gal into /tmp/CTLFireability11008318108370205890.gal : 13 ms
[2025-06-02 07:08:28] [INFO ] Time to serialize properties into /tmp/CTLFireability7937911054637021251.ctl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11008318108370205890.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7937911054637021251.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.41793e+06,2.02264,44932,2,2939,5,120247,6,0,728,108922,0


Converting to forward existential form...Done !
original formula: AG((E((((p8==1)&&(((p8==1)&&(p32==1))||((p8==1)&&(p56==1))))&&((p85==1)&&(!((p7==1)&&(p98==1))))) U EF(!((((p8==1)&&(p30==1))||(p94==1)))...318
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E((((p8==1)&&(((p8==1)&&(p32==1))||((p8==1)&&(p56==1))))&&((p85==1)&&(!((p7==1)&&(p98==1)...435
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t5, t7, t11, t12, t14, t15, t17, t19, t23, t24, t26, t27, t29, t31, t35, t36, t38...622
(forward)formula 0,1,4.35925,82416,1,0,537,333371,634,282,6217,305634,627
FORMULA FireWire-PT-05-CTLFireability-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 307/307 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 107 transition count 303
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 107 transition count 303
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 107 transition count 301
Applied a total of 6 rules in 12 ms. Remains 107 /109 variables (removed 2) and now considering 301/307 (removed 6) transitions.
[2025-06-02 07:08:32] [INFO ] Flow matrix only has 275 transitions (discarded 26 similar events)
[2025-06-02 07:08:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:08:33] [INFO ] Implicit Places using invariants in 101 ms returned []
[2025-06-02 07:08:33] [INFO ] Flow matrix only has 275 transitions (discarded 26 similar events)
[2025-06-02 07:08:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:08:33] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 07:08:33] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 484 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2025-06-02 07:08:33] [INFO ] Flow matrix only has 275 transitions (discarded 26 similar events)
[2025-06-02 07:08:33] [INFO ] Invariant cache hit.
[2025-06-02 07:08:33] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:08:38] [INFO ] Deduced a trap composed of 37 places in 180 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:08:38] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:08:38] [INFO ] Deduced a trap composed of 22 places in 155 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 274/381 variables, 107/114 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 39/153 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:08:46] [INFO ] Deduced a trap composed of 22 places in 209 ms of which 23 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (OVERLAPS) 1/382 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 382/382 variables, and 155 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 274/381 variables, 107/115 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 39/154 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 300/454 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:09:14] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:09:18] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 2/456 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:09:31] [INFO ] Deduced a trap along path composed of 2 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:09:31] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 381/382 variables, and 458 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 107/107 constraints, ReadFeed: 39/40 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60229ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 60233ms
Starting structural reductions in LTL mode, iteration 1 : 107/109 places, 301/307 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60731 ms. Remains : 107/109 places, 301/307 transitions.
[2025-06-02 07:09:33] [INFO ] Flatten gal took : 24 ms
[2025-06-02 07:09:33] [INFO ] Flatten gal took : 25 ms
[2025-06-02 07:09:33] [INFO ] Input system was already deterministic with 301 transitions.
[2025-06-02 07:09:33] [INFO ] Flatten gal took : 23 ms
[2025-06-02 07:09:33] [INFO ] Flatten gal took : 22 ms
[2025-06-02 07:09:33] [INFO ] Time to serialize gal into /tmp/CTLFireability13564590542038030377.gal : 12 ms
[2025-06-02 07:09:33] [INFO ] Time to serialize properties into /tmp/CTLFireability14055746998216020755.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13564590542038030377.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14055746998216020755.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.41793e+06,1.94351,44952,2,2939,5,120247,6,0,728,108922,0


Converting to forward existential form...Done !
original formula: (EX(EG(((((p3==0)||(p17==0))&&((p9==0)||(p17==0)))&&(p53==0)))) * !(E(AG(!(AG((p8==1)))) U EX(((!((p67==1)&&(p84==1)))&&((p10==1)||((p8==...174
=> equivalent forward existential formula: ([(Init * !(EX(EG(((((p3==0)||(p17==0))&&((p9==0)||(p17==0)))&&(p53==0))))))] = FALSE * [(EY(FwdU(Init,!(E(TRUE ...262
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t5, t7, t11, t12, t14, t15, t17, t19, t23, t24, t26, t27, t29, t31, t35, t36, t38...622
(forward)formula 0,0,6.02719,112424,1,0,531,412417,623,276,6298,384473,617
FORMULA FireWire-PT-05-CTLFireability-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 307/307 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 107 transition count 303
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 107 transition count 303
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 107 transition count 301
Applied a total of 6 rules in 8 ms. Remains 107 /109 variables (removed 2) and now considering 301/307 (removed 6) transitions.
[2025-06-02 07:09:39] [INFO ] Flow matrix only has 275 transitions (discarded 26 similar events)
[2025-06-02 07:09:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:09:40] [INFO ] Implicit Places using invariants in 110 ms returned []
[2025-06-02 07:09:40] [INFO ] Flow matrix only has 275 transitions (discarded 26 similar events)
[2025-06-02 07:09:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:09:40] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 07:09:40] [INFO ] Implicit Places using invariants and state equation in 540 ms returned []
Implicit Place search using SMT with State Equation took 668 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2025-06-02 07:09:40] [INFO ] Flow matrix only has 275 transitions (discarded 26 similar events)
[2025-06-02 07:09:40] [INFO ] Invariant cache hit.
[2025-06-02 07:09:40] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:09:45] [INFO ] Deduced a trap composed of 37 places in 176 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:09:45] [INFO ] Deduced a trap composed of 15 places in 161 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:09:45] [INFO ] Deduced a trap composed of 22 places in 173 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 274/381 variables, 107/114 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 39/153 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:09:54] [INFO ] Deduced a trap composed of 22 places in 175 ms of which 22 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (OVERLAPS) 1/382 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 382/382 variables, and 155 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 274/381 variables, 107/115 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 39/154 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 300/454 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:10:21] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:10:25] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 2/456 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:10:36] [INFO ] Deduced a trap along path composed of 2 places in 38 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:10:36] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 381/382 variables, and 458 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 107/107 constraints, ReadFeed: 39/40 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60214ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 60216ms
Starting structural reductions in LTL mode, iteration 1 : 107/109 places, 301/307 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60894 ms. Remains : 107/109 places, 301/307 transitions.
[2025-06-02 07:10:40] [INFO ] Flatten gal took : 13 ms
[2025-06-02 07:10:40] [INFO ] Flatten gal took : 16 ms
[2025-06-02 07:10:40] [INFO ] Input system was already deterministic with 301 transitions.
[2025-06-02 07:10:40] [INFO ] Flatten gal took : 13 ms
[2025-06-02 07:10:40] [INFO ] Flatten gal took : 12 ms
[2025-06-02 07:10:40] [INFO ] Time to serialize gal into /tmp/CTLFireability2454929289067617251.gal : 5 ms
[2025-06-02 07:10:40] [INFO ] Time to serialize properties into /tmp/CTLFireability211064679714515962.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2454929289067617251.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability211064679714515962.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.41793e+06,2.08084,44620,2,2939,5,120247,6,0,728,108922,0


Converting to forward existential form...Done !
original formula: E(AX(!(((p8==1)&&(p32==1)))) U ((p7==1)&&(p96==1)))
=> equivalent forward existential formula: [(FwdU(Init,!(EX(!(!(((p8==1)&&(p32==1))))))) * ((p7==1)&&(p96==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t5, t7, t11, t12, t14, t15, t17, t19, t23, t24, t26, t27, t29, t31, t35, t36, t38...622
Detected timeout of ITS tools.
[2025-06-02 07:11:11] [INFO ] Flatten gal took : 13 ms
[2025-06-02 07:11:11] [INFO ] Applying decomposition
[2025-06-02 07:11:11] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17258369386465345293.txt' '-o' '/tmp/graph17258369386465345293.bin' '-w' '/tmp/graph17258369386465345293.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17258369386465345293.bin' '-l' '-1' '-v' '-w' '/tmp/graph17258369386465345293.weights' '-q' '0' '-e' '0.001'
[2025-06-02 07:11:11] [INFO ] Decomposing Gal with order
[2025-06-02 07:11:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 07:11:11] [INFO ] Removed a total of 470 redundant transitions.
[2025-06-02 07:11:11] [INFO ] Flatten gal took : 133 ms
[2025-06-02 07:11:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 85 labels/synchronizations in 31 ms.
[2025-06-02 07:11:11] [INFO ] Time to serialize gal into /tmp/CTLFireability9898850187288602005.gal : 10 ms
[2025-06-02 07:11:11] [INFO ] Time to serialize properties into /tmp/CTLFireability2365668019088234056.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9898850187288602005.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2365668019088234056.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.41793e+06,16.3716,256680,1757,196,424625,2000,560,827161,84,15032,0


Converting to forward existential form...Done !
original formula: E(AX(!(((i6.i0.u2.p8==1)&&(i2.u12.p32==1)))) U ((i6.i0.u2.p7==1)&&(i6.i1.u30.p96==1)))
=> equivalent forward existential formula: [(FwdU(Init,!(EX(!(!(((i6.i0.u2.p8==1)&&(i2.u12.p32==1))))))) * ((i6.i0.u2.p7==1)&&(i6.i1.u30.p96==1)))] != FALS...156
Reverse transition relation is NOT exact ! Due to transitions t1, t39, t41, t42, t45, t46, t48, t59, t60, t61, t62, t65, t108, t110, t126, t131, t136, t141...732
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 307/307 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 108 transition count 305
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 108 transition count 305
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 108 transition count 304
Applied a total of 3 rules in 7 ms. Remains 108 /109 variables (removed 1) and now considering 304/307 (removed 3) transitions.
[2025-06-02 07:11:41] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
// Phase 1: matrix 278 rows 108 cols
[2025-06-02 07:11:41] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:11:41] [INFO ] Implicit Places using invariants in 199 ms returned []
[2025-06-02 07:11:41] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2025-06-02 07:11:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:11:41] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 07:11:42] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
Running 303 sub problems to find dead transitions.
[2025-06-02 07:11:42] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2025-06-02 07:11:42] [INFO ] Invariant cache hit.
[2025-06-02 07:11:42] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 303 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:11:46] [INFO ] Deduced a trap composed of 37 places in 196 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:11:46] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:11:47] [INFO ] Deduced a trap composed of 22 places in 178 ms of which 20 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 4 (OVERLAPS) 277/385 variables, 108/115 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/385 variables, 39/154 constraints. Problems are: Problem set: 0 solved, 303 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:11:55] [INFO ] Deduced a trap composed of 22 places in 186 ms of which 24 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 8 (OVERLAPS) 1/386 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/386 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 303 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 386/386 variables, and 156 constraints, problems are : Problem set: 0 solved, 303 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 108/108 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 303 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 4 (OVERLAPS) 277/385 variables, 108/116 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/385 variables, 39/155 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 303/458 constraints. Problems are: Problem set: 0 solved, 303 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:12:23] [INFO ] Deduced a trap composed of 35 places in 94 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:12:24] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:12:27] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 3/461 constraints. Problems are: Problem set: 0 solved, 303 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 385/386 variables, and 461 constraints, problems are : Problem set: 0 solved, 303 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 108/108 constraints, ReadFeed: 39/40 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60146ms problems are : Problem set: 0 solved, 303 unsolved
Search for dead transitions found 0 dead transitions in 60147ms
Starting structural reductions in LTL mode, iteration 1 : 108/109 places, 304/307 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60611 ms. Remains : 108/109 places, 304/307 transitions.
[2025-06-02 07:12:42] [INFO ] Flatten gal took : 20 ms
[2025-06-02 07:12:42] [INFO ] Flatten gal took : 38 ms
[2025-06-02 07:12:42] [INFO ] Input system was already deterministic with 304 transitions.
[2025-06-02 07:12:42] [INFO ] Flatten gal took : 19 ms
[2025-06-02 07:12:42] [INFO ] Flatten gal took : 18 ms
[2025-06-02 07:12:42] [INFO ] Time to serialize gal into /tmp/CTLFireability5992135164656795505.gal : 4 ms
[2025-06-02 07:12:42] [INFO ] Time to serialize properties into /tmp/CTLFireability15837257195026760104.ctl : 12 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5992135164656795505.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15837257195026760104.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.45773e+06,1.68138,42244,2,2908,5,99579,6,0,735,101830,0


Converting to forward existential form...Done !
original formula: !(E(((AF(((((p11==1)&&(p112==1))||((p11==1)&&(p41==1)))||(((p10==1)&&(p18==1))&&((p9==1)&&(p110==1))))) + ((p5==1)&&(p41==1))) * EF(AX(EF...205
=> equivalent forward existential formula: [(FwdU(Init,((!(EG(!(((((p11==1)&&(p112==1))||((p11==1)&&(p41==1)))||(((p10==1)&&(p18==1))&&((p9==1)&&(p110==1))...271
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t5, t7, t11, t12, t14, t15, t17, t19, t23, t24, t26, t27, t29, t31, t35, t36, t38...628
Detected timeout of ITS tools.
[2025-06-02 07:13:12] [INFO ] Flatten gal took : 27 ms
[2025-06-02 07:13:12] [INFO ] Applying decomposition
[2025-06-02 07:13:12] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph10801710547858942837.txt' '-o' '/tmp/graph10801710547858942837.bin' '-w' '/tmp/graph10801710547858942837.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10801710547858942837.bin' '-l' '-1' '-v' '-w' '/tmp/graph10801710547858942837.weights' '-q' '0' '-e' '0.001'
[2025-06-02 07:13:12] [INFO ] Decomposing Gal with order
[2025-06-02 07:13:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 07:13:12] [INFO ] Removed a total of 487 redundant transitions.
[2025-06-02 07:13:12] [INFO ] Flatten gal took : 31 ms
[2025-06-02 07:13:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 86 labels/synchronizations in 11 ms.
[2025-06-02 07:13:12] [INFO ] Time to serialize gal into /tmp/CTLFireability622001505492605836.gal : 3 ms
[2025-06-02 07:13:12] [INFO ] Time to serialize properties into /tmp/CTLFireability14876232551837741197.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability622001505492605836.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14876232551837741197.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 109/109 places, 307/307 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 109 transition count 306
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 108 transition count 306
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 108 transition count 305
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 107 transition count 305
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 6 place count 105 transition count 301
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 105 transition count 301
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 105 transition count 299
Applied a total of 10 rules in 29 ms. Remains 105 /109 variables (removed 4) and now considering 299/307 (removed 8) transitions.
[2025-06-02 07:13:42] [INFO ] Flow matrix only has 273 transitions (discarded 26 similar events)
// Phase 1: matrix 273 rows 105 cols
[2025-06-02 07:13:42] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:13:42] [INFO ] Implicit Places using invariants in 100 ms returned []
[2025-06-02 07:13:42] [INFO ] Flow matrix only has 273 transitions (discarded 26 similar events)
[2025-06-02 07:13:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:13:42] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 07:13:43] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 07:13:43] [INFO ] Redundant transitions in 40 ms returned []
Running 298 sub problems to find dead transitions.
[2025-06-02 07:13:43] [INFO ] Flow matrix only has 273 transitions (discarded 26 similar events)
[2025-06-02 07:13:43] [INFO ] Invariant cache hit.
[2025-06-02 07:13:43] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:13:47] [INFO ] Deduced a trap composed of 37 places in 192 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:13:47] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:13:48] [INFO ] Deduced a trap composed of 22 places in 176 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:13:48] [INFO ] Deduced a trap composed of 22 places in 145 ms of which 22 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 4 (OVERLAPS) 272/377 variables, 105/113 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/377 variables, 39/152 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/377 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 7 (OVERLAPS) 1/378 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 378/378 variables, and 153 constraints, problems are : Problem set: 0 solved, 298 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 105/105 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 298 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 4 (OVERLAPS) 272/377 variables, 105/113 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/377 variables, 39/152 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/377 variables, 298/450 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:14:23] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:14:28] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/377 variables, 2/452 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:14:39] [INFO ] Deduced a trap along path composed of 2 places in 35 ms of which 2 ms to minimize.
(t173 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((t0 1)
(t1 1)
(t2 1)
(t3 4)
(t4 1)
(t5 1)
(t6 1)
(t7 0)
(t8 1)
(t9 1)
(t10 1)
(t11 17)
(t12 0)
(t13 1)
(t14 1)
(t15 1)
(t16 0)
(t17 0)
(t18 0)
(t19 0)
(t20 0)
(t21 0)
(t22 0)
(t23 3)
(t24 0)
(t25 3)
(t26 0)
(t27 0)
(t28 1)
(t29 0)
(t30 10)
(t31 1)
(t32 0)
(t33 1)
(t34 0)
(t35 1)
(t36 38)
(t37 0)
(t38 1)
(t39 68)
(t40 2)
(t41 2)
(t42 25)
(t44 25)
(t45 0)
(t46 25)
(t47 14)
(t48 0)
(t49 0)
(t50 1)
(t51 0)
(t52 1)
(t53 0)
(t54 0)
(t55 0)
(t56 0)
(t57 0)
(t58 0)
(t59 14)
(t60 0)
(t61 0)
(t62 0)
(t63 14)
(t64 0)
(t65 0)
(t66 14)
(t67 13)
(t68 1)
(t69 0)
(t70 14)
(t71 13)
(t72 1)
(t73 0)
(t74 14)
(t75 1)
(t76 0)
(t77 15)
(t78 1)
(t79 0)
(t80 1)
(t81 16)
(t82 0)
(t83 18)
(t84 0)
(t85 0)
(t86 0)
(t87 1)
(t88 19)
(t89 0)
(t90 1)
(t91 20)
(t92 1)
(t93 0)
(t94 0)
(t95 0)
(t96 0)
(t97 0)
(t98 1)
(t99 0)
(t100 0)
(t101 1)
(t102 1)
(t103 0)
(t104 5)
(t105 0)
(t106 0)
(t107 0)
(t108 0)
(t109 0)
(t110 1)
(t111 0)
(t112 0)
(t113 0)
(t114 1)
(t115 0)
(t116 1)
(t117 0)
(t118 1)
(t119 0)
(t120 0)
(t121 0)
(t122 1)
(t123 0)
(t124 1)
(t125 0)
(t126 1)
(t127 0)
(t128 1)
(t129 0)
(t130 0)
(t131 0)
(t132 1)
(t133 0)
(t134 0)
(t135 1)
(t136 0)
(t137 1)
(t138 1)
(t139 0)
(t140 0)
(t141 1)
(t142 0)
(t143 1)
(t144 0)
(t145 2)
(t146 1)
(t147 0)
(t148 0)
(t149 10)
(t150 1)
(t151 0)
(t152 11)
(t153 0)
(t154 0)
(t155 11)
(t156 0)
(t157 1)
(t158 52)
(t159 0)
(t160 50)
(t161 1)
(t162 0)
(t163 41)
(t164 0)
(t165 2)
(t166 1)
(t167 0)
(t168 2)
(t169 1)
(t170 0)
(t171 2)
(t172 1)
(t173 0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 377/378 variables, and 453 constraints, problems are : Problem set: 0 solved, 298 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 105/105 constraints, ReadFeed: 39/40 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60154ms problems are : Problem set: 0 solved, 298 unsolved
Search for dead transitions found 0 dead transitions in 60157ms
Starting structural reductions in SI_CTL mode, iteration 1 : 105/109 places, 299/307 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60629 ms. Remains : 105/109 places, 299/307 transitions.
[2025-06-02 07:14:43] [INFO ] Flatten gal took : 18 ms
[2025-06-02 07:14:43] [INFO ] Flatten gal took : 27 ms
[2025-06-02 07:14:43] [INFO ] Input system was already deterministic with 299 transitions.
[2025-06-02 07:14:43] [INFO ] Flatten gal took : 16 ms
[2025-06-02 07:14:43] [INFO ] Flatten gal took : 16 ms
[2025-06-02 07:14:43] [INFO ] Time to serialize gal into /tmp/CTLFireability14554723675086040553.gal : 5 ms
[2025-06-02 07:14:43] [INFO ] Time to serialize properties into /tmp/CTLFireability5398040453414699150.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14554723675086040553.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5398040453414699150.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.07266e+06,2.30547,46452,2,3078,5,126952,6,0,718,116207,0


Converting to forward existential form...Done !
original formula: A(AF((A(((!((p11==1)&&(p112==1)))&&(((p8==1)&&(p56==1))||((p3==1)&&(p21==1)))) U E(((p8==1)&&(p33==1)) U ((p3==1)&&(p78==1)))) * (p6!=1))...319
=> equivalent forward existential formula: [((Init * !(EG(!(E(!(((p8==1)&&(p95==1))) U (E(TRUE U (!(E(TRUE U !((p10==1)))) * !((E(!(((p8==1)&&(p97==1))) U ...1311
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t5, t7, t11, t12, t14, t15, t17, t19, t23, t24, t26, t27, t29, t31, t35, t36, t38...622
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,26.0627,560736,1,0,850,3.07184e+06,658,479,6317,2.6916e+06,962
FORMULA FireWire-PT-05-CTLFireability-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 307/307 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 107 transition count 303
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 107 transition count 303
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 107 transition count 301
Applied a total of 6 rules in 5 ms. Remains 107 /109 variables (removed 2) and now considering 301/307 (removed 6) transitions.
[2025-06-02 07:15:09] [INFO ] Flow matrix only has 275 transitions (discarded 26 similar events)
// Phase 1: matrix 275 rows 107 cols
[2025-06-02 07:15:09] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:15:09] [INFO ] Implicit Places using invariants in 88 ms returned []
[2025-06-02 07:15:09] [INFO ] Flow matrix only has 275 transitions (discarded 26 similar events)
[2025-06-02 07:15:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:15:09] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 07:15:10] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2025-06-02 07:15:10] [INFO ] Flow matrix only has 275 transitions (discarded 26 similar events)
[2025-06-02 07:15:10] [INFO ] Invariant cache hit.
[2025-06-02 07:15:10] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:15:14] [INFO ] Deduced a trap composed of 37 places in 181 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:15:14] [INFO ] Deduced a trap composed of 15 places in 170 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:15:15] [INFO ] Deduced a trap composed of 22 places in 168 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 274/381 variables, 107/114 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 39/153 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:15:22] [INFO ] Deduced a trap composed of 22 places in 167 ms of which 23 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (OVERLAPS) 1/382 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 1.0)
(t1 0.0)
(t2 (/ 3.0 4.0))
(t3 0.0)
(t4 (/ 3.0 4.0))
(t5 0.0)
(t6 0.0)
(t7 0.0)
(t8 0.0)
(t9 0.0)
(t10 0.0)
(t11 0.0)
(t12 0.0)
(t13 0.0)
(t14 0.0)
(t15 0.0)
(t16 (/ 7.0 2.0))
(t17 0.0)
(t18 0.0)
(t19 0.0)
(t20 0.0)
(t21 0.0)
(t22 0.0)
(t23 0.0)
(t24 0.0)
(t25 2.0)
(t26 0.0)
(t27 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 382/382 variables, and 155 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 274/381 variables, 107/115 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 39/154 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 300/454 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:15:50] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:15:54] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 2/456 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:16:07] [INFO ] Deduced a trap along path composed of 2 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:16:08] [INFO ] Deduced a trap along path composed of 2 places in 32 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 381/382 variables, and 458 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 107/107 constraints, ReadFeed: 39/40 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60160ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 60163ms
Starting structural reductions in LTL mode, iteration 1 : 107/109 places, 301/307 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60549 ms. Remains : 107/109 places, 301/307 transitions.
[2025-06-02 07:16:10] [INFO ] Flatten gal took : 12 ms
[2025-06-02 07:16:10] [INFO ] Flatten gal took : 14 ms
[2025-06-02 07:16:10] [INFO ] Input system was already deterministic with 301 transitions.
[2025-06-02 07:16:10] [INFO ] Flatten gal took : 13 ms
[2025-06-02 07:16:10] [INFO ] Flatten gal took : 12 ms
[2025-06-02 07:16:10] [INFO ] Time to serialize gal into /tmp/CTLFireability3117483081652194315.gal : 3 ms
[2025-06-02 07:16:10] [INFO ] Time to serialize properties into /tmp/CTLFireability32798001558910029.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3117483081652194315.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability32798001558910029.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...281
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.41793e+06,1.96358,44848,2,2939,5,120247,6,0,728,108922,0


Converting to forward existential form...Done !
original formula: EX((AG(EF(EG(((p7==0)||(p89==0))))) + (((p10==0)&&(p68==1))&&(p91==1))))
=> equivalent forward existential formula: ([(EY(Init) * !(E(TRUE U !(E(TRUE U EG(((p7==0)||(p89==0))))))))] != FALSE + [(EY(Init) * (((p10==0)&&(p68==1))&...177
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t5, t7, t11, t12, t14, t15, t17, t19, t23, t24, t26, t27, t29, t31, t35, t36, t38...622
(forward)formula 0,1,24.4589,469380,1,0,671,2.49471e+06,626,351,6233,2.23318e+06,781
FORMULA FireWire-PT-05-CTLFireability-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 307/307 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 108 transition count 305
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 108 transition count 305
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 108 transition count 304
Applied a total of 3 rules in 7 ms. Remains 108 /109 variables (removed 1) and now considering 304/307 (removed 3) transitions.
[2025-06-02 07:16:35] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
// Phase 1: matrix 278 rows 108 cols
[2025-06-02 07:16:35] [INFO ] Computed 4 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:16:35] [INFO ] Implicit Places using invariants in 232 ms returned []
[2025-06-02 07:16:35] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2025-06-02 07:16:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:16:35] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 07:16:35] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 680 ms to find 0 implicit places.
Running 303 sub problems to find dead transitions.
[2025-06-02 07:16:35] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2025-06-02 07:16:35] [INFO ] Invariant cache hit.
[2025-06-02 07:16:35] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 303 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:16:40] [INFO ] Deduced a trap composed of 37 places in 186 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:16:40] [INFO ] Deduced a trap composed of 15 places in 161 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:16:40] [INFO ] Deduced a trap composed of 22 places in 173 ms of which 23 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 4 (OVERLAPS) 277/385 variables, 108/115 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/385 variables, 39/154 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 7 (OVERLAPS) 1/386 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 303 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 386/386 variables, and 155 constraints, problems are : Problem set: 0 solved, 303 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 108/108 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 303 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 4 (OVERLAPS) 277/385 variables, 108/115 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/385 variables, 39/154 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 303/457 constraints. Problems are: Problem set: 0 solved, 303 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:17:15] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:17:15] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:17:17] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 3/460 constraints. Problems are: Problem set: 0 solved, 303 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:17:30] [INFO ] Deduced a trap along path composed of 2 places in 36 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 385/386 variables, and 461 constraints, problems are : Problem set: 0 solved, 303 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 108/108 constraints, ReadFeed: 39/40 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60191ms problems are : Problem set: 0 solved, 303 unsolved
Search for dead transitions found 0 dead transitions in 60193ms
Starting structural reductions in LTL mode, iteration 1 : 108/109 places, 304/307 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60881 ms. Remains : 108/109 places, 304/307 transitions.
[2025-06-02 07:17:36] [INFO ] Flatten gal took : 13 ms
[2025-06-02 07:17:36] [INFO ] Flatten gal took : 14 ms
[2025-06-02 07:17:36] [INFO ] Input system was already deterministic with 304 transitions.
[2025-06-02 07:17:36] [INFO ] Flatten gal took : 14 ms
[2025-06-02 07:17:36] [INFO ] Flatten gal took : 15 ms
[2025-06-02 07:17:36] [INFO ] Time to serialize gal into /tmp/CTLFireability1287795294266562601.gal : 4 ms
[2025-06-02 07:17:36] [INFO ] Time to serialize properties into /tmp/CTLFireability13118171002959439274.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1287795294266562601.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13118171002959439274.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.42779e+06,4.5557,91560,2,3215,5,240136,6,0,735,235030,0


Converting to forward existential form...Done !
original formula: EF((((AX(EX(((p8==0)||(p58==0)))) * AF(EX(((p12==1)&&(p88==1))))) * ((p8==1)&&(p54==1))) * ((AF((p88==1)) * AF(((p3==1)&&(p47==1)))) + (A...235
=> equivalent forward existential formula: ([(((FwdU(Init,TRUE) * ((!(EX(!(EX(((p8==0)||(p58==0)))))) * !(EG(!(EX(((p12==1)&&(p88==1))))))) * ((p8==1)&&(p5...454
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t5, t7, t11, t12, t14, t15, t17, t19, t23, t24, t26, t27, t29, t31, t35, t36, t38...627
Detected timeout of ITS tools.
[2025-06-02 07:18:06] [INFO ] Flatten gal took : 22 ms
[2025-06-02 07:18:06] [INFO ] Applying decomposition
[2025-06-02 07:18:06] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph10802024031533318583.txt' '-o' '/tmp/graph10802024031533318583.bin' '-w' '/tmp/graph10802024031533318583.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10802024031533318583.bin' '-l' '-1' '-v' '-w' '/tmp/graph10802024031533318583.weights' '-q' '0' '-e' '0.001'
[2025-06-02 07:18:06] [INFO ] Decomposing Gal with order
[2025-06-02 07:18:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 07:18:06] [INFO ] Removed a total of 472 redundant transitions.
[2025-06-02 07:18:06] [INFO ] Flatten gal took : 37 ms
[2025-06-02 07:18:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 95 labels/synchronizations in 21 ms.
[2025-06-02 07:18:06] [INFO ] Time to serialize gal into /tmp/CTLFireability17542454696750409013.gal : 4 ms
[2025-06-02 07:18:06] [INFO ] Time to serialize properties into /tmp/CTLFireability6374114234909090927.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17542454696750409013.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6374114234909090927.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.42779e+06,12.423,245332,2366,158,360672,1336,602,1.15335e+06,88,8599,0


Converting to forward existential form...Done !
original formula: EF((((AX(EX(((i5.u2.p8==0)||(i5.u21.p58==0)))) * AF(EX(((i0.u3.p12==1)&&(i6.i1.u24.p88==1))))) * ((i5.u2.p8==1)&&(i5.u18.p54==1))) * ((AF...352
=> equivalent forward existential formula: ([(((FwdU(Init,TRUE) * ((!(EX(!(EX(((i5.u2.p8==0)||(i5.u21.p58==0)))))) * !(EG(!(EX(((i0.u3.p12==1)&&(i6.i1.u24....613
Reverse transition relation is NOT exact ! Due to transitions t39, t41, t42, t45, t46, t48, t55, t59, t60, t61, t62, t110, t112, t128, t133, t138, t143, t1...744
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
(forward)formula 0,0,24.7526,348244,1,0,521398,4111,3125,1.41554e+06,371,23335,1456677
FORMULA FireWire-PT-05-CTLFireability-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 109/109 places, 307/307 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 109 transition count 306
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 108 transition count 306
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 108 transition count 305
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 107 transition count 305
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 106 transition count 303
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 106 transition count 303
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 106 transition count 302
Applied a total of 7 rules in 34 ms. Remains 106 /109 variables (removed 3) and now considering 302/307 (removed 5) transitions.
[2025-06-02 07:18:31] [INFO ] Flow matrix only has 276 transitions (discarded 26 similar events)
// Phase 1: matrix 276 rows 106 cols
[2025-06-02 07:18:31] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:18:31] [INFO ] Implicit Places using invariants in 106 ms returned []
[2025-06-02 07:18:31] [INFO ] Flow matrix only has 276 transitions (discarded 26 similar events)
[2025-06-02 07:18:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:18:31] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 07:18:31] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 07:18:31] [INFO ] Redundant transitions in 9 ms returned []
Running 301 sub problems to find dead transitions.
[2025-06-02 07:18:31] [INFO ] Flow matrix only has 276 transitions (discarded 26 similar events)
[2025-06-02 07:18:31] [INFO ] Invariant cache hit.
[2025-06-02 07:18:31] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:18:36] [INFO ] Deduced a trap composed of 37 places in 153 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:18:36] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:18:36] [INFO ] Deduced a trap composed of 22 places in 171 ms of which 21 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:18:39] [INFO ] Deduced a trap composed of 22 places in 171 ms of which 24 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (OVERLAPS) 275/381 variables, 106/114 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 39/153 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 8 (OVERLAPS) 1/382 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/382 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 382/382 variables, and 154 constraints, problems are : Problem set: 0 solved, 301 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 106/106 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 301 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 4 (OVERLAPS) 275/381 variables, 106/114 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 39/153 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 301/454 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:19:25] [INFO ] Deduced a trap along path composed of 2 places in 41 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:19:25] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 381/382 variables, and 456 constraints, problems are : Problem set: 0 solved, 301 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 106/106 constraints, ReadFeed: 39/40 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60198ms problems are : Problem set: 0 solved, 301 unsolved
Search for dead transitions found 0 dead transitions in 60200ms
Starting structural reductions in SI_CTL mode, iteration 1 : 106/109 places, 302/307 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60636 ms. Remains : 106/109 places, 302/307 transitions.
[2025-06-02 07:19:31] [INFO ] Flatten gal took : 14 ms
[2025-06-02 07:19:31] [INFO ] Flatten gal took : 15 ms
[2025-06-02 07:19:31] [INFO ] Input system was already deterministic with 302 transitions.
[2025-06-02 07:19:31] [INFO ] Flatten gal took : 14 ms
[2025-06-02 07:19:32] [INFO ] Flatten gal took : 14 ms
[2025-06-02 07:19:32] [INFO ] Time to serialize gal into /tmp/CTLFireability13328724302041547664.gal : 4 ms
[2025-06-02 07:19:32] [INFO ] Time to serialize properties into /tmp/CTLFireability2181475577790315321.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13328724302041547664.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2181475577790315321.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.10272e+06,6.39013,122800,2,6690,5,322703,6,0,725,425609,0


Converting to forward existential form...Done !
original formula: (EF(((((E(((p7==1)&&(p29==1)) U (p27==1)) + ((p4==1)&&(p48==1))) + ((p8==1)&&(p63==1))) * ((p8!=1)||(p96!=1))) * ((p11==1)&&(p41==1)))) +...180
=> equivalent forward existential formula: [FwdG((Init * !(E(TRUE U ((((E(((p7==1)&&(p29==1)) U (p27==1)) + ((p4==1)&&(p48==1))) + ((p8==1)&&(p63==1))) * (...234
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t5, t7, t11, t12, t14, t15, t17, t19, t23, t24, t26, t27, t29, t31, t35, t36, t38...628
Detected timeout of ITS tools.
[2025-06-02 07:20:02] [INFO ] Flatten gal took : 14 ms
[2025-06-02 07:20:02] [INFO ] Applying decomposition
[2025-06-02 07:20:02] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph18251041954604710959.txt' '-o' '/tmp/graph18251041954604710959.bin' '-w' '/tmp/graph18251041954604710959.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18251041954604710959.bin' '-l' '-1' '-v' '-w' '/tmp/graph18251041954604710959.weights' '-q' '0' '-e' '0.001'
[2025-06-02 07:20:02] [INFO ] Decomposing Gal with order
[2025-06-02 07:20:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 07:20:02] [INFO ] Removed a total of 457 redundant transitions.
[2025-06-02 07:20:02] [INFO ] Flatten gal took : 28 ms
[2025-06-02 07:20:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 99 labels/synchronizations in 11 ms.
[2025-06-02 07:20:02] [INFO ] Time to serialize gal into /tmp/CTLFireability4750806228184077278.gal : 4 ms
[2025-06-02 07:20:02] [INFO ] Time to serialize properties into /tmp/CTLFireability18156441699576808028.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4750806228184077278.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18156441699576808028.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 307/307 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 107 transition count 303
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 107 transition count 303
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 107 transition count 301
Applied a total of 6 rules in 14 ms. Remains 107 /109 variables (removed 2) and now considering 301/307 (removed 6) transitions.
[2025-06-02 07:20:32] [INFO ] Flow matrix only has 275 transitions (discarded 26 similar events)
// Phase 1: matrix 275 rows 107 cols
[2025-06-02 07:20:32] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:20:32] [INFO ] Implicit Places using invariants in 181 ms returned []
[2025-06-02 07:20:32] [INFO ] Flow matrix only has 275 transitions (discarded 26 similar events)
[2025-06-02 07:20:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:20:32] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 07:20:32] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 520 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2025-06-02 07:20:32] [INFO ] Flow matrix only has 275 transitions (discarded 26 similar events)
[2025-06-02 07:20:32] [INFO ] Invariant cache hit.
[2025-06-02 07:20:32] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:20:36] [INFO ] Deduced a trap composed of 37 places in 182 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:20:36] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:20:37] [INFO ] Deduced a trap composed of 22 places in 146 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 274/381 variables, 107/114 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 39/153 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:20:45] [INFO ] Deduced a trap composed of 22 places in 158 ms of which 24 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (OVERLAPS) 1/382 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 382/382 variables, and 155 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 274/381 variables, 107/115 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 39/154 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 300/454 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:21:13] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:21:17] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 2/456 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:21:27] [INFO ] Deduced a trap along path composed of 2 places in 42 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:21:27] [INFO ] Deduced a trap along path composed of 2 places in 30 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 381/382 variables, and 458 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 107/107 constraints, ReadFeed: 39/40 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60146ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 60147ms
Starting structural reductions in LTL mode, iteration 1 : 107/109 places, 301/307 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60683 ms. Remains : 107/109 places, 301/307 transitions.
[2025-06-02 07:21:33] [INFO ] Flatten gal took : 9 ms
[2025-06-02 07:21:33] [INFO ] Flatten gal took : 8 ms
[2025-06-02 07:21:33] [INFO ] Input system was already deterministic with 301 transitions.
[2025-06-02 07:21:33] [INFO ] Flatten gal took : 9 ms
[2025-06-02 07:21:33] [INFO ] Flatten gal took : 8 ms
[2025-06-02 07:21:33] [INFO ] Time to serialize gal into /tmp/CTLFireability10328976691558532861.gal : 2 ms
[2025-06-02 07:21:33] [INFO ] Time to serialize properties into /tmp/CTLFireability15620358167935476071.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10328976691558532861.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15620358167935476071.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.41793e+06,2.24026,44872,2,2939,5,120247,6,0,728,108922,0


Converting to forward existential form...Done !
original formula: AG((AX(AG((p84==0))) + (A(((AG(((p6==1)&&(p29==1))) * (p4==1)) * (p75==1)) U !(EF(((p8==1)&&(p85==1))))) * ((p7==0)||(p56==0)))))
=> equivalent forward existential formula: [(FwdU(EY((FwdU(Init,TRUE) * !((!((E(!(!(E(TRUE U ((p8==1)&&(p85==1))))) U (!(((!(E(TRUE U !(((p6==1)&&(p29==1))...322
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t5, t7, t11, t12, t14, t15, t17, t19, t23, t24, t26, t27, t29, t31, t35, t36, t38...622
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,11.4574,222244,1,0,574,976154,636,307,6477,734657,691
FORMULA FireWire-PT-05-CTLFireability-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 307/307 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 107 transition count 303
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 107 transition count 303
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 107 transition count 301
Applied a total of 6 rules in 6 ms. Remains 107 /109 variables (removed 2) and now considering 301/307 (removed 6) transitions.
[2025-06-02 07:21:44] [INFO ] Flow matrix only has 275 transitions (discarded 26 similar events)
[2025-06-02 07:21:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:21:44] [INFO ] Implicit Places using invariants in 223 ms returned []
[2025-06-02 07:21:44] [INFO ] Flow matrix only has 275 transitions (discarded 26 similar events)
[2025-06-02 07:21:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:21:45] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 07:21:45] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 625 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2025-06-02 07:21:45] [INFO ] Flow matrix only has 275 transitions (discarded 26 similar events)
[2025-06-02 07:21:45] [INFO ] Invariant cache hit.
[2025-06-02 07:21:45] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:21:49] [INFO ] Deduced a trap composed of 37 places in 173 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:21:50] [INFO ] Deduced a trap composed of 15 places in 192 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:21:50] [INFO ] Deduced a trap composed of 22 places in 169 ms of which 12 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 274/381 variables, 107/114 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 39/153 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:21:59] [INFO ] Deduced a trap composed of 22 places in 158 ms of which 23 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (OVERLAPS) 1/382 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
( org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 382/382 variables, and 155 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 274/381 variables, 107/115 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 39/154 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 300/454 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:24] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:28] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 2/456 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:38] [INFO ] Deduced a trap along path composed of 2 places in 39 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:38] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 381/382 variables, and 458 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 107/107 constraints, ReadFeed: 39/40 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60119ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 60120ms
Starting structural reductions in LTL mode, iteration 1 : 107/109 places, 301/307 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60753 ms. Remains : 107/109 places, 301/307 transitions.
[2025-06-02 07:22:45] [INFO ] Flatten gal took : 12 ms
[2025-06-02 07:22:45] [INFO ] Flatten gal took : 13 ms
[2025-06-02 07:22:45] [INFO ] Input system was already deterministic with 301 transitions.
[2025-06-02 07:22:45] [INFO ] Flatten gal took : 13 ms
[2025-06-02 07:22:45] [INFO ] Flatten gal took : 13 ms
[2025-06-02 07:22:45] [INFO ] Time to serialize gal into /tmp/CTLFireability16328943343581624515.gal : 3 ms
[2025-06-02 07:22:45] [INFO ] Time to serialize properties into /tmp/CTLFireability546137755569939665.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16328943343581624515.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability546137755569939665.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.41793e+06,2.03442,44864,2,2939,5,120247,6,0,728,108922,0


Converting to forward existential form...Done !
original formula: EG(E(((EF(((p8==1)&&(p98==1))) + !(AF(((p6==1)&&(p32==1))))) + ((EF(((p6==1)&&(p87==1))) * (p8==1)) * !(((p3==1)&&(p108==1))))) U ((!(AX(...228
=> equivalent forward existential formula: [FwdG(Init,E(((E(TRUE U ((p8==1)&&(p98==1))) + !(!(EG(!(((p6==1)&&(p32==1))))))) + ((E(TRUE U ((p6==1)&&(p87==1)...301
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t5, t7, t11, t12, t14, t15, t17, t19, t23, t24, t26, t27, t29, t31, t35, t36, t38...622
Detected timeout of ITS tools.
[2025-06-02 07:23:15] [INFO ] Flatten gal took : 8 ms
[2025-06-02 07:23:15] [INFO ] Applying decomposition
[2025-06-02 07:23:15] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12916252068213213384.txt' '-o' '/tmp/graph12916252068213213384.bin' '-w' '/tmp/graph12916252068213213384.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12916252068213213384.bin' '-l' '-1' '-v' '-w' '/tmp/graph12916252068213213384.weights' '-q' '0' '-e' '0.001'
[2025-06-02 07:23:15] [INFO ] Decomposing Gal with order
[2025-06-02 07:23:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 07:23:15] [INFO ] Removed a total of 470 redundant transitions.
[2025-06-02 07:23:15] [INFO ] Flatten gal took : 22 ms
[2025-06-02 07:23:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 79 labels/synchronizations in 12 ms.
[2025-06-02 07:23:15] [INFO ] Time to serialize gal into /tmp/CTLFireability9840917374979180889.gal : 5 ms
[2025-06-02 07:23:15] [INFO ] Time to serialize properties into /tmp/CTLFireability1524798839877846606.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9840917374979180889.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1524798839877846606.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.41793e+06,3.90061,73448,1839,197,108735,1393,581,266480,84,11776,0


Converting to forward existential form...Done !
original formula: EG(E(((EF(((i3.u2.p8==1)&&(i6.i0.u33.p98==1))) + !(AF(((i6.i1.u31.p6==1)&&(i3.u12.p32==1))))) + ((EF(((i6.i1.u31.p6==1)&&(i6.i1.u30.p87==...336
=> equivalent forward existential formula: [FwdG(Init,E(((E(TRUE U ((i3.u2.p8==1)&&(i6.i0.u33.p98==1))) + !(!(EG(!(((i6.i1.u31.p6==1)&&(i3.u12.p32==1))))))...409
Reverse transition relation is NOT exact ! Due to transitions t39, t41, t42, t45, t46, t48, t55, t62, t65, t104, t105, t106, t108, t110, t126, t131, t136, ...752
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 109/109 places, 307/307 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 108 transition count 305
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 107 transition count 305
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 107 transition count 304
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 106 transition count 304
Applied a total of 4 rules in 18 ms. Remains 106 /109 variables (removed 3) and now considering 304/307 (removed 3) transitions.
[2025-06-02 07:23:45] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
// Phase 1: matrix 278 rows 106 cols
[2025-06-02 07:23:45] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:23:45] [INFO ] Implicit Places using invariants in 133 ms returned []
[2025-06-02 07:23:45] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2025-06-02 07:23:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:23:45] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-06-02 07:23:46] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 07:23:46] [INFO ] Redundant transitions in 5 ms returned []
Running 301 sub problems to find dead transitions.
[2025-06-02 07:23:46] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2025-06-02 07:23:46] [INFO ] Invariant cache hit.
[2025-06-02 07:23:46] [INFO ] State equation strengthened by 38 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:47] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:47] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:47] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:48] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:48] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 9 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 3 (OVERLAPS) 277/382 variables, 105/114 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/382 variables, 38/152 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:56] [INFO ] Deduced a trap composed of 21 places in 156 ms of which 22 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/382 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 7 (OVERLAPS) 1/383 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/383 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 383/384 variables, and 154 constraints, problems are : Problem set: 0 solved, 301 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 106/106 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 301 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 3 (OVERLAPS) 277/382 variables, 105/115 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/382 variables, 38/153 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/382 variables, 301/454 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:28] [INFO ] Deduced a trap along path composed of 2 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:28] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:33] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 3/457 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:43] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 382/384 variables, and 458 constraints, problems are : Problem set: 0 solved, 301 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 105/106 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60131ms problems are : Problem set: 0 solved, 301 unsolved
Search for dead transitions found 0 dead transitions in 60132ms
Starting structural reductions in SI_CTL mode, iteration 1 : 106/109 places, 304/307 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60536 ms. Remains : 106/109 places, 304/307 transitions.
[2025-06-02 07:24:46] [INFO ] Flatten gal took : 8 ms
[2025-06-02 07:24:46] [INFO ] Flatten gal took : 8 ms
[2025-06-02 07:24:46] [INFO ] Input system was already deterministic with 304 transitions.
[2025-06-02 07:24:46] [INFO ] Flatten gal took : 13 ms
[2025-06-02 07:24:46] [INFO ] Flatten gal took : 13 ms
[2025-06-02 07:24:46] [INFO ] Time to serialize gal into /tmp/CTLFireability12223927534944005092.gal : 2 ms
[2025-06-02 07:24:46] [INFO ] Time to serialize properties into /tmp/CTLFireability2417401622485151557.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12223927534944005092.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2417401622485151557.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.11284e+06,2.04559,46492,2,2733,5,128661,6,0,727,123771,0


Converting to forward existential form...Done !
original formula: AF(!(A(((p5==1)&&(p83==1)) U A(EF(((p11==1)&&(p52==1))) U EF(((p4==1)&&(p48==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(!((E(!(!((E(!(E(TRUE U ((p4==1)&&(p48==1)))) U (!(E(TRUE U ((p11==1)&&(p52==1)))) * !(E(TRUE U ((...580
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t4, t6, t10, t11, t13, t14, t16, t18, t22, t23, t25, t26, t28, t30, t34, t35, t37...633
Detected timeout of ITS tools.
[2025-06-02 07:25:16] [INFO ] Flatten gal took : 13 ms
[2025-06-02 07:25:16] [INFO ] Applying decomposition
[2025-06-02 07:25:16] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph18276366118837153702.txt' '-o' '/tmp/graph18276366118837153702.bin' '-w' '/tmp/graph18276366118837153702.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18276366118837153702.bin' '-l' '-1' '-v' '-w' '/tmp/graph18276366118837153702.weights' '-q' '0' '-e' '0.001'
[2025-06-02 07:25:16] [INFO ] Decomposing Gal with order
[2025-06-02 07:25:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 07:25:16] [INFO ] Removed a total of 443 redundant transitions.
[2025-06-02 07:25:16] [INFO ] Flatten gal took : 31 ms
[2025-06-02 07:25:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 111 labels/synchronizations in 9 ms.
[2025-06-02 07:25:16] [INFO ] Time to serialize gal into /tmp/CTLFireability654493952416129514.gal : 4 ms
[2025-06-02 07:25:16] [INFO ] Time to serialize properties into /tmp/CTLFireability8761375452930767870.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability654493952416129514.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8761375452930767870.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.11284e+06,11.0839,190712,1828,276,222738,3122,530,1.13543e+06,133,20576,0


Converting to forward existential form...Done !
original formula: AF(!(A(((i0.u1.p5==1)&&(i0.u21.p83==1)) U A(EF(((i1.i0.u3.p11==1)&&(i0.u13.p52==1))) U EF(((i0.u1.p4==1)&&(i0.u16.p48==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(!((E(!(!((E(!(E(TRUE U ((i0.u1.p4==1)&&(i0.u16.p48==1)))) U (!(E(TRUE U ((i1.i0.u3.p11==1)&&(i0.u...758
Reverse transition relation is NOT exact ! Due to transitions t0, t38, t40, t41, t44, t45, t54, t58, t59, t60, t61, t66, t73, t107, t109, t111, t127, t132,...731
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 109/109 places, 307/307 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 108 transition count 305
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 107 transition count 305
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 107 transition count 304
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 106 transition count 304
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 105 transition count 302
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 105 transition count 302
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 105 transition count 301
Applied a total of 7 rules in 22 ms. Remains 105 /109 variables (removed 4) and now considering 301/307 (removed 6) transitions.
[2025-06-02 07:25:46] [INFO ] Flow matrix only has 275 transitions (discarded 26 similar events)
// Phase 1: matrix 275 rows 105 cols
[2025-06-02 07:25:46] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:25:46] [INFO ] Implicit Places using invariants in 151 ms returned []
[2025-06-02 07:25:46] [INFO ] Flow matrix only has 275 transitions (discarded 26 similar events)
[2025-06-02 07:25:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:25:46] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-06-02 07:25:47] [INFO ] Implicit Places using invariants and state equation in 399 ms returned []
Implicit Place search using SMT with State Equation took 576 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 07:25:47] [INFO ] Redundant transitions in 4 ms returned []
Running 298 sub problems to find dead transitions.
[2025-06-02 07:25:47] [INFO ] Flow matrix only has 275 transitions (discarded 26 similar events)
[2025-06-02 07:25:47] [INFO ] Invariant cache hit.
[2025-06-02 07:25:47] [INFO ] State equation strengthened by 38 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:25:49] [INFO ] Deduced a trap composed of 36 places in 165 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:25:49] [INFO ] Deduced a trap composed of 15 places in 173 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:25:49] [INFO ] Deduced a trap composed of 21 places in 179 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:25:50] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 9 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (OVERLAPS) 274/378 variables, 104/112 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/378 variables, 38/150 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:25:59] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 7 (OVERLAPS) 1/379 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 379/380 variables, and 152 constraints, problems are : Problem set: 0 solved, 298 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 105/105 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 298 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (OVERLAPS) 274/378 variables, 104/113 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/378 variables, 38/151 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 298/449 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:26:24] [INFO ] Deduced a trap composed of 35 places in 95 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:26:27] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:26:28] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 3/452 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:26:38] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:26:38] [INFO ] Deduced a trap along path composed of 2 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:26:38] [INFO ] Deduced a trap along path composed of 2 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 3/455 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 378/380 variables, and 455 constraints, problems are : Problem set: 0 solved, 298 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 104/105 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60220ms problems are : Problem set: 0 solved, 298 unsolved
Search for dead transitions found 0 dead transitions in 60223ms
Starting structural reductions in SI_CTL mode, iteration 1 : 105/109 places, 301/307 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60841 ms. Remains : 105/109 places, 301/307 transitions.
[2025-06-02 07:26:47] [INFO ] Flatten gal took : 7 ms
[2025-06-02 07:26:47] [INFO ] Flatten gal took : 8 ms
[2025-06-02 07:26:47] [INFO ] Input system was already deterministic with 301 transitions.
[2025-06-02 07:26:47] [INFO ] Flatten gal took : 8 ms
[2025-06-02 07:26:47] [INFO ] Flatten gal took : 8 ms
[2025-06-02 07:26:47] [INFO ] Time to serialize gal into /tmp/CTLFireability2479460693036119721.gal : 1 ms
[2025-06-02 07:26:47] [INFO ] Time to serialize properties into /tmp/CTLFireability15677992737129177946.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2479460693036119721.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15677992737129177946.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.08251e+06,2.21229,48920,2,2687,5,129726,6,0,720,127530,0


Converting to forward existential form...Done !
original formula: (EF((p31==0)) * (AF(((EF(((p5==1)&&(p72==1))) + (((p8==1)&&(p59==1))&&(p36==1))) + ((p4==1)&&(p75==1)))) + EF(((p9==1)&&(p43==1)))))
=> equivalent forward existential formula: ([(Init * !(E(TRUE U (p31==0))))] = FALSE * [FwdG((Init * !(E(TRUE U ((p9==1)&&(p43==1))))),!(((E(TRUE U ((p5==1...238
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t4, t6, t10, t11, t13, t14, t16, t18, t22, t23, t25, t26, t28, t30, t34, t35, t37...627
(forward)formula 0,1,20.809,388456,1,0,618,1.92557e+06,630,331,6109,1.19192e+06,756
FORMULA FireWire-PT-05-CTLFireability-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 307/307 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 107 transition count 303
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 107 transition count 303
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 107 transition count 301
Applied a total of 6 rules in 3 ms. Remains 107 /109 variables (removed 2) and now considering 301/307 (removed 6) transitions.
[2025-06-02 07:27:08] [INFO ] Flow matrix only has 275 transitions (discarded 26 similar events)
// Phase 1: matrix 275 rows 107 cols
[2025-06-02 07:27:08] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:27:08] [INFO ] Implicit Places using invariants in 119 ms returned []
[2025-06-02 07:27:08] [INFO ] Flow matrix only has 275 transitions (discarded 26 similar events)
[2025-06-02 07:27:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:27:08] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 07:27:08] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2025-06-02 07:27:08] [INFO ] Flow matrix only has 275 transitions (discarded 26 similar events)
[2025-06-02 07:27:08] [INFO ] Invariant cache hit.
[2025-06-02 07:27:08] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:27:13] [INFO ] Deduced a trap composed of 37 places in 147 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:27:13] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:27:13] [INFO ] Deduced a trap composed of 22 places in 159 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 274/381 variables, 107/114 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 39/153 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:27:21] [INFO ] Deduced a trap composed of 22 places in 146 ms of which 21 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (OVERLAPS) 1/382 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 382/382 variables, and 155 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 274/381 variables, 107/115 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 39/154 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 300/454 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:27:50] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:27:54] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 2/456 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:28:05] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:28:05] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 381/382 variables, and 458 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 107/107 constraints, ReadFeed: 39/40 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60137ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 60138ms
Starting structural reductions in LTL mode, iteration 1 : 107/109 places, 301/307 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60495 ms. Remains : 107/109 places, 301/307 transitions.
[2025-06-02 07:28:08] [INFO ] Flatten gal took : 12 ms
[2025-06-02 07:28:09] [INFO ] Flatten gal took : 13 ms
[2025-06-02 07:28:09] [INFO ] Input system was already deterministic with 301 transitions.
[2025-06-02 07:28:09] [INFO ] Flatten gal took : 13 ms
[2025-06-02 07:28:09] [INFO ] Flatten gal took : 12 ms
[2025-06-02 07:28:09] [INFO ] Time to serialize gal into /tmp/CTLFireability3666815343651302203.gal : 2 ms
[2025-06-02 07:28:09] [INFO ] Time to serialize properties into /tmp/CTLFireability15854662425830132204.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3666815343651302203.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15854662425830132204.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.41793e+06,2.12622,44628,2,2939,5,120247,6,0,728,108922,0


Converting to forward existential form...Done !
original formula: EF((AF((EX((((p9==1)&&(p19==1))||((p8==1)&&(p90==1)))) * (EX(((p3==1)&&(p78==1))) + EG(((p7==1)&&(p58==1)))))) * E(EG(AG(((p8==1)&&(p38==...235
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * !(EG(!((EX((((p9==1)&&(p19==1))||((p8==1)&&(p90==1)))) * (EX(((p3==1)&&(p78==1))) + EG...318
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t5, t7, t11, t12, t14, t15, t17, t19, t23, t24, t26, t27, t29, t31, t35, t36, t38...622
(forward)formula 0,0,4.50142,75904,1,0,528,298587,621,275,6140,256815,613
FORMULA FireWire-PT-05-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 307/307 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 107 transition count 303
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 107 transition count 303
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 107 transition count 301
Applied a total of 6 rules in 3 ms. Remains 107 /109 variables (removed 2) and now considering 301/307 (removed 6) transitions.
[2025-06-02 07:28:13] [INFO ] Flow matrix only has 275 transitions (discarded 26 similar events)
[2025-06-02 07:28:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:28:13] [INFO ] Implicit Places using invariants in 117 ms returned []
[2025-06-02 07:28:13] [INFO ] Flow matrix only has 275 transitions (discarded 26 similar events)
[2025-06-02 07:28:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:28:13] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 07:28:13] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 391 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2025-06-02 07:28:13] [INFO ] Flow matrix only has 275 transitions (discarded 26 similar events)
[2025-06-02 07:28:13] [INFO ] Invariant cache hit.
[2025-06-02 07:28:13] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:28:18] [INFO ] Deduced a trap composed of 37 places in 149 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:28:18] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:28:18] [INFO ] Deduced a trap composed of 22 places in 142 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 274/381 variables, 107/114 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 39/153 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:28:26] [INFO ] Deduced a trap composed of 22 places in 142 ms of which 21 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (OVERLAPS) 1/382 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 1.0)
(t1 0.0)
(t2 (/ 7.0 8.0))
(t3 1.0)
(t4 0.0)
(t5 0.0)
(t6 0.0)
(t7 0.0)
(t8 0.0)
(t9 1.0)
(t10 0.0)
(t11 0.0)
(t12 0.0)
(t13 0.0)
(t14 0.0)
(t15 0.0)
(t16 (/ 7.0 2.0))
(t17 0.0)
(t18 0.0)
(t19 0.0)
(t20 0.0)
(t21 0.0)
(t22 0.0)
(t23 0.0)
(t24 0.0)
(t25 3.0)
(t26 0.0)
(t27 0.0)
(t28 0.0)
(t29 0.0)
(t30 0.0)
(t31 0.0)
(t32 0.0)
(t33 0.0)
(t34 0.0)
(t35 0.0)
(t36 0.0)
(t37 0.0)
(t38 0.0)
(t39 3.0)
(t40 1.0)
(t41 1.0)
(t42 1.0)
(t43 0.0)
(t44 1.0)
(t45 0.0)
(t46 1.0)
(t47 0.0)
(t48 0.0)
(t49 0.0)
(t50 0.0)
(t51 0.0)
(t52 0.0)
(t53 0.0)
(t54 1.0)
(t55 1.0)
(t56 0.0)
(t57 0.0)
(t58 0.0)
(t59 0.0)
(t60 0.0)
(t61 0.0)
(t62 0.0)
(t63 0.0)
(t64 0.0)
(t65 0.0)
(t66 0.0)
(t67 0.0)
(t68 0.0)
(t69 0.0)
(t70 0.0)
(t71 0.0)
(t72 0.0)
(t73 0.0)
(t74 0.0)
(t75 0.0)
(t76 0.0)
(t77 0.0)
(t78 1.0)
(t79 0.0)
(t80 0.0)
(t81 1.0)
(t82 1.0)
(t83 (/ 7.0 8.0))
(t84 (/ 1.0 8.0))
(t85 0.0)
(t86 (/ 7.0 8.0))
(t87 (/ 1.0 8.0))
(t88 0.0)
(t89 (/ 7.0 8.0))
(t90 (/ 1.0 8.0))
(t91 0.0)
(t92 0.0)
(t93 0.0)
(t94 0.0)
(t95 0.0)
(t96 0.0)
(t97 0.0)
(t98 0.0)
(t99 0.0)
(t100 0.0)
(t101 0.0)
(t102 0.0)
(t103 0.0)
(t104 (/ 7.0 8.0))
(t105 (/ 1.0 8.0))
(t106 0.0)
(t107 0.0)
(t108 0.0)
(t109 0.0)
(t110 (/ 7.0 8.0))
(t111 0.0)
(t112 0.0)
(t113 0.0)
(t114 0.0)
(t115 0.0)
(t116 0.0)
(t117 0.0)
(t118 0.0)
(t119 0.0)
(t120 0.0)
(t121 0.0)
(t122 0.0)
(t123 0.0)
(t124 0.0)
(t125 0.0)
(t126 0.0)
(t127 0.0)
(t128 0.0)
(t129 0.0)
(t130 0.0)
(t131 0.0)
(t132 0.0)
(t133 0.0)
(t134 0.0)
(t135 0.0)
(t136 0.0)
(t137 0.0)
(t138 0.0)
(t139 0.0)
(t140 0.0)
(t141 0.0)
(t142 0.0)
(t143 0.0)
(t144 0.0)
(t145 0.0)
(t146 0.0)
(t147 0.0)
(t148 0.0)
(t149 0.0)
(t150 0.0)
(t151 0.0)
(t152 0.0)
(t153 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 382/382 variables, and 155 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 274/381 variables, 107/115 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 39/154 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 300/454 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:28:54] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:28:58] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 2/456 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:29:09] [INFO ] Deduced a trap along path composed of 2 places in 42 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:29:09] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 381/382 variables, and 458 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 107/107 constraints, ReadFeed: 39/40 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60181ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 60182ms
Starting structural reductions in LTL mode, iteration 1 : 107/109 places, 301/307 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60578 ms. Remains : 107/109 places, 301/307 transitions.
[2025-06-02 07:29:14] [INFO ] Flatten gal took : 12 ms
[2025-06-02 07:29:14] [INFO ] Flatten gal took : 13 ms
[2025-06-02 07:29:14] [INFO ] Input system was already deterministic with 301 transitions.
[2025-06-02 07:29:14] [INFO ] Flatten gal took : 13 ms
[2025-06-02 07:29:14] [INFO ] Flatten gal took : 13 ms
[2025-06-02 07:29:14] [INFO ] Time to serialize gal into /tmp/CTLFireability14082101613534899017.gal : 2 ms
[2025-06-02 07:29:14] [INFO ] Time to serialize properties into /tmp/CTLFireability7146798771545128755.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14082101613534899017.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7146798771545128755.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.41793e+06,2.27915,44980,2,2939,5,120247,6,0,728,108922,0


Converting to forward existential form...Done !
original formula: (!(E((E(AG(((p3==1)&&(p108==1))) U ((p6==1)&&(p63==1))) + !((((((p8==1)&&(p97==1))||((p3==1)&&(p19==1))) * EX((p99==1))) + ((p3==1)&&(p23...458
=> equivalent forward existential formula: ([(((FwdU((Init * !(E(TRUE U (!(E(TRUE U !((p29==0)))) * (!(E(TRUE U !((p8==1)))) + (!(EX(!(((p8==0)||(p64==0)))...1025
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t5, t7, t11, t12, t14, t15, t17, t19, t23, t24, t26, t27, t29, t31, t35, t36, t38...622
Detected timeout of ITS tools.
[2025-06-02 07:29:44] [INFO ] Flatten gal took : 8 ms
[2025-06-02 07:29:44] [INFO ] Applying decomposition
[2025-06-02 07:29:44] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11643288524747249267.txt' '-o' '/tmp/graph11643288524747249267.bin' '-w' '/tmp/graph11643288524747249267.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11643288524747249267.bin' '-l' '-1' '-v' '-w' '/tmp/graph11643288524747249267.weights' '-q' '0' '-e' '0.001'
[2025-06-02 07:29:44] [INFO ] Decomposing Gal with order
[2025-06-02 07:29:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 07:29:44] [INFO ] Removed a total of 470 redundant transitions.
[2025-06-02 07:29:44] [INFO ] Flatten gal took : 20 ms
[2025-06-02 07:29:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 84 labels/synchronizations in 5 ms.
[2025-06-02 07:29:44] [INFO ] Time to serialize gal into /tmp/CTLFireability2027514329606739896.gal : 3 ms
[2025-06-02 07:29:44] [INFO ] Time to serialize properties into /tmp/CTLFireability88638127490300707.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2027514329606739896.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability88638127490300707.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...260
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.41793e+06,4.5741,86844,1910,156,138815,1215,577,268559,84,7511,0


Converting to forward existential form...Done !
original formula: (!(E((E(AG(((i1.u0.p3==1)&&(i1.u38.p108==1))) U ((i6.i0.u32.p6==1)&&(i5.u21.p63==1))) + !((((((i3.u2.p8==1)&&(i6.i1.u33.p97==1))||((i1.u0...709
=> equivalent forward existential formula: ([(((FwdU((Init * !(E(TRUE U (!(E(TRUE U !((i3.u10.p29==0)))) * (!(E(TRUE U !((i3.u2.p8==1)))) + (!(EX(!(((i3.u2...1495
Reverse transition relation is NOT exact ! Due to transitions t39, t41, t42, t45, t46, t48, t62, t65, t104, t105, t106, t108, t110, t124, t126, t131, t136,...756
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
(forward)formula 0,1,16.0367,278716,1,0,448214,4066,3208,973156,376,22815,1289505
FORMULA FireWire-PT-05-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 307/307 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 107 transition count 303
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 107 transition count 303
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 107 transition count 301
Applied a total of 6 rules in 4 ms. Remains 107 /109 variables (removed 2) and now considering 301/307 (removed 6) transitions.
[2025-06-02 07:30:00] [INFO ] Flow matrix only has 275 transitions (discarded 26 similar events)
[2025-06-02 07:30:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:30:00] [INFO ] Implicit Places using invariants in 160 ms returned []
[2025-06-02 07:30:00] [INFO ] Flow matrix only has 275 transitions (discarded 26 similar events)
[2025-06-02 07:30:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:30:00] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 07:30:01] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2025-06-02 07:30:01] [INFO ] Flow matrix only has 275 transitions (discarded 26 similar events)
[2025-06-02 07:30:01] [INFO ] Invariant cache hit.
[2025-06-02 07:30:01] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:30:05] [INFO ] Deduced a trap composed of 37 places in 182 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:30:05] [INFO ] Deduced a trap composed of 15 places in 158 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:30:05] [INFO ] Deduced a trap composed of 22 places in 152 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 274/381 variables, 107/114 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 39/153 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:30:14] [INFO ] Deduced a trap composed of 22 places in 145 ms of which 21 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (OVERLAPS) 1/382 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/382 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 382/382 variables, and 155 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 274/381 variables, 107/115 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 39/154 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 300/454 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:30:41] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:30:45] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 2/456 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:30:58] [INFO ] Deduced a trap along path composed of 2 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:30:58] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 381/382 variables, and 458 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 107/107 constraints, ReadFeed: 39/40 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60180ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 60182ms
Starting structural reductions in LTL mode, iteration 1 : 107/109 places, 301/307 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60644 ms. Remains : 107/109 places, 301/307 transitions.
[2025-06-02 07:31:01] [INFO ] Flatten gal took : 11 ms
[2025-06-02 07:31:01] [INFO ] Flatten gal took : 10 ms
[2025-06-02 07:31:01] [INFO ] Input system was already deterministic with 301 transitions.
[2025-06-02 07:31:01] [INFO ] Flatten gal took : 11 ms
[2025-06-02 07:31:01] [INFO ] Flatten gal took : 11 ms
[2025-06-02 07:31:01] [INFO ] Time to serialize gal into /tmp/CTLFireability13625031931238997730.gal : 2 ms
[2025-06-02 07:31:01] [INFO ] Time to serialize properties into /tmp/CTLFireability10852449399095383037.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13625031931238997730.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10852449399095383037.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.41793e+06,2.45848,44880,2,2939,5,120247,6,0,728,108922,0


Converting to forward existential form...Done !
original formula: AG(E(!(EX(((p10==1)&&(p20==1)))) U (E((p5==1) U (p94==1)) + ((p7==1)&&(p54==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(!(EX(((p10==1)&&(p20==1)))) U (E((p5==1) U (p94==1)) + ((p7==1)&&(p54==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t5, t7, t11, t12, t14, t15, t17, t19, t23, t24, t26, t27, t29, t31, t35, t36, t38...622
(forward)formula 0,0,17.7307,345408,1,0,697,2.01732e+06,624,392,6069,1.61878e+06,762
FORMULA FireWire-PT-05-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 109/109 places, 307/307 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 108 transition count 305
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 107 transition count 305
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 107 transition count 304
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 106 transition count 304
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 6 place count 104 transition count 300
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 104 transition count 300
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 104 transition count 298
Applied a total of 10 rules in 20 ms. Remains 104 /109 variables (removed 5) and now considering 298/307 (removed 9) transitions.
[2025-06-02 07:31:19] [INFO ] Flow matrix only has 272 transitions (discarded 26 similar events)
// Phase 1: matrix 272 rows 104 cols
[2025-06-02 07:31:19] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:31:19] [INFO ] Implicit Places using invariants in 110 ms returned []
[2025-06-02 07:31:19] [INFO ] Flow matrix only has 272 transitions (discarded 26 similar events)
[2025-06-02 07:31:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:31:19] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-06-02 07:31:19] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 07:31:19] [INFO ] Redundant transitions in 3 ms returned []
Running 295 sub problems to find dead transitions.
[2025-06-02 07:31:19] [INFO ] Flow matrix only has 272 transitions (discarded 26 similar events)
[2025-06-02 07:31:19] [INFO ] Invariant cache hit.
[2025-06-02 07:31:19] [INFO ] State equation strengthened by 38 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:31:21] [INFO ] Deduced a trap composed of 36 places in 139 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:31:21] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:31:21] [INFO ] Deduced a trap composed of 21 places in 155 ms of which 17 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (OVERLAPS) 271/374 variables, 103/110 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 38/148 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:31:30] [INFO ] Deduced a trap composed of 21 places in 191 ms of which 21 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:31:33] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:31:33] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 2/151 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (OVERLAPS) 1/375 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/375 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 375/376 variables, and 152 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 104/104 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (OVERLAPS) 271/374 variables, 103/113 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 38/151 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 295/446 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:31:54] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:31:56] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 2/448 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:31:59] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 1/449 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:32:10] [INFO ] Deduced a trap along path composed of 2 places in 43 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:32:10] [INFO ] Deduced a trap along path composed of 2 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/374 variables, 2/451 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 374/376 variables, and 451 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 103/104 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60206ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 60208ms
Starting structural reductions in SI_CTL mode, iteration 1 : 104/109 places, 298/307 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60730 ms. Remains : 104/109 places, 298/307 transitions.
[2025-06-02 07:32:19] [INFO ] Flatten gal took : 7 ms
[2025-06-02 07:32:19] [INFO ] Flatten gal took : 8 ms
[2025-06-02 07:32:19] [INFO ] Input system was already deterministic with 298 transitions.
[2025-06-02 07:32:19] [INFO ] Flatten gal took : 8 ms
[2025-06-02 07:32:19] [INFO ] Flatten gal took : 8 ms
[2025-06-02 07:32:19] [INFO ] Time to serialize gal into /tmp/CTLFireability4684157834504680544.gal : 2 ms
[2025-06-02 07:32:19] [INFO ] Time to serialize properties into /tmp/CTLFireability11119158423319807189.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4684157834504680544.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11119158423319807189.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.07266e+06,5.57724,113840,2,5814,5,298687,6,0,713,394666,0


Converting to forward existential form...Done !
original formula: A(EF(AG(((p8==1)&&(p57==1)))) U EF(((p9==1)&&(p80==1))))
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U ((p9==1)&&(p80==1))))))) * !(E(!(E(TRUE U ((p9==1)&&(p80==1)))) U (!(E(TRUE U !(E(TRUE...233
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t4, t6, t10, t11, t13, t14, t16, t18, t22, t23, t25, t26, t28, t30, t34, t35, t37...622
Detected timeout of ITS tools.
[2025-06-02 07:32:49] [INFO ] Flatten gal took : 8 ms
[2025-06-02 07:32:49] [INFO ] Applying decomposition
[2025-06-02 07:32:49] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9311860413540004585.txt' '-o' '/tmp/graph9311860413540004585.bin' '-w' '/tmp/graph9311860413540004585.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9311860413540004585.bin' '-l' '-1' '-v' '-w' '/tmp/graph9311860413540004585.weights' '-q' '0' '-e' '0.001'
[2025-06-02 07:32:50] [INFO ] Decomposing Gal with order
[2025-06-02 07:32:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 07:32:50] [INFO ] Removed a total of 464 redundant transitions.
[2025-06-02 07:32:50] [INFO ] Flatten gal took : 28 ms
[2025-06-02 07:32:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 96 labels/synchronizations in 6 ms.
[2025-06-02 07:32:50] [INFO ] Time to serialize gal into /tmp/CTLFireability1936157305809298716.gal : 2 ms
[2025-06-02 07:32:50] [INFO ] Time to serialize properties into /tmp/CTLFireability2454845692879581268.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1936157305809298716.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2454845692879581268.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.07266e+06,2.90732,62752,2002,165,92991,1575,597,233225,84,8498,0


Converting to forward existential form...Done !
original formula: A(EF(AG(((i2.u2.p8==1)&&(i4.u20.p57==1)))) U EF(((i0.i0.u3.p9==1)&&(i3.i1.u25.p80==1))))
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U ((i0.i0.u3.p9==1)&&(i3.i1.u25.p80==1))))))) * !(E(!(E(TRUE U ((i0.i0.u3.p9==1)&&(i3.i1...303
Reverse transition relation is NOT exact ! Due to transitions t38, t40, t41, t44, t45, t47, t61, t66, t103, t104, t105, t107, t109, t125, t130, t135, t140,...762
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
(forward)formula 0,1,11.6386,215328,1,0,332737,4317,3004,886893,365,22357,868641
FORMULA FireWire-PT-05-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

[2025-06-02 07:33:01] [INFO ] Flatten gal took : 8 ms
[2025-06-02 07:33:01] [INFO ] Flatten gal took : 8 ms
[2025-06-02 07:33:01] [INFO ] Applying decomposition
[2025-06-02 07:33:01] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16077205006153152172.txt' '-o' '/tmp/graph16077205006153152172.bin' '-w' '/tmp/graph16077205006153152172.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16077205006153152172.bin' '-l' '-1' '-v' '-w' '/tmp/graph16077205006153152172.weights' '-q' '0' '-e' '0.001'
[2025-06-02 07:33:01] [INFO ] Decomposing Gal with order
[2025-06-02 07:33:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 07:33:01] [INFO ] Removed a total of 474 redundant transitions.
[2025-06-02 07:33:01] [INFO ] Flatten gal took : 18 ms
[2025-06-02 07:33:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 92 labels/synchronizations in 4 ms.
[2025-06-02 07:33:01] [INFO ] Time to serialize gal into /tmp/CTLFireability13346644947042583201.gal : 3 ms
[2025-06-02 07:33:01] [INFO ] Time to serialize properties into /tmp/CTLFireability5862355003786332771.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13346644947042583201.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5862355003786332771.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 5 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.46786e+06,13.6253,252720,2370,244,184860,3074,535,2.13939e+06,88,36577,0


Converting to forward existential form...Done !
original formula: E(AX(!(((i2.u2.p8==1)&&(i2.u12.p32==1)))) U ((i2.u2.p7==1)&&(i5.u29.p96==1)))
=> equivalent forward existential formula: [(FwdU(Init,!(EX(!(!(((i2.u2.p8==1)&&(i2.u12.p32==1))))))) * ((i2.u2.p7==1)&&(i5.u29.p96==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t39, t41, t42, t45, t46, t51, t62, t65, t67, t73, t106, t107, t108, t110, t112, t128, t13...715
(forward)formula 0,1,60.644,1187304,1,0,1.13414e+06,6641,2544,9.95198e+06,361,56373,2090343
FORMULA FireWire-PT-05-CTLFireability-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: !(E(((AF(((((i6.u3.p11==1)&&(i6.u3.p112==1))||((i6.u3.p11==1)&&(i3.u13.p41==1)))||(((i6.u3.p10==1)&&(i6.u5.p18==1))&&((i6.u3.p9==1)&&(i6....293
=> equivalent forward existential formula: [(FwdU(Init,((!(EG(!(((((i6.u3.p11==1)&&(i6.u3.p112==1))||((i6.u3.p11==1)&&(i3.u13.p41==1)))||(((i6.u3.p10==1)&&...359
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
(forward)formula 1,1,77.6652,1558888,1,0,1.44359e+06,9309,2957,1.30853e+07,390,76005,2903893
FORMULA FireWire-PT-05-CTLFireability-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: (EF(((((E(((i2.u2.p7==1)&&(i2.u10.p29==1)) U (i2.u9.p27==1)) + ((i3.u1.p4==1)&&(i3.u16.p48==1))) + ((i2.u2.p8==1)&&(i4.u19.p63==1))) * ((...265
=> equivalent forward existential formula: [FwdG((Init * !(E(TRUE U ((((E(((i2.u2.p7==1)&&(i2.u10.p29==1)) U (i2.u9.p27==1)) + ((i3.u1.p4==1)&&(i3.u16.p48=...319
(forward)formula 2,1,80.7475,1616488,1,0,1.54262e+06,9372,3059,1.32759e+07,391,76507,3185291
FORMULA FireWire-PT-05-CTLFireability-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: EG(E(((EF(((i2.u2.p8==1)&&(i5.u31.p98==1))) + !(AF(((i5.u29.p6==1)&&(i2.u12.p32==1))))) + ((EF(((i5.u29.p6==1)&&(i5.u28.p87==1))) * (i2.u...321
=> equivalent forward existential formula: [FwdG(Init,E(((E(TRUE U ((i2.u2.p8==1)&&(i5.u31.p98==1))) + !(!(EG(!(((i5.u29.p6==1)&&(i2.u12.p32==1))))))) + ((...394
(forward)formula 3,1,131.515,2203948,1,0,2.35737e+06,10427,1305,1.60994e+07,204,86493,268691
FORMULA FireWire-PT-05-CTLFireability-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: AF(!(A(((i3.u1.p5==1)&&(i6.u22.p83==1)) U A(EF(((i6.u3.p11==1)&&(i3.u13.p52==1))) U EF(((i3.u1.p4==1)&&(i3.u16.p48==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(!((E(!(!((E(!(E(TRUE U ((i3.u1.p4==1)&&(i3.u16.p48==1)))) U (!(E(TRUE U ((i6.u3.p11==1)&&(i3.u13....749
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
(forward)formula 4,0,157.667,2203948,1,0,2.35737e+06,10427,1991,1.60994e+07,247,86493,2447053
FORMULA FireWire-PT-05-CTLFireability-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1728038 ms.

BK_STOP 1748849740494

--------------------
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -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="FireWire-PT-05"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is FireWire-PT-05, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r086-smll-174860102200274"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-05.tgz
mv FireWire-PT-05 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;