Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r293-tall-167873945800724.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is PolyORBNT-PT-S05J30, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r293-tall-167873945800724
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.3M
-rw-r--r-- 1 mcc users 15K Feb 25 23:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 23:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 62K Feb 25 23:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 274K Feb 25 23:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 18K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 26K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 33K Feb 25 23:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 216K Feb 25 23:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 30K Feb 25 23:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 126K Feb 25 23:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.7K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.2M Mar 5 18:23 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 PolyORBNT-PT-S05J30-LTLFireability-00
FORMULA_NAME PolyORBNT-PT-S05J30-LTLFireability-01
FORMULA_NAME PolyORBNT-PT-S05J30-LTLFireability-02
FORMULA_NAME PolyORBNT-PT-S05J30-LTLFireability-03
FORMULA_NAME PolyORBNT-PT-S05J30-LTLFireability-04
FORMULA_NAME PolyORBNT-PT-S05J30-LTLFireability-05
FORMULA_NAME PolyORBNT-PT-S05J30-LTLFireability-06
FORMULA_NAME PolyORBNT-PT-S05J30-LTLFireability-07
FORMULA_NAME PolyORBNT-PT-S05J30-LTLFireability-08
FORMULA_NAME PolyORBNT-PT-S05J30-LTLFireability-09
FORMULA_NAME PolyORBNT-PT-S05J30-LTLFireability-10
FORMULA_NAME PolyORBNT-PT-S05J30-LTLFireability-11
FORMULA_NAME PolyORBNT-PT-S05J30-LTLFireability-12
FORMULA_NAME PolyORBNT-PT-S05J30-LTLFireability-13
FORMULA_NAME PolyORBNT-PT-S05J30-LTLFireability-14
FORMULA_NAME PolyORBNT-PT-S05J30-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678952482878

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S05J30
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-16 07:41:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-16 07:41:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 07:41:24] [INFO ] Load time of PNML (sax parser for PT used): 138 ms
[2023-03-16 07:41:24] [INFO ] Transformed 489 places.
[2023-03-16 07:41:24] [INFO ] Transformed 1400 transitions.
[2023-03-16 07:41:24] [INFO ] Parsed PT model containing 489 places and 1400 transitions and 9764 arcs in 222 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
[2023-03-16 07:41:24] [INFO ] Reduced 90 identical enabling conditions.
[2023-03-16 07:41:24] [INFO ] Reduced 90 identical enabling conditions.
[2023-03-16 07:41:24] [INFO ] Reduced 555 identical enabling conditions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
FORMULA PolyORBNT-PT-S05J30-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J30-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 281 out of 489 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 489/489 places, 745/745 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 484 transition count 745
Applied a total of 5 rules in 40 ms. Remains 484 /489 variables (removed 5) and now considering 745/745 (removed 0) transitions.
[2023-03-16 07:41:25] [INFO ] Flow matrix only has 741 transitions (discarded 4 similar events)
// Phase 1: matrix 741 rows 484 cols
[2023-03-16 07:41:25] [INFO ] Computed 77 place invariants in 41 ms
[2023-03-16 07:41:25] [INFO ] Dead Transitions using invariants and state equation in 915 ms found 95 transitions.
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
[2023-03-16 07:41:25] [INFO ] Flow matrix only has 646 transitions (discarded 4 similar events)
// Phase 1: matrix 646 rows 484 cols
[2023-03-16 07:41:26] [INFO ] Computed 77 place invariants in 18 ms
[2023-03-16 07:41:26] [INFO ] Implicit Places using invariants in 352 ms returned []
[2023-03-16 07:41:26] [INFO ] Flow matrix only has 646 transitions (discarded 4 similar events)
[2023-03-16 07:41:26] [INFO ] Invariant cache hit.
[2023-03-16 07:41:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 07:41:29] [INFO ] Implicit Places using invariants and state equation in 2990 ms returned []
Implicit Place search using SMT with State Equation took 3346 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 484/489 places, 650/745 transitions.
Applied a total of 0 rules in 17 ms. Remains 484 /484 variables (removed 0) and now considering 650/650 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4343 ms. Remains : 484/489 places, 650/745 transitions.
Support contains 281 out of 484 places after structural reductions.
[2023-03-16 07:41:29] [INFO ] Flatten gal took : 86 ms
[2023-03-16 07:41:29] [INFO ] Flatten gal took : 62 ms
[2023-03-16 07:41:29] [INFO ] Input system was already deterministic with 650 transitions.
Incomplete random walk after 10000 steps, including 672 resets, run finished after 402 ms. (steps per millisecond=24 ) properties (out of 25) seen :18
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 169 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 138 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-16 07:41:30] [INFO ] Flow matrix only has 646 transitions (discarded 4 similar events)
[2023-03-16 07:41:30] [INFO ] Invariant cache hit.
[2023-03-16 07:41:30] [INFO ] [Real]Absence check using 59 positive place invariants in 11 ms returned sat
[2023-03-16 07:41:30] [INFO ] [Real]Absence check using 59 positive and 18 generalized place invariants in 19 ms returned sat
[2023-03-16 07:41:30] [INFO ] After 191ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:1
[2023-03-16 07:41:30] [INFO ] [Nat]Absence check using 59 positive place invariants in 16 ms returned sat
[2023-03-16 07:41:30] [INFO ] [Nat]Absence check using 59 positive and 18 generalized place invariants in 28 ms returned sat
[2023-03-16 07:41:31] [INFO ] After 422ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :1
[2023-03-16 07:41:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 07:41:31] [INFO ] After 54ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :3 sat :1
[2023-03-16 07:41:31] [INFO ] Deduced a trap composed of 213 places in 283 ms of which 4 ms to minimize.
[2023-03-16 07:41:31] [INFO ] Deduced a trap composed of 200 places in 193 ms of which 1 ms to minimize.
[2023-03-16 07:41:32] [INFO ] Deduced a trap composed of 205 places in 197 ms of which 1 ms to minimize.
[2023-03-16 07:41:32] [INFO ] Deduced a trap composed of 199 places in 158 ms of which 1 ms to minimize.
[2023-03-16 07:41:32] [INFO ] Deduced a trap composed of 212 places in 171 ms of which 1 ms to minimize.
[2023-03-16 07:41:32] [INFO ] Deduced a trap composed of 222 places in 182 ms of which 1 ms to minimize.
[2023-03-16 07:41:33] [INFO ] Deduced a trap composed of 206 places in 168 ms of which 0 ms to minimize.
[2023-03-16 07:41:33] [INFO ] Deduced a trap composed of 198 places in 150 ms of which 1 ms to minimize.
[2023-03-16 07:41:33] [INFO ] Deduced a trap composed of 191 places in 144 ms of which 0 ms to minimize.
[2023-03-16 07:41:33] [INFO ] Deduced a trap composed of 221 places in 138 ms of which 1 ms to minimize.
[2023-03-16 07:41:34] [INFO ] Deduced a trap composed of 203 places in 158 ms of which 1 ms to minimize.
[2023-03-16 07:41:34] [INFO ] Deduced a trap composed of 217 places in 153 ms of which 0 ms to minimize.
[2023-03-16 07:41:34] [INFO ] Deduced a trap composed of 210 places in 152 ms of which 1 ms to minimize.
[2023-03-16 07:41:34] [INFO ] Deduced a trap composed of 194 places in 162 ms of which 1 ms to minimize.
[2023-03-16 07:41:35] [INFO ] Deduced a trap composed of 216 places in 155 ms of which 1 ms to minimize.
[2023-03-16 07:41:35] [INFO ] Deduced a trap composed of 209 places in 144 ms of which 1 ms to minimize.
[2023-03-16 07:41:35] [INFO ] Deduced a trap composed of 194 places in 140 ms of which 1 ms to minimize.
[2023-03-16 07:41:35] [INFO ] Deduced a trap composed of 201 places in 148 ms of which 0 ms to minimize.
[2023-03-16 07:41:35] [INFO ] Deduced a trap composed of 195 places in 148 ms of which 1 ms to minimize.
[2023-03-16 07:41:36] [INFO ] Deduced a trap composed of 197 places in 149 ms of which 1 ms to minimize.
[2023-03-16 07:41:36] [INFO ] Deduced a trap composed of 191 places in 144 ms of which 0 ms to minimize.
[2023-03-16 07:41:36] [INFO ] Deduced a trap composed of 195 places in 149 ms of which 1 ms to minimize.
[2023-03-16 07:41:36] [INFO ] Deduced a trap composed of 215 places in 148 ms of which 1 ms to minimize.
[2023-03-16 07:41:36] [INFO ] Deduced a trap composed of 190 places in 146 ms of which 1 ms to minimize.
[2023-03-16 07:41:37] [INFO ] Deduced a trap composed of 207 places in 145 ms of which 0 ms to minimize.
[2023-03-16 07:41:37] [INFO ] Deduced a trap composed of 204 places in 151 ms of which 0 ms to minimize.
[2023-03-16 07:41:37] [INFO ] Deduced a trap composed of 203 places in 144 ms of which 0 ms to minimize.
[2023-03-16 07:41:37] [INFO ] Deduced a trap composed of 201 places in 149 ms of which 1 ms to minimize.
[2023-03-16 07:41:38] [INFO ] Deduced a trap composed of 203 places in 147 ms of which 0 ms to minimize.
[2023-03-16 07:41:38] [INFO ] Deduced a trap composed of 213 places in 149 ms of which 0 ms to minimize.
[2023-03-16 07:41:38] [INFO ] Deduced a trap composed of 213 places in 143 ms of which 1 ms to minimize.
[2023-03-16 07:41:38] [INFO ] Deduced a trap composed of 213 places in 142 ms of which 0 ms to minimize.
[2023-03-16 07:41:39] [INFO ] Deduced a trap composed of 192 places in 151 ms of which 1 ms to minimize.
[2023-03-16 07:41:39] [INFO ] Deduced a trap composed of 201 places in 147 ms of which 0 ms to minimize.
[2023-03-16 07:41:39] [INFO ] Deduced a trap composed of 206 places in 150 ms of which 4 ms to minimize.
[2023-03-16 07:41:39] [INFO ] Deduced a trap composed of 208 places in 153 ms of which 1 ms to minimize.
[2023-03-16 07:41:40] [INFO ] Deduced a trap composed of 192 places in 146 ms of which 0 ms to minimize.
[2023-03-16 07:41:40] [INFO ] Deduced a trap composed of 213 places in 155 ms of which 0 ms to minimize.
[2023-03-16 07:41:40] [INFO ] Deduced a trap composed of 201 places in 162 ms of which 1 ms to minimize.
[2023-03-16 07:41:49] [INFO ] Trap strengthening (SAT) tested/added 39/39 trap constraints in 18588 ms
[2023-03-16 07:41:50] [INFO ] After 18715ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :0
[2023-03-16 07:41:50] [INFO ] After 19293ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 484 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 484/484 places, 650/650 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 484 transition count 614
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 448 transition count 614
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 72 place count 448 transition count 579
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 142 place count 413 transition count 579
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 143 place count 412 transition count 578
Iterating global reduction 2 with 1 rules applied. Total rules applied 144 place count 412 transition count 578
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 148 place count 410 transition count 576
Applied a total of 148 rules in 107 ms. Remains 410 /484 variables (removed 74) and now considering 576/650 (removed 74) transitions.
[2023-03-16 07:41:50] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
// Phase 1: matrix 572 rows 410 cols
[2023-03-16 07:41:50] [INFO ] Computed 77 place invariants in 9 ms
[2023-03-16 07:41:50] [INFO ] Dead Transitions using invariants and state equation in 406 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 515 ms. Remains : 410/484 places, 576/650 transitions.
Incomplete random walk after 10000 steps, including 541 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 315706 steps, run timeout after 3001 ms. (steps per millisecond=105 ) properties seen :{}
Probabilistic random walk after 315706 steps, saw 94466 distinct states, run finished after 3002 ms. (steps per millisecond=105 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 07:41:53] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2023-03-16 07:41:53] [INFO ] Invariant cache hit.
[2023-03-16 07:41:53] [INFO ] [Real]Absence check using 58 positive place invariants in 9 ms returned sat
[2023-03-16 07:41:53] [INFO ] [Real]Absence check using 58 positive and 19 generalized place invariants in 23 ms returned sat
[2023-03-16 07:41:53] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 07:41:53] [INFO ] [Nat]Absence check using 58 positive place invariants in 10 ms returned sat
[2023-03-16 07:41:53] [INFO ] [Nat]Absence check using 58 positive and 19 generalized place invariants in 22 ms returned sat
[2023-03-16 07:41:54] [INFO ] After 244ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 07:41:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 07:41:54] [INFO ] After 29ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 07:41:54] [INFO ] Deduced a trap composed of 131 places in 130 ms of which 1 ms to minimize.
[2023-03-16 07:41:54] [INFO ] Deduced a trap composed of 140 places in 132 ms of which 0 ms to minimize.
[2023-03-16 07:41:54] [INFO ] Deduced a trap composed of 119 places in 124 ms of which 0 ms to minimize.
[2023-03-16 07:41:54] [INFO ] Deduced a trap composed of 128 places in 129 ms of which 1 ms to minimize.
[2023-03-16 07:41:54] [INFO ] Deduced a trap composed of 128 places in 121 ms of which 1 ms to minimize.
[2023-03-16 07:41:55] [INFO ] Deduced a trap composed of 116 places in 164 ms of which 0 ms to minimize.
[2023-03-16 07:41:55] [INFO ] Deduced a trap composed of 130 places in 129 ms of which 0 ms to minimize.
[2023-03-16 07:41:55] [INFO ] Deduced a trap composed of 120 places in 123 ms of which 1 ms to minimize.
[2023-03-16 07:41:55] [INFO ] Deduced a trap composed of 138 places in 126 ms of which 0 ms to minimize.
[2023-03-16 07:41:55] [INFO ] Deduced a trap composed of 137 places in 132 ms of which 0 ms to minimize.
[2023-03-16 07:41:56] [INFO ] Deduced a trap composed of 134 places in 129 ms of which 0 ms to minimize.
[2023-03-16 07:41:56] [INFO ] Deduced a trap composed of 135 places in 129 ms of which 1 ms to minimize.
[2023-03-16 07:41:56] [INFO ] Deduced a trap composed of 125 places in 128 ms of which 1 ms to minimize.
[2023-03-16 07:41:56] [INFO ] Deduced a trap composed of 137 places in 137 ms of which 1 ms to minimize.
[2023-03-16 07:41:57] [INFO ] Deduced a trap composed of 125 places in 127 ms of which 1 ms to minimize.
[2023-03-16 07:41:57] [INFO ] Deduced a trap composed of 131 places in 121 ms of which 0 ms to minimize.
[2023-03-16 07:41:57] [INFO ] Deduced a trap composed of 125 places in 128 ms of which 0 ms to minimize.
[2023-03-16 07:41:57] [INFO ] Deduced a trap composed of 128 places in 137 ms of which 5 ms to minimize.
[2023-03-16 07:41:57] [INFO ] Deduced a trap composed of 128 places in 137 ms of which 1 ms to minimize.
[2023-03-16 07:41:58] [INFO ] Deduced a trap composed of 134 places in 117 ms of which 1 ms to minimize.
[2023-03-16 07:41:58] [INFO ] Deduced a trap composed of 143 places in 119 ms of which 1 ms to minimize.
[2023-03-16 07:41:58] [INFO ] Deduced a trap composed of 145 places in 116 ms of which 1 ms to minimize.
[2023-03-16 07:41:58] [INFO ] Deduced a trap composed of 131 places in 115 ms of which 1 ms to minimize.
[2023-03-16 07:41:58] [INFO ] Deduced a trap composed of 134 places in 130 ms of which 0 ms to minimize.
[2023-03-16 07:41:58] [INFO ] Deduced a trap composed of 120 places in 128 ms of which 1 ms to minimize.
[2023-03-16 07:41:59] [INFO ] Deduced a trap composed of 135 places in 138 ms of which 3 ms to minimize.
[2023-03-16 07:41:59] [INFO ] Deduced a trap composed of 128 places in 132 ms of which 0 ms to minimize.
[2023-03-16 07:41:59] [INFO ] Deduced a trap composed of 134 places in 130 ms of which 1 ms to minimize.
[2023-03-16 07:41:59] [INFO ] Deduced a trap composed of 121 places in 131 ms of which 1 ms to minimize.
[2023-03-16 07:41:59] [INFO ] Deduced a trap composed of 119 places in 134 ms of which 0 ms to minimize.
[2023-03-16 07:42:00] [INFO ] Deduced a trap composed of 131 places in 133 ms of which 0 ms to minimize.
[2023-03-16 07:42:00] [INFO ] Deduced a trap composed of 128 places in 129 ms of which 0 ms to minimize.
[2023-03-16 07:42:00] [INFO ] Deduced a trap composed of 135 places in 129 ms of which 0 ms to minimize.
[2023-03-16 07:42:00] [INFO ] Deduced a trap composed of 131 places in 129 ms of which 1 ms to minimize.
[2023-03-16 07:42:00] [INFO ] Deduced a trap composed of 130 places in 126 ms of which 1 ms to minimize.
[2023-03-16 07:42:00] [INFO ] Deduced a trap composed of 128 places in 129 ms of which 0 ms to minimize.
[2023-03-16 07:42:01] [INFO ] Deduced a trap composed of 138 places in 116 ms of which 0 ms to minimize.
[2023-03-16 07:42:01] [INFO ] Deduced a trap composed of 126 places in 113 ms of which 0 ms to minimize.
[2023-03-16 07:42:01] [INFO ] Deduced a trap composed of 124 places in 132 ms of which 1 ms to minimize.
[2023-03-16 07:42:01] [INFO ] Deduced a trap composed of 128 places in 129 ms of which 1 ms to minimize.
[2023-03-16 07:42:02] [INFO ] Deduced a trap composed of 148 places in 129 ms of which 2 ms to minimize.
[2023-03-16 07:42:02] [INFO ] Deduced a trap composed of 119 places in 122 ms of which 0 ms to minimize.
[2023-03-16 07:42:02] [INFO ] Deduced a trap composed of 122 places in 124 ms of which 0 ms to minimize.
[2023-03-16 07:42:09] [INFO ] Deduced a trap composed of 138 places in 117 ms of which 0 ms to minimize.
[2023-03-16 07:42:14] [INFO ] Deduced a trap composed of 134 places in 116 ms of which 1 ms to minimize.
[2023-03-16 07:42:18] [INFO ] Trap strengthening (SAT) tested/added 45/45 trap constraints in 24627 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 07:42:18] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 07:42:18] [INFO ] After 25014ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 576/576 transitions.
Applied a total of 0 rules in 33 ms. Remains 410 /410 variables (removed 0) and now considering 576/576 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 410/410 places, 576/576 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 576/576 transitions.
Applied a total of 0 rules in 27 ms. Remains 410 /410 variables (removed 0) and now considering 576/576 (removed 0) transitions.
[2023-03-16 07:42:18] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2023-03-16 07:42:18] [INFO ] Invariant cache hit.
[2023-03-16 07:42:19] [INFO ] Implicit Places using invariants in 441 ms returned []
[2023-03-16 07:42:19] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2023-03-16 07:42:19] [INFO ] Invariant cache hit.
[2023-03-16 07:42:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 07:42:25] [INFO ] Implicit Places using invariants and state equation in 5933 ms returned []
Implicit Place search using SMT with State Equation took 6377 ms to find 0 implicit places.
[2023-03-16 07:42:25] [INFO ] Redundant transitions in 43 ms returned []
[2023-03-16 07:42:25] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2023-03-16 07:42:25] [INFO ] Invariant cache hit.
[2023-03-16 07:42:25] [INFO ] Dead Transitions using invariants and state equation in 416 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6881 ms. Remains : 410/410 places, 576/576 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 410 transition count 572
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 410 transition count 571
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 409 transition count 571
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 409 transition count 570
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 408 transition count 570
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 408 transition count 565
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 403 transition count 565
Applied a total of 18 rules in 70 ms. Remains 403 /410 variables (removed 7) and now considering 565/576 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 565 rows 403 cols
[2023-03-16 07:42:25] [INFO ] Computed 77 place invariants in 14 ms
[2023-03-16 07:42:25] [INFO ] [Real]Absence check using 59 positive place invariants in 10 ms returned sat
[2023-03-16 07:42:25] [INFO ] [Real]Absence check using 59 positive and 18 generalized place invariants in 17 ms returned sat
[2023-03-16 07:42:25] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 07:42:25] [INFO ] [Nat]Absence check using 59 positive place invariants in 9 ms returned sat
[2023-03-16 07:42:25] [INFO ] [Nat]Absence check using 59 positive and 18 generalized place invariants in 20 ms returned sat
[2023-03-16 07:42:26] [INFO ] After 471ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 07:42:26] [INFO ] Deduced a trap composed of 137 places in 126 ms of which 0 ms to minimize.
[2023-03-16 07:42:26] [INFO ] Deduced a trap composed of 134 places in 120 ms of which 0 ms to minimize.
[2023-03-16 07:42:26] [INFO ] Deduced a trap composed of 111 places in 128 ms of which 1 ms to minimize.
[2023-03-16 07:42:27] [INFO ] Deduced a trap composed of 134 places in 120 ms of which 0 ms to minimize.
[2023-03-16 07:42:27] [INFO ] Deduced a trap composed of 126 places in 120 ms of which 1 ms to minimize.
[2023-03-16 07:42:27] [INFO ] Deduced a trap composed of 136 places in 118 ms of which 0 ms to minimize.
[2023-03-16 07:42:27] [INFO ] Deduced a trap composed of 120 places in 116 ms of which 0 ms to minimize.
[2023-03-16 07:42:27] [INFO ] Deduced a trap composed of 123 places in 121 ms of which 0 ms to minimize.
[2023-03-16 07:42:27] [INFO ] Deduced a trap composed of 126 places in 124 ms of which 1 ms to minimize.
[2023-03-16 07:42:27] [INFO ] Deduced a trap composed of 111 places in 126 ms of which 1 ms to minimize.
[2023-03-16 07:42:28] [INFO ] Deduced a trap composed of 114 places in 119 ms of which 1 ms to minimize.
[2023-03-16 07:42:28] [INFO ] Deduced a trap composed of 141 places in 129 ms of which 1 ms to minimize.
[2023-03-16 07:42:28] [INFO ] Deduced a trap composed of 126 places in 121 ms of which 1 ms to minimize.
[2023-03-16 07:42:28] [INFO ] Deduced a trap composed of 128 places in 129 ms of which 1 ms to minimize.
[2023-03-16 07:42:28] [INFO ] Deduced a trap composed of 139 places in 134 ms of which 1 ms to minimize.
[2023-03-16 07:42:29] [INFO ] Deduced a trap composed of 126 places in 124 ms of which 0 ms to minimize.
[2023-03-16 07:42:29] [INFO ] Deduced a trap composed of 132 places in 136 ms of which 0 ms to minimize.
[2023-03-16 07:42:29] [INFO ] Deduced a trap composed of 133 places in 128 ms of which 1 ms to minimize.
[2023-03-16 07:42:29] [INFO ] Deduced a trap composed of 120 places in 130 ms of which 0 ms to minimize.
[2023-03-16 07:42:30] [INFO ] Deduced a trap composed of 134 places in 125 ms of which 0 ms to minimize.
[2023-03-16 07:42:30] [INFO ] Deduced a trap composed of 122 places in 127 ms of which 0 ms to minimize.
[2023-03-16 07:42:30] [INFO ] Deduced a trap composed of 136 places in 123 ms of which 1 ms to minimize.
[2023-03-16 07:42:30] [INFO ] Deduced a trap composed of 145 places in 122 ms of which 1 ms to minimize.
[2023-03-16 07:42:31] [INFO ] Deduced a trap composed of 122 places in 123 ms of which 1 ms to minimize.
[2023-03-16 07:42:31] [INFO ] Deduced a trap composed of 118 places in 120 ms of which 0 ms to minimize.
[2023-03-16 07:42:31] [INFO ] Deduced a trap composed of 116 places in 127 ms of which 0 ms to minimize.
[2023-03-16 07:42:31] [INFO ] Deduced a trap composed of 124 places in 120 ms of which 0 ms to minimize.
[2023-03-16 07:42:31] [INFO ] Deduced a trap composed of 144 places in 118 ms of which 1 ms to minimize.
[2023-03-16 07:42:31] [INFO ] Deduced a trap composed of 142 places in 124 ms of which 0 ms to minimize.
[2023-03-16 07:42:32] [INFO ] Deduced a trap composed of 116 places in 122 ms of which 0 ms to minimize.
[2023-03-16 07:42:32] [INFO ] Deduced a trap composed of 132 places in 123 ms of which 0 ms to minimize.
[2023-03-16 07:42:32] [INFO ] Deduced a trap composed of 138 places in 130 ms of which 0 ms to minimize.
[2023-03-16 07:42:32] [INFO ] Deduced a trap composed of 126 places in 132 ms of which 0 ms to minimize.
[2023-03-16 07:42:32] [INFO ] Deduced a trap composed of 135 places in 118 ms of which 0 ms to minimize.
[2023-03-16 07:42:32] [INFO ] Deduced a trap composed of 126 places in 128 ms of which 0 ms to minimize.
[2023-03-16 07:42:33] [INFO ] Deduced a trap composed of 117 places in 119 ms of which 1 ms to minimize.
[2023-03-16 07:42:33] [INFO ] Deduced a trap composed of 117 places in 124 ms of which 0 ms to minimize.
[2023-03-16 07:42:33] [INFO ] Deduced a trap composed of 129 places in 128 ms of which 0 ms to minimize.
[2023-03-16 07:42:33] [INFO ] Deduced a trap composed of 117 places in 122 ms of which 1 ms to minimize.
[2023-03-16 07:42:33] [INFO ] Deduced a trap composed of 132 places in 126 ms of which 0 ms to minimize.
[2023-03-16 07:42:33] [INFO ] Deduced a trap composed of 120 places in 125 ms of which 1 ms to minimize.
[2023-03-16 07:42:34] [INFO ] Deduced a trap composed of 126 places in 126 ms of which 0 ms to minimize.
[2023-03-16 07:42:34] [INFO ] Deduced a trap composed of 123 places in 124 ms of which 0 ms to minimize.
[2023-03-16 07:42:34] [INFO ] Deduced a trap composed of 144 places in 125 ms of which 0 ms to minimize.
[2023-03-16 07:42:34] [INFO ] Deduced a trap composed of 120 places in 123 ms of which 1 ms to minimize.
[2023-03-16 07:42:34] [INFO ] Deduced a trap composed of 120 places in 127 ms of which 0 ms to minimize.
[2023-03-16 07:42:35] [INFO ] Deduced a trap composed of 114 places in 116 ms of which 1 ms to minimize.
[2023-03-16 07:42:35] [INFO ] Deduced a trap composed of 129 places in 119 ms of which 0 ms to minimize.
[2023-03-16 07:42:35] [INFO ] Deduced a trap composed of 120 places in 119 ms of which 0 ms to minimize.
[2023-03-16 07:42:35] [INFO ] Deduced a trap composed of 123 places in 128 ms of which 1 ms to minimize.
[2023-03-16 07:42:35] [INFO ] Deduced a trap composed of 114 places in 121 ms of which 1 ms to minimize.
[2023-03-16 07:42:35] [INFO ] Deduced a trap composed of 126 places in 126 ms of which 1 ms to minimize.
[2023-03-16 07:42:36] [INFO ] Deduced a trap composed of 141 places in 127 ms of which 0 ms to minimize.
[2023-03-16 07:42:36] [INFO ] Deduced a trap composed of 125 places in 126 ms of which 0 ms to minimize.
[2023-03-16 07:42:36] [INFO ] Deduced a trap composed of 123 places in 128 ms of which 0 ms to minimize.
[2023-03-16 07:42:36] [INFO ] Deduced a trap composed of 132 places in 132 ms of which 1 ms to minimize.
[2023-03-16 07:42:36] [INFO ] Deduced a trap composed of 130 places in 124 ms of which 1 ms to minimize.
[2023-03-16 07:42:37] [INFO ] Deduced a trap composed of 120 places in 116 ms of which 0 ms to minimize.
[2023-03-16 07:42:37] [INFO ] Deduced a trap composed of 121 places in 116 ms of which 2 ms to minimize.
[2023-03-16 07:42:37] [INFO ] Deduced a trap composed of 115 places in 130 ms of which 1 ms to minimize.
[2023-03-16 07:42:37] [INFO ] Deduced a trap composed of 121 places in 128 ms of which 0 ms to minimize.
[2023-03-16 07:42:37] [INFO ] Deduced a trap composed of 111 places in 123 ms of which 0 ms to minimize.
[2023-03-16 07:42:38] [INFO ] Deduced a trap composed of 129 places in 124 ms of which 0 ms to minimize.
[2023-03-16 07:42:38] [INFO ] Deduced a trap composed of 135 places in 124 ms of which 1 ms to minimize.
[2023-03-16 07:42:38] [INFO ] Deduced a trap composed of 114 places in 125 ms of which 0 ms to minimize.
[2023-03-16 07:42:38] [INFO ] Deduced a trap composed of 129 places in 126 ms of which 1 ms to minimize.
[2023-03-16 07:42:38] [INFO ] Deduced a trap composed of 120 places in 123 ms of which 0 ms to minimize.
[2023-03-16 07:42:38] [INFO ] Deduced a trap composed of 117 places in 130 ms of which 1 ms to minimize.
[2023-03-16 07:42:39] [INFO ] Deduced a trap composed of 120 places in 124 ms of which 0 ms to minimize.
[2023-03-16 07:42:39] [INFO ] Deduced a trap composed of 140 places in 124 ms of which 0 ms to minimize.
[2023-03-16 07:42:39] [INFO ] Deduced a trap composed of 117 places in 128 ms of which 0 ms to minimize.
[2023-03-16 07:42:39] [INFO ] Deduced a trap composed of 126 places in 119 ms of which 0 ms to minimize.
[2023-03-16 07:42:39] [INFO ] Deduced a trap composed of 138 places in 126 ms of which 0 ms to minimize.
[2023-03-16 07:42:39] [INFO ] Deduced a trap composed of 132 places in 118 ms of which 0 ms to minimize.
[2023-03-16 07:42:40] [INFO ] Deduced a trap composed of 117 places in 128 ms of which 1 ms to minimize.
[2023-03-16 07:42:40] [INFO ] Deduced a trap composed of 123 places in 131 ms of which 0 ms to minimize.
[2023-03-16 07:42:40] [INFO ] Deduced a trap composed of 120 places in 125 ms of which 0 ms to minimize.
[2023-03-16 07:42:40] [INFO ] Deduced a trap composed of 132 places in 129 ms of which 0 ms to minimize.
[2023-03-16 07:42:40] [INFO ] Deduced a trap composed of 120 places in 127 ms of which 1 ms to minimize.
[2023-03-16 07:42:40] [INFO ] Deduced a trap composed of 117 places in 124 ms of which 0 ms to minimize.
[2023-03-16 07:42:41] [INFO ] Deduced a trap composed of 126 places in 128 ms of which 1 ms to minimize.
[2023-03-16 07:42:41] [INFO ] Deduced a trap composed of 123 places in 129 ms of which 0 ms to minimize.
[2023-03-16 07:42:41] [INFO ] Deduced a trap composed of 126 places in 125 ms of which 0 ms to minimize.
[2023-03-16 07:42:41] [INFO ] Deduced a trap composed of 129 places in 130 ms of which 1 ms to minimize.
[2023-03-16 07:42:41] [INFO ] Deduced a trap composed of 132 places in 114 ms of which 1 ms to minimize.
[2023-03-16 07:42:42] [INFO ] Deduced a trap composed of 123 places in 117 ms of which 0 ms to minimize.
[2023-03-16 07:42:42] [INFO ] Deduced a trap composed of 126 places in 119 ms of which 1 ms to minimize.
[2023-03-16 07:42:43] [INFO ] Deduced a trap composed of 121 places in 119 ms of which 1 ms to minimize.
[2023-03-16 07:42:43] [INFO ] Deduced a trap composed of 126 places in 116 ms of which 0 ms to minimize.
[2023-03-16 07:42:44] [INFO ] Deduced a trap composed of 129 places in 128 ms of which 1 ms to minimize.
[2023-03-16 07:42:44] [INFO ] Deduced a trap composed of 120 places in 119 ms of which 1 ms to minimize.
[2023-03-16 07:42:53] [INFO ] Trap strengthening (SAT) tested/added 91/91 trap constraints in 26907 ms
[2023-03-16 07:42:53] [INFO ] After 27418ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-16 07:42:53] [INFO ] After 27516ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
FORMULA PolyORBNT-PT-S05J30-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA PolyORBNT-PT-S05J30-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J30-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G(p1)&&F(p2))))'
Support contains 65 out of 484 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 484/484 places, 650/650 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 483 transition count 649
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 483 transition count 649
Applied a total of 2 rules in 14 ms. Remains 483 /484 variables (removed 1) and now considering 649/650 (removed 1) transitions.
[2023-03-16 07:42:53] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2023-03-16 07:42:53] [INFO ] Computed 77 place invariants in 10 ms
[2023-03-16 07:42:54] [INFO ] Dead Transitions using invariants and state equation in 639 ms found 0 transitions.
[2023-03-16 07:42:54] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-16 07:42:54] [INFO ] Invariant cache hit.
[2023-03-16 07:42:54] [INFO ] Implicit Places using invariants in 518 ms returned []
[2023-03-16 07:42:54] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-16 07:42:54] [INFO ] Invariant cache hit.
[2023-03-16 07:42:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 07:42:59] [INFO ] Implicit Places using invariants and state equation in 4231 ms returned []
Implicit Place search using SMT with State Equation took 4756 ms to find 0 implicit places.
[2023-03-16 07:42:59] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-16 07:42:59] [INFO ] Invariant cache hit.
[2023-03-16 07:42:59] [INFO ] Dead Transitions using invariants and state equation in 672 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 483/484 places, 649/650 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6088 ms. Remains : 483/484 places, 649/650 transitions.
Stuttering acceptance computed with spot in 382 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : PolyORBNT-PT-S05J30-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND p1 p2), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(AND p0 p1 p2), acceptance={0} source=5 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=5 dest: 2}, { cond=(NOT p1), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=4, aps=[p1:(AND (LT s255 1) (LT s256 1) (LT s447 1) (LT s446 1) (LT s67 1) (LT s133 1) (LT s12 1) (LT s323 1) (LT s401 1) (LT s141 1) (LT s205 1) (LT s267 1) (LT ...], 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, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 513 steps with 34 reset in 16 ms.
FORMULA PolyORBNT-PT-S05J30-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J30-LTLFireability-01 finished in 6552 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!p0)||(F(!p0) U p1)||(p2&&F(p1)))))'
Support contains 35 out of 484 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 484/484 places, 650/650 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 483 transition count 649
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 483 transition count 649
Applied a total of 2 rules in 18 ms. Remains 483 /484 variables (removed 1) and now considering 649/650 (removed 1) transitions.
[2023-03-16 07:43:00] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-16 07:43:00] [INFO ] Invariant cache hit.
[2023-03-16 07:43:00] [INFO ] Dead Transitions using invariants and state equation in 650 ms found 0 transitions.
[2023-03-16 07:43:00] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-16 07:43:00] [INFO ] Invariant cache hit.
[2023-03-16 07:43:01] [INFO ] Implicit Places using invariants in 515 ms returned []
[2023-03-16 07:43:01] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-16 07:43:01] [INFO ] Invariant cache hit.
[2023-03-16 07:43:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 07:43:05] [INFO ] Implicit Places using invariants and state equation in 4443 ms returned []
Implicit Place search using SMT with State Equation took 4963 ms to find 0 implicit places.
[2023-03-16 07:43:05] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-16 07:43:05] [INFO ] Invariant cache hit.
[2023-03-16 07:43:06] [INFO ] Dead Transitions using invariants and state equation in 707 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 483/484 places, 649/650 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6341 ms. Remains : 483/484 places, 649/650 transitions.
Stuttering acceptance computed with spot in 391 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, (NOT p1), (AND p0 (NOT p1)), (AND (NOT p1) p0), (NOT p1)]
Running random walk in product with property : PolyORBNT-PT-S05J30-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 5}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 6}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (OR (LT s104 1) (LT s181 1) (LT s301 1)) (OR (LT s104 1) (LT s162 1) (LT s181 1)) (OR (LT s104 1) (LT s181 1) (LT s305 1)) (OR (LT s104 1) (LT s18...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J30-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J30-LTLFireability-02 finished in 6766 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 193 out of 484 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 484/484 places, 650/650 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 484 transition count 646
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 480 transition count 646
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 8 place count 480 transition count 612
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 76 place count 446 transition count 612
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 445 transition count 611
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 445 transition count 611
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 82 place count 443 transition count 609
Applied a total of 82 rules in 52 ms. Remains 443 /484 variables (removed 41) and now considering 609/650 (removed 41) transitions.
[2023-03-16 07:43:07] [INFO ] Flow matrix only has 605 transitions (discarded 4 similar events)
// Phase 1: matrix 605 rows 443 cols
[2023-03-16 07:43:07] [INFO ] Computed 77 place invariants in 7 ms
[2023-03-16 07:43:07] [INFO ] Dead Transitions using invariants and state equation in 508 ms found 0 transitions.
[2023-03-16 07:43:07] [INFO ] Flow matrix only has 605 transitions (discarded 4 similar events)
[2023-03-16 07:43:07] [INFO ] Invariant cache hit.
[2023-03-16 07:43:07] [INFO ] Implicit Places using invariants in 334 ms returned []
[2023-03-16 07:43:07] [INFO ] Flow matrix only has 605 transitions (discarded 4 similar events)
[2023-03-16 07:43:07] [INFO ] Invariant cache hit.
[2023-03-16 07:43:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 07:43:10] [INFO ] Implicit Places using invariants and state equation in 2374 ms returned []
Implicit Place search using SMT with State Equation took 2711 ms to find 0 implicit places.
[2023-03-16 07:43:10] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-16 07:43:10] [INFO ] Flow matrix only has 605 transitions (discarded 4 similar events)
[2023-03-16 07:43:10] [INFO ] Invariant cache hit.
[2023-03-16 07:43:10] [INFO ] Dead Transitions using invariants and state equation in 506 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 443/484 places, 609/650 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3798 ms. Remains : 443/484 places, 609/650 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PolyORBNT-PT-S05J30-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (LT s389 1) (LT s396 1)) (OR (LT s176 1) (LT s269 1)) (OR (LT s284 1) (LT s399 1)) (OR (LT s76 1) (LT s301 1)) (OR (LT s223 1) (LT s408 1)) (O...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J30-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J30-LTLFireability-03 finished in 3947 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 3 out of 484 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 484/484 places, 650/650 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 484 transition count 615
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 71 place count 449 transition count 614
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 448 transition count 614
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 72 place count 448 transition count 580
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 140 place count 414 transition count 580
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 141 place count 413 transition count 579
Iterating global reduction 3 with 1 rules applied. Total rules applied 142 place count 413 transition count 579
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 146 place count 411 transition count 577
Applied a total of 146 rules in 54 ms. Remains 411 /484 variables (removed 73) and now considering 577/650 (removed 73) transitions.
[2023-03-16 07:43:11] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
// Phase 1: matrix 573 rows 411 cols
[2023-03-16 07:43:11] [INFO ] Computed 77 place invariants in 7 ms
[2023-03-16 07:43:11] [INFO ] Dead Transitions using invariants and state equation in 380 ms found 0 transitions.
[2023-03-16 07:43:11] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-16 07:43:11] [INFO ] Invariant cache hit.
[2023-03-16 07:43:11] [INFO ] Implicit Places using invariants in 471 ms returned []
[2023-03-16 07:43:11] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-16 07:43:11] [INFO ] Invariant cache hit.
[2023-03-16 07:43:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 07:43:15] [INFO ] Implicit Places using invariants and state equation in 3278 ms returned []
Implicit Place search using SMT with State Equation took 3751 ms to find 0 implicit places.
[2023-03-16 07:43:15] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-16 07:43:15] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-16 07:43:15] [INFO ] Invariant cache hit.
[2023-03-16 07:43:15] [INFO ] Dead Transitions using invariants and state equation in 415 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 411/484 places, 577/650 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4621 ms. Remains : 411/484 places, 577/650 transitions.
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PolyORBNT-PT-S05J30-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s139 1) (LT s181 1)), p1:(OR (LT s16 1) (LT s181 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 5246 reset in 498 ms.
Product exploration explored 100000 steps with 5223 reset in 504 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 281 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 169 steps, including 8 resets, run visited all 2 properties in 5 ms. (steps per millisecond=33 )
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 214 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 3 out of 411 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 411/411 places, 577/577 transitions.
Applied a total of 0 rules in 17 ms. Remains 411 /411 variables (removed 0) and now considering 577/577 (removed 0) transitions.
[2023-03-16 07:43:17] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-16 07:43:17] [INFO ] Invariant cache hit.
[2023-03-16 07:43:18] [INFO ] Dead Transitions using invariants and state equation in 412 ms found 0 transitions.
[2023-03-16 07:43:18] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-16 07:43:18] [INFO ] Invariant cache hit.
[2023-03-16 07:43:18] [INFO ] Implicit Places using invariants in 454 ms returned []
[2023-03-16 07:43:18] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-16 07:43:18] [INFO ] Invariant cache hit.
[2023-03-16 07:43:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 07:43:21] [INFO ] Implicit Places using invariants and state equation in 3407 ms returned []
Implicit Place search using SMT with State Equation took 3864 ms to find 0 implicit places.
[2023-03-16 07:43:21] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-16 07:43:21] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-16 07:43:21] [INFO ] Invariant cache hit.
[2023-03-16 07:43:22] [INFO ] Dead Transitions using invariants and state equation in 415 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4725 ms. Remains : 411/411 places, 577/577 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 169 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 96 steps, including 6 resets, run visited all 2 properties in 4 ms. (steps per millisecond=24 )
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 221 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 5225 reset in 437 ms.
Product exploration explored 100000 steps with 5227 reset in 448 ms.
Built C files in :
/tmp/ltsmin3497541575174269987
[2023-03-16 07:43:24] [INFO ] Computing symmetric may disable matrix : 577 transitions.
[2023-03-16 07:43:24] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 07:43:24] [INFO ] Computing symmetric may enable matrix : 577 transitions.
[2023-03-16 07:43:24] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 07:43:24] [INFO ] Computing Do-Not-Accords matrix : 577 transitions.
[2023-03-16 07:43:24] [INFO ] Computation of Completed DNA matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 07:43:24] [INFO ] Built C files in 120ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3497541575174269987
Running compilation step : cd /tmp/ltsmin3497541575174269987;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1537 ms.
Running link step : cd /tmp/ltsmin3497541575174269987;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin3497541575174269987;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5669563585719874516.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 411 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 411/411 places, 577/577 transitions.
Applied a total of 0 rules in 17 ms. Remains 411 /411 variables (removed 0) and now considering 577/577 (removed 0) transitions.
[2023-03-16 07:43:39] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-16 07:43:39] [INFO ] Invariant cache hit.
[2023-03-16 07:43:39] [INFO ] Dead Transitions using invariants and state equation in 433 ms found 0 transitions.
[2023-03-16 07:43:39] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-16 07:43:39] [INFO ] Invariant cache hit.
[2023-03-16 07:43:40] [INFO ] Implicit Places using invariants in 460 ms returned []
[2023-03-16 07:43:40] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-16 07:43:40] [INFO ] Invariant cache hit.
[2023-03-16 07:43:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 07:43:43] [INFO ] Implicit Places using invariants and state equation in 3643 ms returned []
Implicit Place search using SMT with State Equation took 4116 ms to find 0 implicit places.
[2023-03-16 07:43:43] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-16 07:43:43] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-16 07:43:43] [INFO ] Invariant cache hit.
[2023-03-16 07:43:44] [INFO ] Dead Transitions using invariants and state equation in 414 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4996 ms. Remains : 411/411 places, 577/577 transitions.
Built C files in :
/tmp/ltsmin14683188567516041595
[2023-03-16 07:43:44] [INFO ] Computing symmetric may disable matrix : 577 transitions.
[2023-03-16 07:43:44] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 07:43:44] [INFO ] Computing symmetric may enable matrix : 577 transitions.
[2023-03-16 07:43:44] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 07:43:44] [INFO ] Computing Do-Not-Accords matrix : 577 transitions.
[2023-03-16 07:43:44] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 07:43:44] [INFO ] Built C files in 88ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14683188567516041595
Running compilation step : cd /tmp/ltsmin14683188567516041595;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1438 ms.
Running link step : cd /tmp/ltsmin14683188567516041595;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin14683188567516041595;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5674419447027507543.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 07:43:59] [INFO ] Flatten gal took : 40 ms
[2023-03-16 07:43:59] [INFO ] Flatten gal took : 38 ms
[2023-03-16 07:43:59] [INFO ] Time to serialize gal into /tmp/LTL4359630675254564849.gal : 6 ms
[2023-03-16 07:43:59] [INFO ] Time to serialize properties into /tmp/LTL2437789616443476955.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4359630675254564849.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6092753235680190337.hoa' '-atoms' '/tmp/LTL2437789616443476955.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL2437789616443476955.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6092753235680190337.hoa
Detected timeout of ITS tools.
[2023-03-16 07:44:14] [INFO ] Flatten gal took : 33 ms
[2023-03-16 07:44:14] [INFO ] Flatten gal took : 29 ms
[2023-03-16 07:44:14] [INFO ] Time to serialize gal into /tmp/LTL1026527694002059766.gal : 4 ms
[2023-03-16 07:44:14] [INFO ] Time to serialize properties into /tmp/LTL9806124387735494039.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1026527694002059766.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9806124387735494039.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G((F(G("((place_462<1)||(NotifyEventJobQueuedE_1<1))")))&&(F("((place_458<1)||(NotifyEventJobQueuedE_1<1))")))))
Formula 0 simplified : F(GF!"((place_462<1)||(NotifyEventJobQueuedE_1<1))" | G!"((place_458<1)||(NotifyEventJobQueuedE_1<1))")
Detected timeout of ITS tools.
[2023-03-16 07:44:29] [INFO ] Flatten gal took : 31 ms
[2023-03-16 07:44:29] [INFO ] Applying decomposition
[2023-03-16 07:44:29] [INFO ] Flatten gal took : 26 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph5445463953184075493.txt' '-o' '/tmp/graph5445463953184075493.bin' '-w' '/tmp/graph5445463953184075493.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph5445463953184075493.bin' '-l' '-1' '-v' '-w' '/tmp/graph5445463953184075493.weights' '-q' '0' '-e' '0.001'
[2023-03-16 07:44:29] [INFO ] Decomposing Gal with order
[2023-03-16 07:44:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 07:44:30] [INFO ] Removed a total of 541 redundant transitions.
[2023-03-16 07:44:30] [INFO ] Flatten gal took : 121 ms
[2023-03-16 07:44:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 151 labels/synchronizations in 19 ms.
[2023-03-16 07:44:30] [INFO ] Time to serialize gal into /tmp/LTL13059840946712549174.gal : 11 ms
[2023-03-16 07:44:30] [INFO ] Time to serialize properties into /tmp/LTL12156004707688917124.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13059840946712549174.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12156004707688917124.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G((F(G("((i2.u6.place_462<1)||(i2.u6.NotifyEventJobQueuedE_1<1))")))&&(F("((i2.u6.place_458<1)||(i2.u6.NotifyEventJobQueuedE_1<1))"...160
Formula 0 simplified : F(GF!"((i2.u6.place_462<1)||(i2.u6.NotifyEventJobQueuedE_1<1))" | G!"((i2.u6.place_458<1)||(i2.u6.NotifyEventJobQueuedE_1<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6458043308063513914
[2023-03-16 07:44:45] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6458043308063513914
Running compilation step : cd /tmp/ltsmin6458043308063513914;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 970 ms.
Running link step : cd /tmp/ltsmin6458043308063513914;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin6458043308063513914;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>([]((LTLAPp0==true)))&&<>((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PolyORBNT-PT-S05J30-LTLFireability-04 finished in 109331 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(!p0))'
Support contains 2 out of 484 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 484/484 places, 650/650 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 483 transition count 649
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 483 transition count 649
Applied a total of 2 rules in 18 ms. Remains 483 /484 variables (removed 1) and now considering 649/650 (removed 1) transitions.
[2023-03-16 07:45:00] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2023-03-16 07:45:00] [INFO ] Computed 77 place invariants in 15 ms
[2023-03-16 07:45:01] [INFO ] Dead Transitions using invariants and state equation in 672 ms found 0 transitions.
[2023-03-16 07:45:01] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-16 07:45:01] [INFO ] Invariant cache hit.
[2023-03-16 07:45:01] [INFO ] Implicit Places using invariants in 536 ms returned []
[2023-03-16 07:45:01] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-16 07:45:01] [INFO ] Invariant cache hit.
[2023-03-16 07:45:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 07:45:06] [INFO ] Implicit Places using invariants and state equation in 4779 ms returned []
Implicit Place search using SMT with State Equation took 5317 ms to find 0 implicit places.
[2023-03-16 07:45:06] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-16 07:45:06] [INFO ] Invariant cache hit.
[2023-03-16 07:45:07] [INFO ] Dead Transitions using invariants and state equation in 710 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 483/484 places, 649/650 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6719 ms. Remains : 483/484 places, 649/650 transitions.
Stuttering acceptance computed with spot in 98 ms :[p0, p0, true]
Running random walk in product with property : PolyORBNT-PT-S05J30-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s19 1) (LT s210 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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 PolyORBNT-PT-S05J30-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J30-LTLFireability-05 finished in 6842 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(F(p1))||p0)))'
Support contains 8 out of 484 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 484/484 places, 650/650 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 484 transition count 615
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 449 transition count 615
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 70 place count 449 transition count 581
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 138 place count 415 transition count 581
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 139 place count 414 transition count 580
Iterating global reduction 2 with 1 rules applied. Total rules applied 140 place count 414 transition count 580
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 144 place count 412 transition count 578
Applied a total of 144 rules in 38 ms. Remains 412 /484 variables (removed 72) and now considering 578/650 (removed 72) transitions.
[2023-03-16 07:45:07] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
// Phase 1: matrix 574 rows 412 cols
[2023-03-16 07:45:07] [INFO ] Computed 77 place invariants in 13 ms
[2023-03-16 07:45:07] [INFO ] Dead Transitions using invariants and state equation in 442 ms found 0 transitions.
[2023-03-16 07:45:07] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2023-03-16 07:45:07] [INFO ] Invariant cache hit.
[2023-03-16 07:45:08] [INFO ] Implicit Places using invariants in 441 ms returned []
[2023-03-16 07:45:08] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2023-03-16 07:45:08] [INFO ] Invariant cache hit.
[2023-03-16 07:45:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 07:45:12] [INFO ] Implicit Places using invariants and state equation in 4035 ms returned []
Implicit Place search using SMT with State Equation took 4478 ms to find 0 implicit places.
[2023-03-16 07:45:12] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-16 07:45:12] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2023-03-16 07:45:12] [INFO ] Invariant cache hit.
[2023-03-16 07:45:12] [INFO ] Dead Transitions using invariants and state equation in 436 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 412/484 places, 578/650 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5426 ms. Remains : 412/484 places, 578/650 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : PolyORBNT-PT-S05J30-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s7 4) (AND (GEQ s68 6) (GEQ s130 2) (GEQ s288 2) (GEQ s359 1)) (AND (GEQ s68 6) (GEQ s288 4) (GEQ s359 1)) (AND (GEQ s68 6) (GEQ s73 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J30-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J30-LTLFireability-07 finished in 5527 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G((p1||X(X(X(G(p2))))))))'
Support contains 3 out of 484 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 484/484 places, 650/650 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 483 transition count 649
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 483 transition count 649
Applied a total of 2 rules in 21 ms. Remains 483 /484 variables (removed 1) and now considering 649/650 (removed 1) transitions.
[2023-03-16 07:45:12] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2023-03-16 07:45:12] [INFO ] Computed 77 place invariants in 10 ms
[2023-03-16 07:45:13] [INFO ] Dead Transitions using invariants and state equation in 662 ms found 0 transitions.
[2023-03-16 07:45:13] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-16 07:45:13] [INFO ] Invariant cache hit.
[2023-03-16 07:45:13] [INFO ] Implicit Places using invariants in 519 ms returned []
[2023-03-16 07:45:13] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-16 07:45:13] [INFO ] Invariant cache hit.
[2023-03-16 07:45:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 07:45:18] [INFO ] Implicit Places using invariants and state equation in 4942 ms returned []
Implicit Place search using SMT with State Equation took 5477 ms to find 0 implicit places.
[2023-03-16 07:45:18] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-16 07:45:18] [INFO ] Invariant cache hit.
[2023-03-16 07:45:19] [INFO ] Dead Transitions using invariants and state equation in 647 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 483/484 places, 649/650 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6810 ms. Remains : 483/484 places, 649/650 transitions.
Stuttering acceptance computed with spot in 322 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p2), (NOT p2), true]
Running random walk in product with property : PolyORBNT-PT-S05J30-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=p2, acceptance={} source=5 dest: 5}, { cond=(NOT p2), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(LT s8 4), p1:(LT s371 1), p2:(GEQ s449 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S05J30-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J30-LTLFireability-09 finished in 7156 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(!p1)&&p0)))'
Support contains 3 out of 484 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 484/484 places, 650/650 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 483 transition count 649
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 483 transition count 649
Applied a total of 2 rules in 18 ms. Remains 483 /484 variables (removed 1) and now considering 649/650 (removed 1) transitions.
[2023-03-16 07:45:19] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-16 07:45:19] [INFO ] Invariant cache hit.
[2023-03-16 07:45:20] [INFO ] Dead Transitions using invariants and state equation in 687 ms found 0 transitions.
[2023-03-16 07:45:20] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-16 07:45:20] [INFO ] Invariant cache hit.
[2023-03-16 07:45:21] [INFO ] Implicit Places using invariants in 525 ms returned []
[2023-03-16 07:45:21] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-16 07:45:21] [INFO ] Invariant cache hit.
[2023-03-16 07:45:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 07:45:25] [INFO ] Implicit Places using invariants and state equation in 4822 ms returned []
Implicit Place search using SMT with State Equation took 5349 ms to find 0 implicit places.
[2023-03-16 07:45:25] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-16 07:45:25] [INFO ] Invariant cache hit.
[2023-03-16 07:45:26] [INFO ] Dead Transitions using invariants and state equation in 672 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 483/484 places, 649/650 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6727 ms. Remains : 483/484 places, 649/650 transitions.
Stuttering acceptance computed with spot in 79 ms :[(OR (NOT p0) p1), p1]
Running random walk in product with property : PolyORBNT-PT-S05J30-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s337 1) (GEQ s477 1)), p1:(LT s233 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S05J30-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J30-LTLFireability-10 finished in 6824 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((!p0&&G(p1)))||G(p0))))'
Support contains 3 out of 484 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 484/484 places, 650/650 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 483 transition count 649
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 483 transition count 649
Applied a total of 2 rules in 17 ms. Remains 483 /484 variables (removed 1) and now considering 649/650 (removed 1) transitions.
[2023-03-16 07:45:26] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-16 07:45:26] [INFO ] Invariant cache hit.
[2023-03-16 07:45:27] [INFO ] Dead Transitions using invariants and state equation in 664 ms found 0 transitions.
[2023-03-16 07:45:27] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-16 07:45:27] [INFO ] Invariant cache hit.
[2023-03-16 07:45:27] [INFO ] Implicit Places using invariants in 530 ms returned []
[2023-03-16 07:45:27] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-16 07:45:27] [INFO ] Invariant cache hit.
[2023-03-16 07:45:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 07:45:32] [INFO ] Implicit Places using invariants and state equation in 4533 ms returned []
Implicit Place search using SMT with State Equation took 5072 ms to find 0 implicit places.
[2023-03-16 07:45:32] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-16 07:45:32] [INFO ] Invariant cache hit.
[2023-03-16 07:45:33] [INFO ] Dead Transitions using invariants and state equation in 668 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 483/484 places, 649/650 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6445 ms. Remains : 483/484 places, 649/650 transitions.
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (OR (NOT p1) p0), (NOT p1)]
Running random walk in product with property : PolyORBNT-PT-S05J30-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}], [{ cond=(OR p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LT s371 1), p1:(AND (GEQ s3 1) (GEQ s464 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J30-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J30-LTLFireability-11 finished in 6605 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 484 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 484/484 places, 650/650 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 484 transition count 615
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 71 place count 449 transition count 614
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 448 transition count 614
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 72 place count 448 transition count 580
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 140 place count 414 transition count 580
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 141 place count 413 transition count 579
Iterating global reduction 3 with 1 rules applied. Total rules applied 142 place count 413 transition count 579
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 146 place count 411 transition count 577
Applied a total of 146 rules in 39 ms. Remains 411 /484 variables (removed 73) and now considering 577/650 (removed 73) transitions.
[2023-03-16 07:45:33] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
// Phase 1: matrix 573 rows 411 cols
[2023-03-16 07:45:33] [INFO ] Computed 77 place invariants in 6 ms
[2023-03-16 07:45:33] [INFO ] Dead Transitions using invariants and state equation in 522 ms found 0 transitions.
[2023-03-16 07:45:33] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-16 07:45:33] [INFO ] Invariant cache hit.
[2023-03-16 07:45:34] [INFO ] Implicit Places using invariants in 426 ms returned []
[2023-03-16 07:45:34] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-16 07:45:34] [INFO ] Invariant cache hit.
[2023-03-16 07:45:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 07:45:37] [INFO ] Implicit Places using invariants and state equation in 3491 ms returned []
Implicit Place search using SMT with State Equation took 3954 ms to find 0 implicit places.
[2023-03-16 07:45:37] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-16 07:45:37] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-16 07:45:37] [INFO ] Invariant cache hit.
[2023-03-16 07:45:38] [INFO ] Dead Transitions using invariants and state equation in 389 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 411/484 places, 577/650 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4940 ms. Remains : 411/484 places, 577/650 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J30-LTLFireability-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:(OR (LT s16 1) (LT s181 1))], 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 4928 reset in 445 ms.
Product exploration explored 100000 steps with 5001 reset in 434 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Finished random walk after 183 steps, including 7 resets, run visited all 1 properties in 3 ms. (steps per millisecond=61 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 135 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Support contains 2 out of 411 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 411/411 places, 577/577 transitions.
Applied a total of 0 rules in 17 ms. Remains 411 /411 variables (removed 0) and now considering 577/577 (removed 0) transitions.
[2023-03-16 07:45:39] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-16 07:45:39] [INFO ] Invariant cache hit.
[2023-03-16 07:45:39] [INFO ] Dead Transitions using invariants and state equation in 450 ms found 0 transitions.
[2023-03-16 07:45:39] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-16 07:45:39] [INFO ] Invariant cache hit.
[2023-03-16 07:45:40] [INFO ] Implicit Places using invariants in 426 ms returned []
[2023-03-16 07:45:40] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-16 07:45:40] [INFO ] Invariant cache hit.
[2023-03-16 07:45:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 07:45:44] [INFO ] Implicit Places using invariants and state equation in 3693 ms returned []
Implicit Place search using SMT with State Equation took 4128 ms to find 0 implicit places.
[2023-03-16 07:45:44] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-16 07:45:44] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-16 07:45:44] [INFO ] Invariant cache hit.
[2023-03-16 07:45:44] [INFO ] Dead Transitions using invariants and state equation in 421 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5035 ms. Remains : 411/411 places, 577/577 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Finished random walk after 198 steps, including 8 resets, run visited all 1 properties in 3 ms. (steps per millisecond=66 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 136 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4856 reset in 423 ms.
Product exploration explored 100000 steps with 4929 reset in 431 ms.
Built C files in :
/tmp/ltsmin11316955255976363562
[2023-03-16 07:45:45] [INFO ] Computing symmetric may disable matrix : 577 transitions.
[2023-03-16 07:45:45] [INFO ] Computation of Complete disable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 07:45:45] [INFO ] Computing symmetric may enable matrix : 577 transitions.
[2023-03-16 07:45:45] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 07:45:45] [INFO ] Computing Do-Not-Accords matrix : 577 transitions.
[2023-03-16 07:45:45] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 07:45:45] [INFO ] Built C files in 94ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11316955255976363562
Running compilation step : cd /tmp/ltsmin11316955255976363562;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1495 ms.
Running link step : cd /tmp/ltsmin11316955255976363562;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin11316955255976363562;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15266423294311964511.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 411 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 411/411 places, 577/577 transitions.
Applied a total of 0 rules in 17 ms. Remains 411 /411 variables (removed 0) and now considering 577/577 (removed 0) transitions.
[2023-03-16 07:46:00] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-16 07:46:00] [INFO ] Invariant cache hit.
[2023-03-16 07:46:01] [INFO ] Dead Transitions using invariants and state equation in 412 ms found 0 transitions.
[2023-03-16 07:46:01] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-16 07:46:01] [INFO ] Invariant cache hit.
[2023-03-16 07:46:01] [INFO ] Implicit Places using invariants in 458 ms returned []
[2023-03-16 07:46:01] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-16 07:46:01] [INFO ] Invariant cache hit.
[2023-03-16 07:46:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 07:46:05] [INFO ] Implicit Places using invariants and state equation in 3874 ms returned []
Implicit Place search using SMT with State Equation took 4336 ms to find 0 implicit places.
[2023-03-16 07:46:05] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-16 07:46:05] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-16 07:46:05] [INFO ] Invariant cache hit.
[2023-03-16 07:46:06] [INFO ] Dead Transitions using invariants and state equation in 415 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5202 ms. Remains : 411/411 places, 577/577 transitions.
Built C files in :
/tmp/ltsmin706020307869228729
[2023-03-16 07:46:06] [INFO ] Computing symmetric may disable matrix : 577 transitions.
[2023-03-16 07:46:06] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 07:46:06] [INFO ] Computing symmetric may enable matrix : 577 transitions.
[2023-03-16 07:46:06] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 07:46:06] [INFO ] Computing Do-Not-Accords matrix : 577 transitions.
[2023-03-16 07:46:06] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 07:46:06] [INFO ] Built C files in 77ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin706020307869228729
Running compilation step : cd /tmp/ltsmin706020307869228729;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1476 ms.
Running link step : cd /tmp/ltsmin706020307869228729;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin706020307869228729;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6878179151175391959.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-16 07:46:21] [INFO ] Flatten gal took : 24 ms
[2023-03-16 07:46:21] [INFO ] Flatten gal took : 24 ms
[2023-03-16 07:46:21] [INFO ] Time to serialize gal into /tmp/LTL14856265688098140643.gal : 4 ms
[2023-03-16 07:46:21] [INFO ] Time to serialize properties into /tmp/LTL15197871291813357598.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14856265688098140643.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2830500614894794961.hoa' '-atoms' '/tmp/LTL15197871291813357598.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL15197871291813357598.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2830500614894794961.hoa
Detected timeout of ITS tools.
[2023-03-16 07:46:36] [INFO ] Flatten gal took : 24 ms
[2023-03-16 07:46:36] [INFO ] Flatten gal took : 25 ms
[2023-03-16 07:46:36] [INFO ] Time to serialize gal into /tmp/LTL15624322481904548712.gal : 11 ms
[2023-03-16 07:46:36] [INFO ] Time to serialize properties into /tmp/LTL6098366114777660757.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15624322481904548712.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6098366114777660757.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("((place_458<1)||(NotifyEventJobQueuedE_1<1))"))))
Formula 0 simplified : GF!"((place_458<1)||(NotifyEventJobQueuedE_1<1))"
Detected timeout of ITS tools.
[2023-03-16 07:46:51] [INFO ] Flatten gal took : 28 ms
[2023-03-16 07:46:51] [INFO ] Applying decomposition
[2023-03-16 07:46:51] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph15705704778885357637.txt' '-o' '/tmp/graph15705704778885357637.bin' '-w' '/tmp/graph15705704778885357637.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph15705704778885357637.bin' '-l' '-1' '-v' '-w' '/tmp/graph15705704778885357637.weights' '-q' '0' '-e' '0.001'
[2023-03-16 07:46:51] [INFO ] Decomposing Gal with order
[2023-03-16 07:46:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 07:46:51] [INFO ] Removed a total of 631 redundant transitions.
[2023-03-16 07:46:51] [INFO ] Flatten gal took : 65 ms
[2023-03-16 07:46:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 58 labels/synchronizations in 11 ms.
[2023-03-16 07:46:51] [INFO ] Time to serialize gal into /tmp/LTL14621921369677825499.gal : 7 ms
[2023-03-16 07:46:51] [INFO ] Time to serialize properties into /tmp/LTL4984649550523589012.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14621921369677825499.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4984649550523589012.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G("((i1.u8.place_458<1)||(i1.u8.NotifyEventJobQueuedE_1<1))"))))
Formula 0 simplified : GF!"((i1.u8.place_458<1)||(i1.u8.NotifyEventJobQueuedE_1<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9448174636903064700
[2023-03-16 07:47:06] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9448174636903064700
Running compilation step : cd /tmp/ltsmin9448174636903064700;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1072 ms.
Running link step : cd /tmp/ltsmin9448174636903064700;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin9448174636903064700;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PolyORBNT-PT-S05J30-LTLFireability-12 finished in 108674 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(G((p0&&(p1 U (G(p1)||(X(p1)&&p2)))))))))'
Support contains 6 out of 484 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 484/484 places, 650/650 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 483 transition count 649
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 483 transition count 649
Applied a total of 2 rules in 16 ms. Remains 483 /484 variables (removed 1) and now considering 649/650 (removed 1) transitions.
[2023-03-16 07:47:22] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2023-03-16 07:47:22] [INFO ] Computed 77 place invariants in 12 ms
[2023-03-16 07:47:22] [INFO ] Dead Transitions using invariants and state equation in 665 ms found 0 transitions.
[2023-03-16 07:47:22] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-16 07:47:22] [INFO ] Invariant cache hit.
[2023-03-16 07:47:23] [INFO ] Implicit Places using invariants in 502 ms returned []
[2023-03-16 07:47:23] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-16 07:47:23] [INFO ] Invariant cache hit.
[2023-03-16 07:47:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 07:47:27] [INFO ] Implicit Places using invariants and state equation in 4683 ms returned []
Implicit Place search using SMT with State Equation took 5187 ms to find 0 implicit places.
[2023-03-16 07:47:27] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-16 07:47:27] [INFO ] Invariant cache hit.
[2023-03-16 07:47:28] [INFO ] Dead Transitions using invariants and state equation in 671 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 483/484 places, 649/650 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6549 ms. Remains : 483/484 places, 649/650 transitions.
Stuttering acceptance computed with spot in 292 ms :[true, (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J30-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=4 dest: 0}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(OR (LT s332 1) (LT s439 1) (LT s440 1)), p1:(OR (LT s19 1) (LT s210 1)), p2:(AND (OR (LT s19 1) (LT s210 1)) (NOT (AND (GEQ s200 1) (GEQ s210 1))))], 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, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 10 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S05J30-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J30-LTLFireability-14 finished in 6888 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2023-03-16 07:47:29] [INFO ] Flatten gal took : 25 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin901689377576949170
[2023-03-16 07:47:29] [INFO ] Computing symmetric may disable matrix : 650 transitions.
[2023-03-16 07:47:29] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 07:47:29] [INFO ] Computing symmetric may enable matrix : 650 transitions.
[2023-03-16 07:47:29] [INFO ] Applying decomposition
[2023-03-16 07:47:29] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 07:47:29] [INFO ] Flatten gal took : 40 ms
[2023-03-16 07:47:29] [INFO ] Computing Do-Not-Accords matrix : 650 transitions.
[2023-03-16 07:47:29] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 07:47:29] [INFO ] Built C files in 221ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin901689377576949170
Running compilation step : cd /tmp/ltsmin901689377576949170;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph3822227585777306374.txt' '-o' '/tmp/graph3822227585777306374.bin' '-w' '/tmp/graph3822227585777306374.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph3822227585777306374.bin' '-l' '-1' '-v' '-w' '/tmp/graph3822227585777306374.weights' '-q' '0' '-e' '0.001'
[2023-03-16 07:47:29] [INFO ] Decomposing Gal with order
[2023-03-16 07:47:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 07:47:30] [INFO ] Removed a total of 751 redundant transitions.
[2023-03-16 07:47:30] [INFO ] Flatten gal took : 90 ms
[2023-03-16 07:47:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 27 ms.
[2023-03-16 07:47:30] [INFO ] Time to serialize gal into /tmp/LTLFireability4935346699941581246.gal : 24 ms
[2023-03-16 07:47:30] [INFO ] Time to serialize properties into /tmp/LTLFireability3180445065573434656.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability4935346699941581246.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3180445065573434656.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 2 LTL properties
Checking formula 0 : !((G((F(G("((i28.u63.place_462<1)||(i28.u63.NotifyEventJobQueuedE_1<1))")))&&(F("((i28.u63.place_458<1)||(i28.u63.NotifyEventJobQueued...168
Formula 0 simplified : F(GF!"((i28.u63.place_462<1)||(i28.u63.NotifyEventJobQueuedE_1<1))" | G!"((i28.u63.place_458<1)||(i28.u63.NotifyEventJobQueuedE_1<1)...158
Compilation finished in 1796 ms.
Running link step : cd /tmp/ltsmin901689377576949170;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin901689377576949170;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((<>([]((LTLAPp0==true)))&&<>((LTLAPp1==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.005: Loading model from ./gal.so
pins2lts-mc-linux64( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.047: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.051: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.056: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.066: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.061: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.072: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.072: Initializing POR dependencies: labels 652, guards 650
pins2lts-mc-linux64( 3/ 8), 0.078: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.089: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 5.782: LTL layer: formula: []((<>([]((LTLAPp0==true)))&&<>((LTLAPp1==true))))
pins2lts-mc-linux64( 3/ 8), 5.782: "[]((<>([]((LTLAPp0==true)))&&<>((LTLAPp1==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 5.783: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 6.013: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 6.046: There are 653 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 6.047: State length is 485, there are 658 groups
pins2lts-mc-linux64( 0/ 8), 6.047: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 6.047: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 6.047: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 6.047: Visible groups: 0 / 658, labels: 2 / 653
pins2lts-mc-linux64( 0/ 8), 6.047: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 6.047: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 6/ 8), 6.093: [Blue] ~39 levels ~960 states ~1944 transitions
pins2lts-mc-linux64( 6/ 8), 6.136: [Blue] ~39 levels ~1920 states ~3712 transitions
pins2lts-mc-linux64( 4/ 8), 6.228: [Blue] ~51 levels ~3840 states ~7920 transitions
pins2lts-mc-linux64( 6/ 8), 6.401: [Blue] ~39 levels ~7680 states ~15544 transitions
pins2lts-mc-linux64( 5/ 8), 6.724: [Blue] ~52 levels ~15360 states ~29192 transitions
pins2lts-mc-linux64( 5/ 8), 7.343: [Blue] ~52 levels ~30720 states ~58328 transitions
pins2lts-mc-linux64( 2/ 8), 8.454: [Blue] ~65 levels ~61440 states ~110432 transitions
pins2lts-mc-linux64( 5/ 8), 10.645: [Blue] ~52 levels ~122880 states ~225016 transitions
pins2lts-mc-linux64( 4/ 8), 15.363: [Blue] ~51 levels ~245760 states ~443584 transitions
pins2lts-mc-linux64( 4/ 8), 22.796: [Blue] ~51 levels ~491520 states ~891224 transitions
pins2lts-mc-linux64( 6/ 8), 37.502: [Blue] ~44 levels ~983040 states ~1785144 transitions
pins2lts-mc-linux64( 6/ 8), 66.223: [Blue] ~55 levels ~1966080 states ~3576440 transitions
pins2lts-mc-linux64( 6/ 8), 124.562: [Blue] ~55 levels ~3932160 states ~7238928 transitions
pins2lts-mc-linux64( 2/ 8), 240.778: [Blue] ~65 levels ~7864320 states ~14803528 transitions
pins2lts-mc-linux64( 2/ 8), 474.315: [Blue] ~65 levels ~15728640 states ~29625216 transitions
pins2lts-mc-linux64( 2/ 8), 937.126: [Blue] ~65 levels ~31457280 states ~59886592 transitions
pins2lts-mc-linux64( 4/ 8), 1092.014: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1092.052:
pins2lts-mc-linux64( 0/ 8), 1092.052: Explored 33201637 states 78957500 transitions, fanout: 2.378
pins2lts-mc-linux64( 0/ 8), 1092.052: Total exploration time 1086.000 sec (1085.970 sec minimum, 1085.979 sec on average)
pins2lts-mc-linux64( 0/ 8), 1092.052: States per second: 30572, Transitions per second: 72705
pins2lts-mc-linux64( 0/ 8), 1092.052:
pins2lts-mc-linux64( 0/ 8), 1092.052: State space has 33202750 states, 2204353 are accepting
pins2lts-mc-linux64( 0/ 8), 1092.052: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1092.052: blue states: 33201637 (100.00%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1092.052: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1092.052: all-red states: 2769304 (8.34%), bogus 5 (0.00%)
pins2lts-mc-linux64( 0/ 8), 1092.052:
pins2lts-mc-linux64( 0/ 8), 1092.052: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 1092.052:
pins2lts-mc-linux64( 0/ 8), 1092.052: Queue width: 8B, total height: 408, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 1092.052: Tree memory: 509.3MB, 16.1 B/state, compr.: 0.8%
pins2lts-mc-linux64( 0/ 8), 1092.052: Tree fill ratio (roots/leafs): 24.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1092.052: Stored 660 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1092.052: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1092.052: Est. total memory use: 509.3MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin901689377576949170;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((<>([]((LTLAPp0==true)))&&<>((LTLAPp1==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin901689377576949170;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((<>([]((LTLAPp0==true)))&&<>((LTLAPp1==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-16 08:09:31] [INFO ] Flatten gal took : 22 ms
[2023-03-16 08:09:31] [INFO ] Time to serialize gal into /tmp/LTLFireability4018838658731012482.gal : 6 ms
[2023-03-16 08:09:31] [INFO ] Time to serialize properties into /tmp/LTLFireability11628326103519522944.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability4018838658731012482.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11628326103519522944.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 2 LTL properties
Checking formula 0 : !((G((F(G("((place_462<1)||(NotifyEventJobQueuedE_1<1))")))&&(F("((place_458<1)||(NotifyEventJobQueuedE_1<1))")))))
Formula 0 simplified : F(GF!"((place_462<1)||(NotifyEventJobQueuedE_1<1))" | G!"((place_458<1)||(NotifyEventJobQueuedE_1<1))")
Detected timeout of ITS tools.
[2023-03-16 08:32:15] [INFO ] Flatten gal took : 160 ms
[2023-03-16 08:32:16] [INFO ] Input system was already deterministic with 650 transitions.
[2023-03-16 08:32:17] [INFO ] Transformed 484 places.
[2023-03-16 08:32:17] [INFO ] Transformed 650 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-16 08:32:47] [INFO ] Time to serialize gal into /tmp/LTLFireability15547704206029193224.gal : 8 ms
[2023-03-16 08:32:47] [INFO ] Time to serialize properties into /tmp/LTLFireability4716551358285605516.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15547704206029193224.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4716551358285605516.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G((F(G("((place_462<1)||(NotifyEventJobQueuedE_1<1))")))&&(F("((place_458<1)||(NotifyEventJobQueuedE_1<1))")))))
Formula 0 simplified : F(GF!"((place_462<1)||(NotifyEventJobQueuedE_1<1))" | G!"((place_458<1)||(NotifyEventJobQueuedE_1<1))")
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 3962800 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15918812 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is PolyORBNT-PT-S05J30, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r293-tall-167873945800724"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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