Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r132-tall-165271820800371.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is LamportFastMutEx-COL-6, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-165271820800371
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 280K
-rw-r--r-- 1 mcc users 7.1K Apr 29 19:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 29 19:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 29 19:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 29 19:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K May 9 08:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 9 08:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 9 08:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 42K May 10 09:34 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 LamportFastMutEx-COL-6-LTLCardinality-00
FORMULA_NAME LamportFastMutEx-COL-6-LTLCardinality-01
FORMULA_NAME LamportFastMutEx-COL-6-LTLCardinality-02
FORMULA_NAME LamportFastMutEx-COL-6-LTLCardinality-03
FORMULA_NAME LamportFastMutEx-COL-6-LTLCardinality-04
FORMULA_NAME LamportFastMutEx-COL-6-LTLCardinality-05
FORMULA_NAME LamportFastMutEx-COL-6-LTLCardinality-06
FORMULA_NAME LamportFastMutEx-COL-6-LTLCardinality-07
FORMULA_NAME LamportFastMutEx-COL-6-LTLCardinality-08
FORMULA_NAME LamportFastMutEx-COL-6-LTLCardinality-09
FORMULA_NAME LamportFastMutEx-COL-6-LTLCardinality-10
FORMULA_NAME LamportFastMutEx-COL-6-LTLCardinality-11
FORMULA_NAME LamportFastMutEx-COL-6-LTLCardinality-12
FORMULA_NAME LamportFastMutEx-COL-6-LTLCardinality-13
FORMULA_NAME LamportFastMutEx-COL-6-LTLCardinality-14
FORMULA_NAME LamportFastMutEx-COL-6-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652777895690

Running Version 202205111006
[2022-05-17 08:58:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-17 08:58:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 08:58:16] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-17 08:58:17] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-17 08:58:17] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 596 ms
[2022-05-17 08:58:17] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 217 PT places and 525.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
FORMULA LamportFastMutEx-COL-6-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-17 08:58:17] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 10 ms.
[2022-05-17 08:58:17] [INFO ] Skeletonized 15 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
FORMULA LamportFastMutEx-COL-6-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-6-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-6-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-6-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 0 stable transitions
Remains 11 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10029 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=164 ) properties (out of 19) seen :18
Finished Best-First random walk after 326 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=163 )
[2022-05-17 08:58:17] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-05-17 08:58:17] [INFO ] Flatten gal took : 17 ms
FORMULA LamportFastMutEx-COL-6-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-17 08:58:17] [INFO ] Flatten gal took : 3 ms
Domain [pid(7), pid(7)] of place P_wait breaks symmetries in sort pid
Symmetric sort wr.t. initial and guards and successors and join/free detected :P_bool
Arc [3:1*[$i, 1]] contains constants of sort P_bool
Transition T_setbi_2 : constants on arcs in [[3:1*[$i, 1]]] introduces in P_bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2022-05-17 08:58:17] [INFO ] Unfolded HLPN to a Petri net with 217 places and 420 transitions 1834 arcs in 19 ms.
[2022-05-17 08:58:17] [INFO ] Unfolded 10 HLPN properties in 0 ms.
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 66 transitions.
Support contains 144 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 10 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2022-05-17 08:58:17] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2022-05-17 08:58:17] [INFO ] Computed 50 place invariants in 23 ms
[2022-05-17 08:58:18] [INFO ] Implicit Places using invariants in 226 ms returned []
[2022-05-17 08:58:18] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2022-05-17 08:58:18] [INFO ] Computed 50 place invariants in 4 ms
[2022-05-17 08:58:18] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-17 08:58:18] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
[2022-05-17 08:58:18] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2022-05-17 08:58:18] [INFO ] Computed 50 place invariants in 5 ms
[2022-05-17 08:58:18] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 176/176 places, 354/354 transitions.
Support contains 144 out of 176 places after structural reductions.
[2022-05-17 08:58:18] [INFO ] Flatten gal took : 33 ms
[2022-05-17 08:58:18] [INFO ] Flatten gal took : 30 ms
[2022-05-17 08:58:18] [INFO ] Input system was already deterministic with 354 transitions.
Finished random walk after 1517 steps, including 0 resets, run visited all 18 properties in 33 ms. (steps per millisecond=45 )
Computed a total of 1 stabilizing places and 6 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G((X(p0)||p1)))))'
Support contains 66 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 6 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2022-05-17 08:58:18] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2022-05-17 08:58:18] [INFO ] Computed 50 place invariants in 5 ms
[2022-05-17 08:58:19] [INFO ] Implicit Places using invariants in 119 ms returned []
[2022-05-17 08:58:19] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2022-05-17 08:58:19] [INFO ] Computed 50 place invariants in 5 ms
[2022-05-17 08:58:19] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-17 08:58:19] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
[2022-05-17 08:58:19] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2022-05-17 08:58:19] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-17 08:58:19] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 176/176 places, 354/354 transitions.
Stuttering acceptance computed with spot in 333 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : LamportFastMutEx-COL-6-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(AND (OR (LEQ 2 (ADD s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 45 steps with 0 reset in 4 ms.
FORMULA LamportFastMutEx-COL-6-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-6-LTLCardinality-00 finished in 882 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(((X(G(p0))||p1) U (F((F(p0)&&p1))&&X(p2)))))'
Support contains 60 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 4 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2022-05-17 08:58:19] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2022-05-17 08:58:19] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-17 08:58:19] [INFO ] Implicit Places using invariants in 99 ms returned [110, 111, 112, 113, 114, 115]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 101 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/176 places, 354/354 transitions.
Applied a total of 0 rules in 3 ms. Remains 170 /170 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 170/176 places, 354/354 transitions.
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-6-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ (ADD s50 s51 s52 s53 s54 s55) (ADD s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100 s1...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 13901 reset in 450 ms.
Product exploration explored 100000 steps with 13907 reset in 386 ms.
Computed a total of 1 stabilizing places and 6 stable transitions
Computed a total of 1 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X p1), (X (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X p1)), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 640 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p1) (NOT p0)), (NOT p2), (NOT p0), false]
Finished random walk after 1977 steps, including 0 resets, run visited all 7 properties in 11 ms. (steps per millisecond=179 )
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X p1), (X (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X p1)), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (F (AND (NOT p2) (NOT p0) p1)), (F (NOT p2)), (F (NOT (AND p2 p0 p1))), (F (NOT p0)), (F (NOT p1)), (F (AND (NOT p2) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 731 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p1) (NOT p0)), (NOT p2), (NOT p0), false]
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p1) (NOT p0)), (NOT p2), (NOT p0), false]
Support contains 60 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 354/354 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 170 transition count 348
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 164 transition count 348
Applied a total of 12 rules in 30 ms. Remains 164 /170 variables (removed 6) and now considering 348/354 (removed 6) transitions.
[2022-05-17 08:58:22] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
// Phase 1: matrix 258 rows 164 cols
[2022-05-17 08:58:22] [INFO ] Computed 44 place invariants in 2 ms
[2022-05-17 08:58:22] [INFO ] Implicit Places using invariants in 93 ms returned []
[2022-05-17 08:58:22] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
// Phase 1: matrix 258 rows 164 cols
[2022-05-17 08:58:22] [INFO ] Computed 44 place invariants in 2 ms
[2022-05-17 08:58:22] [INFO ] State equation strengthened by 36 read => feed constraints.
[2022-05-17 08:58:23] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
[2022-05-17 08:58:23] [INFO ] Redundant transitions in 21 ms returned []
[2022-05-17 08:58:23] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
// Phase 1: matrix 258 rows 164 cols
[2022-05-17 08:58:23] [INFO ] Computed 44 place invariants in 3 ms
[2022-05-17 08:58:23] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 164/170 places, 348/354 transitions.
Finished structural reductions, in 1 iterations. Remains : 164/170 places, 348/354 transitions.
Computed a total of 1 stabilizing places and 6 stable transitions
Computed a total of 1 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 p0 p1))), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND p2 p0 p1))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT p2))), (X (X p2))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 560 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p1) (NOT p0)), (NOT p2), (NOT p0), false]
Finished random walk after 1014 steps, including 0 resets, run visited all 7 properties in 20 ms. (steps per millisecond=50 )
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 p0 p1))), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND p2 p0 p1))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT p2))), (X (X p2)), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT p2)), (F (NOT (AND p0 p1 p2))), (F (NOT p0)), (F (NOT p1)), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p0) p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 734 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p1) (NOT p0)), (NOT p2), (NOT p0), false]
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p1) (NOT p0)), (NOT p2), (NOT p0), false]
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p1) (NOT p0)), (NOT p2), (NOT p0), false]
Product exploration explored 100000 steps with 21855 reset in 324 ms.
Product exploration explored 100000 steps with 21766 reset in 377 ms.
Built C files in :
/tmp/ltsmin10646289191831372548
[2022-05-17 08:58:25] [INFO ] Computing symmetric may disable matrix : 348 transitions.
[2022-05-17 08:58:25] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 08:58:25] [INFO ] Computing symmetric may enable matrix : 348 transitions.
[2022-05-17 08:58:25] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 08:58:25] [INFO ] Computing Do-Not-Accords matrix : 348 transitions.
[2022-05-17 08:58:25] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 08:58:26] [INFO ] Built C files in 83ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10646289191831372548
Running compilation step : cd /tmp/ltsmin10646289191831372548;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 781 ms.
Running link step : cd /tmp/ltsmin10646289191831372548;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin10646289191831372548;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2606831913004904488.hoa' '--buchi-type=spotba'
LTSmin run took 1338 ms.
FORMULA LamportFastMutEx-COL-6-LTLCardinality-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property LamportFastMutEx-COL-6-LTLCardinality-02 finished in 8454 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U ((p1 U p2)&&p3)))'
Support contains 66 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 16 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2022-05-17 08:58:28] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2022-05-17 08:58:28] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-17 08:58:28] [INFO ] Implicit Places using invariants in 117 ms returned []
[2022-05-17 08:58:28] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2022-05-17 08:58:28] [INFO ] Computed 50 place invariants in 11 ms
[2022-05-17 08:58:28] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-17 08:58:28] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
[2022-05-17 08:58:28] [INFO ] Redundant transitions in 12 ms returned []
[2022-05-17 08:58:28] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2022-05-17 08:58:28] [INFO ] Computed 50 place invariants in 13 ms
[2022-05-17 08:58:28] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 176/176 places, 354/354 transitions.
Stuttering acceptance computed with spot in 125 ms :[true, (OR (NOT p3) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : LamportFastMutEx-COL-6-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (AND (NOT p3) (NOT p0)) (AND (NOT p2) (NOT p1) (NOT p0))), acceptance={0} source=1 dest: 0}, { cond=(OR (AND (NOT p3) p0) (AND (NOT p2) (NOT p1) p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p3 (NOT p2) p1 (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND p3 (NOT p2) p1 p0), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p3:(LEQ (ADD s152 s153 s154 s155 s156 s157) (ADD s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 50000 reset in 543 ms.
Product exploration explored 100000 steps with 50000 reset in 501 ms.
Computed a total of 1 stabilizing places and 6 stable transitions
Computed a total of 1 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p3 p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (OR (AND (NOT p3) p0) (AND (NOT p2) (NOT p1) p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (OR (AND (NOT p3) (NOT p0)) (AND (NOT p2) (NOT p1) (NOT p0))))), (X (NOT (AND p3 (NOT p2) p1 (NOT p0)))), (X (NOT (AND p3 (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) p1))), true, (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (OR (AND (NOT p3) (NOT p0)) (AND (NOT p2) (NOT p1) (NOT p0)))))), (X (X (NOT (AND p3 (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p3 (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (OR (AND (NOT p3) p0) (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (OR (AND (NOT p3) p0) (AND (NOT p2) (NOT p1) p0))))), (X (X (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0))))]
Knowledge based reduction with 19 factoid took 813 ms. Reduced automaton from 4 states, 11 edges and 4 AP to 4 states, 11 edges and 4 AP.
Stuttering acceptance computed with spot in 122 ms :[true, (OR (NOT p3) (NOT p2)), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 10) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-05-17 08:58:31] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2022-05-17 08:58:31] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-17 08:58:31] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2022-05-17 08:58:31] [INFO ] [Nat]Absence check using 50 positive place invariants in 21 ms returned sat
[2022-05-17 08:58:31] [INFO ] After 103ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2022-05-17 08:58:31] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-17 08:58:31] [INFO ] After 37ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2022-05-17 08:58:31] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 3 ms to minimize.
[2022-05-17 08:58:31] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2022-05-17 08:58:31] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2022-05-17 08:58:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 156 ms
[2022-05-17 08:58:31] [INFO ] After 233ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2022-05-17 08:58:31] [INFO ] After 443ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 66 out of 176 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 27 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 176/176 places, 354/354 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1264593 steps, run timeout after 3001 ms. (steps per millisecond=421 ) properties seen :{}
Probabilistic random walk after 1264593 steps, saw 414738 distinct states, run finished after 3001 ms. (steps per millisecond=421 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 08:58:34] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2022-05-17 08:58:34] [INFO ] Computed 50 place invariants in 4 ms
[2022-05-17 08:58:34] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 08:58:34] [INFO ] [Nat]Absence check using 50 positive place invariants in 17 ms returned sat
[2022-05-17 08:58:34] [INFO ] After 85ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 08:58:34] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-17 08:58:35] [INFO ] After 68ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 08:58:35] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2022-05-17 08:58:35] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2022-05-17 08:58:35] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2022-05-17 08:58:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 151 ms
[2022-05-17 08:58:35] [INFO ] After 259ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2022-05-17 08:58:35] [INFO ] After 441ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 66 out of 176 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 20 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 176/176 places, 354/354 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 12 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2022-05-17 08:58:35] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2022-05-17 08:58:35] [INFO ] Computed 50 place invariants in 5 ms
[2022-05-17 08:58:35] [INFO ] Implicit Places using invariants in 133 ms returned []
[2022-05-17 08:58:35] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2022-05-17 08:58:35] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-17 08:58:35] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-17 08:58:35] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
[2022-05-17 08:58:35] [INFO ] Redundant transitions in 21 ms returned []
[2022-05-17 08:58:35] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2022-05-17 08:58:35] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-17 08:58:35] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 176/176 places, 354/354 transitions.
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 176 transition count 264
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 102 place count 170 transition count 258
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 108 place count 164 transition count 246
Iterating global reduction 1 with 6 rules applied. Total rules applied 114 place count 164 transition count 246
Applied a total of 114 rules in 13 ms. Remains 164 /176 variables (removed 12) and now considering 246/354 (removed 108) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 246 rows 164 cols
[2022-05-17 08:58:35] [INFO ] Computed 50 place invariants in 0 ms
[2022-05-17 08:58:35] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 08:58:35] [INFO ] [Nat]Absence check using 50 positive place invariants in 7 ms returned sat
[2022-05-17 08:58:35] [INFO ] After 72ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 08:58:36] [INFO ] After 110ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2022-05-17 08:58:36] [INFO ] After 184ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 08:58:36] [INFO ] Flatten gal took : 16 ms
[2022-05-17 08:58:36] [INFO ] Flatten gal took : 31 ms
[2022-05-17 08:58:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17974569808573757903.gal : 3 ms
[2022-05-17 08:58:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4711783945158387624.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms3312849253154135964;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17974569808573757903.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4711783945158387624.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality4711783945158387624.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 16
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :16 after 26
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :26 after 424
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :424 after 574
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :574 after 1560
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1560 after 13536
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :13536 after 313728
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :313728 after 5.11142e+06
Detected timeout of ITS tools.
[2022-05-17 08:58:51] [INFO ] Flatten gal took : 14 ms
[2022-05-17 08:58:51] [INFO ] Applying decomposition
[2022-05-17 08:58:51] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12444544080763478315.txt' '-o' '/tmp/graph12444544080763478315.bin' '-w' '/tmp/graph12444544080763478315.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12444544080763478315.bin' '-l' '-1' '-v' '-w' '/tmp/graph12444544080763478315.weights' '-q' '0' '-e' '0.001'
[2022-05-17 08:58:51] [INFO ] Decomposing Gal with order
[2022-05-17 08:58:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 08:58:51] [INFO ] Removed a total of 168 redundant transitions.
[2022-05-17 08:58:51] [INFO ] Flatten gal took : 67 ms
[2022-05-17 08:58:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 162 labels/synchronizations in 12 ms.
[2022-05-17 08:58:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3349220969314928779.gal : 4 ms
[2022-05-17 08:58:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6458070585354776767.prop : 5 ms
Invoking ITS tools like this :cd /tmp/redAtoms3312849253154135964;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3349220969314928779.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6458070585354776767.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality6458070585354776767.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6 after 30
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :30 after 40
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :40 after 62
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :62 after 102
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :102 after 820
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :820 after 2268
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2268 after 1.7424e+06
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16268191836153707547
[2022-05-17 08:59:06] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16268191836153707547
Running compilation step : cd /tmp/ltsmin16268191836153707547;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 372 ms.
Running link step : cd /tmp/ltsmin16268191836153707547;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin16268191836153707547;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf8==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p3 p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (OR (AND (NOT p3) p0) (AND (NOT p2) (NOT p1) p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (OR (AND (NOT p3) (NOT p0)) (AND (NOT p2) (NOT p1) (NOT p0))))), (X (NOT (AND p3 (NOT p2) p1 (NOT p0)))), (X (NOT (AND p3 (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) p1))), true, (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (OR (AND (NOT p3) (NOT p0)) (AND (NOT p2) (NOT p1) (NOT p0)))))), (X (X (NOT (AND p3 (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p3 (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) p1)))), (G (NOT (AND (NOT p0) p3 p1 (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (OR (AND (NOT p3) p0) (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (OR (AND (NOT p3) p0) (AND (NOT p2) (NOT p1) p0))))), (X (X (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p0 p3 p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p1 (NOT p2))), (F (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (OR (AND p0 (NOT p3)) (AND p0 (NOT p1) (NOT p2))))), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (AND p0 p1 (NOT p2)))]
Knowledge based reduction with 20 factoid took 936 ms. Reduced automaton from 4 states, 11 edges and 4 AP to 4 states, 10 edges and 4 AP.
Stuttering acceptance computed with spot in 130 ms :[true, (OR (NOT p2) (NOT p3)), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 133 ms :[true, (OR (NOT p2) (NOT p3)), (NOT p2), (NOT p2)]
[2022-05-17 08:59:22] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2022-05-17 08:59:22] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-17 08:59:23] [INFO ] [Real]Absence check using 50 positive place invariants in 12 ms returned sat
[2022-05-17 08:59:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 08:59:23] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2022-05-17 08:59:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 08:59:23] [INFO ] [Nat]Absence check using 50 positive place invariants in 17 ms returned sat
[2022-05-17 08:59:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 08:59:23] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2022-05-17 08:59:23] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-17 08:59:23] [INFO ] [Nat]Added 72 Read/Feed constraints in 9 ms returned sat
[2022-05-17 08:59:23] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 0 ms to minimize.
[2022-05-17 08:59:23] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2022-05-17 08:59:23] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2022-05-17 08:59:23] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2022-05-17 08:59:23] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 0 ms to minimize.
[2022-05-17 08:59:23] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2022-05-17 08:59:23] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2022-05-17 08:59:23] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 0 ms to minimize.
[2022-05-17 08:59:24] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 0 ms to minimize.
[2022-05-17 08:59:24] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 660 ms
[2022-05-17 08:59:24] [INFO ] Computed and/alt/rep : 234/1218/234 causal constraints (skipped 24 transitions) in 19 ms.
[2022-05-17 08:59:24] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 0 ms to minimize.
[2022-05-17 08:59:24] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2022-05-17 08:59:24] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2022-05-17 08:59:24] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 0 ms to minimize.
[2022-05-17 08:59:24] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2022-05-17 08:59:24] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 0 ms to minimize.
[2022-05-17 08:59:24] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 471 ms
[2022-05-17 08:59:25] [INFO ] Added : 132 causal constraints over 28 iterations in 1117 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 66 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 19 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2022-05-17 08:59:25] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2022-05-17 08:59:25] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-17 08:59:25] [INFO ] Implicit Places using invariants in 86 ms returned []
[2022-05-17 08:59:25] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2022-05-17 08:59:25] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-17 08:59:25] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-17 08:59:25] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
[2022-05-17 08:59:25] [INFO ] Redundant transitions in 3 ms returned []
[2022-05-17 08:59:25] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2022-05-17 08:59:25] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-17 08:59:25] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 176/176 places, 354/354 transitions.
Computed a total of 1 stabilizing places and 6 stable transitions
Computed a total of 1 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p3 (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 p0 (NOT p2) p3))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))))), (X (NOT (OR (AND (NOT p1) p0 (NOT p2)) (AND p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), true, (X (X (NOT (AND p1 p0 (NOT p2) p3)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (OR (AND (NOT p1) p0 (NOT p2)) (AND p0 (NOT p3))))), (X (X (NOT (OR (AND (NOT p1) p0 (NOT p2)) (AND p0 (NOT p3))))))]
Knowledge based reduction with 15 factoid took 648 ms. Reduced automaton from 4 states, 10 edges and 4 AP to 4 states, 10 edges and 4 AP.
Stuttering acceptance computed with spot in 146 ms :[true, (OR (NOT p2) (NOT p3)), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-17 08:59:26] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2022-05-17 08:59:26] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-17 08:59:26] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 08:59:26] [INFO ] [Nat]Absence check using 50 positive place invariants in 9 ms returned sat
[2022-05-17 08:59:26] [INFO ] After 83ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 08:59:26] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-17 08:59:26] [INFO ] After 43ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 08:59:26] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2022-05-17 08:59:26] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2022-05-17 08:59:26] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2022-05-17 08:59:26] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2022-05-17 08:59:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 201 ms
[2022-05-17 08:59:26] [INFO ] After 277ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2022-05-17 08:59:26] [INFO ] After 450ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 66 out of 176 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 8 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 176/176 places, 354/354 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1230280 steps, run timeout after 3001 ms. (steps per millisecond=409 ) properties seen :{}
Probabilistic random walk after 1230280 steps, saw 406373 distinct states, run finished after 3001 ms. (steps per millisecond=409 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 08:59:30] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2022-05-17 08:59:30] [INFO ] Computed 50 place invariants in 3 ms
[2022-05-17 08:59:30] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 08:59:30] [INFO ] [Nat]Absence check using 50 positive place invariants in 9 ms returned sat
[2022-05-17 08:59:30] [INFO ] After 83ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 08:59:30] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-17 08:59:30] [INFO ] After 43ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 08:59:30] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 0 ms to minimize.
[2022-05-17 08:59:30] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2022-05-17 08:59:30] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2022-05-17 08:59:30] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2022-05-17 08:59:30] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 214 ms
[2022-05-17 08:59:30] [INFO ] After 294ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2022-05-17 08:59:30] [INFO ] After 474ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 66 out of 176 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 7 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 176/176 places, 354/354 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 6 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2022-05-17 08:59:30] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2022-05-17 08:59:30] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-17 08:59:30] [INFO ] Implicit Places using invariants in 83 ms returned []
[2022-05-17 08:59:30] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2022-05-17 08:59:30] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-17 08:59:30] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-17 08:59:30] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
[2022-05-17 08:59:30] [INFO ] Redundant transitions in 2 ms returned []
[2022-05-17 08:59:30] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2022-05-17 08:59:30] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-17 08:59:31] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 176/176 places, 354/354 transitions.
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 176 transition count 264
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 102 place count 170 transition count 258
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 108 place count 164 transition count 246
Iterating global reduction 1 with 6 rules applied. Total rules applied 114 place count 164 transition count 246
Applied a total of 114 rules in 10 ms. Remains 164 /176 variables (removed 12) and now considering 246/354 (removed 108) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 246 rows 164 cols
[2022-05-17 08:59:31] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-17 08:59:31] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 08:59:31] [INFO ] [Nat]Absence check using 50 positive place invariants in 7 ms returned sat
[2022-05-17 08:59:31] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 08:59:31] [INFO ] After 116ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2022-05-17 08:59:31] [INFO ] After 188ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 08:59:31] [INFO ] Flatten gal took : 14 ms
[2022-05-17 08:59:31] [INFO ] Flatten gal took : 12 ms
[2022-05-17 08:59:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8463009076148976423.gal : 2 ms
[2022-05-17 08:59:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4368049172739179267.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms10820050590311917305;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8463009076148976423.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4368049172739179267.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality4368049172739179267.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 16
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :16 after 26
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :26 after 424
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :424 after 574
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :574 after 1560
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1560 after 13536
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :13536 after 313728
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :313728 after 5.11142e+06
Detected timeout of ITS tools.
[2022-05-17 08:59:46] [INFO ] Flatten gal took : 11 ms
[2022-05-17 08:59:46] [INFO ] Applying decomposition
[2022-05-17 08:59:46] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph6302162545457114536.txt' '-o' '/tmp/graph6302162545457114536.bin' '-w' '/tmp/graph6302162545457114536.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6302162545457114536.bin' '-l' '-1' '-v' '-w' '/tmp/graph6302162545457114536.weights' '-q' '0' '-e' '0.001'
[2022-05-17 08:59:46] [INFO ] Decomposing Gal with order
[2022-05-17 08:59:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 08:59:46] [INFO ] Removed a total of 162 redundant transitions.
[2022-05-17 08:59:46] [INFO ] Flatten gal took : 33 ms
[2022-05-17 08:59:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 158 labels/synchronizations in 5 ms.
[2022-05-17 08:59:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11107407966701795392.gal : 2 ms
[2022-05-17 08:59:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17964199720122201992.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms10820050590311917305;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11107407966701795392.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17964199720122201992.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality17964199720122201992.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6 after 19
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :19 after 31
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :31 after 59
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :59 after 114
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :114 after 489
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :489 after 1651
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1651 after 30528
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :30528 after 4.18038e+07
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin559767236048366349
[2022-05-17 09:00:01] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin559767236048366349
Running compilation step : cd /tmp/ltsmin559767236048366349;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 361 ms.
Running link step : cd /tmp/ltsmin559767236048366349;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin559767236048366349;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf7==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [(AND p0 (NOT p2) p3 (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 p0 (NOT p2) p3))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))))), (X (NOT (OR (AND (NOT p1) p0 (NOT p2)) (AND p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), true, (X (X (NOT (AND p1 p0 (NOT p2) p3)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (OR (AND (NOT p1) p0 (NOT p2)) (AND p0 (NOT p3))))), (X (X (NOT (OR (AND (NOT p1) p0 (NOT p2)) (AND p0 (NOT p3)))))), (F (AND (NOT p2) p1)), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (AND p0 (NOT p2) (NOT p1)))), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3)))), (F (AND p0 (NOT p2) p3 p1)), (F (NOT (OR (AND p0 (NOT p2) (NOT p1)) (AND p0 (NOT p3))))), (F (AND p0 (NOT p2) p1))]
Knowledge based reduction with 15 factoid took 764 ms. Reduced automaton from 4 states, 10 edges and 4 AP to 4 states, 10 edges and 4 AP.
Stuttering acceptance computed with spot in 128 ms :[true, (OR (NOT p2) (NOT p3)), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 150 ms :[true, (OR (NOT p2) (NOT p3)), (NOT p2), (NOT p2)]
[2022-05-17 09:00:17] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2022-05-17 09:00:17] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-17 09:00:17] [INFO ] [Real]Absence check using 50 positive place invariants in 12 ms returned sat
[2022-05-17 09:00:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:00:17] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2022-05-17 09:00:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:00:17] [INFO ] [Nat]Absence check using 50 positive place invariants in 21 ms returned sat
[2022-05-17 09:00:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:00:18] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2022-05-17 09:00:18] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-17 09:00:18] [INFO ] [Nat]Added 72 Read/Feed constraints in 10 ms returned sat
[2022-05-17 09:00:18] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 0 ms to minimize.
[2022-05-17 09:00:18] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2022-05-17 09:00:18] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 0 ms to minimize.
[2022-05-17 09:00:18] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2022-05-17 09:00:18] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 0 ms to minimize.
[2022-05-17 09:00:18] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2022-05-17 09:00:18] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2022-05-17 09:00:18] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 1 ms to minimize.
[2022-05-17 09:00:18] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2022-05-17 09:00:18] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 652 ms
[2022-05-17 09:00:18] [INFO ] Computed and/alt/rep : 234/1218/234 causal constraints (skipped 24 transitions) in 18 ms.
[2022-05-17 09:00:19] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2022-05-17 09:00:19] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 0 ms to minimize.
[2022-05-17 09:00:19] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2022-05-17 09:00:19] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 0 ms to minimize.
[2022-05-17 09:00:19] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2022-05-17 09:00:19] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2022-05-17 09:00:19] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 445 ms
[2022-05-17 09:00:19] [INFO ] Added : 132 causal constraints over 28 iterations in 1086 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 142 ms :[true, (OR (NOT p2) (NOT p3)), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 50000 reset in 364 ms.
Product exploration explored 100000 steps with 50000 reset in 376 ms.
Built C files in :
/tmp/ltsmin375816598352638394
[2022-05-17 09:00:20] [INFO ] Computing symmetric may disable matrix : 354 transitions.
[2022-05-17 09:00:20] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 09:00:20] [INFO ] Computing symmetric may enable matrix : 354 transitions.
[2022-05-17 09:00:20] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 09:00:20] [INFO ] Computing Do-Not-Accords matrix : 354 transitions.
[2022-05-17 09:00:20] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 09:00:20] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin375816598352638394
Running compilation step : cd /tmp/ltsmin375816598352638394;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 717 ms.
Running link step : cd /tmp/ltsmin375816598352638394;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin375816598352638394;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4886692795466401044.hoa' '--buchi-type=spotba'
LTSmin run took 270 ms.
FORMULA LamportFastMutEx-COL-6-LTLCardinality-03 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property LamportFastMutEx-COL-6-LTLCardinality-03 finished in 113603 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 6 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 3 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2022-05-17 09:00:21] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2022-05-17 09:00:21] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-17 09:00:21] [INFO ] Implicit Places using invariants in 108 ms returned [110, 111, 112, 113, 114, 115]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 109 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/176 places, 354/354 transitions.
Applied a total of 0 rules in 2 ms. Remains 170 /170 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 170/176 places, 354/354 transitions.
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-6-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 1 (ADD s50 s51 s52 s53 s54 s55))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA LamportFastMutEx-COL-6-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-6-LTLCardinality-05 finished in 192 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X((p0 U p1)))))'
Support contains 12 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 12 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2022-05-17 09:00:21] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2022-05-17 09:00:21] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-17 09:00:22] [INFO ] Implicit Places using invariants in 108 ms returned [110, 111, 112, 113, 114, 115]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 110 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 170/176 places, 354/354 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 170 transition count 348
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 164 transition count 348
Applied a total of 12 rules in 10 ms. Remains 164 /170 variables (removed 6) and now considering 348/354 (removed 6) transitions.
[2022-05-17 09:00:22] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
// Phase 1: matrix 258 rows 164 cols
[2022-05-17 09:00:22] [INFO ] Computed 44 place invariants in 1 ms
[2022-05-17 09:00:22] [INFO ] Implicit Places using invariants in 97 ms returned []
[2022-05-17 09:00:22] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
// Phase 1: matrix 258 rows 164 cols
[2022-05-17 09:00:22] [INFO ] Computed 44 place invariants in 1 ms
[2022-05-17 09:00:22] [INFO ] State equation strengthened by 36 read => feed constraints.
[2022-05-17 09:00:22] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 164/176 places, 348/354 transitions.
Finished structural reductions, in 2 iterations. Remains : 164/176 places, 348/354 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : LamportFastMutEx-COL-6-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ (ADD s146 s147 s148 s149 s150 s151) (ADD s68 s69 s70 s71 s72 s73))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1903 reset in 211 ms.
Stack based approach found an accepted trace after 21405 steps with 407 reset with depth 110 and stack size 110 in 56 ms.
FORMULA LamportFastMutEx-COL-6-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-6-LTLCardinality-07 finished in 796 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 12 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 2 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2022-05-17 09:00:22] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2022-05-17 09:00:22] [INFO ] Computed 50 place invariants in 3 ms
[2022-05-17 09:00:22] [INFO ] Implicit Places using invariants in 110 ms returned [110, 111, 112, 113, 114, 115]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 111 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/176 places, 354/354 transitions.
Applied a total of 0 rules in 1 ms. Remains 170 /170 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 170/176 places, 354/354 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-6-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ (ADD s32 s33 s34 s35 s36 s37) (ADD s56 s57 s58 s59 s60 s61))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 8239 reset in 230 ms.
Product exploration explored 100000 steps with 8200 reset in 237 ms.
Computed a total of 1 stabilizing places and 6 stable transitions
Computed a total of 1 stabilizing places and 6 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 77 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 176 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 12 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 354/354 transitions.
Applied a total of 0 rules in 2 ms. Remains 170 /170 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2022-05-17 09:00:24] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 170 cols
[2022-05-17 09:00:24] [INFO ] Computed 44 place invariants in 3 ms
[2022-05-17 09:00:24] [INFO ] Implicit Places using invariants in 102 ms returned []
[2022-05-17 09:00:24] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 170 cols
[2022-05-17 09:00:24] [INFO ] Computed 44 place invariants in 1 ms
[2022-05-17 09:00:24] [INFO ] State equation strengthened by 36 read => feed constraints.
[2022-05-17 09:00:24] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
[2022-05-17 09:00:24] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 170 cols
[2022-05-17 09:00:24] [INFO ] Computed 44 place invariants in 1 ms
[2022-05-17 09:00:24] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 354/354 transitions.
Computed a total of 1 stabilizing places and 6 stable transitions
Computed a total of 1 stabilizing places and 6 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 70 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 104 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 8260 reset in 221 ms.
Product exploration explored 100000 steps with 8280 reset in 218 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 12 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 354/354 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 170 transition count 354
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 6 rules in 14 ms. Remains 170 /170 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2022-05-17 09:00:25] [INFO ] Redundant transitions in 1 ms returned []
[2022-05-17 09:00:25] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 170 cols
[2022-05-17 09:00:25] [INFO ] Computed 44 place invariants in 0 ms
[2022-05-17 09:00:25] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 170/170 places, 354/354 transitions.
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 354/354 transitions.
Product exploration explored 100000 steps with 8124 reset in 368 ms.
Product exploration explored 100000 steps with 8220 reset in 384 ms.
Built C files in :
/tmp/ltsmin11671028743110152706
[2022-05-17 09:00:26] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11671028743110152706
Running compilation step : cd /tmp/ltsmin11671028743110152706;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 483 ms.
Running link step : cd /tmp/ltsmin11671028743110152706;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin11671028743110152706;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased381744597879317825.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 12 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 354/354 transitions.
Applied a total of 0 rules in 6 ms. Remains 170 /170 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2022-05-17 09:00:41] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 170 cols
[2022-05-17 09:00:41] [INFO ] Computed 44 place invariants in 2 ms
[2022-05-17 09:00:41] [INFO ] Implicit Places using invariants in 106 ms returned []
[2022-05-17 09:00:41] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 170 cols
[2022-05-17 09:00:41] [INFO ] Computed 44 place invariants in 1 ms
[2022-05-17 09:00:41] [INFO ] State equation strengthened by 36 read => feed constraints.
[2022-05-17 09:00:42] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
[2022-05-17 09:00:42] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 170 cols
[2022-05-17 09:00:42] [INFO ] Computed 44 place invariants in 1 ms
[2022-05-17 09:00:42] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 354/354 transitions.
Built C files in :
/tmp/ltsmin11691575824934174175
[2022-05-17 09:00:42] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11691575824934174175
Running compilation step : cd /tmp/ltsmin11691575824934174175;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 492 ms.
Running link step : cd /tmp/ltsmin11691575824934174175;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin11691575824934174175;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10466410720462574113.hoa' '--buchi-type=spotba'
LTSmin run took 3648 ms.
FORMULA LamportFastMutEx-COL-6-LTLCardinality-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property LamportFastMutEx-COL-6-LTLCardinality-09 finished in 23680 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(G(X(p0))))))'
Support contains 12 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 354/354 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
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 170 transition count 348
Applied a total of 12 rules in 14 ms. Remains 170 /176 variables (removed 6) and now considering 348/354 (removed 6) transitions.
[2022-05-17 09:00:46] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
// Phase 1: matrix 258 rows 170 cols
[2022-05-17 09:00:46] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-17 09:00:46] [INFO ] Implicit Places using invariants in 117 ms returned [104, 105, 106, 107, 108, 109]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 118 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 164/176 places, 348/354 transitions.
Applied a total of 0 rules in 5 ms. Remains 164 /164 variables (removed 0) and now considering 348/348 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 164/176 places, 348/354 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-6-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT (ADD s140 s141 s142 s143 s144 s145) (ADD s32 s33 s34 s35 s36 s37))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 254 ms.
Stack based approach found an accepted trace after 305 steps with 0 reset with depth 306 and stack size 306 in 1 ms.
FORMULA LamportFastMutEx-COL-6-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-6-LTLCardinality-10 finished in 438 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U p1)))'
Support contains 30 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 2 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2022-05-17 09:00:46] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2022-05-17 09:00:46] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-17 09:00:47] [INFO ] Implicit Places using invariants in 105 ms returned [110, 111, 112, 113, 114, 115]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 106 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/176 places, 354/354 transitions.
Applied a total of 0 rules in 1 ms. Remains 170 /170 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 170/176 places, 354/354 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-6-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (LEQ (ADD s0 s1 s2 s3 s4 s5) 1) (OR (LEQ 3 (ADD s56 s57 s58 s59 s60 s61)) (LEQ 1 (ADD s38 s39 s40 s41 s42 s43)))), p0:(LEQ (ADD s44 s45 s46 s47 s4...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA LamportFastMutEx-COL-6-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-6-LTLCardinality-11 finished in 230 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(X(p0))) U G((F(X(X(G(p0)))) U p0))))'
Support contains 6 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 354/354 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 170 transition count 348
Applied a total of 12 rules in 17 ms. Remains 170 /176 variables (removed 6) and now considering 348/354 (removed 6) transitions.
[2022-05-17 09:00:47] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
// Phase 1: matrix 258 rows 170 cols
[2022-05-17 09:00:47] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-17 09:00:47] [INFO ] Implicit Places using invariants in 118 ms returned [104, 105, 106, 107, 108, 109]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 119 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 164/176 places, 348/354 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 164 transition count 342
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 158 transition count 342
Applied a total of 12 rules in 6 ms. Remains 158 /164 variables (removed 6) and now considering 342/348 (removed 6) transitions.
[2022-05-17 09:00:47] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
// Phase 1: matrix 252 rows 158 cols
[2022-05-17 09:00:47] [INFO ] Computed 44 place invariants in 1 ms
[2022-05-17 09:00:47] [INFO ] Implicit Places using invariants in 101 ms returned []
[2022-05-17 09:00:47] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
// Phase 1: matrix 252 rows 158 cols
[2022-05-17 09:00:47] [INFO ] Computed 44 place invariants in 1 ms
[2022-05-17 09:00:47] [INFO ] State equation strengthened by 36 read => feed constraints.
[2022-05-17 09:00:47] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 158/176 places, 342/354 transitions.
Finished structural reductions, in 2 iterations. Remains : 158/176 places, 342/354 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-6-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 (ADD s32 s33 s34 s35 s36 s37))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 224 ms.
Stack based approach found an accepted trace after 238 steps with 0 reset with depth 239 and stack size 239 in 0 ms.
FORMULA LamportFastMutEx-COL-6-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-6-LTLCardinality-12 finished in 728 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0))&&F(!p0)))'
Support contains 12 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 1 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2022-05-17 09:00:47] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2022-05-17 09:00:47] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-17 09:00:47] [INFO ] Implicit Places using invariants in 119 ms returned [110, 111, 112, 113, 114, 115]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 119 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/176 places, 354/354 transitions.
Applied a total of 0 rules in 1 ms. Remains 170 /170 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 170/176 places, 354/354 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), true]
Running random walk in product with property : LamportFastMutEx-COL-6-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT (ADD s0 s1 s2 s3 s4 s5) (ADD s158 s159 s160 s161 s162 s163))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 0 ms.
FORMULA LamportFastMutEx-COL-6-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-6-LTLCardinality-15 finished in 224 ms.
All properties solved by simple procedures.
Total runtime 151265 ms.

BK_STOP 1652778048184

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="LamportFastMutEx-COL-6"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is LamportFastMutEx-COL-6, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r132-tall-165271820800371"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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