Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r571-tall-171734910400188.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool gold2023
Input is FireWire-PT-17, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r571-tall-171734910400188
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 153K Jun 2 16:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME FireWire-PT-17-LTLFireability-00
FORMULA_NAME FireWire-PT-17-LTLFireability-01
FORMULA_NAME FireWire-PT-17-LTLFireability-02
FORMULA_NAME FireWire-PT-17-LTLFireability-03
FORMULA_NAME FireWire-PT-17-LTLFireability-04
FORMULA_NAME FireWire-PT-17-LTLFireability-05
FORMULA_NAME FireWire-PT-17-LTLFireability-06
FORMULA_NAME FireWire-PT-17-LTLFireability-07
FORMULA_NAME FireWire-PT-17-LTLFireability-08
FORMULA_NAME FireWire-PT-17-LTLFireability-09
FORMULA_NAME FireWire-PT-17-LTLFireability-10
FORMULA_NAME FireWire-PT-17-LTLFireability-11
FORMULA_NAME FireWire-PT-17-LTLFireability-12
FORMULA_NAME FireWire-PT-17-LTLFireability-13
FORMULA_NAME FireWire-PT-17-LTLFireability-14
FORMULA_NAME FireWire-PT-17-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717370985881

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-17
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-06-02 23:29:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 23:29:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 23:29:47] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2024-06-02 23:29:47] [INFO ] Transformed 428 places.
[2024-06-02 23:29:47] [INFO ] Transformed 656 transitions.
[2024-06-02 23:29:47] [INFO ] Found NUPN structural information;
[2024-06-02 23:29:47] [INFO ] Parsed PT model containing 428 places and 656 transitions and 1904 arcs in 142 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA FireWire-PT-17-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 54 out of 428 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 428/428 places, 656/656 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 422 transition count 656
Discarding 88 places :
Symmetric choice reduction at 1 with 88 rule applications. Total rules 94 place count 334 transition count 568
Iterating global reduction 1 with 88 rules applied. Total rules applied 182 place count 334 transition count 568
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 204 place count 312 transition count 538
Iterating global reduction 1 with 22 rules applied. Total rules applied 226 place count 312 transition count 538
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 228 place count 312 transition count 536
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 230 place count 310 transition count 534
Iterating global reduction 2 with 2 rules applied. Total rules applied 232 place count 310 transition count 534
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 233 place count 309 transition count 533
Iterating global reduction 2 with 1 rules applied. Total rules applied 234 place count 309 transition count 533
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 235 place count 308 transition count 532
Iterating global reduction 2 with 1 rules applied. Total rules applied 236 place count 308 transition count 532
Applied a total of 236 rules in 81 ms. Remains 308 /428 variables (removed 120) and now considering 532/656 (removed 124) transitions.
// Phase 1: matrix 532 rows 308 cols
[2024-06-02 23:29:48] [INFO ] Computed 7 invariants in 17 ms
[2024-06-02 23:29:48] [INFO ] Implicit Places using invariants in 244 ms returned []
[2024-06-02 23:29:48] [INFO ] Invariant cache hit.
[2024-06-02 23:29:48] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 771 ms to find 0 implicit places.
[2024-06-02 23:29:48] [INFO ] Invariant cache hit.
[2024-06-02 23:29:48] [INFO ] Dead Transitions using invariants and state equation in 241 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 308/428 places, 532/656 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1095 ms. Remains : 308/428 places, 532/656 transitions.
Support contains 54 out of 308 places after structural reductions.
[2024-06-02 23:29:48] [INFO ] Flatten gal took : 69 ms
[2024-06-02 23:29:49] [INFO ] Flatten gal took : 29 ms
[2024-06-02 23:29:49] [INFO ] Input system was already deterministic with 532 transitions.
Support contains 49 out of 308 places (down from 54) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 399 ms. (steps per millisecond=25 ) properties (out of 32) seen :6
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Running SMT prover for 26 properties.
[2024-06-02 23:29:49] [INFO ] Invariant cache hit.
[2024-06-02 23:29:49] [INFO ] After 220ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:26
[2024-06-02 23:29:50] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-06-02 23:29:50] [INFO ] After 615ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :25
[2024-06-02 23:29:51] [INFO ] Deduced a trap composed of 55 places in 120 ms of which 11 ms to minimize.
[2024-06-02 23:29:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2024-06-02 23:29:51] [INFO ] Deduced a trap composed of 77 places in 103 ms of which 1 ms to minimize.
[2024-06-02 23:29:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2024-06-02 23:29:51] [INFO ] After 1702ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :25
Attempting to minimize the solution found.
Minimization took 452 ms.
[2024-06-02 23:29:52] [INFO ] After 2460ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :25
Fused 26 Parikh solutions to 25 different solutions.
Parikh walk visited 1 properties in 313 ms.
Support contains 37 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 532/532 transitions.
Graph (trivial) has 204 edges and 308 vertex of which 15 / 308 are part of one of the 3 SCC in 3 ms
Free SCC test removed 12 places
Drop transitions removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 296 transition count 468
Reduce places removed 47 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 51 rules applied. Total rules applied 99 place count 249 transition count 464
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 103 place count 247 transition count 462
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 105 place count 245 transition count 462
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 28 Pre rules applied. Total rules applied 105 place count 245 transition count 434
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 161 place count 217 transition count 434
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 219 place count 188 transition count 405
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -99
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 259 place count 168 transition count 504
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 263 place count 168 transition count 500
Free-agglomeration rule applied 20 times.
Iterating global reduction 4 with 20 rules applied. Total rules applied 283 place count 168 transition count 480
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 4 with 20 rules applied. Total rules applied 303 place count 148 transition count 480
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 304 place count 148 transition count 479
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 305 place count 147 transition count 479
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 308 place count 147 transition count 479
Applied a total of 308 rules in 98 ms. Remains 147 /308 variables (removed 161) and now considering 479/532 (removed 53) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 147/308 places, 479/532 transitions.
Incomplete random walk after 10000 steps, including 410 resets, run finished after 235 ms. (steps per millisecond=42 ) properties (out of 24) seen :8
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2024-06-02 23:29:53] [INFO ] Flow matrix only has 464 transitions (discarded 15 similar events)
// Phase 1: matrix 464 rows 147 cols
[2024-06-02 23:29:53] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:29:53] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2024-06-02 23:29:53] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:29:53] [INFO ] After 419ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2024-06-02 23:29:53] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-06-02 23:29:53] [INFO ] After 175ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2024-06-02 23:29:53] [INFO ] Deduced a trap composed of 45 places in 43 ms of which 1 ms to minimize.
[2024-06-02 23:29:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2024-06-02 23:29:54] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 1 ms to minimize.
[2024-06-02 23:29:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2024-06-02 23:29:54] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 1 ms to minimize.
[2024-06-02 23:29:54] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 1 ms to minimize.
[2024-06-02 23:29:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 148 ms
[2024-06-02 23:29:54] [INFO ] After 757ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 163 ms.
[2024-06-02 23:29:54] [INFO ] After 1537ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Parikh walk visited 0 properties in 161 ms.
Support contains 23 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 479/479 transitions.
Graph (trivial) has 28 edges and 147 vertex of which 2 / 147 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 146 transition count 476
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 145 transition count 476
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 144 transition count 435
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 144 transition count 435
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 11 place count 141 transition count 432
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 12 place count 141 transition count 431
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 140 transition count 429
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 140 transition count 429
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 19 place count 140 transition count 424
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 31 place count 134 transition count 454
Drop transitions removed 49 transitions
Redundant transition composition rules discarded 49 transitions
Iterating global reduction 2 with 49 rules applied. Total rules applied 80 place count 134 transition count 405
Applied a total of 80 rules in 73 ms. Remains 134 /147 variables (removed 13) and now considering 405/479 (removed 74) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 134/147 places, 405/479 transitions.
Incomplete random walk after 10000 steps, including 470 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 126 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 121 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 150 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 115 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 125 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 110 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 135 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 119 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 11) seen :1
Running SMT prover for 10 properties.
[2024-06-02 23:29:55] [INFO ] Flow matrix only has 389 transitions (discarded 16 similar events)
// Phase 1: matrix 389 rows 134 cols
[2024-06-02 23:29:55] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:29:55] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-06-02 23:29:55] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:29:55] [INFO ] After 264ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2024-06-02 23:29:55] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-02 23:29:56] [INFO ] After 133ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2024-06-02 23:29:56] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-06-02 23:29:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2024-06-02 23:29:56] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 0 ms to minimize.
[2024-06-02 23:29:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2024-06-02 23:29:56] [INFO ] After 479ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 119 ms.
[2024-06-02 23:29:56] [INFO ] After 944ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 65 ms.
Support contains 19 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 405/405 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 134 transition count 403
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 132 transition count 403
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 132 transition count 402
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 130 transition count 402
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 130 transition count 400
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 130 transition count 399
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 129 transition count 399
Drop transitions removed 42 transitions
Redundant transition composition rules discarded 42 transitions
Iterating global reduction 2 with 42 rules applied. Total rules applied 55 place count 129 transition count 357
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 129 transition count 357
Applied a total of 56 rules in 74 ms. Remains 129 /134 variables (removed 5) and now considering 357/405 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 129/134 places, 357/405 transitions.
Incomplete random walk after 10000 steps, including 480 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 132 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 132 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 160 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 128 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 130 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 127 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 146 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 129 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 67 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 10) seen :1
Running SMT prover for 9 properties.
[2024-06-02 23:29:56] [INFO ] Flow matrix only has 342 transitions (discarded 15 similar events)
// Phase 1: matrix 342 rows 129 cols
[2024-06-02 23:29:56] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:29:57] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-06-02 23:29:57] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:29:57] [INFO ] After 181ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-06-02 23:29:57] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-02 23:29:57] [INFO ] After 127ms SMT Verify possible using 43 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2024-06-02 23:29:57] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 0 ms to minimize.
[2024-06-02 23:29:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2024-06-02 23:29:57] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 1 ms to minimize.
[2024-06-02 23:29:57] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 0 ms to minimize.
[2024-06-02 23:29:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 115 ms
[2024-06-02 23:29:57] [INFO ] After 494ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 113 ms.
[2024-06-02 23:29:57] [INFO ] After 866ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 32 ms.
Support contains 18 out of 129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 357/357 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 129 transition count 356
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 128 transition count 356
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 127 transition count 356
Applied a total of 4 rules in 19 ms. Remains 127 /129 variables (removed 2) and now considering 356/357 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 127/129 places, 356/357 transitions.
Incomplete random walk after 10000 steps, including 482 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 129 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 133 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 158 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 135 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 130 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 128 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 144 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :1
Running SMT prover for 8 properties.
[2024-06-02 23:29:58] [INFO ] Flow matrix only has 341 transitions (discarded 15 similar events)
// Phase 1: matrix 341 rows 127 cols
[2024-06-02 23:29:58] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:29:58] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:29:58] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-06-02 23:29:58] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:29:58] [INFO ] After 155ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-06-02 23:29:58] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-02 23:29:58] [INFO ] After 112ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2024-06-02 23:29:58] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 0 ms to minimize.
[2024-06-02 23:29:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2024-06-02 23:29:58] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
[2024-06-02 23:29:58] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2024-06-02 23:29:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 112 ms
[2024-06-02 23:29:59] [INFO ] After 461ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 94 ms.
[2024-06-02 23:29:59] [INFO ] After 775ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 40 ms.
Support contains 16 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 356/356 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 126 transition count 358
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 126 transition count 355
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 126 transition count 354
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 125 transition count 354
Applied a total of 7 rules in 20 ms. Remains 125 /127 variables (removed 2) and now considering 354/356 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 125/127 places, 354/356 transitions.
Incomplete random walk after 10000 steps, including 469 resets, run finished after 269 ms. (steps per millisecond=37 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 127 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 163 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 141 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 134 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 127 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 150 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 695872 steps, run timeout after 3001 ms. (steps per millisecond=231 ) properties seen :{0=1, 1=1, 2=1, 5=1, 7=1}
Probabilistic random walk after 695872 steps, saw 225860 distinct states, run finished after 3001 ms. (steps per millisecond=231 ) properties seen :5
Running SMT prover for 3 properties.
[2024-06-02 23:30:02] [INFO ] Flow matrix only has 339 transitions (discarded 15 similar events)
// Phase 1: matrix 339 rows 125 cols
[2024-06-02 23:30:02] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:30:02] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-02 23:30:02] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 23:30:03] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-06-02 23:30:03] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-02 23:30:03] [INFO ] After 56ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-06-02 23:30:03] [INFO ] After 120ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 34 ms.
[2024-06-02 23:30:03] [INFO ] After 300ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 354/354 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 124 transition count 324
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 124 transition count 324
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 124 transition count 323
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 123 transition count 324
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 123 transition count 321
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 12 place count 123 transition count 317
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 16 place count 119 transition count 317
Applied a total of 16 rules in 25 ms. Remains 119 /125 variables (removed 6) and now considering 317/354 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 119/125 places, 317/354 transitions.
Incomplete random walk after 10000 steps, including 523 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 145 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 143 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 152 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 602567 steps, run timeout after 3001 ms. (steps per millisecond=200 ) properties seen :{}
Probabilistic random walk after 602567 steps, saw 198975 distinct states, run finished after 3003 ms. (steps per millisecond=200 ) properties seen :0
Running SMT prover for 3 properties.
[2024-06-02 23:30:06] [INFO ] Flow matrix only has 306 transitions (discarded 11 similar events)
// Phase 1: matrix 306 rows 119 cols
[2024-06-02 23:30:06] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:30:06] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-02 23:30:06] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:30:06] [INFO ] After 77ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-06-02 23:30:06] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 23:30:06] [INFO ] After 48ms SMT Verify possible using 58 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-06-02 23:30:06] [INFO ] After 93ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 70 ms.
[2024-06-02 23:30:06] [INFO ] After 331ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 4 ms.
Support contains 6 out of 119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 317/317 transitions.
Applied a total of 0 rules in 6 ms. Remains 119 /119 variables (removed 0) and now considering 317/317 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 119/119 places, 317/317 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 317/317 transitions.
Applied a total of 0 rules in 6 ms. Remains 119 /119 variables (removed 0) and now considering 317/317 (removed 0) transitions.
[2024-06-02 23:30:06] [INFO ] Flow matrix only has 306 transitions (discarded 11 similar events)
[2024-06-02 23:30:06] [INFO ] Invariant cache hit.
[2024-06-02 23:30:06] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-06-02 23:30:06] [INFO ] Flow matrix only has 306 transitions (discarded 11 similar events)
[2024-06-02 23:30:06] [INFO ] Invariant cache hit.
[2024-06-02 23:30:07] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 23:30:07] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
[2024-06-02 23:30:07] [INFO ] Redundant transitions in 14 ms returned []
[2024-06-02 23:30:07] [INFO ] Flow matrix only has 306 transitions (discarded 11 similar events)
[2024-06-02 23:30:07] [INFO ] Invariant cache hit.
[2024-06-02 23:30:07] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 481 ms. Remains : 119/119 places, 317/317 transitions.
Graph (trivial) has 74 edges and 119 vertex of which 20 / 119 are part of one of the 3 SCC in 0 ms
Free SCC test removed 17 places
Drop transitions removed 55 transitions
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 92 transitions.
Graph (complete) has 429 edges and 102 vertex of which 100 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 6 place count 96 transition count 221
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 96 transition count 221
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 16 place count 96 transition count 215
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 1 with 11 rules applied. Total rules applied 27 place count 96 transition count 204
Free-agglomeration rule applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 96 transition count 201
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 33 place count 93 transition count 201
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 40 place count 93 transition count 201
Applied a total of 40 rules in 31 ms. Remains 93 /119 variables (removed 26) and now considering 201/317 (removed 116) transitions.
Running SMT prover for 3 properties.
[2024-06-02 23:30:07] [INFO ] Flow matrix only has 200 transitions (discarded 1 similar events)
// Phase 1: matrix 200 rows 93 cols
[2024-06-02 23:30:07] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:30:07] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-02 23:30:07] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 23:30:07] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-06-02 23:30:07] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-02 23:30:07] [INFO ] After 26ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-06-02 23:30:07] [INFO ] After 66ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 22 ms.
[2024-06-02 23:30:07] [INFO ] After 187ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
FORMULA FireWire-PT-17-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
FORMULA FireWire-PT-17-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 47 stabilizing places and 51 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(((p0 U p1) U (F(!p0)&&G(!p2)))))))'
Support contains 5 out of 308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 532/532 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 301 transition count 506
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 301 transition count 506
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 296 transition count 501
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 296 transition count 501
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 296 transition count 500
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 295 transition count 499
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 295 transition count 499
Applied a total of 27 rules in 8 ms. Remains 295 /308 variables (removed 13) and now considering 499/532 (removed 33) transitions.
// Phase 1: matrix 499 rows 295 cols
[2024-06-02 23:30:08] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:30:08] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-02 23:30:08] [INFO ] Invariant cache hit.
[2024-06-02 23:30:08] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
[2024-06-02 23:30:08] [INFO ] Invariant cache hit.
[2024-06-02 23:30:08] [INFO ] Dead Transitions using invariants and state equation in 177 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 295/308 places, 499/532 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 564 ms. Remains : 295/308 places, 499/532 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 452 ms :[(OR p0 p2), (OR p0 p2), (OR p0 p2), true, (NOT p1), p2, (OR p0 p2), p2, p0]
Running random walk in product with property : FireWire-PT-17-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR p0 (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(OR (AND p0 p2) (AND p2 p1)), acceptance={} source=2 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 8}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}], [{ cond=p2, acceptance={} source=5 dest: 3}, { cond=(NOT p2), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=6 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(OR (AND p0 p2) (AND p2 p1)), acceptance={0} source=6 dest: 6}, { cond=(OR (AND p0 (NOT p2)) (AND (NOT p2) p1)), acceptance={} source=6 dest: 7}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=7 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=7 dest: 5}, { cond=(OR (AND p0 p2) (AND p2 p1)), acceptance={0} source=7 dest: 6}, { cond=(OR (AND p0 (NOT p2)) (AND (NOT p2) p1)), acceptance={} source=7 dest: 7}], [{ cond=p0, acceptance={0} source=8 dest: 8}]], initial=0, aps=[p0:(AND (EQ s35 1) (EQ s101 1)), p2:(AND (EQ s47 1) (EQ s227 1)), p1:(EQ s46 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 253 ms.
Product exploration explored 100000 steps with 10 reset in 148 ms.
Computed a total of 42 stabilizing places and 46 stable transitions
Computed a total of 42 stabilizing places and 46 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (OR (AND p0 p2) (AND p2 p1))))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (OR p0 (NOT p2) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 184 ms. Reduced automaton from 9 states, 25 edges and 3 AP (stutter sensitive) to 9 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 431 ms :[(OR p0 p2), (OR p0 p2), (OR p0 p2), true, (NOT p1), p2, (OR p0 p2), p2, p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2024-06-02 23:30:10] [INFO ] Invariant cache hit.
[2024-06-02 23:30:10] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 23:30:10] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-06-02 23:30:10] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 23:30:11] [INFO ] After 224ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :6
[2024-06-02 23:30:11] [INFO ] Deduced a trap composed of 51 places in 102 ms of which 0 ms to minimize.
[2024-06-02 23:30:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2024-06-02 23:30:11] [INFO ] After 581ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :6
Attempting to minimize the solution found.
Minimization took 122 ms.
[2024-06-02 23:30:11] [INFO ] After 808ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :6
Fused 8 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 28 ms.
Support contains 5 out of 295 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 295/295 places, 499/499 transitions.
Graph (trivial) has 225 edges and 295 vertex of which 18 / 295 are part of one of the 3 SCC in 0 ms
Free SCC test removed 15 places
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 280 transition count 429
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 53 rules applied. Total rules applied 103 place count 231 transition count 425
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 105 place count 229 transition count 425
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 105 place count 229 transition count 393
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 169 place count 197 transition count 393
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 225 place count 169 transition count 365
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -126
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 283 place count 140 transition count 491
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 289 place count 140 transition count 485
Drop transitions removed 55 transitions
Redundant transition composition rules discarded 55 transitions
Iterating global reduction 4 with 55 rules applied. Total rules applied 344 place count 140 transition count 430
Free-agglomeration rule applied 20 times.
Iterating global reduction 4 with 20 rules applied. Total rules applied 364 place count 140 transition count 410
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 26 rules applied. Total rules applied 390 place count 120 transition count 404
Drop transitions removed 55 transitions
Redundant transition composition rules discarded 55 transitions
Iterating global reduction 5 with 55 rules applied. Total rules applied 445 place count 120 transition count 349
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 448 place count 120 transition count 349
Applied a total of 448 rules in 44 ms. Remains 120 /295 variables (removed 175) and now considering 349/499 (removed 150) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 120/295 places, 349/499 transitions.
Incomplete random walk after 10000 steps, including 481 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 123 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 134 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 166 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Finished probabilistic random walk after 88536 steps, run visited all 6 properties in 554 ms. (steps per millisecond=159 )
Probabilistic random walk after 88536 steps, saw 33456 distinct states, run finished after 554 ms. (steps per millisecond=159 ) properties seen :6
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (OR (AND p0 p2) (AND p2 p1))))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (OR p0 (NOT p2) p1))), (G (NOT (OR (AND p0 p2) (AND p1 p2)))), (G (NOT (AND p0 (NOT p1) p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p2))), (F (NOT (OR p0 p1 (NOT p2)))), (F (AND (NOT p0) (NOT p1) p2)), (F p2), (F p0), (F (AND p0 (NOT p1))), (F (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))]
Knowledge based reduction with 9 factoid took 477 ms. Reduced automaton from 9 states, 25 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(OR p2 p0), (OR p2 p0), (OR p2 p0), true, p0]
Stuttering acceptance computed with spot in 192 ms :[(OR p2 p0), (OR p2 p0), (OR p2 p0), true, p0]
Support contains 4 out of 295 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 295/295 places, 499/499 transitions.
Applied a total of 0 rules in 2 ms. Remains 295 /295 variables (removed 0) and now considering 499/499 (removed 0) transitions.
[2024-06-02 23:30:13] [INFO ] Invariant cache hit.
[2024-06-02 23:30:13] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-06-02 23:30:13] [INFO ] Invariant cache hit.
[2024-06-02 23:30:13] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 453 ms to find 0 implicit places.
[2024-06-02 23:30:13] [INFO ] Invariant cache hit.
[2024-06-02 23:30:14] [INFO ] Dead Transitions using invariants and state equation in 203 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 686 ms. Remains : 295/295 places, 499/499 transitions.
Computed a total of 42 stabilizing places and 46 stable transitions
Computed a total of 42 stabilizing places and 46 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(OR p2 p0), (OR p2 p0), (OR p2 p0), true, p0]
Incomplete random walk after 10000 steps, including 5 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 617670 steps, run timeout after 3001 ms. (steps per millisecond=205 ) properties seen :{}
Probabilistic random walk after 617670 steps, saw 123029 distinct states, run finished after 3001 ms. (steps per millisecond=205 ) properties seen :0
Running SMT prover for 3 properties.
[2024-06-02 23:30:17] [INFO ] Invariant cache hit.
[2024-06-02 23:30:17] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 23:30:17] [INFO ] After 115ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2024-06-02 23:30:17] [INFO ] Deduced a trap composed of 51 places in 93 ms of which 0 ms to minimize.
[2024-06-02 23:30:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2024-06-02 23:30:17] [INFO ] After 267ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-02 23:30:17] [INFO ] After 374ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-02 23:30:17] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:30:18] [INFO ] After 154ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-06-02 23:30:18] [INFO ] Deduced a trap composed of 51 places in 99 ms of which 0 ms to minimize.
[2024-06-02 23:30:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2024-06-02 23:30:18] [INFO ] After 359ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 58 ms.
[2024-06-02 23:30:18] [INFO ] After 486ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 295 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 295/295 places, 499/499 transitions.
Graph (trivial) has 229 edges and 295 vertex of which 18 / 295 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 280 transition count 429
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 53 rules applied. Total rules applied 103 place count 231 transition count 425
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 105 place count 229 transition count 425
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 105 place count 229 transition count 392
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 171 place count 196 transition count 392
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 227 place count 168 transition count 364
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -126
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 285 place count 139 transition count 490
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 291 place count 139 transition count 484
Drop transitions removed 55 transitions
Redundant transition composition rules discarded 55 transitions
Iterating global reduction 4 with 55 rules applied. Total rules applied 346 place count 139 transition count 429
Free-agglomeration rule applied 21 times.
Iterating global reduction 4 with 21 rules applied. Total rules applied 367 place count 139 transition count 408
Reduce places removed 21 places and 0 transitions.
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 27 rules applied. Total rules applied 394 place count 118 transition count 402
Drop transitions removed 55 transitions
Redundant transition composition rules discarded 55 transitions
Iterating global reduction 5 with 55 rules applied. Total rules applied 449 place count 118 transition count 347
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 451 place count 118 transition count 347
Applied a total of 451 rules in 38 ms. Remains 118 /295 variables (removed 177) and now considering 347/499 (removed 152) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 118/295 places, 347/499 transitions.
Incomplete random walk after 10000 steps, including 528 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 180 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Finished probabilistic random walk after 14747 steps, run visited all 3 properties in 78 ms. (steps per millisecond=189 )
Probabilistic random walk after 14747 steps, saw 5533 distinct states, run finished after 79 ms. (steps per millisecond=186 ) properties seen :3
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p2)))]
False Knowledge obtained : [(F p2), (F p0), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 3 factoid took 214 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(OR p2 p0), (OR p2 p0), (OR p2 p0), true, p0]
Stuttering acceptance computed with spot in 182 ms :[(OR p2 p0), (OR p2 p0), (OR p2 p0), true, p0]
Stuttering acceptance computed with spot in 165 ms :[(OR p2 p0), (OR p2 p0), (OR p2 p0), true, p0]
Product exploration explored 100000 steps with 1 reset in 118 ms.
Product exploration explored 100000 steps with 1 reset in 115 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 183 ms :[(OR p2 p0), (OR p2 p0), (OR p2 p0), true, p0]
Support contains 4 out of 295 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 295/295 places, 499/499 transitions.
Graph (trivial) has 229 edges and 295 vertex of which 18 / 295 are part of one of the 3 SCC in 2 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 280 transition count 483
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 50 place count 280 transition count 481
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 50 place count 280 transition count 501
Deduced a syphon composed of 65 places in 1 ms
Iterating global reduction 2 with 18 rules applied. Total rules applied 68 place count 280 transition count 501
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 83 place count 265 transition count 486
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 2 with 15 rules applied. Total rules applied 98 place count 265 transition count 486
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 88 places in 0 ms
Iterating global reduction 2 with 38 rules applied. Total rules applied 136 place count 265 transition count 488
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 156 place count 245 transition count 468
Deduced a syphon composed of 68 places in 0 ms
Iterating global reduction 2 with 20 rules applied. Total rules applied 176 place count 245 transition count 468
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: -241
Deduced a syphon composed of 105 places in 0 ms
Iterating global reduction 2 with 37 rules applied. Total rules applied 213 place count 245 transition count 709
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 223 place count 235 transition count 687
Deduced a syphon composed of 95 places in 0 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 233 place count 235 transition count 687
Deduced a syphon composed of 95 places in 0 ms
Drop transitions removed 55 transitions
Redundant transition composition rules discarded 55 transitions
Iterating global reduction 2 with 55 rules applied. Total rules applied 288 place count 235 transition count 632
Deduced a syphon composed of 95 places in 0 ms
Applied a total of 288 rules in 63 ms. Remains 235 /295 variables (removed 60) and now considering 632/499 (removed -133) transitions.
[2024-06-02 23:30:20] [INFO ] Redundant transitions in 44 ms returned []
[2024-06-02 23:30:20] [INFO ] Flow matrix only has 612 transitions (discarded 20 similar events)
// Phase 1: matrix 612 rows 235 cols
[2024-06-02 23:30:20] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:30:20] [INFO ] Dead Transitions using invariants and state equation in 211 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 235/295 places, 632/499 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 326 ms. Remains : 235/295 places, 632/499 transitions.
Built C files in :
/tmp/ltsmin15254652253147786127
[2024-06-02 23:30:20] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15254652253147786127
Running compilation step : cd /tmp/ltsmin15254652253147786127;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 909 ms.
Running link step : cd /tmp/ltsmin15254652253147786127;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin15254652253147786127;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3951737329687244226.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 295 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 295/295 places, 499/499 transitions.
Applied a total of 0 rules in 6 ms. Remains 295 /295 variables (removed 0) and now considering 499/499 (removed 0) transitions.
// Phase 1: matrix 499 rows 295 cols
[2024-06-02 23:30:35] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:30:35] [INFO ] Implicit Places using invariants in 197 ms returned []
[2024-06-02 23:30:35] [INFO ] Invariant cache hit.
[2024-06-02 23:30:36] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 572 ms to find 0 implicit places.
[2024-06-02 23:30:36] [INFO ] Invariant cache hit.
[2024-06-02 23:30:36] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 772 ms. Remains : 295/295 places, 499/499 transitions.
Built C files in :
/tmp/ltsmin10389657261401664058
[2024-06-02 23:30:36] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10389657261401664058
Running compilation step : cd /tmp/ltsmin10389657261401664058;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 678 ms.
Running link step : cd /tmp/ltsmin10389657261401664058;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin10389657261401664058;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8636157761303898528.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-06-02 23:30:51] [INFO ] Flatten gal took : 27 ms
[2024-06-02 23:30:51] [INFO ] Flatten gal took : 25 ms
[2024-06-02 23:30:51] [INFO ] Time to serialize gal into /tmp/LTL1196009667283733583.gal : 5 ms
[2024-06-02 23:30:51] [INFO ] Time to serialize properties into /tmp/LTL8525594606344991153.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1196009667283733583.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9618979337852811253.hoa' '-atoms' '/tmp/LTL8525594606344991153.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL8525594606344991153.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9618979337852811253.hoa
Detected timeout of ITS tools.
[2024-06-02 23:31:06] [INFO ] Flatten gal took : 20 ms
[2024-06-02 23:31:06] [INFO ] Flatten gal took : 21 ms
[2024-06-02 23:31:06] [INFO ] Time to serialize gal into /tmp/LTL10221275934141424342.gal : 9 ms
[2024-06-02 23:31:06] [INFO ] Time to serialize properties into /tmp/LTL13549802901254829135.ltl : 4 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10221275934141424342.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13549802901254829135.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(G((("((p57==1)&&(p150==1))")U("(p75==1)"))U((F(!("((p57==1)&&(p150==1))")))&&(G(!("((p77==1)&&(p330==1))")))))))))
Formula 0 simplified : XXF((!"((p57==1)&&(p150==1))" R !"(p75==1)") R (G"((p57==1)&&(p150==1))" | F"((p77==1)&&(p330==1))"))
Detected timeout of ITS tools.
[2024-06-02 23:31:21] [INFO ] Flatten gal took : 21 ms
[2024-06-02 23:31:21] [INFO ] Applying decomposition
[2024-06-02 23:31:21] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph2964301840132859320.txt' '-o' '/tmp/graph2964301840132859320.bin' '-w' '/tmp/graph2964301840132859320.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2964301840132859320.bin' '-l' '-1' '-v' '-w' '/tmp/graph2964301840132859320.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:31:21] [INFO ] Decomposing Gal with order
[2024-06-02 23:31:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:31:21] [INFO ] Removed a total of 526 redundant transitions.
[2024-06-02 23:31:21] [INFO ] Flatten gal took : 67 ms
[2024-06-02 23:31:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 37 labels/synchronizations in 7 ms.
[2024-06-02 23:31:21] [INFO ] Time to serialize gal into /tmp/LTL15378268139037156558.gal : 6 ms
[2024-06-02 23:31:21] [INFO ] Time to serialize properties into /tmp/LTL784208153695246460.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15378268139037156558.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL784208153695246460.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(G((("((i3.u13.p57==1)&&(i2.u37.p150==1))")U("(i1.u18.p75==1)"))U((F(!("((i3.u13.p57==1)&&(i2.u37.p150==1))")))&&(G(!("((i1.u18....191
Formula 0 simplified : XXF((!"((i3.u13.p57==1)&&(i2.u37.p150==1))" R !"(i1.u18.p75==1)") R (G"((i3.u13.p57==1)&&(i2.u37.p150==1))" | F"((i1.u18.p77==1)&&(i...173
Reverse transition relation is NOT exact ! Due to transitions t27, t124, t230, t243, t245, t254, t258, t279, t281, t282, t297, t354, t367, t371, t372, t380...1128
Computing Next relation with stutter on 3.69226e+06 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5145524528509164322
[2024-06-02 23:31:36] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5145524528509164322
Running compilation step : cd /tmp/ltsmin5145524528509164322;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 664 ms.
Running link step : cd /tmp/ltsmin5145524528509164322;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin5145524528509164322;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X([]((((LTLAPp0==true) U (LTLAPp1==true)) U (<>(!(LTLAPp0==true))&&[](!(LTLAPp2==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FireWire-PT-17-LTLFireability-01 finished in 104060 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&F(p1)))))'
Support contains 4 out of 308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 532/532 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 301 transition count 506
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 301 transition count 506
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 297 transition count 502
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 297 transition count 502
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 297 transition count 501
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 296 transition count 500
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 296 transition count 500
Applied a total of 25 rules in 17 ms. Remains 296 /308 variables (removed 12) and now considering 500/532 (removed 32) transitions.
// Phase 1: matrix 500 rows 296 cols
[2024-06-02 23:31:52] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:31:52] [INFO ] Implicit Places using invariants in 435 ms returned []
[2024-06-02 23:31:52] [INFO ] Invariant cache hit.
[2024-06-02 23:31:52] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 724 ms to find 0 implicit places.
[2024-06-02 23:31:52] [INFO ] Invariant cache hit.
[2024-06-02 23:31:52] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 296/308 places, 500/532 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 906 ms. Remains : 296/308 places, 500/532 transitions.
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : FireWire-PT-17-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s17 0) (EQ s71 0)), p1:(OR (EQ s73 0) (EQ s135 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 116 ms.
Product exploration explored 100000 steps with 0 reset in 115 ms.
Computed a total of 42 stabilizing places and 46 stable transitions
Computed a total of 42 stabilizing places and 46 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), true, (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 87 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 292 ms. (steps per millisecond=34 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 933979 steps, run timeout after 3001 ms. (steps per millisecond=311 ) properties seen :{}
Probabilistic random walk after 933979 steps, saw 180869 distinct states, run finished after 3001 ms. (steps per millisecond=311 ) properties seen :0
Running SMT prover for 3 properties.
[2024-06-02 23:31:56] [INFO ] Invariant cache hit.
[2024-06-02 23:31:57] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-02 23:31:57] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 23:31:57] [INFO ] After 150ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-06-02 23:31:57] [INFO ] Deduced a trap composed of 72 places in 49 ms of which 1 ms to minimize.
[2024-06-02 23:31:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2024-06-02 23:31:57] [INFO ] After 309ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 65 ms.
[2024-06-02 23:31:57] [INFO ] After 454ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 500/500 transitions.
Graph (trivial) has 231 edges and 296 vertex of which 18 / 296 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 281 transition count 429
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 54 rules applied. Total rules applied 105 place count 231 transition count 425
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 107 place count 229 transition count 425
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 107 place count 229 transition count 393
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 171 place count 197 transition count 393
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 172 place count 196 transition count 373
Iterating global reduction 3 with 1 rules applied. Total rules applied 173 place count 196 transition count 373
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 174 place count 196 transition count 372
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 230 place count 168 transition count 344
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: -99
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 292 place count 137 transition count 443
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 298 place count 137 transition count 437
Drop transitions removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 5 with 36 rules applied. Total rules applied 334 place count 137 transition count 401
Free-agglomeration rule applied 19 times.
Iterating global reduction 5 with 19 rules applied. Total rules applied 353 place count 137 transition count 382
Reduce places removed 19 places and 0 transitions.
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 25 rules applied. Total rules applied 378 place count 118 transition count 376
Drop transitions removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 6 with 56 rules applied. Total rules applied 434 place count 118 transition count 320
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 436 place count 118 transition count 320
Applied a total of 436 rules in 43 ms. Remains 118 /296 variables (removed 178) and now considering 320/500 (removed 180) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 118/296 places, 320/500 transitions.
Incomplete random walk after 10000 steps, including 550 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 151 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 152 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 151 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 647801 steps, run timeout after 3002 ms. (steps per millisecond=215 ) properties seen :{}
Probabilistic random walk after 647801 steps, saw 192179 distinct states, run finished after 3002 ms. (steps per millisecond=215 ) properties seen :0
Running SMT prover for 3 properties.
[2024-06-02 23:32:00] [INFO ] Flow matrix only has 283 transitions (discarded 37 similar events)
// Phase 1: matrix 283 rows 118 cols
[2024-06-02 23:32:00] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:32:00] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-02 23:32:00] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 23:32:00] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-06-02 23:32:00] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-06-02 23:32:01] [INFO ] After 50ms SMT Verify possible using 63 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-06-02 23:32:01] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
[2024-06-02 23:32:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2024-06-02 23:32:01] [INFO ] After 154ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 49 ms.
[2024-06-02 23:32:01] [INFO ] After 350ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 320/320 transitions.
Applied a total of 0 rules in 4 ms. Remains 118 /118 variables (removed 0) and now considering 320/320 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 118/118 places, 320/320 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 320/320 transitions.
Applied a total of 0 rules in 3 ms. Remains 118 /118 variables (removed 0) and now considering 320/320 (removed 0) transitions.
[2024-06-02 23:32:01] [INFO ] Flow matrix only has 283 transitions (discarded 37 similar events)
[2024-06-02 23:32:01] [INFO ] Invariant cache hit.
[2024-06-02 23:32:01] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-02 23:32:01] [INFO ] Flow matrix only has 283 transitions (discarded 37 similar events)
[2024-06-02 23:32:01] [INFO ] Invariant cache hit.
[2024-06-02 23:32:01] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-06-02 23:32:01] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
[2024-06-02 23:32:01] [INFO ] Redundant transitions in 2 ms returned []
[2024-06-02 23:32:01] [INFO ] Flow matrix only has 283 transitions (discarded 37 similar events)
[2024-06-02 23:32:01] [INFO ] Invariant cache hit.
[2024-06-02 23:32:01] [INFO ] Dead Transitions using invariants and state equation in 267 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 666 ms. Remains : 118/118 places, 320/320 transitions.
Graph (trivial) has 109 edges and 118 vertex of which 20 / 118 are part of one of the 3 SCC in 0 ms
Free SCC test removed 17 places
Drop transitions removed 77 transitions
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 91 transitions.
Graph (complete) has 441 edges and 101 vertex of which 99 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 6 place count 95 transition count 225
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 95 transition count 225
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 14 place count 95 transition count 221
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 94 transition count 220
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 20 place count 92 transition count 224
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 28 place count 92 transition count 216
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 2 with 10 rules applied. Total rules applied 38 place count 92 transition count 206
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 40 place count 92 transition count 204
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 42 place count 90 transition count 204
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 48 place count 87 transition count 201
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 54 place count 87 transition count 195
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 55 place count 87 transition count 194
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 57 place count 86 transition count 193
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 58 place count 85 transition count 171
Iterating global reduction 5 with 1 rules applied. Total rules applied 59 place count 85 transition count 171
Free-agglomeration rule applied 5 times.
Iterating global reduction 5 with 5 rules applied. Total rules applied 64 place count 85 transition count 166
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 69 place count 80 transition count 166
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 73 place count 80 transition count 162
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 75 place count 80 transition count 160
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 77 place count 78 transition count 160
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 81 place count 78 transition count 160
Applied a total of 81 rules in 40 ms. Remains 78 /118 variables (removed 40) and now considering 160/320 (removed 160) transitions.
Running SMT prover for 3 properties.
[2024-06-02 23:32:01] [INFO ] Flow matrix only has 158 transitions (discarded 2 similar events)
// Phase 1: matrix 158 rows 78 cols
[2024-06-02 23:32:01] [INFO ] Computed 7 invariants in 0 ms
[2024-06-02 23:32:02] [INFO ] After 135ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-02 23:32:02] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 23:32:02] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-06-02 23:32:02] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-02 23:32:02] [INFO ] After 21ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-06-02 23:32:02] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
[2024-06-02 23:32:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2024-06-02 23:32:02] [INFO ] After 78ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 18 ms.
[2024-06-02 23:32:02] [INFO ] After 165ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), true, (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 94 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 66 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
Support contains 4 out of 296 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 296/296 places, 500/500 transitions.
Graph (trivial) has 231 edges and 296 vertex of which 18 / 296 are part of one of the 3 SCC in 0 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 280 transition count 435
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 52 rules applied. Total rules applied 101 place count 232 transition count 431
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 103 place count 230 transition count 431
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 103 place count 230 transition count 399
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 167 place count 198 transition count 399
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 168 place count 197 transition count 379
Iterating global reduction 3 with 1 rules applied. Total rules applied 169 place count 197 transition count 379
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 170 place count 197 transition count 378
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 224 place count 170 transition count 351
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: -104
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 4 with 66 rules applied. Total rules applied 290 place count 137 transition count 455
Drop transitions removed 42 transitions
Redundant transition composition rules discarded 42 transitions
Iterating global reduction 4 with 42 rules applied. Total rules applied 332 place count 137 transition count 413
Applied a total of 332 rules in 44 ms. Remains 137 /296 variables (removed 159) and now considering 413/500 (removed 87) transitions.
[2024-06-02 23:32:02] [INFO ] Flow matrix only has 394 transitions (discarded 19 similar events)
// Phase 1: matrix 394 rows 137 cols
[2024-06-02 23:32:02] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:32:02] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-06-02 23:32:02] [INFO ] Flow matrix only has 394 transitions (discarded 19 similar events)
[2024-06-02 23:32:02] [INFO ] Invariant cache hit.
[2024-06-02 23:32:02] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 23:32:02] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
[2024-06-02 23:32:02] [INFO ] Redundant transitions in 16 ms returned []
[2024-06-02 23:32:02] [INFO ] Flow matrix only has 394 transitions (discarded 19 similar events)
[2024-06-02 23:32:02] [INFO ] Invariant cache hit.
[2024-06-02 23:32:03] [INFO ] Dead Transitions using invariants and state equation in 202 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 137/296 places, 413/500 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 706 ms. Remains : 137/296 places, 413/500 transitions.
Computed a total of 5 stabilizing places and 17 stable transitions
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND p0 (NOT p1)))), (X p0), true, (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 122 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 809 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 177 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 180 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 176 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 862583 steps, run timeout after 3001 ms. (steps per millisecond=287 ) properties seen :{0=1}
Probabilistic random walk after 862583 steps, saw 239313 distinct states, run finished after 3003 ms. (steps per millisecond=287 ) properties seen :1
Running SMT prover for 2 properties.
[2024-06-02 23:32:06] [INFO ] Flow matrix only has 394 transitions (discarded 19 similar events)
[2024-06-02 23:32:06] [INFO ] Invariant cache hit.
[2024-06-02 23:32:06] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 23:32:06] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:32:06] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-02 23:32:06] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 23:32:06] [INFO ] After 59ms SMT Verify possible using 61 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-06-02 23:32:06] [INFO ] After 98ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 51 ms.
[2024-06-02 23:32:06] [INFO ] After 292ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 137 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 137/137 places, 413/413 transitions.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 137 transition count 410
Free-agglomeration rule applied 19 times.
Iterating global reduction 1 with 19 rules applied. Total rules applied 22 place count 137 transition count 391
Reduce places removed 19 places and 0 transitions.
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 47 place count 118 transition count 385
Drop transitions removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 2 with 56 rules applied. Total rules applied 103 place count 118 transition count 329
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 107 place count 118 transition count 329
Applied a total of 107 rules in 27 ms. Remains 118 /137 variables (removed 19) and now considering 329/413 (removed 84) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 118/137 places, 329/413 transitions.
Incomplete random walk after 10000 steps, including 611 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 144 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 148 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Finished probabilistic random walk after 236711 steps, run visited all 2 properties in 779 ms. (steps per millisecond=303 )
Probabilistic random walk after 236711 steps, saw 83679 distinct states, run finished after 781 ms. (steps per millisecond=303 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND p0 (NOT p1)))), (X p0), true, (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND (NOT p1) p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 8 factoid took 118 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-17-LTLFireability-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-17-LTLFireability-02 finished in 15833 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(X((p1&&G(p2))))))))'
Support contains 5 out of 308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 532/532 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 301 transition count 506
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 301 transition count 506
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 296 transition count 501
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 296 transition count 501
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 296 transition count 500
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 295 transition count 499
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 295 transition count 499
Applied a total of 27 rules in 13 ms. Remains 295 /308 variables (removed 13) and now considering 499/532 (removed 33) transitions.
// Phase 1: matrix 499 rows 295 cols
[2024-06-02 23:32:07] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:32:07] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-06-02 23:32:08] [INFO ] Invariant cache hit.
[2024-06-02 23:32:08] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
[2024-06-02 23:32:08] [INFO ] Invariant cache hit.
[2024-06-02 23:32:08] [INFO ] Dead Transitions using invariants and state equation in 188 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 295/308 places, 499/532 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 623 ms. Remains : 295/308 places, 499/532 transitions.
Stuttering acceptance computed with spot in 186 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : FireWire-PT-17-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p1 p2), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s8 1) (EQ s123 1)), p1:(EQ s253 1), p2:(AND (EQ s33 1) (EQ s205 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-17-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-17-LTLFireability-03 finished in 826 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 308 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 308/308 places, 532/532 transitions.
Graph (trivial) has 240 edges and 308 vertex of which 18 / 308 are part of one of the 3 SCC in 0 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 292 transition count 463
Reduce places removed 52 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 54 rules applied. Total rules applied 107 place count 240 transition count 461
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 108 place count 239 transition count 461
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 108 place count 239 transition count 432
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 166 place count 210 transition count 432
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 170 place count 206 transition count 409
Iterating global reduction 3 with 4 rules applied. Total rules applied 174 place count 206 transition count 409
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 174 place count 206 transition count 406
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 180 place count 203 transition count 406
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 182 place count 201 transition count 404
Iterating global reduction 3 with 2 rules applied. Total rules applied 184 place count 201 transition count 404
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 186 place count 201 transition count 402
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 187 place count 200 transition count 402
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 5 with 56 rules applied. Total rules applied 243 place count 172 transition count 374
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 244 place count 171 transition count 354
Iterating global reduction 5 with 1 rules applied. Total rules applied 245 place count 171 transition count 354
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 246 place count 171 transition count 353
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: -106
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 6 with 66 rules applied. Total rules applied 312 place count 138 transition count 459
Drop transitions removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 6 with 39 rules applied. Total rules applied 351 place count 138 transition count 420
Applied a total of 351 rules in 53 ms. Remains 138 /308 variables (removed 170) and now considering 420/532 (removed 112) transitions.
[2024-06-02 23:32:08] [INFO ] Flow matrix only has 404 transitions (discarded 16 similar events)
// Phase 1: matrix 404 rows 138 cols
[2024-06-02 23:32:08] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:32:08] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-06-02 23:32:08] [INFO ] Flow matrix only has 404 transitions (discarded 16 similar events)
[2024-06-02 23:32:08] [INFO ] Invariant cache hit.
[2024-06-02 23:32:08] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-06-02 23:32:09] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
[2024-06-02 23:32:09] [INFO ] Redundant transitions in 20 ms returned []
[2024-06-02 23:32:09] [INFO ] Flow matrix only has 404 transitions (discarded 16 similar events)
[2024-06-02 23:32:09] [INFO ] Invariant cache hit.
[2024-06-02 23:32:09] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 138/308 places, 420/532 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 613 ms. Remains : 138/308 places, 420/532 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FireWire-PT-17-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s11 0) (EQ s108 0)), p1:(EQ s136 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-17-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-17-LTLFireability-05 finished in 743 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 2 out of 308 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 308/308 places, 532/532 transitions.
Graph (trivial) has 239 edges and 308 vertex of which 18 / 308 are part of one of the 3 SCC in 0 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 292 transition count 463
Reduce places removed 52 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 56 rules applied. Total rules applied 109 place count 240 transition count 459
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 111 place count 238 transition count 459
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 111 place count 238 transition count 428
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 173 place count 207 transition count 428
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 176 place count 204 transition count 406
Iterating global reduction 3 with 3 rules applied. Total rules applied 179 place count 204 transition count 406
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 179 place count 204 transition count 405
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 181 place count 203 transition count 405
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 182 place count 202 transition count 404
Iterating global reduction 3 with 1 rules applied. Total rules applied 183 place count 202 transition count 404
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 185 place count 202 transition count 402
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 186 place count 201 transition count 402
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 244 place count 172 transition count 373
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 245 place count 171 transition count 353
Iterating global reduction 5 with 1 rules applied. Total rules applied 246 place count 171 transition count 353
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 247 place count 171 transition count 352
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: -104
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 6 with 66 rules applied. Total rules applied 313 place count 138 transition count 456
Drop transitions removed 42 transitions
Redundant transition composition rules discarded 42 transitions
Iterating global reduction 6 with 42 rules applied. Total rules applied 355 place count 138 transition count 414
Applied a total of 355 rules in 50 ms. Remains 138 /308 variables (removed 170) and now considering 414/532 (removed 118) transitions.
[2024-06-02 23:32:09] [INFO ] Flow matrix only has 395 transitions (discarded 19 similar events)
// Phase 1: matrix 395 rows 138 cols
[2024-06-02 23:32:09] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:32:09] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-06-02 23:32:09] [INFO ] Flow matrix only has 395 transitions (discarded 19 similar events)
[2024-06-02 23:32:09] [INFO ] Invariant cache hit.
[2024-06-02 23:32:09] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 23:32:09] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
[2024-06-02 23:32:09] [INFO ] Redundant transitions in 17 ms returned []
[2024-06-02 23:32:09] [INFO ] Flow matrix only has 395 transitions (discarded 19 similar events)
[2024-06-02 23:32:09] [INFO ] Invariant cache hit.
[2024-06-02 23:32:10] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 138/308 places, 414/532 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 606 ms. Remains : 138/308 places, 414/532 transitions.
Stuttering acceptance computed with spot in 49 ms :[true, (NOT p0)]
Running random walk in product with property : FireWire-PT-17-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (EQ s9 0) (EQ s69 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 88 ms.
Product exploration explored 100000 steps with 0 reset in 77 ms.
Computed a total of 5 stabilizing places and 17 stable transitions
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 146 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 794 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 171 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4448 steps, run visited all 1 properties in 16 ms. (steps per millisecond=278 )
Probabilistic random walk after 4448 steps, saw 1687 distinct states, run finished after 16 ms. (steps per millisecond=278 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 4 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-17-LTLFireability-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-17-LTLFireability-06 finished in 1153 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 308 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 308/308 places, 532/532 transitions.
Graph (trivial) has 236 edges and 308 vertex of which 18 / 308 are part of one of the 3 SCC in 0 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 292 transition count 466
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 51 rules applied. Total rules applied 101 place count 243 transition count 464
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 4 rules applied. Total rules applied 105 place count 242 transition count 461
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 110 place count 239 transition count 459
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 111 place count 238 transition count 459
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 28 Pre rules applied. Total rules applied 111 place count 238 transition count 431
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 5 with 56 rules applied. Total rules applied 167 place count 210 transition count 431
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 171 place count 206 transition count 408
Iterating global reduction 5 with 4 rules applied. Total rules applied 175 place count 206 transition count 408
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 175 place count 206 transition count 405
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 181 place count 203 transition count 405
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 183 place count 201 transition count 403
Iterating global reduction 5 with 2 rules applied. Total rules applied 185 place count 201 transition count 403
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 187 place count 201 transition count 401
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 188 place count 200 transition count 401
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 7 with 56 rules applied. Total rules applied 244 place count 172 transition count 373
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 245 place count 171 transition count 353
Iterating global reduction 7 with 1 rules applied. Total rules applied 246 place count 171 transition count 353
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 247 place count 171 transition count 352
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: -101
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 8 with 64 rules applied. Total rules applied 311 place count 139 transition count 453
Drop transitions removed 42 transitions
Redundant transition composition rules discarded 42 transitions
Iterating global reduction 8 with 42 rules applied. Total rules applied 353 place count 139 transition count 411
Applied a total of 353 rules in 29 ms. Remains 139 /308 variables (removed 169) and now considering 411/532 (removed 121) transitions.
[2024-06-02 23:32:10] [INFO ] Flow matrix only has 392 transitions (discarded 19 similar events)
// Phase 1: matrix 392 rows 139 cols
[2024-06-02 23:32:10] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:32:10] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-06-02 23:32:10] [INFO ] Flow matrix only has 392 transitions (discarded 19 similar events)
[2024-06-02 23:32:10] [INFO ] Invariant cache hit.
[2024-06-02 23:32:10] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 23:32:11] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
[2024-06-02 23:32:11] [INFO ] Redundant transitions in 2 ms returned []
[2024-06-02 23:32:11] [INFO ] Flow matrix only has 392 transitions (discarded 19 similar events)
[2024-06-02 23:32:11] [INFO ] Invariant cache hit.
[2024-06-02 23:32:11] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 139/308 places, 411/532 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 626 ms. Remains : 139/308 places, 411/532 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-17-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s138 1) (EQ s130 1) (AND (EQ s64 1) (EQ s73 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-17-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-17-LTLFireability-07 finished in 718 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&(X(F(p1))||G(p2))))'
Support contains 5 out of 308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 532/532 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 303 transition count 527
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 303 transition count 527
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 299 transition count 523
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 299 transition count 523
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 299 transition count 522
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 298 transition count 521
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 298 transition count 521
Applied a total of 21 rules in 8 ms. Remains 298 /308 variables (removed 10) and now considering 521/532 (removed 11) transitions.
// Phase 1: matrix 521 rows 298 cols
[2024-06-02 23:32:11] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:32:11] [INFO ] Implicit Places using invariants in 194 ms returned []
[2024-06-02 23:32:11] [INFO ] Invariant cache hit.
[2024-06-02 23:32:11] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 530 ms to find 0 implicit places.
[2024-06-02 23:32:11] [INFO ] Invariant cache hit.
[2024-06-02 23:32:12] [INFO ] Dead Transitions using invariants and state equation in 191 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 298/308 places, 521/532 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 743 ms. Remains : 298/308 places, 521/532 transitions.
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), true]
Running random walk in product with property : FireWire-PT-17-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(OR (EQ s36 0) (EQ s210 0)), p0:(OR (AND (EQ s36 1) (EQ s210 1)) (EQ s21 1) (AND (EQ s36 1) (EQ s210 1))), p1:(AND (EQ s41 1) (EQ s232 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 97 steps with 1 reset in 1 ms.
FORMULA FireWire-PT-17-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-17-LTLFireability-08 finished in 893 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(p1))))'
Support contains 2 out of 308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 532/532 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 302 transition count 507
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 302 transition count 507
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 297 transition count 502
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 297 transition count 502
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 297 transition count 501
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 296 transition count 500
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 296 transition count 500
Applied a total of 25 rules in 8 ms. Remains 296 /308 variables (removed 12) and now considering 500/532 (removed 32) transitions.
// Phase 1: matrix 500 rows 296 cols
[2024-06-02 23:32:12] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:32:12] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-06-02 23:32:12] [INFO ] Invariant cache hit.
[2024-06-02 23:32:12] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 458 ms to find 0 implicit places.
[2024-06-02 23:32:12] [INFO ] Invariant cache hit.
[2024-06-02 23:32:12] [INFO ] Dead Transitions using invariants and state equation in 188 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 296/308 places, 500/532 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 655 ms. Remains : 296/308 places, 500/532 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : FireWire-PT-17-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(EQ s110 1), p0:(EQ s34 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-17-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-17-LTLFireability-09 finished in 803 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0)&&X(p1)) U X(X(G((p2||X(!p3)))))))'
Support contains 7 out of 308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 532/532 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 301 transition count 506
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 301 transition count 506
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 296 transition count 501
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 296 transition count 501
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 296 transition count 500
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 295 transition count 499
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 295 transition count 499
Applied a total of 27 rules in 7 ms. Remains 295 /308 variables (removed 13) and now considering 499/532 (removed 33) transitions.
// Phase 1: matrix 499 rows 295 cols
[2024-06-02 23:32:13] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:32:13] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-06-02 23:32:13] [INFO ] Invariant cache hit.
[2024-06-02 23:32:13] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
[2024-06-02 23:32:13] [INFO ] Invariant cache hit.
[2024-06-02 23:32:13] [INFO ] Dead Transitions using invariants and state equation in 195 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 295/308 places, 499/532 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 588 ms. Remains : 295/308 places, 499/532 transitions.
Stuttering acceptance computed with spot in 472 ms :[(AND (NOT p2) p3), (AND p3 (NOT p2)), (AND p3 (NOT p2) (NOT p0)), (OR (AND p1 (NOT p2) p3) (AND p0 (NOT p2) p3)), (AND (NOT p2) p3), p3, true, (AND p3 (NOT p2) (NOT p0)), (AND (NOT p2) p0 (NOT p1) p3), (AND (NOT p2) p3), (AND (NOT p0) p3), (AND (NOT p2) p3), (NOT p0)]
Running random walk in product with property : FireWire-PT-17-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1), acceptance={} source=3 dest: 8}, { cond=p0, acceptance={} source=3 dest: 9}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={} source=4 dest: 5}], [{ cond=p3, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 5}, { cond=p0, acceptance={} source=7 dest: 7}, { cond=(AND p0 (NOT p2)), acceptance={} source=7 dest: 10}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=8 dest: 4}], [{ cond=(NOT p0), acceptance={} source=9 dest: 1}, { cond=p0, acceptance={} source=9 dest: 2}, { cond=p0, acceptance={} source=9 dest: 8}, { cond=p0, acceptance={} source=9 dest: 9}, { cond=(AND p0 (NOT p2)), acceptance={0} source=9 dest: 11}], [{ cond=(AND (NOT p0) p3), acceptance={} source=10 dest: 6}, { cond=(AND p0 p3), acceptance={} source=10 dest: 12}], [{ cond=(AND (NOT p0) p3), acceptance={} source=11 dest: 1}, { cond=(AND p0 p3), acceptance={} source=11 dest: 2}, { cond=(AND p0 p3), acceptance={} source=11 dest: 8}, { cond=(AND p0 p3), acceptance={} source=11 dest: 9}, { cond=(AND p0 (NOT p2) p3), acceptance={0} source=11 dest: 11}], [{ cond=(NOT p0), acceptance={} source=12 dest: 6}, { cond=p0, acceptance={} source=12 dest: 12}]], initial=0, aps=[p0:(AND (EQ s23 1) (EQ s83 1)), p1:(EQ s213 1), p2:(AND (EQ s44 1) (EQ s126 1)), p3:(AND (EQ s43 1) (EQ s197 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20009 reset in 202 ms.
Product exploration explored 100000 steps with 19954 reset in 226 ms.
Computed a total of 42 stabilizing places and 46 stable transitions
Computed a total of 42 stabilizing places and 46 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), true, (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 228 ms. Reduced automaton from 13 states, 34 edges and 4 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 260 ms :[true, p3, (AND (NOT p2) p3), (AND p3 (NOT p2)), (AND p3 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :3
Running SMT prover for 1 properties.
[2024-06-02 23:32:15] [INFO ] Invariant cache hit.
[2024-06-02 23:32:15] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 23:32:15] [INFO ] After 169ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 23:32:15] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:32:15] [INFO ] After 128ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 23:32:15] [INFO ] Deduced a trap composed of 74 places in 81 ms of which 0 ms to minimize.
[2024-06-02 23:32:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2024-06-02 23:32:15] [INFO ] After 296ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2024-06-02 23:32:15] [INFO ] After 389ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 295 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 295/295 places, 499/499 transitions.
Graph (trivial) has 233 edges and 295 vertex of which 18 / 295 are part of one of the 3 SCC in 0 ms
Free SCC test removed 15 places
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 280 transition count 428
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 54 rules applied. Total rules applied 105 place count 230 transition count 424
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 107 place count 228 transition count 424
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 107 place count 228 transition count 391
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 173 place count 195 transition count 391
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 174 place count 194 transition count 371
Iterating global reduction 3 with 1 rules applied. Total rules applied 175 place count 194 transition count 371
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 176 place count 194 transition count 370
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 232 place count 166 transition count 342
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: -99
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 294 place count 135 transition count 441
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 300 place count 135 transition count 435
Drop transitions removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 5 with 36 rules applied. Total rules applied 336 place count 135 transition count 399
Free-agglomeration rule applied 20 times.
Iterating global reduction 5 with 20 rules applied. Total rules applied 356 place count 135 transition count 379
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 26 rules applied. Total rules applied 382 place count 115 transition count 373
Drop transitions removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 6 with 56 rules applied. Total rules applied 438 place count 115 transition count 317
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 440 place count 115 transition count 317
Applied a total of 440 rules in 66 ms. Remains 115 /295 variables (removed 180) and now considering 317/499 (removed 182) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 115/295 places, 317/499 transitions.
Incomplete random walk after 10000 steps, including 583 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 59 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4915 steps, run visited all 1 properties in 13 ms. (steps per millisecond=378 )
Probabilistic random walk after 4915 steps, saw 1781 distinct states, run finished after 22 ms. (steps per millisecond=223 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), true, (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p2), (F p3), (F (AND p2 (NOT p3))), (F (NOT (AND (NOT p2) (NOT p3))))]
Knowledge based reduction with 11 factoid took 249 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[true, p3, (AND (NOT p2) p3), (AND p3 (NOT p2)), (AND p3 (NOT p2))]
Stuttering acceptance computed with spot in 130 ms :[true, p3, (AND (NOT p2) p3), (AND p3 (NOT p2)), (AND p3 (NOT p2))]
Support contains 4 out of 295 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 295/295 places, 499/499 transitions.
Applied a total of 0 rules in 5 ms. Remains 295 /295 variables (removed 0) and now considering 499/499 (removed 0) transitions.
[2024-06-02 23:32:16] [INFO ] Invariant cache hit.
[2024-06-02 23:32:16] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-02 23:32:16] [INFO ] Invariant cache hit.
[2024-06-02 23:32:16] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
[2024-06-02 23:32:16] [INFO ] Invariant cache hit.
[2024-06-02 23:32:16] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 527 ms. Remains : 295/295 places, 499/499 transitions.
Computed a total of 42 stabilizing places and 46 stable transitions
Computed a total of 42 stabilizing places and 46 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 77 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 225 ms :[true, p3, (AND (NOT p2) p3), (AND p3 (NOT p2)), (AND p3 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-06-02 23:32:17] [INFO ] Invariant cache hit.
[2024-06-02 23:32:17] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 23:32:17] [INFO ] After 184ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 23:32:17] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 23:32:17] [INFO ] After 181ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 23:32:17] [INFO ] Deduced a trap composed of 74 places in 61 ms of which 0 ms to minimize.
[2024-06-02 23:32:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2024-06-02 23:32:17] [INFO ] After 300ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2024-06-02 23:32:17] [INFO ] After 406ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 295 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 295/295 places, 499/499 transitions.
Graph (trivial) has 233 edges and 295 vertex of which 18 / 295 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 280 transition count 428
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 54 rules applied. Total rules applied 105 place count 230 transition count 424
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 107 place count 228 transition count 424
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 107 place count 228 transition count 391
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 173 place count 195 transition count 391
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 174 place count 194 transition count 371
Iterating global reduction 3 with 1 rules applied. Total rules applied 175 place count 194 transition count 371
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 176 place count 194 transition count 370
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 232 place count 166 transition count 342
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: -99
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 294 place count 135 transition count 441
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 300 place count 135 transition count 435
Drop transitions removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 5 with 36 rules applied. Total rules applied 336 place count 135 transition count 399
Free-agglomeration rule applied 20 times.
Iterating global reduction 5 with 20 rules applied. Total rules applied 356 place count 135 transition count 379
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 26 rules applied. Total rules applied 382 place count 115 transition count 373
Drop transitions removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 6 with 56 rules applied. Total rules applied 438 place count 115 transition count 317
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 440 place count 115 transition count 317
Applied a total of 440 rules in 36 ms. Remains 115 /295 variables (removed 180) and now considering 317/499 (removed 182) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 115/295 places, 317/499 transitions.
Incomplete random walk after 10000 steps, including 599 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 58 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4915 steps, run visited all 1 properties in 13 ms. (steps per millisecond=378 )
Probabilistic random walk after 4915 steps, saw 1781 distinct states, run finished after 13 ms. (steps per millisecond=378 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p3) (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : [(F p2), (F p3), (F (AND p2 (NOT p3))), (F (NOT (AND (NOT p2) (NOT p3))))]
Knowledge based reduction with 2 factoid took 330 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 245 ms :[true, p3, (AND (NOT p2) p3), (AND p3 (NOT p2)), (AND p3 (NOT p2))]
Stuttering acceptance computed with spot in 127 ms :[true, p3, (AND (NOT p2) p3), (AND p3 (NOT p2)), (AND p3 (NOT p2))]
Stuttering acceptance computed with spot in 148 ms :[true, p3, (AND (NOT p2) p3), (AND p3 (NOT p2)), (AND p3 (NOT p2))]
Product exploration explored 100000 steps with 4 reset in 91 ms.
Product exploration explored 100000 steps with 0 reset in 97 ms.
Built C files in :
/tmp/ltsmin14854854582646591597
[2024-06-02 23:32:19] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14854854582646591597
Running compilation step : cd /tmp/ltsmin14854854582646591597;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 667 ms.
Running link step : cd /tmp/ltsmin14854854582646591597;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin14854854582646591597;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17617432605571302590.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 295 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 295/295 places, 499/499 transitions.
Applied a total of 0 rules in 2 ms. Remains 295 /295 variables (removed 0) and now considering 499/499 (removed 0) transitions.
[2024-06-02 23:32:34] [INFO ] Invariant cache hit.
[2024-06-02 23:32:34] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-02 23:32:34] [INFO ] Invariant cache hit.
[2024-06-02 23:32:34] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
[2024-06-02 23:32:34] [INFO ] Invariant cache hit.
[2024-06-02 23:32:34] [INFO ] Dead Transitions using invariants and state equation in 177 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 589 ms. Remains : 295/295 places, 499/499 transitions.
Built C files in :
/tmp/ltsmin10403614634926239395
[2024-06-02 23:32:34] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10403614634926239395
Running compilation step : cd /tmp/ltsmin10403614634926239395;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 655 ms.
Running link step : cd /tmp/ltsmin10403614634926239395;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin10403614634926239395;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15315648473893517721.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-06-02 23:32:49] [INFO ] Flatten gal took : 33 ms
[2024-06-02 23:32:49] [INFO ] Flatten gal took : 29 ms
[2024-06-02 23:32:49] [INFO ] Time to serialize gal into /tmp/LTL18054750705994184237.gal : 3 ms
[2024-06-02 23:32:49] [INFO ] Time to serialize properties into /tmp/LTL6532948189044528075.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18054750705994184237.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4343087954881835980.hoa' '-atoms' '/tmp/LTL6532948189044528075.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL6532948189044528075.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4343087954881835980.hoa
Detected timeout of ITS tools.
[2024-06-02 23:33:05] [INFO ] Flatten gal took : 15 ms
[2024-06-02 23:33:05] [INFO ] Flatten gal took : 26 ms
[2024-06-02 23:33:05] [INFO ] Time to serialize gal into /tmp/LTL8415808230686605353.gal : 3 ms
[2024-06-02 23:33:05] [INFO ] Time to serialize properties into /tmp/LTL13359044325809659994.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8415808230686605353.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13359044325809659994.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((((G("((p32==1)&&(p123==1))"))&&(X("(p309==1)")))U(X(X(G((X(!("((p70==1)&&(p282==1))")))||("((p71==1)&&(p186==1))")))))))
Formula 0 simplified : (F!"((p32==1)&&(p123==1))" | X!"(p309==1)") R XXF(!"((p71==1)&&(p186==1))" & X"((p70==1)&&(p282==1))")
Detected timeout of ITS tools.
[2024-06-02 23:33:20] [INFO ] Flatten gal took : 18 ms
[2024-06-02 23:33:20] [INFO ] Applying decomposition
[2024-06-02 23:33:20] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph2569165796450839459.txt' '-o' '/tmp/graph2569165796450839459.bin' '-w' '/tmp/graph2569165796450839459.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2569165796450839459.bin' '-l' '-1' '-v' '-w' '/tmp/graph2569165796450839459.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:33:20] [INFO ] Decomposing Gal with order
[2024-06-02 23:33:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:33:20] [INFO ] Removed a total of 527 redundant transitions.
[2024-06-02 23:33:20] [INFO ] Flatten gal took : 35 ms
[2024-06-02 23:33:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 5 ms.
[2024-06-02 23:33:20] [INFO ] Time to serialize gal into /tmp/LTL11456250695100577760.gal : 18 ms
[2024-06-02 23:33:20] [INFO ] Time to serialize properties into /tmp/LTL13800342868095930517.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11456250695100577760.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13800342868095930517.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((((G("((i0.u8.p32==1)&&(i3.u31.p123==1))"))&&(X("(i8.u83.p309==1)")))U(X(X(G((X(!("((i1.u17.p70==1)&&(i9.u76.p282==1))")))||("((i1.u...192
Formula 0 simplified : (F!"((i0.u8.p32==1)&&(i3.u31.p123==1))" | X!"(i8.u83.p309==1)") R XXF(!"((i1.u17.p71==1)&&(i1.u21.p186==1))" & X"((i1.u17.p70==1)&&(...173
Reverse transition relation is NOT exact ! Due to transitions t27, t124, t230, t243, t245, t254, t273, t297, t354, t371, t372, t380, t405, t407, t408, t423...1116
Computing Next relation with stutter on 3.69226e+06 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17200795808580474972
[2024-06-02 23:33:35] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17200795808580474972
Running compilation step : cd /tmp/ltsmin17200795808580474972;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 655 ms.
Running link step : cd /tmp/ltsmin17200795808580474972;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin17200795808580474972;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(([]((LTLAPp0==true))&&X((LTLAPp1==true))) U X(X([]((X(!(LTLAPp2==true))||(LTLAPp3==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FireWire-PT-17-LTLFireability-11 finished in 97561 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(p0&&F(!p1)&&X(X(F(p2))))))'
Support contains 3 out of 308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 532/532 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 302 transition count 507
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 302 transition count 507
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 298 transition count 503
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 298 transition count 503
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 297 transition count 502
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 297 transition count 502
Applied a total of 22 rules in 12 ms. Remains 297 /308 variables (removed 11) and now considering 502/532 (removed 30) transitions.
// Phase 1: matrix 502 rows 297 cols
[2024-06-02 23:33:50] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:33:50] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-06-02 23:33:50] [INFO ] Invariant cache hit.
[2024-06-02 23:33:50] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
[2024-06-02 23:33:50] [INFO ] Invariant cache hit.
[2024-06-02 23:33:51] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 297/308 places, 502/532 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 550 ms. Remains : 297/308 places, 502/532 transitions.
Stuttering acceptance computed with spot in 319 ms :[(NOT p0), true, (AND (NOT p2) (NOT p0)), (AND p1 (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p0)), p1]
Running random walk in product with property : FireWire-PT-17-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(AND p0 p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 5}], [{ cond=p1, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(NEQ s263 1), p1:(AND (EQ s263 1) (EQ s278 1)), p2:(NEQ s179 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 221 ms.
Product exploration explored 100000 steps with 33333 reset in 230 ms.
Computed a total of 42 stabilizing places and 46 stable transitions
Computed a total of 42 stabilizing places and 46 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND p0 p1))), (X p0), (X (NOT (AND (NOT p0) p1))), true, (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 16 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-17-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-17-LTLFireability-12 finished in 1363 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Support contains 3 out of 308 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 308/308 places, 532/532 transitions.
Graph (trivial) has 242 edges and 308 vertex of which 18 / 308 are part of one of the 3 SCC in 0 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 292 transition count 462
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 57 rules applied. Total rules applied 111 place count 239 transition count 458
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 114 place count 237 transition count 457
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 115 place count 236 transition count 457
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 29 Pre rules applied. Total rules applied 115 place count 236 transition count 428
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 173 place count 207 transition count 428
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 176 place count 204 transition count 425
Iterating global reduction 4 with 3 rules applied. Total rules applied 179 place count 204 transition count 425
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 179 place count 204 transition count 422
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 185 place count 201 transition count 422
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 187 place count 199 transition count 420
Iterating global reduction 4 with 2 rules applied. Total rules applied 189 place count 199 transition count 420
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 191 place count 199 transition count 418
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 192 place count 198 transition count 418
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 248 place count 170 transition count 390
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 249 place count 169 transition count 370
Iterating global reduction 6 with 1 rules applied. Total rules applied 250 place count 169 transition count 370
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 251 place count 169 transition count 369
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: -126
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 7 with 62 rules applied. Total rules applied 313 place count 138 transition count 495
Drop transitions removed 58 transitions
Redundant transition composition rules discarded 58 transitions
Iterating global reduction 7 with 58 rules applied. Total rules applied 371 place count 138 transition count 437
Applied a total of 371 rules in 42 ms. Remains 138 /308 variables (removed 170) and now considering 437/532 (removed 95) transitions.
[2024-06-02 23:33:51] [INFO ] Flow matrix only has 413 transitions (discarded 24 similar events)
// Phase 1: matrix 413 rows 138 cols
[2024-06-02 23:33:51] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:33:52] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-06-02 23:33:52] [INFO ] Flow matrix only has 413 transitions (discarded 24 similar events)
[2024-06-02 23:33:52] [INFO ] Invariant cache hit.
[2024-06-02 23:33:52] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-06-02 23:33:52] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
[2024-06-02 23:33:52] [INFO ] Redundant transitions in 5 ms returned []
[2024-06-02 23:33:52] [INFO ] Flow matrix only has 413 transitions (discarded 24 similar events)
[2024-06-02 23:33:52] [INFO ] Invariant cache hit.
[2024-06-02 23:33:52] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 138/308 places, 437/532 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 625 ms. Remains : 138/308 places, 437/532 transitions.
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : FireWire-PT-17-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (EQ s10 1) (EQ s42 1)), p0:(EQ s79 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-17-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-17-LTLFireability-13 finished in 672 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X((G(p1)&&X(p2)))&&p0)))'
Support contains 4 out of 308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 532/532 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 301 transition count 506
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 301 transition count 506
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 296 transition count 501
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 296 transition count 501
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 296 transition count 500
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 295 transition count 499
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 295 transition count 499
Applied a total of 27 rules in 15 ms. Remains 295 /308 variables (removed 13) and now considering 499/532 (removed 33) transitions.
// Phase 1: matrix 499 rows 295 cols
[2024-06-02 23:33:52] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:33:52] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-06-02 23:33:52] [INFO ] Invariant cache hit.
[2024-06-02 23:33:52] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
[2024-06-02 23:33:52] [INFO ] Invariant cache hit.
[2024-06-02 23:33:53] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 295/308 places, 499/532 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 522 ms. Remains : 295/308 places, 499/532 transitions.
Stuttering acceptance computed with spot in 212 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p2)]
Running random walk in product with property : FireWire-PT-17-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s35 1) (EQ s85 1)), p1:(EQ s31 0), p2:(EQ s109 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 78 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-17-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-17-LTLFireability-14 finished in 757 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 532/532 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 301 transition count 506
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 301 transition count 506
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 296 transition count 501
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 296 transition count 501
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 296 transition count 500
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 295 transition count 499
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 295 transition count 499
Applied a total of 27 rules in 14 ms. Remains 295 /308 variables (removed 13) and now considering 499/532 (removed 33) transitions.
[2024-06-02 23:33:53] [INFO ] Invariant cache hit.
[2024-06-02 23:33:53] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-02 23:33:53] [INFO ] Invariant cache hit.
[2024-06-02 23:33:53] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
[2024-06-02 23:33:53] [INFO ] Invariant cache hit.
[2024-06-02 23:33:53] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 295/308 places, 499/532 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 536 ms. Remains : 295/308 places, 499/532 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-17-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s34 1) (EQ s207 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 85 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-17-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-17-LTLFireability-15 finished in 618 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(((p0 U p1) U (F(!p0)&&G(!p2)))))))'
Found a Lengthening insensitive property : FireWire-PT-17-LTLFireability-01
Stuttering acceptance computed with spot in 307 ms :[(OR p0 p2), (OR p0 p2), (OR p0 p2), true, (NOT p1), p2, (OR p0 p2), p2, p0]
Support contains 5 out of 308 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 308/308 places, 532/532 transitions.
Graph (trivial) has 236 edges and 308 vertex of which 18 / 308 are part of one of the 3 SCC in 0 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 292 transition count 462
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 57 rules applied. Total rules applied 111 place count 239 transition count 458
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 113 place count 237 transition count 458
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 113 place count 237 transition count 430
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 169 place count 209 transition count 430
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 173 place count 205 transition count 407
Iterating global reduction 3 with 4 rules applied. Total rules applied 177 place count 205 transition count 407
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 177 place count 205 transition count 404
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 183 place count 202 transition count 404
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 185 place count 200 transition count 402
Iterating global reduction 3 with 2 rules applied. Total rules applied 187 place count 200 transition count 402
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 189 place count 200 transition count 400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 190 place count 199 transition count 400
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 5 with 56 rules applied. Total rules applied 246 place count 171 transition count 372
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: -131
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 5 with 62 rules applied. Total rules applied 308 place count 140 transition count 503
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 314 place count 140 transition count 497
Applied a total of 314 rules in 38 ms. Remains 140 /308 variables (removed 168) and now considering 497/532 (removed 35) transitions.
[2024-06-02 23:33:54] [INFO ] Flow matrix only has 475 transitions (discarded 22 similar events)
// Phase 1: matrix 475 rows 140 cols
[2024-06-02 23:33:54] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:33:54] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-02 23:33:54] [INFO ] Flow matrix only has 475 transitions (discarded 22 similar events)
[2024-06-02 23:33:54] [INFO ] Invariant cache hit.
[2024-06-02 23:33:54] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-06-02 23:33:54] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
[2024-06-02 23:33:54] [INFO ] Flow matrix only has 475 transitions (discarded 22 similar events)
[2024-06-02 23:33:54] [INFO ] Invariant cache hit.
[2024-06-02 23:33:54] [INFO ] Dead Transitions using invariants and state equation in 214 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 140/308 places, 497/532 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 567 ms. Remains : 140/308 places, 497/532 transitions.
Running random walk in product with property : FireWire-PT-17-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR p0 (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(OR (AND p0 p2) (AND p2 p1)), acceptance={} source=2 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 8}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}], [{ cond=p2, acceptance={} source=5 dest: 3}, { cond=(NOT p2), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=6 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(OR (AND p0 p2) (AND p2 p1)), acceptance={0} source=6 dest: 6}, { cond=(OR (AND p0 (NOT p2)) (AND (NOT p2) p1)), acceptance={} source=6 dest: 7}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=7 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=7 dest: 5}, { cond=(OR (AND p0 p2) (AND p2 p1)), acceptance={0} source=7 dest: 6}, { cond=(OR (AND p0 (NOT p2)) (AND (NOT p2) p1)), acceptance={} source=7 dest: 7}], [{ cond=p0, acceptance={0} source=8 dest: 8}]], initial=0, aps=[p0:(AND (EQ s12 1) (EQ s50 1)), p2:(AND (EQ s19 1) (EQ s112 1)), p1:(EQ s18 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 41 ms.
Product exploration explored 100000 steps with 0 reset in 57 ms.
Computed a total of 5 stabilizing places and 17 stable transitions
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (OR (AND p0 p2) (AND p2 p1))))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (OR p0 (NOT p2) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 131 ms. Reduced automaton from 9 states, 25 edges and 3 AP (stutter sensitive) to 9 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 326 ms :[(OR p0 p2), (OR p0 p2), (OR p0 p2), true, (NOT p1), p2, (OR p0 p2), p2, p0]
Incomplete random walk after 10000 steps, including 687 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10001 steps, including 183 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 177 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 178 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 176 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 177 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 166 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 187 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 172 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2024-06-02 23:33:55] [INFO ] Flow matrix only has 475 transitions (discarded 22 similar events)
[2024-06-02 23:33:55] [INFO ] Invariant cache hit.
[2024-06-02 23:33:55] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:33:55] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-06-02 23:33:56] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:33:56] [INFO ] After 176ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :6
[2024-06-02 23:33:56] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-06-02 23:33:56] [INFO ] After 140ms SMT Verify possible using 75 Read/Feed constraints in natural domain returned unsat :2 sat :6
[2024-06-02 23:33:56] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 1 ms to minimize.
[2024-06-02 23:33:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2024-06-02 23:33:56] [INFO ] After 423ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :6
Attempting to minimize the solution found.
Minimization took 105 ms.
[2024-06-02 23:33:56] [INFO ] After 769ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :6
Fused 8 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 497/497 transitions.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 140 transition count 494
Drop transitions removed 55 transitions
Redundant transition composition rules discarded 55 transitions
Iterating global reduction 1 with 55 rules applied. Total rules applied 58 place count 140 transition count 439
Free-agglomeration rule applied 20 times.
Iterating global reduction 1 with 20 rules applied. Total rules applied 78 place count 140 transition count 419
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 104 place count 120 transition count 413
Drop transitions removed 55 transitions
Redundant transition composition rules discarded 55 transitions
Iterating global reduction 2 with 55 rules applied. Total rules applied 159 place count 120 transition count 358
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 164 place count 120 transition count 358
Applied a total of 164 rules in 25 ms. Remains 120 /140 variables (removed 20) and now considering 358/497 (removed 139) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 120/140 places, 358/497 transitions.
Incomplete random walk after 10000 steps, including 500 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 116 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 100 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 169 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Finished probabilistic random walk after 84371 steps, run visited all 6 properties in 458 ms. (steps per millisecond=184 )
Probabilistic random walk after 84371 steps, saw 32433 distinct states, run finished after 459 ms. (steps per millisecond=183 ) properties seen :6
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (OR (AND p0 p2) (AND p2 p1))))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (OR p0 (NOT p2) p1))), (G (NOT (OR (AND p0 p2) (AND p1 p2)))), (G (NOT (AND p0 (NOT p1) p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p2))), (F (NOT (OR p0 p1 (NOT p2)))), (F (AND (NOT p0) (NOT p1) p2)), (F p2), (F p0), (F (AND p0 (NOT p1))), (F (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))]
Knowledge based reduction with 9 factoid took 376 ms. Reduced automaton from 9 states, 25 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(OR p2 p0), (OR p2 p0), (OR p2 p0), true, p0]
Stuttering acceptance computed with spot in 134 ms :[(OR p2 p0), (OR p2 p0), (OR p2 p0), true, p0]
Support contains 4 out of 140 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 497/497 transitions.
Applied a total of 0 rules in 3 ms. Remains 140 /140 variables (removed 0) and now considering 497/497 (removed 0) transitions.
[2024-06-02 23:33:58] [INFO ] Flow matrix only has 475 transitions (discarded 22 similar events)
[2024-06-02 23:33:58] [INFO ] Invariant cache hit.
[2024-06-02 23:33:58] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-02 23:33:58] [INFO ] Flow matrix only has 475 transitions (discarded 22 similar events)
[2024-06-02 23:33:58] [INFO ] Invariant cache hit.
[2024-06-02 23:33:58] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-06-02 23:33:58] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
[2024-06-02 23:33:58] [INFO ] Flow matrix only has 475 transitions (discarded 22 similar events)
[2024-06-02 23:33:58] [INFO ] Invariant cache hit.
[2024-06-02 23:33:58] [INFO ] Dead Transitions using invariants and state equation in 168 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 528 ms. Remains : 140/140 places, 497/497 transitions.
Computed a total of 5 stabilizing places and 17 stable transitions
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(OR p2 p0), (OR p2 p0), (OR p2 p0), true, p0]
Incomplete random walk after 10000 steps, including 692 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 186 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 174 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 177 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Finished probabilistic random walk after 1075660 steps, run visited all 3 properties in 2625 ms. (steps per millisecond=409 )
Probabilistic random walk after 1075660 steps, saw 306887 distinct states, run finished after 2625 ms. (steps per millisecond=409 ) properties seen :3
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p2)))]
False Knowledge obtained : [(F p2), (F p0), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 3 factoid took 132 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(OR p2 p0), (OR p2 p0), (OR p2 p0), true, p0]
Stuttering acceptance computed with spot in 158 ms :[(OR p2 p0), (OR p2 p0), (OR p2 p0), true, p0]
Stuttering acceptance computed with spot in 160 ms :[(OR p2 p0), (OR p2 p0), (OR p2 p0), true, p0]
Product exploration explored 100000 steps with 1 reset in 57 ms.
Product exploration explored 100000 steps with 5 reset in 55 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 137 ms :[(OR p2 p0), (OR p2 p0), (OR p2 p0), true, p0]
Support contains 4 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 497/497 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 140 transition count 497
Deduced a syphon composed of 1 places in 0 ms
Drop transitions removed 55 transitions
Redundant transition composition rules discarded 55 transitions
Iterating global reduction 0 with 55 rules applied. Total rules applied 56 place count 140 transition count 442
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 56 rules in 11 ms. Remains 140 /140 variables (removed 0) and now considering 442/497 (removed 55) transitions.
[2024-06-02 23:34:02] [INFO ] Redundant transitions in 21 ms returned []
[2024-06-02 23:34:02] [INFO ] Flow matrix only has 418 transitions (discarded 24 similar events)
// Phase 1: matrix 418 rows 140 cols
[2024-06-02 23:34:02] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:34:03] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 140/140 places, 442/497 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 198 ms. Remains : 140/140 places, 442/497 transitions.
Built C files in :
/tmp/ltsmin3637870673376054136
[2024-06-02 23:34:03] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3637870673376054136
Running compilation step : cd /tmp/ltsmin3637870673376054136;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 737 ms.
Running link step : cd /tmp/ltsmin3637870673376054136;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin3637870673376054136;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14759643807786413074.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 497/497 transitions.
Applied a total of 0 rules in 1 ms. Remains 140 /140 variables (removed 0) and now considering 497/497 (removed 0) transitions.
[2024-06-02 23:34:18] [INFO ] Flow matrix only has 475 transitions (discarded 22 similar events)
// Phase 1: matrix 475 rows 140 cols
[2024-06-02 23:34:18] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:34:18] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-02 23:34:18] [INFO ] Flow matrix only has 475 transitions (discarded 22 similar events)
[2024-06-02 23:34:18] [INFO ] Invariant cache hit.
[2024-06-02 23:34:18] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-06-02 23:34:18] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
[2024-06-02 23:34:18] [INFO ] Flow matrix only has 475 transitions (discarded 22 similar events)
[2024-06-02 23:34:18] [INFO ] Invariant cache hit.
[2024-06-02 23:34:18] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 478 ms. Remains : 140/140 places, 497/497 transitions.
Built C files in :
/tmp/ltsmin5445771809348066367
[2024-06-02 23:34:18] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5445771809348066367
Running compilation step : cd /tmp/ltsmin5445771809348066367;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 676 ms.
Running link step : cd /tmp/ltsmin5445771809348066367;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin5445771809348066367;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5227005038706087391.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-06-02 23:34:33] [INFO ] Flatten gal took : 18 ms
[2024-06-02 23:34:33] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:34:33] [INFO ] Time to serialize gal into /tmp/LTL2160103401856280154.gal : 8 ms
[2024-06-02 23:34:33] [INFO ] Time to serialize properties into /tmp/LTL15070626350272606941.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2160103401856280154.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6978874552716376334.hoa' '-atoms' '/tmp/LTL15070626350272606941.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL15070626350272606941.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6978874552716376334.hoa
Reverse transition relation is NOT exact ! Due to transitions t217.t218.t220.t221.t222, t223, t230, t243, t245, t254, t257, t258, t259, t261, t263, t264, t...2980
Computing Next relation with stutter on 3.69226e+06 deadlock states
Detected timeout of ITS tools.
[2024-06-02 23:34:48] [INFO ] Flatten gal took : 15 ms
[2024-06-02 23:34:48] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:34:48] [INFO ] Time to serialize gal into /tmp/LTL17551046378213952961.gal : 6 ms
[2024-06-02 23:34:48] [INFO ] Time to serialize properties into /tmp/LTL2102962383595364492.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17551046378213952961.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2102962383595364492.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(G((("((p57==1)&&(p150==1))")U("(p75==1)"))U((F(!("((p57==1)&&(p150==1))")))&&(G(!("((p77==1)&&(p330==1))")))))))))
Formula 0 simplified : XXF((!"((p57==1)&&(p150==1))" R !"(p75==1)") R (G"((p57==1)&&(p150==1))" | F"((p77==1)&&(p330==1))"))
Reverse transition relation is NOT exact ! Due to transitions t217.t218.t220.t221.t222, t223, t230, t243, t245, t254, t257, t258, t259, t261, t263, t264, t...2980
Computing Next relation with stutter on 3.69226e+06 deadlock states
Detected timeout of ITS tools.
[2024-06-02 23:35:03] [INFO ] Flatten gal took : 17 ms
[2024-06-02 23:35:03] [INFO ] Applying decomposition
[2024-06-02 23:35:03] [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.202304061127/bin/convert-linux64' '-i' '/tmp/graph6549235216028156317.txt' '-o' '/tmp/graph6549235216028156317.bin' '-w' '/tmp/graph6549235216028156317.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6549235216028156317.bin' '-l' '-1' '-v' '-w' '/tmp/graph6549235216028156317.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:35:04] [INFO ] Decomposing Gal with order
[2024-06-02 23:35:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:35:04] [INFO ] Removed a total of 875 redundant transitions.
[2024-06-02 23:35:04] [INFO ] Flatten gal took : 33 ms
[2024-06-02 23:35:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 172 labels/synchronizations in 16 ms.
[2024-06-02 23:35:04] [INFO ] Time to serialize gal into /tmp/LTL6966836623663926704.gal : 3 ms
[2024-06-02 23:35:04] [INFO ] Time to serialize properties into /tmp/LTL18084796242319613140.ltl : 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6966836623663926704.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18084796242319613140.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(G((("((i2.u6.p57==1)&&(i4.u14.p150==1))")U("(i0.u4.p75==1)"))U((F(!("((i2.u6.p57==1)&&(i4.u14.p150==1))")))&&(G(!("((i0.u4.p77=...187
Formula 0 simplified : XXF((!"((i2.u6.p57==1)&&(i4.u14.p150==1))" R !"(i0.u4.p75==1)") R (G"((i2.u6.p57==1)&&(i4.u14.p150==1))" | F"((i0.u4.p77==1)&&(i1.u2...169
Reverse transition relation is NOT exact ! Due to transitions t217_t218_t220_t221_t222, t223, t230, t243, t245, t258, t297, t299, t372, t376, t423, t425, t...2077
Computing Next relation with stutter on 3.69226e+06 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5567906581806602938
[2024-06-02 23:35:19] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5567906581806602938
Running compilation step : cd /tmp/ltsmin5567906581806602938;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 672 ms.
Running link step : cd /tmp/ltsmin5567906581806602938;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin5567906581806602938;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X([]((((LTLAPp0==true) U (LTLAPp1==true)) U (<>(!(LTLAPp0==true))&&[](!(LTLAPp2==true)))))))' '--buchi-type=spotba'
LTSmin run took 6440 ms.
Treatment of property FireWire-PT-17-LTLFireability-01 finished in 92449 ms.
FORMULA FireWire-PT-17-LTLFireability-01 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0)&&X(p1)) U X(X(G((p2||X(!p3)))))))'
Found a Lengthening insensitive property : FireWire-PT-17-LTLFireability-11
Stuttering acceptance computed with spot in 435 ms :[(AND (NOT p2) p3), (AND p3 (NOT p2)), (AND p3 (NOT p2) (NOT p0)), (OR (AND p1 (NOT p2) p3) (AND p0 (NOT p2) p3)), (AND (NOT p2) p3), p3, true, (AND p3 (NOT p2) (NOT p0)), (AND (NOT p2) p0 (NOT p1) p3), (AND (NOT p2) p3), (AND (NOT p0) p3), (AND (NOT p2) p3), (NOT p0)]
Support contains 7 out of 308 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 308/308 places, 532/532 transitions.
Graph (trivial) has 237 edges and 308 vertex of which 18 / 308 are part of one of the 3 SCC in 0 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 292 transition count 462
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 57 rules applied. Total rules applied 111 place count 239 transition count 458
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 114 place count 237 transition count 457
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 115 place count 236 transition count 457
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 28 Pre rules applied. Total rules applied 115 place count 236 transition count 429
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 171 place count 208 transition count 429
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 175 place count 204 transition count 406
Iterating global reduction 4 with 4 rules applied. Total rules applied 179 place count 204 transition count 406
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 179 place count 204 transition count 403
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 185 place count 201 transition count 403
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 187 place count 199 transition count 401
Iterating global reduction 4 with 2 rules applied. Total rules applied 189 place count 199 transition count 401
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 191 place count 199 transition count 399
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 192 place count 198 transition count 399
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 248 place count 170 transition count 371
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 249 place count 169 transition count 351
Iterating global reduction 6 with 1 rules applied. Total rules applied 250 place count 169 transition count 351
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 251 place count 169 transition count 350
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: -94
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 7 with 62 rules applied. Total rules applied 313 place count 138 transition count 444
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 319 place count 138 transition count 438
Applied a total of 319 rules in 34 ms. Remains 138 /308 variables (removed 170) and now considering 438/532 (removed 94) transitions.
[2024-06-02 23:35:27] [INFO ] Flow matrix only has 419 transitions (discarded 19 similar events)
// Phase 1: matrix 419 rows 138 cols
[2024-06-02 23:35:27] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:35:27] [INFO ] Implicit Places using invariants in 250 ms returned []
[2024-06-02 23:35:27] [INFO ] Flow matrix only has 419 transitions (discarded 19 similar events)
[2024-06-02 23:35:27] [INFO ] Invariant cache hit.
[2024-06-02 23:35:27] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-06-02 23:35:27] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 545 ms to find 0 implicit places.
[2024-06-02 23:35:27] [INFO ] Flow matrix only has 419 transitions (discarded 19 similar events)
[2024-06-02 23:35:27] [INFO ] Invariant cache hit.
[2024-06-02 23:35:27] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 138/308 places, 438/532 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 732 ms. Remains : 138/308 places, 438/532 transitions.
Running random walk in product with property : FireWire-PT-17-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1), acceptance={} source=3 dest: 8}, { cond=p0, acceptance={} source=3 dest: 9}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={} source=4 dest: 5}], [{ cond=p3, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 5}, { cond=p0, acceptance={} source=7 dest: 7}, { cond=(AND p0 (NOT p2)), acceptance={} source=7 dest: 10}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=8 dest: 4}], [{ cond=(NOT p0), acceptance={} source=9 dest: 1}, { cond=p0, acceptance={} source=9 dest: 2}, { cond=p0, acceptance={} source=9 dest: 8}, { cond=p0, acceptance={} source=9 dest: 9}, { cond=(AND p0 (NOT p2)), acceptance={0} source=9 dest: 11}], [{ cond=(AND (NOT p0) p3), acceptance={} source=10 dest: 6}, { cond=(AND p0 p3), acceptance={} source=10 dest: 12}], [{ cond=(AND (NOT p0) p3), acceptance={} source=11 dest: 1}, { cond=(AND p0 p3), acceptance={} source=11 dest: 2}, { cond=(AND p0 p3), acceptance={} source=11 dest: 8}, { cond=(AND p0 p3), acceptance={} source=11 dest: 9}, { cond=(AND p0 (NOT p2) p3), acceptance={0} source=11 dest: 11}], [{ cond=(NOT p0), acceptance={} source=12 dest: 6}, { cond=p0, acceptance={} source=12 dest: 12}]], initial=0, aps=[p0:(AND (EQ s8 1) (EQ s38 1)), p1:(EQ s101 1), p2:(AND (EQ s14 1) (EQ s63 1)), p3:(AND (EQ s13 1) (EQ s95 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 19953 reset in 215 ms.
Product exploration explored 100000 steps with 19949 reset in 261 ms.
Computed a total of 5 stabilizing places and 17 stable transitions
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), true, (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 173 ms. Reduced automaton from 13 states, 34 edges and 4 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[true, p3, (AND (NOT p2) p3), (AND p3 (NOT p2)), (AND p3 (NOT p2))]
Incomplete random walk after 10000 steps, including 800 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 170 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-06-02 23:35:28] [INFO ] Flow matrix only has 419 transitions (discarded 19 similar events)
[2024-06-02 23:35:28] [INFO ] Invariant cache hit.
[2024-06-02 23:35:28] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:35:28] [INFO ] After 150ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 23:35:28] [INFO ] [Nat]Absence check using 7 positive place invariants in 9 ms returned sat
[2024-06-02 23:35:28] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 23:35:28] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-06-02 23:35:28] [INFO ] After 43ms SMT Verify possible using 71 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 23:35:28] [INFO ] After 70ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2024-06-02 23:35:28] [INFO ] After 208ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 438/438 transitions.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 138 transition count 435
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 138 transition count 434
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 137 transition count 434
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 135 transition count 444
Drop transitions removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 1 with 38 rules applied. Total rules applied 47 place count 135 transition count 406
Free-agglomeration rule applied 20 times.
Iterating global reduction 1 with 20 rules applied. Total rules applied 67 place count 135 transition count 386
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 93 place count 115 transition count 380
Drop transitions removed 58 transitions
Redundant transition composition rules discarded 58 transitions
Iterating global reduction 2 with 58 rules applied. Total rules applied 151 place count 115 transition count 322
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 155 place count 115 transition count 322
Applied a total of 155 rules in 23 ms. Remains 115 /138 variables (removed 23) and now considering 322/438 (removed 116) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 115/138 places, 322/438 transitions.
Incomplete random walk after 10000 steps, including 623 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 59 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 11433 steps, run visited all 1 properties in 28 ms. (steps per millisecond=408 )
Probabilistic random walk after 11433 steps, saw 4833 distinct states, run finished after 28 ms. (steps per millisecond=408 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), true, (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p2), (F p3), (F (AND p2 (NOT p3))), (F (NOT (AND (NOT p2) (NOT p3))))]
Knowledge based reduction with 11 factoid took 170 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[true, p3, (AND (NOT p2) p3), (AND p3 (NOT p2)), (AND p3 (NOT p2))]
Stuttering acceptance computed with spot in 131 ms :[true, p3, (AND (NOT p2) p3), (AND p3 (NOT p2)), (AND p3 (NOT p2))]
Support contains 4 out of 138 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 438/438 transitions.
Applied a total of 0 rules in 1 ms. Remains 138 /138 variables (removed 0) and now considering 438/438 (removed 0) transitions.
[2024-06-02 23:35:29] [INFO ] Flow matrix only has 419 transitions (discarded 19 similar events)
[2024-06-02 23:35:29] [INFO ] Invariant cache hit.
[2024-06-02 23:35:29] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-02 23:35:29] [INFO ] Flow matrix only has 419 transitions (discarded 19 similar events)
[2024-06-02 23:35:29] [INFO ] Invariant cache hit.
[2024-06-02 23:35:29] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-06-02 23:35:29] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
[2024-06-02 23:35:29] [INFO ] Flow matrix only has 419 transitions (discarded 19 similar events)
[2024-06-02 23:35:29] [INFO ] Invariant cache hit.
[2024-06-02 23:35:30] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 534 ms. Remains : 138/138 places, 438/438 transitions.
Computed a total of 5 stabilizing places and 17 stable transitions
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 69 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[true, p3, (AND (NOT p2) p3), (AND p3 (NOT p2)), (AND p3 (NOT p2))]
Incomplete random walk after 10000 steps, including 797 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 174 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-06-02 23:35:30] [INFO ] Flow matrix only has 419 transitions (discarded 19 similar events)
[2024-06-02 23:35:30] [INFO ] Invariant cache hit.
[2024-06-02 23:35:30] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 23:35:30] [INFO ] After 135ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 23:35:30] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:35:30] [INFO ] After 80ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 23:35:30] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-06-02 23:35:30] [INFO ] After 43ms SMT Verify possible using 71 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 23:35:30] [INFO ] After 70ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2024-06-02 23:35:30] [INFO ] After 219ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 438/438 transitions.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 138 transition count 435
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 138 transition count 434
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 137 transition count 434
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 135 transition count 444
Drop transitions removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 1 with 38 rules applied. Total rules applied 47 place count 135 transition count 406
Free-agglomeration rule applied 20 times.
Iterating global reduction 1 with 20 rules applied. Total rules applied 67 place count 135 transition count 386
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 93 place count 115 transition count 380
Drop transitions removed 58 transitions
Redundant transition composition rules discarded 58 transitions
Iterating global reduction 2 with 58 rules applied. Total rules applied 151 place count 115 transition count 322
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 155 place count 115 transition count 322
Applied a total of 155 rules in 22 ms. Remains 115 /138 variables (removed 23) and now considering 322/438 (removed 116) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 115/138 places, 322/438 transitions.
Incomplete random walk after 10000 steps, including 615 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 62 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 11433 steps, run visited all 1 properties in 28 ms. (steps per millisecond=408 )
Probabilistic random walk after 11433 steps, saw 4833 distinct states, run finished after 28 ms. (steps per millisecond=408 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p3) (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : [(F p2), (F p3), (F (AND p2 (NOT p3))), (F (NOT (AND (NOT p2) (NOT p3))))]
Knowledge based reduction with 2 factoid took 273 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[true, p3, (AND (NOT p2) p3), (AND p3 (NOT p2)), (AND p3 (NOT p2))]
Stuttering acceptance computed with spot in 118 ms :[true, p3, (AND (NOT p2) p3), (AND p3 (NOT p2)), (AND p3 (NOT p2))]
Stuttering acceptance computed with spot in 129 ms :[true, p3, (AND (NOT p2) p3), (AND p3 (NOT p2)), (AND p3 (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 59 ms.
Product exploration explored 100000 steps with 0 reset in 53 ms.
Built C files in :
/tmp/ltsmin7802070532269145837
[2024-06-02 23:35:31] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7802070532269145837
Running compilation step : cd /tmp/ltsmin7802070532269145837;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 584 ms.
Running link step : cd /tmp/ltsmin7802070532269145837;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin7802070532269145837;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18417439182291007966.hoa' '--buchi-type=spotba'
LTSmin run took 7974 ms.
Treatment of property FireWire-PT-17-LTLFireability-11 finished in 13705 ms.
FORMULA FireWire-PT-17-LTLFireability-11 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2024-06-02 23:35:40] [INFO ] Flatten gal took : 13 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 352801 ms.

BK_STOP 1717371341302

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FireWire-PT-17"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is FireWire-PT-17, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r571-tall-171734910400188"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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