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.r334-tall-171679080300420.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 itstools
Input is SafeBus-PT-06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r334-tall-171679080300420
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 18K Apr 12 14:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 128K Apr 12 14:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 25K Apr 12 14:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 140K Apr 12 14:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.3K Apr 23 07:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Apr 23 07:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 25K Apr 23 07:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 94K Apr 23 07:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 12 14:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Apr 12 14:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 173K Apr 12 14:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 840K Apr 12 14:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.6K Apr 23 07:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 303K May 18 16:43 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 SafeBus-PT-06-LTLFireability-00
FORMULA_NAME SafeBus-PT-06-LTLFireability-01
FORMULA_NAME SafeBus-PT-06-LTLFireability-02
FORMULA_NAME SafeBus-PT-06-LTLFireability-03
FORMULA_NAME SafeBus-PT-06-LTLFireability-04
FORMULA_NAME SafeBus-PT-06-LTLFireability-05
FORMULA_NAME SafeBus-PT-06-LTLFireability-06
FORMULA_NAME SafeBus-PT-06-LTLFireability-07
FORMULA_NAME SafeBus-PT-06-LTLFireability-08
FORMULA_NAME SafeBus-PT-06-LTLFireability-09
FORMULA_NAME SafeBus-PT-06-LTLFireability-10
FORMULA_NAME SafeBus-PT-06-LTLFireability-11
FORMULA_NAME SafeBus-PT-06-LTLFireability-12
FORMULA_NAME SafeBus-PT-06-LTLFireability-13
FORMULA_NAME SafeBus-PT-06-LTLFireability-14
FORMULA_NAME SafeBus-PT-06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716828888264

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SafeBus-PT-06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-27 16:54:49] [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-05-27 16:54:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 16:54:49] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2024-05-27 16:54:49] [INFO ] Transformed 144 places.
[2024-05-27 16:54:49] [INFO ] Transformed 451 transitions.
[2024-05-27 16:54:49] [INFO ] Found NUPN structural information;
[2024-05-27 16:54:49] [INFO ] Parsed PT model containing 144 places and 451 transitions and 2968 arcs in 198 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Reduce places removed 6 places and 0 transitions.
FORMULA SafeBus-PT-06-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-06-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-06-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 126 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 451/451 transitions.
Applied a total of 0 rules in 14 ms. Remains 138 /138 variables (removed 0) and now considering 451/451 (removed 0) transitions.
[2024-05-27 16:54:49] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
// Phase 1: matrix 242 rows 138 cols
[2024-05-27 16:54:49] [INFO ] Computed 29 invariants in 24 ms
[2024-05-27 16:54:50] [INFO ] Implicit Places using invariants in 207 ms returned []
[2024-05-27 16:54:50] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
[2024-05-27 16:54:50] [INFO ] Invariant cache hit.
[2024-05-27 16:54:50] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 16:54:50] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
Running 445 sub problems to find dead transitions.
[2024-05-27 16:54:50] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
[2024-05-27 16:54:50] [INFO ] Invariant cache hit.
[2024-05-27 16:54:50] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 445 unsolved
Problem TDEAD31 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD246 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 15/167 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-27 16:54:52] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 12 ms to minimize.
[2024-05-27 16:54:52] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 2 ms to minimize.
[2024-05-27 16:54:52] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 1 ms to minimize.
[2024-05-27 16:54:52] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 2 ms to minimize.
[2024-05-27 16:54:53] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 1 ms to minimize.
[2024-05-27 16:54:53] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-05-27 16:54:54] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
[2024-05-27 16:54:54] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2024-05-27 16:54:54] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 3 ms to minimize.
[2024-05-27 16:54:54] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 1 ms to minimize.
[2024-05-27 16:54:54] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 5 ms to minimize.
[2024-05-27 16:54:54] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 1 ms to minimize.
[2024-05-27 16:54:55] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 1 ms to minimize.
[2024-05-27 16:54:55] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
[2024-05-27 16:54:55] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-05-27 16:54:55] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2024-05-27 16:54:55] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 1 ms to minimize.
[2024-05-27 16:54:55] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 1 ms to minimize.
[2024-05-27 16:54:55] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-27 16:54:55] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 20/187 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-27 16:54:57] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 2 ms to minimize.
[2024-05-27 16:54:57] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
[2024-05-27 16:54:57] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
[2024-05-27 16:54:58] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-05-27 16:54:58] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2024-05-27 16:54:58] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-05-27 16:54:58] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-27 16:54:58] [INFO ] Deduced a trap composed of 46 places in 73 ms of which 1 ms to minimize.
[2024-05-27 16:54:58] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 1 ms to minimize.
[2024-05-27 16:54:58] [INFO ] Deduced a trap composed of 47 places in 69 ms of which 1 ms to minimize.
[2024-05-27 16:54:58] [INFO ] Deduced a trap composed of 46 places in 74 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 11/198 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-27 16:54:59] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 1 ms to minimize.
[2024-05-27 16:55:00] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 1 ms to minimize.
[2024-05-27 16:55:00] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 2 ms to minimize.
[2024-05-27 16:55:00] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 4 ms to minimize.
[2024-05-27 16:55:00] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 5/203 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-27 16:55:01] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 1 ms to minimize.
[2024-05-27 16:55:02] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 1 ms to minimize.
[2024-05-27 16:55:02] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 1 ms to minimize.
[2024-05-27 16:55:02] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 4/207 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/207 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 8 (OVERLAPS) 242/380 variables, 138/345 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 43/388 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/380 variables, 0/388 constraints. Problems are: Problem set: 36 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 380/380 variables, and 388 constraints, problems are : Problem set: 36 solved, 409 unsolved in 30031 ms.
Refiners :[Domain max(s): 138/138 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 445/445 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 36 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 138/138 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 14/152 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 15/167 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 40/207 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-27 16:55:23] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-05-27 16:55:23] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 1 ms to minimize.
[2024-05-27 16:55:23] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 1 ms to minimize.
[2024-05-27 16:55:23] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 1 ms to minimize.
[2024-05-27 16:55:24] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 1 ms to minimize.
[2024-05-27 16:55:24] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 1 ms to minimize.
[2024-05-27 16:55:24] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 1 ms to minimize.
[2024-05-27 16:55:24] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 8/215 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-27 16:55:29] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 1 ms to minimize.
[2024-05-27 16:55:30] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 1 ms to minimize.
[2024-05-27 16:55:30] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 3/218 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/218 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 7 (OVERLAPS) 242/380 variables, 138/356 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 43/399 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 409/808 constraints. Problems are: Problem set: 36 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 808 constraints, problems are : Problem set: 36 solved, 409 unsolved in 30026 ms.
Refiners :[Domain max(s): 138/138 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/445 constraints, Known Traps: 51/51 constraints]
After SMT, in 60627ms problems are : Problem set: 36 solved, 409 unsolved
Search for dead transitions found 36 dead transitions in 60658ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in LTL mode, iteration 1 : 138/138 places, 415/451 transitions.
Applied a total of 0 rules in 3 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61117 ms. Remains : 138/138 places, 415/451 transitions.
Support contains 126 out of 138 places after structural reductions.
[2024-05-27 16:55:51] [INFO ] Flatten gal took : 84 ms
[2024-05-27 16:55:51] [INFO ] Flatten gal took : 58 ms
[2024-05-27 16:55:51] [INFO ] Input system was already deterministic with 415 transitions.
Reduction of identical properties reduced properties to check from 25 to 21
RANDOM walk for 16576 steps (3 resets) in 445 ms. (37 steps per ms) remains 0/21 properties
FORMULA SafeBus-PT-06-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p0)&&(X(G(!p1))||(X(!p1)&&F((G(F(!p2))||(F(!p2)&&G(!p1))))))))))'
Support contains 61 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 4 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-05-27 16:55:52] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
// Phase 1: matrix 242 rows 138 cols
[2024-05-27 16:55:52] [INFO ] Computed 29 invariants in 4 ms
[2024-05-27 16:55:52] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-27 16:55:52] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 16:55:52] [INFO ] Invariant cache hit.
[2024-05-27 16:55:52] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 16:55:52] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
Running 409 sub problems to find dead transitions.
[2024-05-27 16:55:52] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 16:55:52] [INFO ] Invariant cache hit.
[2024-05-27 16:55:52] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 15/167 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 16:55:54] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
[2024-05-27 16:55:54] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-05-27 16:55:54] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2024-05-27 16:55:54] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-05-27 16:55:55] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-27 16:55:55] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-05-27 16:55:55] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-27 16:55:55] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 1 ms to minimize.
[2024-05-27 16:55:55] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-05-27 16:55:55] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 1 ms to minimize.
[2024-05-27 16:55:55] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 1 ms to minimize.
[2024-05-27 16:55:55] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 1 ms to minimize.
[2024-05-27 16:55:56] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-05-27 16:55:56] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
[2024-05-27 16:55:56] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 1 ms to minimize.
[2024-05-27 16:55:56] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 2 ms to minimize.
[2024-05-27 16:55:56] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 1 ms to minimize.
[2024-05-27 16:55:56] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 1 ms to minimize.
[2024-05-27 16:55:57] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 1 ms to minimize.
[2024-05-27 16:55:57] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 20/187 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 16:55:59] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 16:56:00] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 1 ms to minimize.
[2024-05-27 16:56:01] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2024-05-27 16:56:01] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 1 ms to minimize.
[2024-05-27 16:56:01] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 1 ms to minimize.
[2024-05-27 16:56:01] [INFO ] Deduced a trap composed of 49 places in 71 ms of which 2 ms to minimize.
[2024-05-27 16:56:01] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2024-05-27 16:56:01] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 1 ms to minimize.
[2024-05-27 16:56:01] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 1 ms to minimize.
[2024-05-27 16:56:01] [INFO ] Deduced a trap composed of 49 places in 72 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 9/197 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 16:56:03] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 16:56:06] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2024-05-27 16:56:06] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 16:56:08] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 16:56:09] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 11 (OVERLAPS) 242/380 variables, 138/340 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/380 variables, 43/383 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/380 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 380/380 variables, and 383 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30026 ms.
Refiners :[Domain max(s): 138/138 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 15/167 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 35/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (OVERLAPS) 242/380 variables, 138/340 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 43/383 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 409/792 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 16:56:39] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2024-05-27 16:56:39] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-27 16:56:39] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 0 ms to minimize.
[2024-05-27 16:56:39] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 4/796 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 16:56:50] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 1/797 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 797 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30017 ms.
Refiners :[Domain max(s): 138/138 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 40/40 constraints]
After SMT, in 60402ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 60407ms
Finished structural reductions in LTL mode , in 1 iterations and 60810 ms. Remains : 138/138 places, 415/415 transitions.
Stuttering acceptance computed with spot in 386 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p2), (AND p1 p2), (AND p2 (NOT p1) (NOT p0))]
Running random walk in product with property : SafeBus-PT-06-LTLFireability-00
Product exploration explored 100000 steps with 18873 reset in 1312 ms.
Product exploration explored 100000 steps with 18714 reset in 1200 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (X (NOT (OR p1 (NOT p0))))), (X (X p0)), (X (X (NOT (OR (AND p2 p1) (AND p2 (NOT p0)))))), (X (X (NOT p1))), (X (X (NOT (AND p2 p1))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 211 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(AND p1 p2), (AND p1 p2), (AND p2 (NOT p1) (NOT p0))]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (8 resets) in 565 ms. (70 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1928 ms. (20 steps per ms) remains 1/1 properties
[2024-05-27 16:56:57] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 16:56:57] [INFO ] Invariant cache hit.
[2024-05-27 16:56:57] [INFO ] State equation strengthened by 43 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 60/121 variables, 12/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 60/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 6/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 14/135 variables, 9/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 14/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/136 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/136 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/136 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 241/377 variables, 136/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/377 variables, 42/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/377 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/380 variables, 2/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/380 variables, 2/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/380 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/380 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/380 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/380 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 348 constraints, problems are : Problem set: 0 solved, 1 unsolved in 408 ms.
Refiners :[Domain max(s): 138/138 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Int declared 61/380 variables, and 61 constraints, problems are : Problem set: 1 solved, 0 unsolved in 47 ms.
Refiners :[Domain max(s): 61/138 constraints, Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 0/15 constraints, State Equation: 0/138 constraints, ReadFeed: 0/43 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 770ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (X (NOT (OR p1 (NOT p0))))), (X (X p0)), (X (X (NOT (OR (AND p2 p1) (AND p2 (NOT p0)))))), (X (X (NOT p1))), (X (X (NOT (AND p2 p1)))), (G (OR (NOT p2) p0 p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT p0)), (F p1), (F p2), (F (NOT (OR (NOT p2) p1)))]
Knowledge based reduction with 8 factoid took 418 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND p2 p1), (AND p2 p1)]
Stuttering acceptance computed with spot in 74 ms :[(AND p2 p1), (AND p2 p1)]
Support contains 61 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 37 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-05-27 16:56:58] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 16:56:58] [INFO ] Invariant cache hit.
[2024-05-27 16:56:58] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-27 16:56:58] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 16:56:58] [INFO ] Invariant cache hit.
[2024-05-27 16:56:58] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 16:56:58] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
[2024-05-27 16:56:59] [INFO ] Redundant transitions in 28 ms returned []
Running 409 sub problems to find dead transitions.
[2024-05-27 16:56:59] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 16:56:59] [INFO ] Invariant cache hit.
[2024-05-27 16:56:59] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 15/167 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 16:57:00] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 1 ms to minimize.
[2024-05-27 16:57:00] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2024-05-27 16:57:01] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
[2024-05-27 16:57:01] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 1 ms to minimize.
[2024-05-27 16:57:01] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-27 16:57:01] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 0 ms to minimize.
[2024-05-27 16:57:01] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-27 16:57:02] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
[2024-05-27 16:57:02] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 2 ms to minimize.
[2024-05-27 16:57:02] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2024-05-27 16:57:02] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 0 ms to minimize.
[2024-05-27 16:57:02] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 1 ms to minimize.
[2024-05-27 16:57:02] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2024-05-27 16:57:02] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
[2024-05-27 16:57:03] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 1 ms to minimize.
[2024-05-27 16:57:03] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
[2024-05-27 16:57:03] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-05-27 16:57:03] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2024-05-27 16:57:03] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
[2024-05-27 16:57:03] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 20/187 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 16:57:05] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 16:57:07] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 1 ms to minimize.
[2024-05-27 16:57:07] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-05-27 16:57:07] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 1 ms to minimize.
[2024-05-27 16:57:07] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2024-05-27 16:57:07] [INFO ] Deduced a trap composed of 49 places in 68 ms of which 1 ms to minimize.
[2024-05-27 16:57:08] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
[2024-05-27 16:57:08] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 1 ms to minimize.
[2024-05-27 16:57:08] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 1 ms to minimize.
[2024-05-27 16:57:08] [INFO ] Deduced a trap composed of 49 places in 71 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 9/197 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 16:57:09] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 16:57:12] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
[2024-05-27 16:57:12] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 16:57:14] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 16:57:16] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 11 (OVERLAPS) 242/380 variables, 138/340 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/380 variables, 43/383 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/380 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 380/380 variables, and 383 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30027 ms.
Refiners :[Domain max(s): 138/138 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 15/167 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 35/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (OVERLAPS) 242/380 variables, 138/340 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 43/383 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 409/792 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 16:57:45] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2024-05-27 16:57:45] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-27 16:57:45] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 0 ms to minimize.
[2024-05-27 16:57:45] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 4/796 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 16:57:56] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 1/797 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 797 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30021 ms.
Refiners :[Domain max(s): 138/138 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 40/40 constraints]
After SMT, in 60531ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 60535ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61000 ms. Remains : 138/138 places, 415/415 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (NOT p1)), (X (NOT (AND p2 p1))), (X (X (NOT p1))), (X (X (NOT (AND p2 p1))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1)))))]
Knowledge based reduction with 7 factoid took 179 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND p2 p1), (AND p2 p1)]
RANDOM walk for 114 steps (0 resets) in 6 ms. (16 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (NOT p1)), (X (NOT (AND p2 p1))), (X (X (NOT p1))), (X (X (NOT (AND p2 p1))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (F p1), (F p2), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p2) p1)))]
Knowledge based reduction with 7 factoid took 259 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND p2 p1), (AND p2 p1)]
Stuttering acceptance computed with spot in 85 ms :[(AND p2 p1), (AND p2 p1)]
Stuttering acceptance computed with spot in 72 ms :[(AND p2 p1), (AND p2 p1)]
Product exploration explored 100000 steps with 4092 reset in 412 ms.
Product exploration explored 100000 steps with 4016 reset in 518 ms.
Built C files in :
/tmp/ltsmin14911689948534307714
[2024-05-27 16:58:01] [INFO ] Computing symmetric may disable matrix : 415 transitions.
[2024-05-27 16:58:01] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 16:58:01] [INFO ] Computing symmetric may enable matrix : 415 transitions.
[2024-05-27 16:58:01] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 16:58:01] [INFO ] Computing Do-Not-Accords matrix : 415 transitions.
[2024-05-27 16:58:01] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 16:58:01] [INFO ] Built C files in 134ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14911689948534307714
Running compilation step : cd /tmp/ltsmin14911689948534307714;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1317 ms.
Running link step : cd /tmp/ltsmin14911689948534307714;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin14911689948534307714;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7626346276241614679.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 61 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 25 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-05-27 16:58:16] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 16:58:16] [INFO ] Invariant cache hit.
[2024-05-27 16:58:16] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-27 16:58:16] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 16:58:16] [INFO ] Invariant cache hit.
[2024-05-27 16:58:16] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 16:58:16] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
[2024-05-27 16:58:16] [INFO ] Redundant transitions in 9 ms returned []
Running 409 sub problems to find dead transitions.
[2024-05-27 16:58:16] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 16:58:16] [INFO ] Invariant cache hit.
[2024-05-27 16:58:16] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 15/167 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 16:58:18] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 1 ms to minimize.
[2024-05-27 16:58:18] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 1 ms to minimize.
[2024-05-27 16:58:18] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
[2024-05-27 16:58:18] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
[2024-05-27 16:58:19] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-05-27 16:58:19] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 0 ms to minimize.
[2024-05-27 16:58:19] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-05-27 16:58:19] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 1 ms to minimize.
[2024-05-27 16:58:19] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
[2024-05-27 16:58:19] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2024-05-27 16:58:20] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 1 ms to minimize.
[2024-05-27 16:58:20] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 2 ms to minimize.
[2024-05-27 16:58:20] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 2 ms to minimize.
[2024-05-27 16:58:20] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 1 ms to minimize.
[2024-05-27 16:58:20] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 1 ms to minimize.
[2024-05-27 16:58:20] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 1 ms to minimize.
[2024-05-27 16:58:21] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
[2024-05-27 16:58:21] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
[2024-05-27 16:58:21] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 1 ms to minimize.
[2024-05-27 16:58:21] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 20/187 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 16:58:23] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 16:58:24] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 1 ms to minimize.
[2024-05-27 16:58:25] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2024-05-27 16:58:25] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 1 ms to minimize.
[2024-05-27 16:58:25] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
[2024-05-27 16:58:25] [INFO ] Deduced a trap composed of 49 places in 69 ms of which 1 ms to minimize.
[2024-05-27 16:58:25] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2024-05-27 16:58:25] [INFO ] Deduced a trap composed of 56 places in 63 ms of which 1 ms to minimize.
[2024-05-27 16:58:25] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 1 ms to minimize.
[2024-05-27 16:58:26] [INFO ] Deduced a trap composed of 49 places in 63 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 9/197 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 16:58:27] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 16:58:30] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2024-05-27 16:58:30] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 16:58:32] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 16:58:34] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 11 (OVERLAPS) 242/380 variables, 138/340 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/380 variables, 43/383 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/380 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 380/380 variables, and 383 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30019 ms.
Refiners :[Domain max(s): 138/138 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 15/167 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 35/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (OVERLAPS) 242/380 variables, 138/340 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 43/383 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 409/792 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 16:59:03] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 3 ms to minimize.
[2024-05-27 16:59:03] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-05-27 16:59:03] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-05-27 16:59:03] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 4/796 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 16:59:14] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 1/797 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 797 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30011 ms.
Refiners :[Domain max(s): 138/138 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 40/40 constraints]
After SMT, in 60369ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 60373ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60824 ms. Remains : 138/138 places, 415/415 transitions.
Built C files in :
/tmp/ltsmin6852733151785190942
[2024-05-27 16:59:17] [INFO ] Computing symmetric may disable matrix : 415 transitions.
[2024-05-27 16:59:17] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 16:59:17] [INFO ] Computing symmetric may enable matrix : 415 transitions.
[2024-05-27 16:59:17] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 16:59:17] [INFO ] Computing Do-Not-Accords matrix : 415 transitions.
[2024-05-27 16:59:17] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 16:59:17] [INFO ] Built C files in 65ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6852733151785190942
Running compilation step : cd /tmp/ltsmin6852733151785190942;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1196 ms.
Running link step : cd /tmp/ltsmin6852733151785190942;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin6852733151785190942;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16679757493570040248.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-27 16:59:32] [INFO ] Flatten gal took : 52 ms
[2024-05-27 16:59:32] [INFO ] Flatten gal took : 46 ms
[2024-05-27 16:59:32] [INFO ] Time to serialize gal into /tmp/LTL17673158868222620968.gal : 7 ms
[2024-05-27 16:59:32] [INFO ] Time to serialize properties into /tmp/LTL5114254695542728716.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17673158868222620968.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16761934936096590916.hoa' '-atoms' '/tmp/LTL5114254695542728716.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL5114254695542728716.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16761934936096590916.hoa
Detected timeout of ITS tools.
[2024-05-27 16:59:47] [INFO ] Flatten gal took : 35 ms
[2024-05-27 16:59:47] [INFO ] Flatten gal took : 51 ms
[2024-05-27 16:59:47] [INFO ] Time to serialize gal into /tmp/LTL7488095736566225561.gal : 5 ms
[2024-05-27 16:59:47] [INFO ] Time to serialize properties into /tmp/LTL4962999688666549344.ltl : 14 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7488095736566225561.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4962999688666549344.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(F((X("(((((((((((Cpt2_2==0)||(AMC_5_2==0))||((cable_used_5==0)||(FMCb==0)))&&(((Cpt2_3==0)||(AMC_2_3==0))||((cable_used_1==0)||(F...58057
Formula 0 simplified : XG(F!"(((((((((((Cpt2_2==0)||(AMC_5_2==0))||((cable_used_5==0)||(FMCb==0)))&&(((Cpt2_3==0)||(AMC_2_3==0))||((cable_used_1==0)||(FMCb...43987
Detected timeout of ITS tools.
[2024-05-27 17:00:02] [INFO ] Flatten gal took : 32 ms
[2024-05-27 17:00:02] [INFO ] Applying decomposition
[2024-05-27 17:00:02] [INFO ] Flatten gal took : 44 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12332509127313678049.txt' '-o' '/tmp/graph12332509127313678049.bin' '-w' '/tmp/graph12332509127313678049.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12332509127313678049.bin' '-l' '-1' '-v' '-w' '/tmp/graph12332509127313678049.weights' '-q' '0' '-e' '0.001'
[2024-05-27 17:00:03] [INFO ] Decomposing Gal with order
[2024-05-27 17:00:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 17:00:03] [INFO ] Removed a total of 382 redundant transitions.
[2024-05-27 17:00:03] [INFO ] Flatten gal took : 131 ms
[2024-05-27 17:00:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 266 labels/synchronizations in 12 ms.
[2024-05-27 17:00:03] [INFO ] Time to serialize gal into /tmp/LTL6451064525764991241.gal : 5 ms
[2024-05-27 17:00:03] [INFO ] Time to serialize properties into /tmp/LTL7077614841610258867.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6451064525764991241.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7077614841610258867.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(F((X("(((((((((((i1.u3.Cpt2_2==0)||(i1.u3.AMC_5_2==0))||((i1.u3.cable_used_5==0)||(i1.u3.FMCb==0)))&&(((i1.u3.Cpt2_3==0)||(i1.u3....79451
Formula 0 simplified : XG(F!"(((((((((((i1.u3.Cpt2_2==0)||(i1.u3.AMC_5_2==0))||((i1.u3.cable_used_5==0)||(i1.u3.FMCb==0)))&&(((i1.u3.Cpt2_3==0)||(i1.u3.AMC...60191
Detected timeout of ITS tools.
Treatment of property SafeBus-PT-06-LTLFireability-00 finished in 266128 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(X(p0))))))'
Support contains 12 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 5 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-05-27 17:00:18] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 17:00:18] [INFO ] Invariant cache hit.
[2024-05-27 17:00:18] [INFO ] Implicit Places using invariants in 265 ms returned [114, 115, 116, 117, 118, 119]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 267 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/138 places, 415/415 transitions.
Applied a total of 0 rules in 4 ms. Remains 132 /132 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 277 ms. Remains : 132/138 places, 415/415 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-PT-06-LTLFireability-01
Product exploration explored 100000 steps with 50000 reset in 137 ms.
Product exploration explored 100000 steps with 50000 reset in 160 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 14 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SafeBus-PT-06-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SafeBus-PT-06-LTLFireability-01 finished in 664 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((F(p0)||(X(p1)&&p2)))) U p3))'
Support contains 89 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 5 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-05-27 17:00:19] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 17:00:19] [INFO ] Invariant cache hit.
[2024-05-27 17:00:19] [INFO ] Implicit Places using invariants in 154 ms returned [114, 115, 116, 117, 118, 119]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 156 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/138 places, 415/415 transitions.
Applied a total of 0 rules in 2 ms. Remains 132 /132 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 163 ms. Remains : 132/138 places, 415/415 transitions.
Stuttering acceptance computed with spot in 201 ms :[(NOT p3), (OR (NOT p3) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SafeBus-PT-06-LTLFireability-02
Product exploration explored 100000 steps with 8587 reset in 305 ms.
Product exploration explored 100000 steps with 8635 reset in 313 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), (X (NOT p3)), (X (X (NOT p3))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 4 factoid took 284 ms. Reduced automaton from 5 states, 7 edges and 4 AP (stutter sensitive) to 5 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 250 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p3) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1))]
RANDOM walk for 359 steps (0 resets) in 12 ms. (27 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), (X (NOT p3)), (X (X (NOT p3))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (NOT (AND (NOT p0) (NOT p2)))), (F p3), (F p1), (F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p2))))]
Knowledge based reduction with 4 factoid took 483 ms. Reduced automaton from 5 states, 7 edges and 4 AP (stutter sensitive) to 5 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p3) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p3) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1))]
[2024-05-27 17:00:21] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
// Phase 1: matrix 242 rows 132 cols
[2024-05-27 17:00:21] [INFO ] Computed 23 invariants in 4 ms
[2024-05-27 17:00:21] [INFO ] [Real]Absence check using 10 positive place invariants in 13 ms returned unsat
Proved EG (NOT p3)
[2024-05-27 17:00:21] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 17:00:21] [INFO ] Invariant cache hit.
[2024-05-27 17:00:22] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-27 17:00:22] [INFO ] [Real]Absence check using 10 positive and 13 generalized place invariants in 28 ms returned sat
[2024-05-27 17:00:22] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2024-05-27 17:00:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 17:00:22] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-27 17:00:22] [INFO ] [Nat]Absence check using 10 positive and 13 generalized place invariants in 14 ms returned sat
[2024-05-27 17:00:22] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2024-05-27 17:00:22] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 17:00:22] [INFO ] [Nat]Added 43 Read/Feed constraints in 31 ms returned sat
[2024-05-27 17:00:22] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-27 17:00:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2024-05-27 17:00:22] [INFO ] Computed and/alt/rep : 66/348/66 causal constraints (skipped 170 transitions) in 23 ms.
[2024-05-27 17:00:22] [INFO ] Added : 11 causal constraints over 3 iterations in 115 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
[2024-05-27 17:00:22] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 17:00:22] [INFO ] Invariant cache hit.
[2024-05-27 17:00:23] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-27 17:00:23] [INFO ] [Real]Absence check using 10 positive and 13 generalized place invariants in 19 ms returned sat
[2024-05-27 17:00:23] [INFO ] [Real]Absence check using state equation in 245 ms returned sat
[2024-05-27 17:00:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 17:00:24] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2024-05-27 17:00:24] [INFO ] [Nat]Absence check using 10 positive and 13 generalized place invariants in 12 ms returned sat
[2024-05-27 17:00:24] [INFO ] [Nat]Absence check using state equation in 219 ms returned sat
[2024-05-27 17:00:24] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 17:00:24] [INFO ] [Nat]Added 43 Read/Feed constraints in 38 ms returned sat
[2024-05-27 17:00:24] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2024-05-27 17:00:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2024-05-27 17:00:24] [INFO ] Computed and/alt/rep : 66/348/66 causal constraints (skipped 170 transitions) in 23 ms.
[2024-05-27 17:00:24] [INFO ] Added : 40 causal constraints over 8 iterations in 246 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), (X (NOT p3)), (X (X (NOT p3))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (NOT (AND (NOT p0) (NOT p2)))), (F p3), (F p1), (F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p2)))), (G (NOT p3))]
Property proved to be false thanks to negative knowledge :(G (NOT p3))
Knowledge based reduction with 4 factoid took 362 ms. Reduced automaton from 5 states, 7 edges and 4 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA SafeBus-PT-06-LTLFireability-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property SafeBus-PT-06-LTLFireability-02 finished in 6261 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 19 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-05-27 17:00:25] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
// Phase 1: matrix 242 rows 138 cols
[2024-05-27 17:00:25] [INFO ] Computed 29 invariants in 2 ms
[2024-05-27 17:00:25] [INFO ] Implicit Places using invariants in 250 ms returned [114, 115, 116, 117, 118, 119]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 251 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/138 places, 415/415 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 132 transition count 409
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 409
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -114
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 120 transition count 523
Applied a total of 24 rules in 74 ms. Remains 120 /132 variables (removed 12) and now considering 523/415 (removed -108) transitions.
[2024-05-27 17:00:25] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
// Phase 1: matrix 350 rows 120 cols
[2024-05-27 17:00:25] [INFO ] Computed 23 invariants in 7 ms
[2024-05-27 17:00:25] [INFO ] Implicit Places using invariants in 214 ms returned []
[2024-05-27 17:00:25] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
[2024-05-27 17:00:25] [INFO ] Invariant cache hit.
[2024-05-27 17:00:26] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 17:00:26] [INFO ] Implicit Places using invariants and state equation in 514 ms returned []
Implicit Place search using SMT with State Equation took 731 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 120/138 places, 523/415 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1078 ms. Remains : 120/138 places, 523/415 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : SafeBus-PT-06-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 315 ms.
Stack based approach found an accepted trace after 212 steps with 0 reset with depth 213 and stack size 213 in 1 ms.
FORMULA SafeBus-PT-06-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-PT-06-LTLFireability-03 finished in 1450 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 12 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 17 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-05-27 17:00:26] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
// Phase 1: matrix 242 rows 138 cols
[2024-05-27 17:00:26] [INFO ] Computed 29 invariants in 3 ms
[2024-05-27 17:00:27] [INFO ] Implicit Places using invariants in 238 ms returned [114, 115, 116, 117, 118, 119]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 239 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/138 places, 415/415 transitions.
Applied a total of 0 rules in 19 ms. Remains 132 /132 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 276 ms. Remains : 132/138 places, 415/415 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-PT-06-LTLFireability-04
Product exploration explored 100000 steps with 3891 reset in 206 ms.
Product exploration explored 100000 steps with 3944 reset in 210 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 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 58 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 76 steps (0 resets) in 5 ms. (12 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 95 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 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Support contains 12 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 415/415 transitions.
Applied a total of 0 rules in 14 ms. Remains 132 /132 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-05-27 17:00:27] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
// Phase 1: matrix 242 rows 132 cols
[2024-05-27 17:00:27] [INFO ] Computed 23 invariants in 2 ms
[2024-05-27 17:00:28] [INFO ] Implicit Places using invariants in 201 ms returned []
[2024-05-27 17:00:28] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 17:00:28] [INFO ] Invariant cache hit.
[2024-05-27 17:00:28] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 17:00:28] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 602 ms to find 0 implicit places.
[2024-05-27 17:00:28] [INFO ] Redundant transitions in 4 ms returned []
Running 409 sub problems to find dead transitions.
[2024-05-27 17:00:28] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 17:00:28] [INFO ] Invariant cache hit.
[2024-05-27 17:00:28] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 132/132 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 10/142 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 13/155 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 17:00:30] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 3 ms to minimize.
[2024-05-27 17:00:30] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-05-27 17:00:31] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 0 ms to minimize.
[2024-05-27 17:00:31] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 0 ms to minimize.
[2024-05-27 17:00:31] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-05-27 17:00:31] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 1 ms to minimize.
[2024-05-27 17:00:31] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2024-05-27 17:00:31] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
[2024-05-27 17:00:32] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2024-05-27 17:00:32] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
[2024-05-27 17:00:32] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-27 17:00:32] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-27 17:00:32] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-27 17:00:32] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 1 ms to minimize.
[2024-05-27 17:00:32] [INFO ] Deduced a trap composed of 66 places in 61 ms of which 1 ms to minimize.
[2024-05-27 17:00:32] [INFO ] Deduced a trap composed of 61 places in 75 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 16/171 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 17:00:34] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2024-05-27 17:00:34] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
[2024-05-27 17:00:35] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
[2024-05-27 17:00:35] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2024-05-27 17:00:35] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 5/176 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 17:00:36] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2024-05-27 17:00:36] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 1 ms to minimize.
[2024-05-27 17:00:36] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 1 ms to minimize.
[2024-05-27 17:00:36] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
[2024-05-27 17:00:36] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 1 ms to minimize.
[2024-05-27 17:00:37] [INFO ] Deduced a trap composed of 61 places in 70 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 6/182 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 17:00:38] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 17:00:40] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-05-27 17:00:41] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 0 ms to minimize.
[2024-05-27 17:00:41] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2024-05-27 17:00:41] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 4/187 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 9 (OVERLAPS) 242/374 variables, 132/319 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 43/362 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 12 (OVERLAPS) 0/374 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 409 unsolved
No progress, stopping.
After SMT solving in domain Real declared 374/374 variables, and 362 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30019 ms.
Refiners :[Domain max(s): 132/132 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 132/132 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 132/132 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 10/142 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 13/155 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 32/187 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 17:01:02] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2024-05-27 17:01:03] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 2/189 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (OVERLAPS) 242/374 variables, 132/321 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 43/364 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/374 variables, 409/773 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/374 variables, 0/773 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 374/374 variables, and 773 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30013 ms.
Refiners :[Domain max(s): 132/132 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 132/132 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 34/34 constraints]
After SMT, in 60379ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 60384ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61015 ms. Remains : 132/132 places, 415/415 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 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 78 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 64 steps (0 resets) in 5 ms. (10 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 92 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 150 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3948 reset in 209 ms.
Product exploration explored 100000 steps with 3902 reset in 215 ms.
Built C files in :
/tmp/ltsmin11726287740579162249
[2024-05-27 17:01:30] [INFO ] Computing symmetric may disable matrix : 415 transitions.
[2024-05-27 17:01:30] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 17:01:30] [INFO ] Computing symmetric may enable matrix : 415 transitions.
[2024-05-27 17:01:30] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 17:01:30] [INFO ] Computing Do-Not-Accords matrix : 415 transitions.
[2024-05-27 17:01:30] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 17:01:30] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11726287740579162249
Running compilation step : cd /tmp/ltsmin11726287740579162249;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1088 ms.
Running link step : cd /tmp/ltsmin11726287740579162249;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin11726287740579162249;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15624911994227585885.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 12 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 415/415 transitions.
Applied a total of 0 rules in 17 ms. Remains 132 /132 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-05-27 17:01:45] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 17:01:45] [INFO ] Invariant cache hit.
[2024-05-27 17:01:45] [INFO ] Implicit Places using invariants in 234 ms returned []
[2024-05-27 17:01:45] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 17:01:45] [INFO ] Invariant cache hit.
[2024-05-27 17:01:45] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 17:01:45] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 582 ms to find 0 implicit places.
[2024-05-27 17:01:45] [INFO ] Redundant transitions in 1 ms returned []
Running 409 sub problems to find dead transitions.
[2024-05-27 17:01:45] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 17:01:45] [INFO ] Invariant cache hit.
[2024-05-27 17:01:45] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 132/132 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 10/142 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 13/155 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 17:01:47] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 2 ms to minimize.
[2024-05-27 17:01:48] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-05-27 17:01:48] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 1 ms to minimize.
[2024-05-27 17:01:48] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2024-05-27 17:01:48] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2024-05-27 17:01:48] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 1 ms to minimize.
[2024-05-27 17:01:48] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2024-05-27 17:01:48] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 1 ms to minimize.
[2024-05-27 17:01:48] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2024-05-27 17:01:49] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-05-27 17:01:49] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-05-27 17:01:49] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-27 17:01:49] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-27 17:01:49] [INFO ] Deduced a trap composed of 47 places in 70 ms of which 1 ms to minimize.
[2024-05-27 17:01:49] [INFO ] Deduced a trap composed of 66 places in 74 ms of which 1 ms to minimize.
[2024-05-27 17:01:49] [INFO ] Deduced a trap composed of 61 places in 74 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 16/171 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 17:01:51] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
[2024-05-27 17:01:51] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 1 ms to minimize.
[2024-05-27 17:01:52] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2024-05-27 17:01:52] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-27 17:01:52] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 5/176 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 17:01:53] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2024-05-27 17:01:53] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 2 ms to minimize.
[2024-05-27 17:01:53] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 1 ms to minimize.
[2024-05-27 17:01:53] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2024-05-27 17:01:53] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 1 ms to minimize.
[2024-05-27 17:01:54] [INFO ] Deduced a trap composed of 61 places in 74 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 6/182 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 17:01:55] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 17:01:58] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2024-05-27 17:01:58] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
[2024-05-27 17:01:58] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-05-27 17:01:58] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 4/187 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 9 (OVERLAPS) 242/374 variables, 132/319 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 43/362 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 12 (OVERLAPS) 0/374 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 409 unsolved
No progress, stopping.
After SMT solving in domain Real declared 374/374 variables, and 362 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30025 ms.
Refiners :[Domain max(s): 132/132 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 132/132 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 132/132 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 10/142 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 13/155 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 32/187 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 17:02:20] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-05-27 17:02:20] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 2/189 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (OVERLAPS) 242/374 variables, 132/321 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 43/364 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/374 variables, 409/773 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/374 variables, 0/773 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 374/374 variables, and 773 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30026 ms.
Refiners :[Domain max(s): 132/132 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 132/132 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 34/34 constraints]
After SMT, in 60380ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 60383ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60992 ms. Remains : 132/132 places, 415/415 transitions.
Built C files in :
/tmp/ltsmin11132082887287541450
[2024-05-27 17:02:46] [INFO ] Computing symmetric may disable matrix : 415 transitions.
[2024-05-27 17:02:46] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 17:02:46] [INFO ] Computing symmetric may enable matrix : 415 transitions.
[2024-05-27 17:02:46] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 17:02:46] [INFO ] Computing Do-Not-Accords matrix : 415 transitions.
[2024-05-27 17:02:46] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 17:02:46] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11132082887287541450
Running compilation step : cd /tmp/ltsmin11132082887287541450;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1081 ms.
Running link step : cd /tmp/ltsmin11132082887287541450;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin11132082887287541450;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12413229759760011764.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-27 17:03:01] [INFO ] Flatten gal took : 22 ms
[2024-05-27 17:03:01] [INFO ] Flatten gal took : 18 ms
[2024-05-27 17:03:01] [INFO ] Time to serialize gal into /tmp/LTL5605983656741080641.gal : 3 ms
[2024-05-27 17:03:01] [INFO ] Time to serialize properties into /tmp/LTL7878207557774354561.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5605983656741080641.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10773233435877686498.hoa' '-atoms' '/tmp/LTL7878207557774354561.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL7878207557774354561.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10773233435877686498.hoa
Detected timeout of ITS tools.
[2024-05-27 17:03:16] [INFO ] Flatten gal took : 17 ms
[2024-05-27 17:03:16] [INFO ] Flatten gal took : 16 ms
[2024-05-27 17:03:16] [INFO ] Time to serialize gal into /tmp/LTL11940954681906268601.gal : 3 ms
[2024-05-27 17:03:16] [INFO ] Time to serialize properties into /tmp/LTL3183697678840020160.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11940954681906268601.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3183697678840020160.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((MSG_1==0)||(wait_msg_1==0))&&((MSG_2==0)||(wait_msg_2==0)))&&(((MSG_3==0)||(wait_msg_3==0))&&((MSG_4==0)||(wait_msg_4==0)...228
Formula 0 simplified : FG!"(((((MSG_1==0)||(wait_msg_1==0))&&((MSG_2==0)||(wait_msg_2==0)))&&(((MSG_3==0)||(wait_msg_3==0))&&((MSG_4==0)||(wait_msg_4==0)))...222
Detected timeout of ITS tools.
[2024-05-27 17:03:31] [INFO ] Flatten gal took : 21 ms
[2024-05-27 17:03:31] [INFO ] Applying decomposition
[2024-05-27 17:03:31] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14776241671215252049.txt' '-o' '/tmp/graph14776241671215252049.bin' '-w' '/tmp/graph14776241671215252049.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14776241671215252049.bin' '-l' '-1' '-v' '-w' '/tmp/graph14776241671215252049.weights' '-q' '0' '-e' '0.001'
[2024-05-27 17:03:31] [INFO ] Decomposing Gal with order
[2024-05-27 17:03:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 17:03:31] [INFO ] Removed a total of 362 redundant transitions.
[2024-05-27 17:03:31] [INFO ] Flatten gal took : 82 ms
[2024-05-27 17:03:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 294 labels/synchronizations in 10 ms.
[2024-05-27 17:03:31] [INFO ] Time to serialize gal into /tmp/LTL7362157198465038128.gal : 4 ms
[2024-05-27 17:03:31] [INFO ] Time to serialize properties into /tmp/LTL10691019119808823219.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7362157198465038128.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10691019119808823219.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((i2.u2.MSG_1==0)||(u4.wait_msg_1==0))&&((i2.u2.MSG_2==0)||(u4.wait_msg_2==0)))&&(((i2.u2.MSG_3==0)||(u5.wait_msg_3==0))&&(...282
Formula 0 simplified : FG!"(((((i2.u2.MSG_1==0)||(u4.wait_msg_1==0))&&((i2.u2.MSG_2==0)||(u4.wait_msg_2==0)))&&(((i2.u2.MSG_3==0)||(u5.wait_msg_3==0))&&((i...276
Detected timeout of ITS tools.
Treatment of property SafeBus-PT-06-LTLFireability-04 finished in 199883 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 7 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 3 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-05-27 17:03:46] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
// Phase 1: matrix 242 rows 138 cols
[2024-05-27 17:03:46] [INFO ] Computed 29 invariants in 3 ms
[2024-05-27 17:03:46] [INFO ] Implicit Places using invariants in 240 ms returned [114, 115, 116, 117, 118, 119]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 241 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/138 places, 415/415 transitions.
Applied a total of 0 rules in 2 ms. Remains 132 /132 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 246 ms. Remains : 132/138 places, 415/415 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-PT-06-LTLFireability-05
Product exploration explored 100000 steps with 14012 reset in 195 ms.
Product exploration explored 100000 steps with 14044 reset in 205 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 26 steps (0 resets) in 4 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 85 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 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
[2024-05-27 17:03:47] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
// Phase 1: matrix 242 rows 132 cols
[2024-05-27 17:03:47] [INFO ] Computed 23 invariants in 6 ms
[2024-05-27 17:03:47] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-27 17:03:48] [INFO ] [Real]Absence check using 10 positive and 13 generalized place invariants in 35 ms returned sat
[2024-05-27 17:03:48] [INFO ] [Real]Absence check using state equation in 180 ms returned sat
[2024-05-27 17:03:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 17:03:48] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-27 17:03:48] [INFO ] [Nat]Absence check using 10 positive and 13 generalized place invariants in 13 ms returned sat
[2024-05-27 17:03:48] [INFO ] [Nat]Absence check using state equation in 178 ms returned sat
[2024-05-27 17:03:48] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 17:03:48] [INFO ] [Nat]Added 43 Read/Feed constraints in 27 ms returned sat
[2024-05-27 17:03:48] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-27 17:03:48] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-27 17:03:48] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
[2024-05-27 17:03:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 178 ms
[2024-05-27 17:03:48] [INFO ] Computed and/alt/rep : 66/348/66 causal constraints (skipped 170 transitions) in 22 ms.
[2024-05-27 17:03:48] [INFO ] Added : 40 causal constraints over 8 iterations in 228 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 7 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 415/415 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 132 transition count 409
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 409
Applied a total of 12 rules in 15 ms. Remains 126 /132 variables (removed 6) and now considering 409/415 (removed 6) transitions.
[2024-05-27 17:03:49] [INFO ] Flow matrix only has 236 transitions (discarded 173 similar events)
// Phase 1: matrix 236 rows 126 cols
[2024-05-27 17:03:49] [INFO ] Computed 23 invariants in 3 ms
[2024-05-27 17:03:49] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-05-27 17:03:49] [INFO ] Flow matrix only has 236 transitions (discarded 173 similar events)
[2024-05-27 17:03:49] [INFO ] Invariant cache hit.
[2024-05-27 17:03:49] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 17:03:49] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 500 ms to find 0 implicit places.
[2024-05-27 17:03:49] [INFO ] Redundant transitions in 2 ms returned []
Running 403 sub problems to find dead transitions.
[2024-05-27 17:03:49] [INFO ] Flow matrix only has 236 transitions (discarded 173 similar events)
[2024-05-27 17:03:49] [INFO ] Invariant cache hit.
[2024-05-27 17:03:49] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 10/136 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 13/149 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-05-27 17:03:51] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 0 ms to minimize.
[2024-05-27 17:03:51] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-27 17:03:51] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-27 17:03:51] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 2 ms to minimize.
[2024-05-27 17:03:52] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2024-05-27 17:03:52] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-05-27 17:03:52] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
[2024-05-27 17:03:52] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 1 ms to minimize.
[2024-05-27 17:03:52] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
[2024-05-27 17:03:52] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 0 ms to minimize.
[2024-05-27 17:03:52] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2024-05-27 17:03:52] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 4 ms to minimize.
[2024-05-27 17:03:52] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 1 ms to minimize.
[2024-05-27 17:03:53] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 1 ms to minimize.
[2024-05-27 17:03:53] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 0 ms to minimize.
[2024-05-27 17:03:53] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2024-05-27 17:03:53] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 1 ms to minimize.
[2024-05-27 17:03:53] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2024-05-27 17:03:53] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-05-27 17:03:53] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 20/169 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-05-27 17:03:55] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-05-27 17:03:55] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-05-27 17:03:55] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2024-05-27 17:03:55] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 0 ms to minimize.
[2024-05-27 17:03:55] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-27 17:03:55] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 6/175 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-05-27 17:03:56] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2024-05-27 17:03:57] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2024-05-27 17:03:57] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
[2024-05-27 17:03:57] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 4/179 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-05-27 17:03:59] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 8 (OVERLAPS) 236/362 variables, 126/306 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/362 variables, 43/349 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/362 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 11 (OVERLAPS) 0/362 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 403 unsolved
No progress, stopping.
After SMT solving in domain Real declared 362/362 variables, and 349 constraints, problems are : Problem set: 0 solved, 403 unsolved in 30013 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 403/403 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 403 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 10/136 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 13/149 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 31/180 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-05-27 17:04:21] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 0 ms to minimize.
[2024-05-27 17:04:22] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 0 ms to minimize.
[2024-05-27 17:04:23] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-05-27 17:04:24] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
[2024-05-27 17:04:24] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 5/185 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 6 (OVERLAPS) 236/362 variables, 126/311 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 43/354 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/362 variables, 403/757 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/362 variables, 0/757 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 10 (OVERLAPS) 0/362 variables, 0/757 constraints. Problems are: Problem set: 0 solved, 403 unsolved
No progress, stopping.
After SMT solving in domain Int declared 362/362 variables, and 757 constraints, problems are : Problem set: 0 solved, 403 unsolved in 30022 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 403/403 constraints, Known Traps: 36/36 constraints]
After SMT, in 60368ms problems are : Problem set: 0 solved, 403 unsolved
Search for dead transitions found 0 dead transitions in 60372ms
Starting structural reductions in SI_LTL mode, iteration 1 : 126/132 places, 409/415 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60894 ms. Remains : 126/132 places, 409/415 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 66 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 60 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 23 steps (0 resets) in 6 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 95 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 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
[2024-05-27 17:04:50] [INFO ] Flow matrix only has 236 transitions (discarded 173 similar events)
[2024-05-27 17:04:50] [INFO ] Invariant cache hit.
[2024-05-27 17:04:50] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-05-27 17:04:50] [INFO ] [Real]Absence check using 10 positive and 13 generalized place invariants in 18 ms returned sat
[2024-05-27 17:04:50] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2024-05-27 17:04:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 17:04:50] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-27 17:04:50] [INFO ] [Nat]Absence check using 10 positive and 13 generalized place invariants in 13 ms returned sat
[2024-05-27 17:04:50] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2024-05-27 17:04:50] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 17:04:50] [INFO ] [Nat]Added 43 Read/Feed constraints in 18 ms returned sat
[2024-05-27 17:04:50] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 0 ms to minimize.
[2024-05-27 17:04:51] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-27 17:04:51] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-27 17:04:51] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-27 17:04:51] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-27 17:04:51] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 302 ms
[2024-05-27 17:04:51] [INFO ] Computed and/alt/rep : 54/270/54 causal constraints (skipped 176 transitions) in 22 ms.
[2024-05-27 17:04:51] [INFO ] Added : 9 causal constraints over 3 iterations in 89 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 14114 reset in 206 ms.
Product exploration explored 100000 steps with 14137 reset in 235 ms.
Built C files in :
/tmp/ltsmin18351706200460922790
[2024-05-27 17:04:51] [INFO ] Computing symmetric may disable matrix : 409 transitions.
[2024-05-27 17:04:51] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 17:04:51] [INFO ] Computing symmetric may enable matrix : 409 transitions.
[2024-05-27 17:04:51] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 17:04:51] [INFO ] Computing Do-Not-Accords matrix : 409 transitions.
[2024-05-27 17:04:51] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 17:04:51] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18351706200460922790
Running compilation step : cd /tmp/ltsmin18351706200460922790;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1059 ms.
Running link step : cd /tmp/ltsmin18351706200460922790;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin18351706200460922790;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9082154037599228509.hoa' '--buchi-type=spotba'
LTSmin run took 2133 ms.
FORMULA SafeBus-PT-06-LTLFireability-05 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SafeBus-PT-06-LTLFireability-05 finished in 68465 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(G((F(p2)&&p1))))&&p0)))'
Support contains 19 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 3 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-05-27 17:04:55] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
// Phase 1: matrix 242 rows 138 cols
[2024-05-27 17:04:55] [INFO ] Computed 29 invariants in 1 ms
[2024-05-27 17:04:55] [INFO ] Implicit Places using invariants in 247 ms returned [114, 115, 116, 117, 118, 119]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 249 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/138 places, 415/415 transitions.
Applied a total of 0 rules in 3 ms. Remains 132 /132 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 256 ms. Remains : 132/138 places, 415/415 transitions.
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : SafeBus-PT-06-LTLFireability-07
Product exploration explored 100000 steps with 3875 reset in 416 ms.
Stack based approach found an accepted trace after 49147 steps with 1884 reset with depth 48 and stack size 48 in 209 ms.
FORMULA SafeBus-PT-06-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-PT-06-LTLFireability-07 finished in 1103 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G((X(p0)||(G(p1)&&X(p2))))||X(p3))))'
Support contains 8 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 3 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-05-27 17:04:56] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 17:04:56] [INFO ] Invariant cache hit.
[2024-05-27 17:04:56] [INFO ] Implicit Places using invariants in 215 ms returned [114, 115, 116, 117, 118, 119]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 215 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/138 places, 415/415 transitions.
Applied a total of 0 rules in 2 ms. Remains 132 /132 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 221 ms. Remains : 132/138 places, 415/415 transitions.
Stuttering acceptance computed with spot in 289 ms :[true, (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : SafeBus-PT-06-LTLFireability-10
Entered a terminal (fully accepting) state of product in 4303 steps with 0 reset in 11 ms.
FORMULA SafeBus-PT-06-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-PT-06-LTLFireability-10 finished in 547 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(((G(p0) U p1)&&X(X(!p2)))) U p1)))'
Support contains 6 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 1 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-05-27 17:04:56] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 17:04:56] [INFO ] Invariant cache hit.
[2024-05-27 17:04:57] [INFO ] Implicit Places using invariants in 259 ms returned [114, 115, 116, 117, 118, 119]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 260 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/138 places, 415/415 transitions.
Applied a total of 0 rules in 1 ms. Remains 132 /132 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 262 ms. Remains : 132/138 places, 415/415 transitions.
Stuttering acceptance computed with spot in 663 ms :[(NOT p1), (NOT p1), (OR (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p1), p2, (AND (NOT p0) p2), p2, (AND (NOT p0) p2), (AND (NOT p1) p2), p2, (AND (NOT p0) p2)]
Running random walk in product with property : SafeBus-PT-06-LTLFireability-11
Product exploration explored 100000 steps with 384 reset in 259 ms.
Stack based approach found an accepted trace after 250 steps with 0 reset with depth 251 and stack size 251 in 1 ms.
FORMULA SafeBus-PT-06-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-PT-06-LTLFireability-11 finished in 1214 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Support contains 6 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 12 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-05-27 17:04:58] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 17:04:58] [INFO ] Invariant cache hit.
[2024-05-27 17:04:58] [INFO ] Implicit Places using invariants in 217 ms returned [114, 115, 116, 117, 118, 119]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 217 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/138 places, 415/415 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 132 transition count 409
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 409
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
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 14 place count 125 transition count 428
Applied a total of 14 rules in 16 ms. Remains 125 /132 variables (removed 7) and now considering 428/415 (removed -13) transitions.
[2024-05-27 17:04:58] [INFO ] Flow matrix only has 255 transitions (discarded 173 similar events)
// Phase 1: matrix 255 rows 125 cols
[2024-05-27 17:04:58] [INFO ] Computed 23 invariants in 2 ms
[2024-05-27 17:04:58] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-05-27 17:04:58] [INFO ] Flow matrix only has 255 transitions (discarded 173 similar events)
[2024-05-27 17:04:58] [INFO ] Invariant cache hit.
[2024-05-27 17:04:58] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 17:04:58] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 563 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 125/138 places, 428/415 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 809 ms. Remains : 125/138 places, 428/415 transitions.
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : SafeBus-PT-06-LTLFireability-12
Product exploration explored 100000 steps with 1058 reset in 258 ms.
Stack based approach found an accepted trace after 368 steps with 4 reset with depth 81 and stack size 81 in 2 ms.
FORMULA SafeBus-PT-06-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-PT-06-LTLFireability-12 finished in 1126 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0&&X(G(p1))) U X(X(p0))))'
Support contains 4 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 2 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-05-27 17:04:59] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
// Phase 1: matrix 242 rows 138 cols
[2024-05-27 17:04:59] [INFO ] Computed 29 invariants in 4 ms
[2024-05-27 17:04:59] [INFO ] Implicit Places using invariants in 265 ms returned [114, 115, 116, 117, 118, 119]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 266 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/138 places, 415/415 transitions.
Applied a total of 0 rules in 1 ms. Remains 132 /132 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 271 ms. Remains : 132/138 places, 415/415 transitions.
Stuttering acceptance computed with spot in 335 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1)), true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : SafeBus-PT-06-LTLFireability-14
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SafeBus-PT-06-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-PT-06-LTLFireability-14 finished in 635 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&(X(X(G(p2)))||p1))))'
Support contains 5 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 3 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-05-27 17:04:59] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 17:04:59] [INFO ] Invariant cache hit.
[2024-05-27 17:05:00] [INFO ] Implicit Places using invariants in 260 ms returned [115, 116, 117, 118, 119]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 261 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 133/138 places, 415/415 transitions.
Applied a total of 0 rules in 1 ms. Remains 133 /133 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 265 ms. Remains : 133/138 places, 415/415 transitions.
Stuttering acceptance computed with spot in 175 ms :[true, (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : SafeBus-PT-06-LTLFireability-15
Product exploration explored 100000 steps with 33333 reset in 167 ms.
Product exploration explored 100000 steps with 33333 reset in 182 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p1), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 17 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SafeBus-PT-06-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SafeBus-PT-06-LTLFireability-15 finished in 837 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p0)&&(X(G(!p1))||(X(!p1)&&F((G(F(!p2))||(F(!p2)&&G(!p1))))))))))'
Found a Shortening insensitive property : SafeBus-PT-06-LTLFireability-00
Stuttering acceptance computed with spot in 272 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p2), (AND p1 p2), (AND p2 (NOT p1) (NOT p0))]
Support contains 61 out of 138 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 10 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-05-27 17:05:01] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 17:05:01] [INFO ] Invariant cache hit.
[2024-05-27 17:05:01] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-27 17:05:01] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 17:05:01] [INFO ] Invariant cache hit.
[2024-05-27 17:05:01] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 17:05:01] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 412 ms to find 0 implicit places.
Running 409 sub problems to find dead transitions.
[2024-05-27 17:05:01] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 17:05:01] [INFO ] Invariant cache hit.
[2024-05-27 17:05:01] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 15/167 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 17:05:03] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 1 ms to minimize.
[2024-05-27 17:05:03] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 2 ms to minimize.
[2024-05-27 17:05:03] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
[2024-05-27 17:05:03] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 1 ms to minimize.
[2024-05-27 17:05:03] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-27 17:05:04] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2024-05-27 17:05:04] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-27 17:05:04] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
[2024-05-27 17:05:04] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2024-05-27 17:05:04] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2024-05-27 17:05:04] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2024-05-27 17:05:04] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 1 ms to minimize.
[2024-05-27 17:05:04] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2024-05-27 17:05:05] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
[2024-05-27 17:05:05] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 1 ms to minimize.
[2024-05-27 17:05:05] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 1 ms to minimize.
[2024-05-27 17:05:05] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-05-27 17:05:05] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2024-05-27 17:05:05] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2024-05-27 17:05:05] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 20/187 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 17:05:08] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 17:05:09] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
[2024-05-27 17:05:10] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2024-05-27 17:05:10] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 1 ms to minimize.
[2024-05-27 17:05:10] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 1 ms to minimize.
[2024-05-27 17:05:10] [INFO ] Deduced a trap composed of 49 places in 78 ms of which 1 ms to minimize.
[2024-05-27 17:05:10] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 1 ms to minimize.
[2024-05-27 17:05:10] [INFO ] Deduced a trap composed of 56 places in 75 ms of which 1 ms to minimize.
[2024-05-27 17:05:10] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 1 ms to minimize.
[2024-05-27 17:05:10] [INFO ] Deduced a trap composed of 49 places in 66 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 9/197 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 17:05:12] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 17:05:15] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 1 ms to minimize.
[2024-05-27 17:05:15] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 17:05:17] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 17:05:18] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 11 (OVERLAPS) 242/380 variables, 138/340 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/380 variables, 43/383 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/380 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 380/380 variables, and 383 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30013 ms.
Refiners :[Domain max(s): 138/138 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 15/167 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 35/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (OVERLAPS) 242/380 variables, 138/340 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 43/383 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 409/792 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 17:05:47] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
[2024-05-27 17:05:47] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 0 ms to minimize.
[2024-05-27 17:05:47] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 0 ms to minimize.
[2024-05-27 17:05:47] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 4/796 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 17:05:58] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 1/797 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 797 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30016 ms.
Refiners :[Domain max(s): 138/138 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 40/40 constraints]
After SMT, in 60375ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 60381ms
Finished structural reductions in LI_LTL mode , in 1 iterations and 60806 ms. Remains : 138/138 places, 415/415 transitions.
Running random walk in product with property : SafeBus-PT-06-LTLFireability-00
Product exploration explored 100000 steps with 18841 reset in 1214 ms.
Product exploration explored 100000 steps with 18703 reset in 1221 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (X (NOT (OR p1 (NOT p0))))), (X (X p0)), (X (X (NOT (OR (AND p2 p1) (AND p2 (NOT p0)))))), (X (X (NOT p1))), (X (X (NOT (AND p2 p1))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 210 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(AND p1 p2), (AND p1 p2), (AND p2 (NOT p1) (NOT p0))]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (8 resets) in 400 ms. (99 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 1566 ms. (25 steps per ms) remains 1/1 properties
[2024-05-27 17:06:05] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 17:06:05] [INFO ] Invariant cache hit.
[2024-05-27 17:06:05] [INFO ] State equation strengthened by 43 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 60/121 variables, 12/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 60/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 6/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 14/135 variables, 9/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 14/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/136 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/136 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/136 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 241/377 variables, 136/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/377 variables, 42/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/377 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/380 variables, 2/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/380 variables, 2/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/380 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/380 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/380 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/380 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 348 constraints, problems are : Problem set: 0 solved, 1 unsolved in 369 ms.
Refiners :[Domain max(s): 138/138 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Int declared 61/380 variables, and 61 constraints, problems are : Problem set: 1 solved, 0 unsolved in 60 ms.
Refiners :[Domain max(s): 61/138 constraints, Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 0/15 constraints, State Equation: 0/138 constraints, ReadFeed: 0/43 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 600ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (X (NOT (OR p1 (NOT p0))))), (X (X p0)), (X (X (NOT (OR (AND p2 p1) (AND p2 (NOT p0)))))), (X (X (NOT p1))), (X (X (NOT (AND p2 p1)))), (G (OR (NOT p2) p0 p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT p0)), (F p1), (F p2), (F (NOT (OR (NOT p2) p1)))]
Knowledge based reduction with 8 factoid took 388 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND p2 p1), (AND p2 p1)]
Stuttering acceptance computed with spot in 72 ms :[(AND p2 p1), (AND p2 p1)]
Support contains 61 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 11 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-05-27 17:06:06] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 17:06:06] [INFO ] Invariant cache hit.
[2024-05-27 17:06:06] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-27 17:06:06] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 17:06:06] [INFO ] Invariant cache hit.
[2024-05-27 17:06:06] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 17:06:06] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
[2024-05-27 17:06:06] [INFO ] Redundant transitions in 1 ms returned []
Running 409 sub problems to find dead transitions.
[2024-05-27 17:06:06] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 17:06:06] [INFO ] Invariant cache hit.
[2024-05-27 17:06:06] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 15/167 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 17:06:08] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 1 ms to minimize.
[2024-05-27 17:06:08] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 1 ms to minimize.
[2024-05-27 17:06:08] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-05-27 17:06:08] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-05-27 17:06:09] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-27 17:06:09] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 0 ms to minimize.
[2024-05-27 17:06:09] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 0 ms to minimize.
[2024-05-27 17:06:09] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2024-05-27 17:06:09] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 1 ms to minimize.
[2024-05-27 17:06:09] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2024-05-27 17:06:10] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2024-05-27 17:06:10] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2024-05-27 17:06:10] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-05-27 17:06:10] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
[2024-05-27 17:06:10] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2024-05-27 17:06:10] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2024-05-27 17:06:10] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-05-27 17:06:11] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2024-05-27 17:06:11] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2024-05-27 17:06:11] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 20/187 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 17:06:13] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 17:06:14] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 1 ms to minimize.
[2024-05-27 17:06:15] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 0 ms to minimize.
[2024-05-27 17:06:15] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 1 ms to minimize.
[2024-05-27 17:06:15] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 1 ms to minimize.
[2024-05-27 17:06:15] [INFO ] Deduced a trap composed of 49 places in 69 ms of which 1 ms to minimize.
[2024-05-27 17:06:15] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-05-27 17:06:15] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
[2024-05-27 17:06:15] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 1 ms to minimize.
[2024-05-27 17:06:16] [INFO ] Deduced a trap composed of 49 places in 63 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 9/197 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 17:06:17] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 17:06:20] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
[2024-05-27 17:06:20] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 17:06:22] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 17:06:24] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 11 (OVERLAPS) 242/380 variables, 138/340 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/380 variables, 43/383 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/380 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 380/380 variables, and 383 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30018 ms.
Refiners :[Domain max(s): 138/138 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 15/167 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 35/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (OVERLAPS) 242/380 variables, 138/340 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 43/383 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 409/792 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 17:06:52] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 0 ms to minimize.
[2024-05-27 17:06:52] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 0 ms to minimize.
[2024-05-27 17:06:53] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-27 17:06:53] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 4/796 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 17:07:03] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 1/797 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 797 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30023 ms.
Refiners :[Domain max(s): 138/138 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 40/40 constraints]
After SMT, in 60372ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 60376ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60773 ms. Remains : 138/138 places, 415/415 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (NOT p1)), (X (NOT (AND p2 p1))), (X (X (NOT p1))), (X (X (NOT (AND p2 p1))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1)))))]
Knowledge based reduction with 7 factoid took 200 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND p2 p1), (AND p2 p1)]
RANDOM walk for 104 steps (0 resets) in 4 ms. (20 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (NOT p1)), (X (NOT (AND p2 p1))), (X (X (NOT p1))), (X (X (NOT (AND p2 p1))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (F p1), (F p2), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p2) p1)))]
Knowledge based reduction with 7 factoid took 243 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(AND p2 p1), (AND p2 p1)]
Stuttering acceptance computed with spot in 62 ms :[(AND p2 p1), (AND p2 p1)]
Stuttering acceptance computed with spot in 76 ms :[(AND p2 p1), (AND p2 p1)]
Product exploration explored 100000 steps with 3949 reset in 422 ms.
Product exploration explored 100000 steps with 4092 reset in 434 ms.
Built C files in :
/tmp/ltsmin13227468782337506572
[2024-05-27 17:07:08] [INFO ] Computing symmetric may disable matrix : 415 transitions.
[2024-05-27 17:07:08] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 17:07:08] [INFO ] Computing symmetric may enable matrix : 415 transitions.
[2024-05-27 17:07:08] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 17:07:09] [INFO ] Computing Do-Not-Accords matrix : 415 transitions.
[2024-05-27 17:07:09] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 17:07:09] [INFO ] Built C files in 70ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13227468782337506572
Running compilation step : cd /tmp/ltsmin13227468782337506572;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1227 ms.
Running link step : cd /tmp/ltsmin13227468782337506572;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin13227468782337506572;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2458045431607390493.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 61 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 17 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-05-27 17:07:24] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 17:07:24] [INFO ] Invariant cache hit.
[2024-05-27 17:07:24] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-05-27 17:07:24] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 17:07:24] [INFO ] Invariant cache hit.
[2024-05-27 17:07:24] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 17:07:24] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
[2024-05-27 17:07:24] [INFO ] Redundant transitions in 3 ms returned []
Running 409 sub problems to find dead transitions.
[2024-05-27 17:07:24] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 17:07:24] [INFO ] Invariant cache hit.
[2024-05-27 17:07:24] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 15/167 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 17:07:26] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 1 ms to minimize.
[2024-05-27 17:07:26] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 1 ms to minimize.
[2024-05-27 17:07:26] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
[2024-05-27 17:07:26] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 1 ms to minimize.
[2024-05-27 17:07:26] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 0 ms to minimize.
[2024-05-27 17:07:27] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2024-05-27 17:07:27] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-27 17:07:27] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 1 ms to minimize.
[2024-05-27 17:07:27] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
[2024-05-27 17:07:27] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 1 ms to minimize.
[2024-05-27 17:07:27] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 1 ms to minimize.
[2024-05-27 17:07:27] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2024-05-27 17:07:27] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 1 ms to minimize.
[2024-05-27 17:07:28] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 1 ms to minimize.
[2024-05-27 17:07:28] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2024-05-27 17:07:28] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 1 ms to minimize.
[2024-05-27 17:07:28] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 1 ms to minimize.
[2024-05-27 17:07:28] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 1 ms to minimize.
[2024-05-27 17:07:28] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 1 ms to minimize.
[2024-05-27 17:07:28] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 20/187 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 17:07:31] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 17:07:32] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 1 ms to minimize.
[2024-05-27 17:07:32] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2024-05-27 17:07:33] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 1 ms to minimize.
[2024-05-27 17:07:33] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2024-05-27 17:07:33] [INFO ] Deduced a trap composed of 49 places in 70 ms of which 1 ms to minimize.
[2024-05-27 17:07:33] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2024-05-27 17:07:33] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 1 ms to minimize.
[2024-05-27 17:07:33] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 1 ms to minimize.
[2024-05-27 17:07:33] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 9/197 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 17:07:34] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 17:07:37] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 1 ms to minimize.
[2024-05-27 17:07:38] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 17:07:39] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 17:07:41] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 11 (OVERLAPS) 242/380 variables, 138/340 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/380 variables, 43/383 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/380 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 380/380 variables, and 383 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30016 ms.
Refiners :[Domain max(s): 138/138 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 15/167 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 35/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (OVERLAPS) 242/380 variables, 138/340 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 43/383 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 409/792 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 17:08:10] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 1 ms to minimize.
[2024-05-27 17:08:10] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
[2024-05-27 17:08:11] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-05-27 17:08:11] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 4/796 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 17:08:21] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 1/797 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 797 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30015 ms.
Refiners :[Domain max(s): 138/138 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 40/40 constraints]
After SMT, in 60382ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 60387ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60803 ms. Remains : 138/138 places, 415/415 transitions.
Built C files in :
/tmp/ltsmin11271420285332241915
[2024-05-27 17:08:24] [INFO ] Computing symmetric may disable matrix : 415 transitions.
[2024-05-27 17:08:24] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 17:08:24] [INFO ] Computing symmetric may enable matrix : 415 transitions.
[2024-05-27 17:08:24] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 17:08:24] [INFO ] Computing Do-Not-Accords matrix : 415 transitions.
[2024-05-27 17:08:24] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 17:08:24] [INFO ] Built C files in 75ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11271420285332241915
Running compilation step : cd /tmp/ltsmin11271420285332241915;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1235 ms.
Running link step : cd /tmp/ltsmin11271420285332241915;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin11271420285332241915;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9972900922641185057.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-27 17:08:40] [INFO ] Flatten gal took : 31 ms
[2024-05-27 17:08:40] [INFO ] Flatten gal took : 16 ms
[2024-05-27 17:08:40] [INFO ] Time to serialize gal into /tmp/LTL3443219452593495690.gal : 3 ms
[2024-05-27 17:08:40] [INFO ] Time to serialize properties into /tmp/LTL16322506162094221018.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3443219452593495690.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5307438112906440799.hoa' '-atoms' '/tmp/LTL16322506162094221018.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL16322506162094221018.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5307438112906440799.hoa
Detected timeout of ITS tools.
[2024-05-27 17:08:55] [INFO ] Flatten gal took : 24 ms
[2024-05-27 17:08:55] [INFO ] Flatten gal took : 24 ms
[2024-05-27 17:08:55] [INFO ] Time to serialize gal into /tmp/LTL2156588402482537272.gal : 2 ms
[2024-05-27 17:08:55] [INFO ] Time to serialize properties into /tmp/LTL16465773390598624023.ltl : 10 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2156588402482537272.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16465773390598624023.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F((X("(((((((((((Cpt2_2==0)||(AMC_5_2==0))||((cable_used_5==0)||(FMCb==0)))&&(((Cpt2_3==0)||(AMC_2_3==0))||((cable_used_1==0)||(F...58057
Formula 0 simplified : XG(F!"(((((((((((Cpt2_2==0)||(AMC_5_2==0))||((cable_used_5==0)||(FMCb==0)))&&(((Cpt2_3==0)||(AMC_2_3==0))||((cable_used_1==0)||(FMCb...43987
Detected timeout of ITS tools.
[2024-05-27 17:09:10] [INFO ] Flatten gal took : 24 ms
[2024-05-27 17:09:10] [INFO ] Applying decomposition
[2024-05-27 17:09:10] [INFO ] Flatten gal took : 24 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7373046491512888619.txt' '-o' '/tmp/graph7373046491512888619.bin' '-w' '/tmp/graph7373046491512888619.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7373046491512888619.bin' '-l' '-1' '-v' '-w' '/tmp/graph7373046491512888619.weights' '-q' '0' '-e' '0.001'
[2024-05-27 17:09:10] [INFO ] Decomposing Gal with order
[2024-05-27 17:09:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 17:09:10] [INFO ] Removed a total of 444 redundant transitions.
[2024-05-27 17:09:10] [INFO ] Flatten gal took : 53 ms
[2024-05-27 17:09:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 272 labels/synchronizations in 8 ms.
[2024-05-27 17:09:10] [INFO ] Time to serialize gal into /tmp/LTL3202404058543640906.gal : 3 ms
[2024-05-27 17:09:10] [INFO ] Time to serialize properties into /tmp/LTL3773986017666133171.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3202404058543640906.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3773986017666133171.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(F((X("(((((((((((i1.u3.Cpt2_2==0)||(i1.u3.AMC_5_2==0))||((i1.u4.cable_used_5==0)||(i1.u4.FMCb==0)))&&(((i1.u3.Cpt2_3==0)||(i1.u4....79435
Formula 0 simplified : XG(F!"(((((((((((i1.u3.Cpt2_2==0)||(i1.u3.AMC_5_2==0))||((i1.u4.cable_used_5==0)||(i1.u4.FMCb==0)))&&(((i1.u3.Cpt2_3==0)||(i1.u4.AMC...60181
Detected timeout of ITS tools.
Treatment of property SafeBus-PT-06-LTLFireability-00 finished in 264909 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2024-05-27 17:09:25] [INFO ] Flatten gal took : 23 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16994626133447915188
[2024-05-27 17:09:25] [INFO ] Applying decomposition
[2024-05-27 17:09:25] [INFO ] Computing symmetric may disable matrix : 415 transitions.
[2024-05-27 17:09:25] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 17:09:25] [INFO ] Computing symmetric may enable matrix : 415 transitions.
[2024-05-27 17:09:25] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 17:09:25] [INFO ] Flatten gal took : 24 ms
[2024-05-27 17:09:25] [INFO ] Computing Do-Not-Accords matrix : 415 transitions.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14444316375237156592.txt' '-o' '/tmp/graph14444316375237156592.bin' '-w' '/tmp/graph14444316375237156592.weights'
[2024-05-27 17:09:25] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14444316375237156592.bin' '-l' '-1' '-v' '-w' '/tmp/graph14444316375237156592.weights' '-q' '0' '-e' '0.001'
[2024-05-27 17:09:25] [INFO ] Decomposing Gal with order
[2024-05-27 17:09:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 17:09:25] [INFO ] Built C files in 91ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16994626133447915188
Running compilation step : cd /tmp/ltsmin16994626133447915188;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-27 17:09:25] [INFO ] Removed a total of 449 redundant transitions.
[2024-05-27 17:09:25] [INFO ] Flatten gal took : 51 ms
[2024-05-27 17:09:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 282 labels/synchronizations in 9 ms.
[2024-05-27 17:09:25] [INFO ] Time to serialize gal into /tmp/LTLFireability6367465411983070771.gal : 3 ms
[2024-05-27 17:09:25] [INFO ] Time to serialize properties into /tmp/LTLFireability13574574367161027007.ltl : 9 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6367465411983070771.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13574574367161027007.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((X(F((X("(((((((((((i1.u3.Cpt2_2==0)||(i1.u5.AMC_5_2==0))||((i1.u5.cable_used_5==0)||(i1.u5.FMCb==0)))&&(((i1.u5.Cpt2_3==0)||(i1.u5....79460
Formula 0 simplified : XG(X!"(((((((((((i1.u3.Cpt2_2==0)||(i1.u5.AMC_5_2==0))||((i1.u5.cable_used_5==0)||(i1.u5.FMCb==0)))&&(((i1.u5.Cpt2_3==0)||(i1.u5.AMC...79416
Compilation finished in 1358 ms.
Running link step : cd /tmp/ltsmin16994626133447915188;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin16994626133447915188;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((X((LTLAPp0==true))&&(X([](!(LTLAPp1==true)))||(X(!(LTLAPp1==true))&&<>(([](<>(!(LTLAPp2==true)))||(<>(!(LTLAPp2==true))&&[](!(LTLAPp1==true))))))))))' '--buchi-type=spotba'
LTSmin run took 268774 ms.
FORMULA SafeBus-PT-06-LTLFireability-00 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin16994626133447915188;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp3==true)))' '--buchi-type=spotba'
LTSmin run took 728297 ms.
FORMULA SafeBus-PT-06-LTLFireability-04 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1875196 ms.

BK_STOP 1716830764652

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="SafeBus-PT-06"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is SafeBus-PT-06, 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 r334-tall-171679080300420"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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