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.r071-smll-167814397600179.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 lolaxred
Input is CircularTrains-PT-192, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r071-smll-167814397600179
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 640K
-rw-r--r-- 1 mcc users 7.2K Feb 26 04:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 26 04:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 26 04:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 04:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 15:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 04:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Feb 26 04:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 04:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Feb 26 04:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 147K Mar 5 18:22 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 CircularTrains-PT-192-LTLCardinality-00
FORMULA_NAME CircularTrains-PT-192-LTLCardinality-01
FORMULA_NAME CircularTrains-PT-192-LTLCardinality-02
FORMULA_NAME CircularTrains-PT-192-LTLCardinality-03
FORMULA_NAME CircularTrains-PT-192-LTLCardinality-04
FORMULA_NAME CircularTrains-PT-192-LTLCardinality-05
FORMULA_NAME CircularTrains-PT-192-LTLCardinality-06
FORMULA_NAME CircularTrains-PT-192-LTLCardinality-07
FORMULA_NAME CircularTrains-PT-192-LTLCardinality-08
FORMULA_NAME CircularTrains-PT-192-LTLCardinality-09
FORMULA_NAME CircularTrains-PT-192-LTLCardinality-10
FORMULA_NAME CircularTrains-PT-192-LTLCardinality-11
FORMULA_NAME CircularTrains-PT-192-LTLCardinality-12
FORMULA_NAME CircularTrains-PT-192-LTLCardinality-13
FORMULA_NAME CircularTrains-PT-192-LTLCardinality-14
FORMULA_NAME CircularTrains-PT-192-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678251282748

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=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CircularTrains-PT-192
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 04:54:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-08 04:54:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 04:54:46] [INFO ] Load time of PNML (sax parser for PT used): 125 ms
[2023-03-08 04:54:46] [INFO ] Transformed 384 places.
[2023-03-08 04:54:46] [INFO ] Transformed 192 transitions.
[2023-03-08 04:54:46] [INFO ] Parsed PT model containing 384 places and 192 transitions and 768 arcs in 276 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CircularTrains-PT-192-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-192-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 60 out of 384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 192/192 transitions.
Applied a total of 0 rules in 98 ms. Remains 384 /384 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 384 cols
[2023-03-08 04:54:47] [INFO ] Computed 193 place invariants in 47 ms
[2023-03-08 04:54:48] [INFO ] Implicit Places using invariants in 1238 ms returned [1, 7, 10, 18, 21, 28, 37, 44, 47, 48, 62, 75, 78, 81, 89, 102, 108, 133, 138, 144, 146, 163, 167, 217, 230, 231, 244, 245, 247, 261, 284, 285, 298, 311, 313, 314, 324, 327, 330, 332, 333, 346, 354, 356, 366, 369, 371, 374, 375, 376, 378, 380, 382]
Discarding 53 places :
Implicit Place search using SMT only with invariants took 1296 ms to find 53 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 331/384 places, 192/192 transitions.
Applied a total of 0 rules in 24 ms. Remains 331 /331 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1419 ms. Remains : 331/384 places, 192/192 transitions.
Support contains 60 out of 331 places after structural reductions.
[2023-03-08 04:54:48] [INFO ] Flatten gal took : 99 ms
[2023-03-08 04:54:49] [INFO ] Flatten gal took : 44 ms
[2023-03-08 04:54:49] [INFO ] Input system was already deterministic with 192 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 944 ms. (steps per millisecond=10 ) properties (out of 32) seen :26
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 192 rows 331 cols
[2023-03-08 04:54:50] [INFO ] Computed 140 place invariants in 17 ms
[2023-03-08 04:54:50] [INFO ] [Real]Absence check using 124 positive place invariants in 33 ms returned sat
[2023-03-08 04:54:50] [INFO ] [Real]Absence check using 124 positive and 16 generalized place invariants in 7 ms returned sat
[2023-03-08 04:54:50] [INFO ] After 279ms SMT Verify possible using all constraints in real domain returned unsat :6 sat :0
Fused 6 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA CircularTrains-PT-192-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 6 atomic propositions for a total of 13 simplifications.
FORMULA CircularTrains-PT-192-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-192-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA CircularTrains-PT-192-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 3 out of 331 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 331/331 places, 192/192 transitions.
Applied a total of 0 rules in 22 ms. Remains 331 /331 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2023-03-08 04:54:51] [INFO ] Invariant cache hit.
[2023-03-08 04:54:52] [INFO ] Implicit Places using invariants in 524 ms returned [53, 54, 122, 139, 173, 253, 261, 308, 313, 316]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 526 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 321/331 places, 192/192 transitions.
Applied a total of 0 rules in 9 ms. Remains 321 /321 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 559 ms. Remains : 321/331 places, 192/192 transitions.
Stuttering acceptance computed with spot in 327 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : CircularTrains-PT-192-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT 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 (LEQ s84 s197) (LEQ 2 s33))], 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 3 ms.
FORMULA CircularTrains-PT-192-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-192-LTLCardinality-00 finished in 1006 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 4 out of 331 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 331/331 places, 192/192 transitions.
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 331 transition count 151
Reduce places removed 41 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 42 rules applied. Total rules applied 83 place count 290 transition count 150
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 84 place count 289 transition count 150
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 84 place count 289 transition count 139
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 106 place count 278 transition count 139
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 124 place count 269 transition count 130
Applied a total of 124 rules in 67 ms. Remains 269 /331 variables (removed 62) and now considering 130/192 (removed 62) transitions.
// Phase 1: matrix 130 rows 269 cols
[2023-03-08 04:54:52] [INFO ] Computed 140 place invariants in 7 ms
[2023-03-08 04:54:52] [INFO ] Implicit Places using invariants in 440 ms returned [46, 47, 71, 101, 117, 143, 203, 210, 248, 253]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 449 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 259/331 places, 130/192 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 259 transition count 129
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 258 transition count 129
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 257 transition count 128
Applied a total of 4 rules in 34 ms. Remains 257 /259 variables (removed 2) and now considering 128/130 (removed 2) transitions.
// Phase 1: matrix 128 rows 257 cols
[2023-03-08 04:54:52] [INFO ] Computed 130 place invariants in 6 ms
[2023-03-08 04:54:53] [INFO ] Implicit Places using invariants in 395 ms returned []
[2023-03-08 04:54:53] [INFO ] Invariant cache hit.
[2023-03-08 04:54:53] [INFO ] Implicit Places using invariants and state equation in 538 ms returned []
Implicit Place search using SMT with State Equation took 940 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 257/331 places, 128/192 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1492 ms. Remains : 257/331 places, 128/192 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-192-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LEQ s193 s135) (LEQ s244 s121))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 1387 ms.
Product exploration explored 100000 steps with 0 reset in 1102 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 362 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 51 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 1 factoid took 218 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 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
[2023-03-08 04:54:57] [INFO ] Invariant cache hit.
[2023-03-08 04:54:57] [INFO ] [Real]Absence check using 126 positive place invariants in 82 ms returned sat
[2023-03-08 04:54:57] [INFO ] [Real]Absence check using 126 positive and 4 generalized place invariants in 25 ms returned sat
[2023-03-08 04:54:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:54:58] [INFO ] [Real]Absence check using state equation in 480 ms returned sat
[2023-03-08 04:54:58] [INFO ] Computed and/alt/rep : 64/128/64 causal constraints (skipped 0 transitions) in 16 ms.
[2023-03-08 04:54:58] [INFO ] Added : 62 causal constraints over 13 iterations in 576 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 257 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 257/257 places, 128/128 transitions.
Applied a total of 0 rules in 15 ms. Remains 257 /257 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2023-03-08 04:54:58] [INFO ] Invariant cache hit.
[2023-03-08 04:54:59] [INFO ] Implicit Places using invariants in 385 ms returned []
[2023-03-08 04:54:59] [INFO ] Invariant cache hit.
[2023-03-08 04:54:59] [INFO ] Implicit Places using invariants and state equation in 623 ms returned []
Implicit Place search using SMT with State Equation took 1020 ms to find 0 implicit places.
[2023-03-08 04:54:59] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-08 04:54:59] [INFO ] Invariant cache hit.
[2023-03-08 04:55:00] [INFO ] Dead Transitions using invariants and state equation in 272 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1326 ms. Remains : 257/257 places, 128/128 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 186 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 53 ms :[(NOT p0)]
Finished random walk after 163 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=40 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 1 factoid took 213 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 52 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
[2023-03-08 04:55:00] [INFO ] Invariant cache hit.
[2023-03-08 04:55:00] [INFO ] [Real]Absence check using 126 positive place invariants in 78 ms returned sat
[2023-03-08 04:55:00] [INFO ] [Real]Absence check using 126 positive and 4 generalized place invariants in 23 ms returned sat
[2023-03-08 04:55:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:55:01] [INFO ] [Real]Absence check using state equation in 481 ms returned sat
[2023-03-08 04:55:01] [INFO ] Computed and/alt/rep : 64/128/64 causal constraints (skipped 0 transitions) in 13 ms.
[2023-03-08 04:55:02] [INFO ] Added : 62 causal constraints over 13 iterations in 521 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 64 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 1089 ms.
Product exploration explored 100000 steps with 0 reset in 894 ms.
Support contains 4 out of 257 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 257/257 places, 128/128 transitions.
Applied a total of 0 rules in 8 ms. Remains 257 /257 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2023-03-08 04:55:04] [INFO ] Invariant cache hit.
[2023-03-08 04:55:04] [INFO ] Implicit Places using invariants in 294 ms returned []
[2023-03-08 04:55:04] [INFO ] Invariant cache hit.
[2023-03-08 04:55:05] [INFO ] Implicit Places using invariants and state equation in 611 ms returned []
Implicit Place search using SMT with State Equation took 909 ms to find 0 implicit places.
[2023-03-08 04:55:05] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-08 04:55:05] [INFO ] Invariant cache hit.
[2023-03-08 04:55:05] [INFO ] Dead Transitions using invariants and state equation in 266 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1199 ms. Remains : 257/257 places, 128/128 transitions.
Treatment of property CircularTrains-PT-192-LTLCardinality-01 finished in 12997 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&&X((p1&&F((p0&&X(p2))))))))'
Support contains 4 out of 331 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 331/331 places, 192/192 transitions.
Applied a total of 0 rules in 8 ms. Remains 331 /331 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 331 cols
[2023-03-08 04:55:05] [INFO ] Computed 140 place invariants in 6 ms
[2023-03-08 04:55:05] [INFO ] Implicit Places using invariants in 408 ms returned [53, 54, 86, 122, 139, 173, 261, 308, 313, 316]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 412 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 321/331 places, 192/192 transitions.
Applied a total of 0 rules in 8 ms. Remains 321 /321 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 430 ms. Remains : 321/331 places, 192/192 transitions.
Stuttering acceptance computed with spot in 272 ms :[(NOT p2), (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p2))]
Running random walk in product with property : CircularTrains-PT-192-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 3}], [{ cond=p0, acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(LEQ 1 s247), p2:(LEQ 1 s233), p1:(LEQ s124 s55)], 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, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 840 reset in 1241 ms.
Product exploration explored 100000 steps with 865 reset in 982 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 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 5 factoid took 767 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 254 ms :[(NOT p2), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2))]
Finished random walk after 395 steps, including 0 resets, run visited all 7 properties in 24 ms. (steps per millisecond=16 )
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 p1)), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p2) p0))), (F (NOT p0)), (F (AND (NOT p2) (NOT p0)))]
Knowledge based reduction with 5 factoid took 1031 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 236 ms :[(NOT p2), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 232 ms :[(NOT p2), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2))]
// Phase 1: matrix 192 rows 321 cols
[2023-03-08 04:55:10] [INFO ] Computed 130 place invariants in 5 ms
[2023-03-08 04:55:11] [INFO ] [Real]Absence check using 127 positive place invariants in 80 ms returned sat
[2023-03-08 04:55:11] [INFO ] [Real]Absence check using 127 positive and 3 generalized place invariants in 27 ms returned sat
[2023-03-08 04:55:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:55:11] [INFO ] [Real]Absence check using state equation in 205 ms returned sat
[2023-03-08 04:55:11] [INFO ] Computed and/alt/rep : 128/192/128 causal constraints (skipped 0 transitions) in 20 ms.
[2023-03-08 04:55:13] [INFO ] Added : 125 causal constraints over 25 iterations in 1578 ms. Result :sat
Could not prove EG (NOT p2)
[2023-03-08 04:55:13] [INFO ] Invariant cache hit.
[2023-03-08 04:55:13] [INFO ] [Real]Absence check using 127 positive place invariants in 82 ms returned sat
[2023-03-08 04:55:13] [INFO ] [Real]Absence check using 127 positive and 3 generalized place invariants in 19 ms returned sat
[2023-03-08 04:55:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:55:14] [INFO ] [Real]Absence check using state equation in 811 ms returned sat
[2023-03-08 04:55:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 04:55:14] [INFO ] [Nat]Absence check using 127 positive place invariants in 74 ms returned sat
[2023-03-08 04:55:14] [INFO ] [Nat]Absence check using 127 positive and 3 generalized place invariants in 17 ms returned sat
[2023-03-08 04:55:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 04:55:15] [INFO ] [Nat]Absence check using state equation in 456 ms returned sat
[2023-03-08 04:55:15] [INFO ] Computed and/alt/rep : 128/192/128 causal constraints (skipped 0 transitions) in 29 ms.
[2023-03-08 04:55:16] [INFO ] Added : 125 causal constraints over 25 iterations in 1059 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 192/192 transitions.
Applied a total of 0 rules in 9 ms. Remains 321 /321 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2023-03-08 04:55:16] [INFO ] Invariant cache hit.
[2023-03-08 04:55:16] [INFO ] Implicit Places using invariants in 476 ms returned []
[2023-03-08 04:55:16] [INFO ] Invariant cache hit.
[2023-03-08 04:55:17] [INFO ] Implicit Places using invariants and state equation in 652 ms returned []
Implicit Place search using SMT with State Equation took 1131 ms to find 0 implicit places.
[2023-03-08 04:55:17] [INFO ] Invariant cache hit.
[2023-03-08 04:55:17] [INFO ] Dead Transitions using invariants and state equation in 310 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1451 ms. Remains : 321/321 places, 192/192 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 5 factoid took 740 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p2), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2))]
Finished random walk after 2470 steps, including 0 resets, run visited all 7 properties in 59 ms. (steps per millisecond=41 )
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 p1)), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p2) p0))), (F (NOT p0)), (F (AND (NOT p2) (NOT p0)))]
Knowledge based reduction with 5 factoid took 926 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[(NOT p2), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 219 ms :[(NOT p2), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2))]
[2023-03-08 04:55:20] [INFO ] Invariant cache hit.
[2023-03-08 04:55:20] [INFO ] [Real]Absence check using 127 positive place invariants in 69 ms returned sat
[2023-03-08 04:55:20] [INFO ] [Real]Absence check using 127 positive and 3 generalized place invariants in 43 ms returned sat
[2023-03-08 04:55:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:55:21] [INFO ] [Real]Absence check using state equation in 517 ms returned sat
[2023-03-08 04:55:21] [INFO ] Computed and/alt/rep : 128/192/128 causal constraints (skipped 0 transitions) in 15 ms.
[2023-03-08 04:55:22] [INFO ] Added : 125 causal constraints over 25 iterations in 1303 ms. Result :sat
Could not prove EG (NOT p2)
[2023-03-08 04:55:22] [INFO ] Invariant cache hit.
[2023-03-08 04:55:22] [INFO ] [Real]Absence check using 127 positive place invariants in 82 ms returned sat
[2023-03-08 04:55:22] [INFO ] [Real]Absence check using 127 positive and 3 generalized place invariants in 19 ms returned sat
[2023-03-08 04:55:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:55:23] [INFO ] [Real]Absence check using state equation in 708 ms returned sat
[2023-03-08 04:55:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 04:55:23] [INFO ] [Nat]Absence check using 127 positive place invariants in 51 ms returned sat
[2023-03-08 04:55:23] [INFO ] [Nat]Absence check using 127 positive and 3 generalized place invariants in 10 ms returned sat
[2023-03-08 04:55:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 04:55:24] [INFO ] [Nat]Absence check using state equation in 360 ms returned sat
[2023-03-08 04:55:24] [INFO ] Computed and/alt/rep : 128/192/128 causal constraints (skipped 0 transitions) in 21 ms.
[2023-03-08 04:55:25] [INFO ] Added : 125 causal constraints over 25 iterations in 988 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 229 ms :[(NOT p2), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 868 reset in 1113 ms.
Product exploration explored 100000 steps with 829 reset in 1160 ms.
Support contains 4 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 192/192 transitions.
Applied a total of 0 rules in 7 ms. Remains 321 /321 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2023-03-08 04:55:27] [INFO ] Invariant cache hit.
[2023-03-08 04:55:28] [INFO ] Implicit Places using invariants in 444 ms returned []
[2023-03-08 04:55:28] [INFO ] Invariant cache hit.
[2023-03-08 04:55:28] [INFO ] Implicit Places using invariants and state equation in 536 ms returned []
Implicit Place search using SMT with State Equation took 982 ms to find 0 implicit places.
[2023-03-08 04:55:28] [INFO ] Invariant cache hit.
[2023-03-08 04:55:29] [INFO ] Dead Transitions using invariants and state equation in 224 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1213 ms. Remains : 321/321 places, 192/192 transitions.
Treatment of property CircularTrains-PT-192-LTLCardinality-02 finished in 23772 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(p0)&&F(p1))))'
Support contains 4 out of 331 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 331/331 places, 192/192 transitions.
Applied a total of 0 rules in 5 ms. Remains 331 /331 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 331 cols
[2023-03-08 04:55:29] [INFO ] Computed 140 place invariants in 3 ms
[2023-03-08 04:55:29] [INFO ] Implicit Places using invariants in 355 ms returned [54, 86, 122, 139, 173, 253, 261, 308, 313, 316]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 357 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 321/331 places, 192/192 transitions.
Applied a total of 0 rules in 7 ms. Remains 321 /321 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 370 ms. Remains : 321/331 places, 192/192 transitions.
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : CircularTrains-PT-192-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GT 3 s53) (GT s162 s95)), p0:(AND (OR (GT 2 s238) (GT s162 s95)) (GT s162 s95))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 810 reset in 1114 ms.
Product exploration explored 100000 steps with 919 reset in 922 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (NOT p0)), (X p0), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 1 factoid took 401 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 50 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=25 )
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (NOT p0)), (X p0), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 618 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
// Phase 1: matrix 192 rows 321 cols
[2023-03-08 04:55:33] [INFO ] Computed 130 place invariants in 3 ms
[2023-03-08 04:55:33] [INFO ] [Real]Absence check using 127 positive place invariants in 79 ms returned sat
[2023-03-08 04:55:33] [INFO ] [Real]Absence check using 127 positive and 3 generalized place invariants in 19 ms returned unsat
Proved EG (NOT p0)
[2023-03-08 04:55:33] [INFO ] Invariant cache hit.
[2023-03-08 04:55:34] [INFO ] [Real]Absence check using 127 positive place invariants in 84 ms returned sat
[2023-03-08 04:55:34] [INFO ] [Real]Absence check using 127 positive and 3 generalized place invariants in 19 ms returned unsat
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (NOT p0)), (X p0), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (G (NOT p0)), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 1 factoid took 502 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CircularTrains-PT-192-LTLCardinality-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CircularTrains-PT-192-LTLCardinality-04 finished in 5398 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(F((p1||G(p2))))))))'
Support contains 6 out of 331 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 331/331 places, 192/192 transitions.
Applied a total of 0 rules in 7 ms. Remains 331 /331 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 331 cols
[2023-03-08 04:55:34] [INFO ] Computed 140 place invariants in 3 ms
[2023-03-08 04:55:35] [INFO ] Implicit Places using invariants in 500 ms returned [53, 54, 86, 122, 139, 173, 253, 261, 308, 313, 316]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 507 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 320/331 places, 192/192 transitions.
Applied a total of 0 rules in 7 ms. Remains 320 /320 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 522 ms. Remains : 320/331 places, 192/192 transitions.
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : CircularTrains-PT-192-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(LEQ s252 s147), p2:(LEQ s293 s123), p1:(LEQ s218 s15)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3317 reset in 1236 ms.
Product exploration explored 100000 steps with 3374 reset in 1075 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X (AND p2 (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0)))))]
Knowledge based reduction with 3 factoid took 327 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Finished random walk after 1057 steps, including 0 resets, run visited all 3 properties in 16 ms. (steps per millisecond=66 )
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X (AND p2 (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (F p0), (F (AND (NOT p0) (NOT p1) p2)), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 3 factoid took 383 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 6 out of 320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 192/192 transitions.
Applied a total of 0 rules in 4 ms. Remains 320 /320 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 320 cols
[2023-03-08 04:55:38] [INFO ] Computed 129 place invariants in 2 ms
[2023-03-08 04:55:39] [INFO ] Implicit Places using invariants in 383 ms returned []
[2023-03-08 04:55:39] [INFO ] Invariant cache hit.
[2023-03-08 04:55:39] [INFO ] Implicit Places using invariants and state equation in 596 ms returned []
Implicit Place search using SMT with State Equation took 983 ms to find 0 implicit places.
[2023-03-08 04:55:39] [INFO ] Invariant cache hit.
[2023-03-08 04:55:40] [INFO ] Dead Transitions using invariants and state equation in 327 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1315 ms. Remains : 320/320 places, 192/192 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
Knowledge based reduction with 3 factoid took 354 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Finished random walk after 1333 steps, including 0 resets, run visited all 3 properties in 26 ms. (steps per millisecond=51 )
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (F p0), (F (AND (NOT p0) (NOT p1) p2)), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 3 factoid took 364 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 3251 reset in 1412 ms.
Product exploration explored 100000 steps with 3301 reset in 1263 ms.
Applying partial POR strategy [true, true, false]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 6 out of 320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 320/320 places, 192/192 transitions.
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 320 transition count 192
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 60 place count 320 transition count 192
Deduced a syphon composed of 62 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 62 place count 320 transition count 192
Deduced a syphon composed of 62 places in 0 ms
Applied a total of 62 rules in 30 ms. Remains 320 /320 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2023-03-08 04:55:44] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 192 rows 320 cols
[2023-03-08 04:55:44] [INFO ] Computed 129 place invariants in 3 ms
[2023-03-08 04:55:44] [INFO ] Dead Transitions using invariants and state equation in 311 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 320/320 places, 192/192 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 356 ms. Remains : 320/320 places, 192/192 transitions.
Support contains 6 out of 320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 192/192 transitions.
Applied a total of 0 rules in 17 ms. Remains 320 /320 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 320 cols
[2023-03-08 04:55:44] [INFO ] Computed 129 place invariants in 2 ms
[2023-03-08 04:55:45] [INFO ] Implicit Places using invariants in 449 ms returned []
[2023-03-08 04:55:45] [INFO ] Invariant cache hit.
[2023-03-08 04:55:45] [INFO ] Implicit Places using invariants and state equation in 580 ms returned []
Implicit Place search using SMT with State Equation took 1033 ms to find 0 implicit places.
[2023-03-08 04:55:45] [INFO ] Invariant cache hit.
[2023-03-08 04:55:46] [INFO ] Dead Transitions using invariants and state equation in 322 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1376 ms. Remains : 320/320 places, 192/192 transitions.
Treatment of property CircularTrains-PT-192-LTLCardinality-06 finished in 11486 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(p0)))'
Support contains 2 out of 331 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 331/331 places, 192/192 transitions.
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 43 place count 331 transition count 149
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 86 place count 288 transition count 149
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 86 place count 288 transition count 140
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 104 place count 279 transition count 140
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 120 place count 271 transition count 132
Applied a total of 120 rules in 43 ms. Remains 271 /331 variables (removed 60) and now considering 132/192 (removed 60) transitions.
// Phase 1: matrix 132 rows 271 cols
[2023-03-08 04:55:46] [INFO ] Computed 140 place invariants in 2 ms
[2023-03-08 04:55:46] [INFO ] Implicit Places using invariants in 500 ms returned [46, 47, 71, 101, 117, 145, 205, 212, 250, 255, 258]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 503 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 260/331 places, 132/192 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 260 transition count 130
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 258 transition count 130
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 258 transition count 129
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 257 transition count 129
Applied a total of 6 rules in 25 ms. Remains 257 /260 variables (removed 3) and now considering 129/132 (removed 3) transitions.
// Phase 1: matrix 129 rows 257 cols
[2023-03-08 04:55:46] [INFO ] Computed 129 place invariants in 2 ms
[2023-03-08 04:55:47] [INFO ] Implicit Places using invariants in 461 ms returned []
[2023-03-08 04:55:47] [INFO ] Invariant cache hit.
[2023-03-08 04:55:47] [INFO ] Implicit Places using invariants and state equation in 566 ms returned []
Implicit Place search using SMT with State Equation took 1029 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 257/331 places, 129/192 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1601 ms. Remains : 257/331 places, 129/192 transitions.
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-192-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s133 s49)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 717 reset in 1066 ms.
Product exploration explored 100000 steps with 742 reset in 933 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]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 132 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Finished random walk after 201 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=67 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 155 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 257 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 257/257 places, 129/129 transitions.
Applied a total of 0 rules in 8 ms. Remains 257 /257 variables (removed 0) and now considering 129/129 (removed 0) transitions.
[2023-03-08 04:55:50] [INFO ] Invariant cache hit.
[2023-03-08 04:55:50] [INFO ] Implicit Places using invariants in 233 ms returned []
[2023-03-08 04:55:50] [INFO ] Invariant cache hit.
[2023-03-08 04:55:51] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 617 ms to find 0 implicit places.
[2023-03-08 04:55:51] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 04:55:51] [INFO ] Invariant cache hit.
[2023-03-08 04:55:51] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 777 ms. Remains : 257/257 places, 129/129 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]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 116 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Finished random walk after 59 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=29 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 206 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 725 reset in 1235 ms.
Product exploration explored 100000 steps with 751 reset in 938 ms.
Support contains 2 out of 257 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 257/257 places, 129/129 transitions.
Applied a total of 0 rules in 11 ms. Remains 257 /257 variables (removed 0) and now considering 129/129 (removed 0) transitions.
[2023-03-08 04:55:54] [INFO ] Invariant cache hit.
[2023-03-08 04:55:54] [INFO ] Implicit Places using invariants in 313 ms returned []
[2023-03-08 04:55:54] [INFO ] Invariant cache hit.
[2023-03-08 04:55:54] [INFO ] Implicit Places using invariants and state equation in 526 ms returned []
Implicit Place search using SMT with State Equation took 841 ms to find 0 implicit places.
[2023-03-08 04:55:54] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 04:55:54] [INFO ] Invariant cache hit.
[2023-03-08 04:55:55] [INFO ] Dead Transitions using invariants and state equation in 283 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1147 ms. Remains : 257/257 places, 129/129 transitions.
Treatment of property CircularTrains-PT-192-LTLCardinality-07 finished in 9205 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' '!((p0 U p1))'
Support contains 4 out of 331 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 331/331 places, 192/192 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 331 transition count 150
Reduce places removed 42 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 43 rules applied. Total rules applied 85 place count 289 transition count 149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 86 place count 288 transition count 149
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 86 place count 288 transition count 139
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 106 place count 278 transition count 139
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 124 place count 269 transition count 130
Applied a total of 124 rules in 31 ms. Remains 269 /331 variables (removed 62) and now considering 130/192 (removed 62) transitions.
// Phase 1: matrix 130 rows 269 cols
[2023-03-08 04:55:55] [INFO ] Computed 140 place invariants in 2 ms
[2023-03-08 04:55:55] [INFO ] Implicit Places using invariants in 385 ms returned [46, 47, 71, 101, 117, 203, 210, 248, 253, 256]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 387 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 259/331 places, 130/192 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 259 transition count 129
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 258 transition count 129
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 257 transition count 128
Applied a total of 4 rules in 20 ms. Remains 257 /259 variables (removed 2) and now considering 128/130 (removed 2) transitions.
// Phase 1: matrix 128 rows 257 cols
[2023-03-08 04:55:55] [INFO ] Computed 130 place invariants in 2 ms
[2023-03-08 04:55:56] [INFO ] Implicit Places using invariants in 428 ms returned []
[2023-03-08 04:55:56] [INFO ] Invariant cache hit.
[2023-03-08 04:55:56] [INFO ] Implicit Places using invariants and state equation in 601 ms returned []
Implicit Place search using SMT with State Equation took 1031 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 257/331 places, 128/192 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1470 ms. Remains : 257/331 places, 128/192 transitions.
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p1)]
Running random walk in product with property : CircularTrains-PT-192-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(GT s145 s136), p0:(GT s75 s250)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 61 steps with 1 reset in 1 ms.
FORMULA CircularTrains-PT-192-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-192-LTLCardinality-11 finished in 1560 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((p0||X(!p0)))&&X(p1)&&F(p2)))'
Support contains 7 out of 331 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 331/331 places, 192/192 transitions.
Applied a total of 0 rules in 6 ms. Remains 331 /331 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 331 cols
[2023-03-08 04:55:56] [INFO ] Computed 140 place invariants in 2 ms
[2023-03-08 04:55:57] [INFO ] Implicit Places using invariants in 464 ms returned [53, 54, 86, 122, 139, 173, 253, 261, 308, 313, 316]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 466 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 320/331 places, 192/192 transitions.
Applied a total of 0 rules in 6 ms. Remains 320 /320 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 480 ms. Remains : 320/331 places, 192/192 transitions.
Stuttering acceptance computed with spot in 274 ms :[(OR (NOT p2) (NOT p1)), p0, false, (NOT p1), (NOT p2), true]
Running random walk in product with property : CircularTrains-PT-192-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=p0, acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(GT s305 s207), p2:(GT s95 s176), p1:(AND (GT 2 s203) (GT s275 s292))], 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][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 14702 steps with 253 reset in 228 ms.
FORMULA CircularTrains-PT-192-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-192-LTLCardinality-12 finished in 1011 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) U ((X(!p0)&&(p1||(G(p2) U p3)))||X(G(!p0)))))'
Support contains 6 out of 331 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 331/331 places, 192/192 transitions.
Applied a total of 0 rules in 6 ms. Remains 331 /331 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2023-03-08 04:55:57] [INFO ] Invariant cache hit.
[2023-03-08 04:55:58] [INFO ] Implicit Places using invariants in 473 ms returned [53, 54, 86, 139, 173, 253, 261, 308, 313, 316]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 479 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 321/331 places, 192/192 transitions.
Applied a total of 0 rules in 6 ms. Remains 321 /321 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 493 ms. Remains : 321/331 places, 192/192 transitions.
Stuttering acceptance computed with spot in 406 ms :[p0, p0, (OR (AND p0 (NOT p3)) (AND p0 (NOT p2))), true, (AND (NOT p2) p0), (AND p0 (NOT p3) p2), (NOT p2), (NOT p3)]
Running random walk in product with property : CircularTrains-PT-192-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p3) (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p3) p2 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p3) p2 p0), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p3) (NOT p2) p0), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p3) p2 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p3) p2 p0), acceptance={0} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 3}, { cond=(AND p2 p0), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p3) p2 p0), acceptance={} source=5 dest: 7}], [{ cond=(NOT p2), acceptance={} source=6 dest: 3}, { cond=p2, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p3) p2), acceptance={0} source=7 dest: 7}]], initial=1, aps=[p0:(AND (LEQ s51 s151) (LEQ s119 s143)), p1:(GT s51 s151), p3:(LEQ s119 s143), p2:(LEQ s81 s232)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1610 ms.
Product exploration explored 100000 steps with 50000 reset in 1165 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p3) p2), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p3) p2 p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)))), true, (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p3) p2 p0)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p3) p2 p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (AND (NOT p3) p2)), (X (NOT (AND (NOT p3) p2))), (X (AND (NOT p1) (NOT p3) p2 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p3) p2 (NOT p0)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0))))), (X (X (AND (NOT p3) p2))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (AND (NOT p1) (NOT p3) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p3) p2 (NOT p0)))))]
Property proved to be true thanks to knowledge :(X (NOT p0))
Knowledge based reduction with 12 factoid took 617 ms. Reduced automaton from 8 states, 22 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CircularTrains-PT-192-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CircularTrains-PT-192-LTLCardinality-14 finished in 4362 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(p1)&&p0)))'
Support contains 7 out of 331 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 331/331 places, 192/192 transitions.
Applied a total of 0 rules in 7 ms. Remains 331 /331 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2023-03-08 04:56:02] [INFO ] Invariant cache hit.
[2023-03-08 04:56:02] [INFO ] Implicit Places using invariants in 489 ms returned [53, 54, 86, 122, 139, 173, 253, 261, 316]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 491 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 322/331 places, 192/192 transitions.
Applied a total of 0 rules in 9 ms. Remains 322 /322 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 508 ms. Remains : 322/331 places, 192/192 transitions.
Stuttering acceptance computed with spot in 231 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CircularTrains-PT-192-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(LEQ s28 s300), p0:(AND (GT s4 s140) (OR (LEQ s27 s32) (GT 2 s305) (LEQ 2 s305)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CircularTrains-PT-192-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-192-LTLCardinality-15 finished in 763 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)))'
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&&X((p1&&F((p0&&X(p2))))))))'
Found a Shortening insensitive property : CircularTrains-PT-192-LTLCardinality-02
Stuttering acceptance computed with spot in 236 ms :[(NOT p2), (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p2))]
Support contains 4 out of 331 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 331/331 places, 192/192 transitions.
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 43 place count 331 transition count 149
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 86 place count 288 transition count 149
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 86 place count 288 transition count 139
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 106 place count 278 transition count 139
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 122 place count 270 transition count 131
Applied a total of 122 rules in 30 ms. Remains 270 /331 variables (removed 61) and now considering 131/192 (removed 61) transitions.
// Phase 1: matrix 131 rows 270 cols
[2023-03-08 04:56:03] [INFO ] Computed 140 place invariants in 2 ms
[2023-03-08 04:56:04] [INFO ] Implicit Places using invariants in 469 ms returned [46, 47, 71, 101, 117, 143, 211, 249, 254, 257]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 471 ms to find 10 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 260/331 places, 131/192 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 260 transition count 130
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 259 transition count 130
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 259 transition count 128
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 6 place count 257 transition count 128
Applied a total of 6 rules in 19 ms. Remains 257 /260 variables (removed 3) and now considering 128/131 (removed 3) transitions.
// Phase 1: matrix 128 rows 257 cols
[2023-03-08 04:56:04] [INFO ] Computed 130 place invariants in 2 ms
[2023-03-08 04:56:04] [INFO ] Implicit Places using invariants in 436 ms returned []
[2023-03-08 04:56:04] [INFO ] Invariant cache hit.
[2023-03-08 04:56:04] [INFO ] Implicit Places using invariants and state equation in 511 ms returned []
Implicit Place search using SMT with State Equation took 953 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 257/331 places, 128/192 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1473 ms. Remains : 257/331 places, 128/192 transitions.
Running random walk in product with property : CircularTrains-PT-192-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 3}], [{ cond=p0, acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(LEQ 1 s195), p2:(LEQ 1 s186), p1:(LEQ s102 s48)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1332 reset in 1306 ms.
Product exploration explored 100000 steps with 1298 reset in 1006 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 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p0), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 2 factoid took 880 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(NOT p2), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p2))]
Finished random walk after 1271 steps, including 0 resets, run visited all 7 properties in 28 ms. (steps per millisecond=45 )
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p0), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 p1)), (F (AND (NOT p0) p1)), (F (NOT (AND p0 (NOT p1)))), (F (NOT (AND (NOT p2) p0))), (F (NOT p0)), (F (AND (NOT p2) (NOT p0)))]
Knowledge based reduction with 2 factoid took 1021 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 319 ms :[(NOT p2), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 306 ms :[(NOT p2), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p2))]
[2023-03-08 04:56:10] [INFO ] Invariant cache hit.
[2023-03-08 04:56:10] [INFO ] [Real]Absence check using 127 positive place invariants in 126 ms returned sat
[2023-03-08 04:56:10] [INFO ] [Real]Absence check using 127 positive and 3 generalized place invariants in 28 ms returned sat
[2023-03-08 04:56:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:56:10] [INFO ] [Real]Absence check using state equation in 353 ms returned sat
[2023-03-08 04:56:11] [INFO ] Computed and/alt/rep : 64/128/64 causal constraints (skipped 0 transitions) in 14 ms.
[2023-03-08 04:56:11] [INFO ] Added : 62 causal constraints over 13 iterations in 565 ms. Result :sat
Could not prove EG (NOT p2)
[2023-03-08 04:56:11] [INFO ] Invariant cache hit.
[2023-03-08 04:56:11] [INFO ] [Real]Absence check using 127 positive place invariants in 76 ms returned sat
[2023-03-08 04:56:11] [INFO ] [Real]Absence check using 127 positive and 3 generalized place invariants in 18 ms returned sat
[2023-03-08 04:56:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:56:12] [INFO ] [Real]Absence check using state equation in 450 ms returned sat
[2023-03-08 04:56:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 04:56:12] [INFO ] [Nat]Absence check using 127 positive place invariants in 71 ms returned sat
[2023-03-08 04:56:12] [INFO ] [Nat]Absence check using 127 positive and 3 generalized place invariants in 20 ms returned sat
[2023-03-08 04:56:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 04:56:13] [INFO ] [Nat]Absence check using state equation in 378 ms returned sat
[2023-03-08 04:56:13] [INFO ] Computed and/alt/rep : 64/128/64 causal constraints (skipped 0 transitions) in 15 ms.
[2023-03-08 04:56:13] [INFO ] Added : 62 causal constraints over 13 iterations in 421 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 257 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 128/128 transitions.
Applied a total of 0 rules in 5 ms. Remains 257 /257 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2023-03-08 04:56:13] [INFO ] Invariant cache hit.
[2023-03-08 04:56:13] [INFO ] Implicit Places using invariants in 444 ms returned []
[2023-03-08 04:56:13] [INFO ] Invariant cache hit.
[2023-03-08 04:56:14] [INFO ] Implicit Places using invariants and state equation in 889 ms returned []
Implicit Place search using SMT with State Equation took 1335 ms to find 0 implicit places.
[2023-03-08 04:56:14] [INFO ] Invariant cache hit.
[2023-03-08 04:56:15] [INFO ] Dead Transitions using invariants and state equation in 259 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1601 ms. Remains : 257/257 places, 128/128 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p0), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 2 factoid took 960 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(NOT p2), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p2))]
Finished random walk after 2192 steps, including 0 resets, run visited all 7 properties in 53 ms. (steps per millisecond=41 )
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p0), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 p1)), (F (AND (NOT p0) p1)), (F (NOT (AND p0 (NOT p1)))), (F (NOT (AND (NOT p2) p0))), (F (NOT p0)), (F (AND (NOT p2) (NOT p0)))]
Knowledge based reduction with 2 factoid took 1022 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(NOT p2), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 327 ms :[(NOT p2), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p2))]
[2023-03-08 04:56:17] [INFO ] Invariant cache hit.
[2023-03-08 04:56:18] [INFO ] [Real]Absence check using 127 positive place invariants in 72 ms returned sat
[2023-03-08 04:56:18] [INFO ] [Real]Absence check using 127 positive and 3 generalized place invariants in 27 ms returned sat
[2023-03-08 04:56:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:56:18] [INFO ] [Real]Absence check using state equation in 351 ms returned sat
[2023-03-08 04:56:18] [INFO ] Computed and/alt/rep : 64/128/64 causal constraints (skipped 0 transitions) in 13 ms.
[2023-03-08 04:56:19] [INFO ] Added : 62 causal constraints over 13 iterations in 534 ms. Result :sat
Could not prove EG (NOT p2)
[2023-03-08 04:56:19] [INFO ] Invariant cache hit.
[2023-03-08 04:56:19] [INFO ] [Real]Absence check using 127 positive place invariants in 71 ms returned sat
[2023-03-08 04:56:19] [INFO ] [Real]Absence check using 127 positive and 3 generalized place invariants in 18 ms returned sat
[2023-03-08 04:56:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:56:19] [INFO ] [Real]Absence check using state equation in 470 ms returned sat
[2023-03-08 04:56:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 04:56:20] [INFO ] [Nat]Absence check using 127 positive place invariants in 51 ms returned sat
[2023-03-08 04:56:20] [INFO ] [Nat]Absence check using 127 positive and 3 generalized place invariants in 13 ms returned sat
[2023-03-08 04:56:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 04:56:20] [INFO ] [Nat]Absence check using state equation in 245 ms returned sat
[2023-03-08 04:56:20] [INFO ] Computed and/alt/rep : 64/128/64 causal constraints (skipped 0 transitions) in 13 ms.
[2023-03-08 04:56:20] [INFO ] Added : 62 causal constraints over 13 iterations in 380 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 208 ms :[(NOT p2), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 1357 reset in 1324 ms.
Product exploration explored 100000 steps with 1316 reset in 1018 ms.
Support contains 4 out of 257 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 128/128 transitions.
Applied a total of 0 rules in 2 ms. Remains 257 /257 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2023-03-08 04:56:23] [INFO ] Invariant cache hit.
[2023-03-08 04:56:23] [INFO ] Implicit Places using invariants in 301 ms returned []
[2023-03-08 04:56:23] [INFO ] Invariant cache hit.
[2023-03-08 04:56:24] [INFO ] Implicit Places using invariants and state equation in 439 ms returned []
Implicit Place search using SMT with State Equation took 742 ms to find 0 implicit places.
[2023-03-08 04:56:24] [INFO ] Invariant cache hit.
[2023-03-08 04:56:24] [INFO ] Dead Transitions using invariants and state equation in 207 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 958 ms. Remains : 257/257 places, 128/128 transitions.
Treatment of property CircularTrains-PT-192-LTLCardinality-02 finished in 21235 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(F((p1||G(p2))))))))'
Found a Shortening insensitive property : CircularTrains-PT-192-LTLCardinality-06
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 6 out of 331 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 331/331 places, 192/192 transitions.
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 331 transition count 151
Reduce places removed 41 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 43 rules applied. Total rules applied 84 place count 290 transition count 149
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 86 place count 288 transition count 149
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 86 place count 288 transition count 140
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 104 place count 279 transition count 140
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 118 place count 272 transition count 133
Applied a total of 118 rules in 28 ms. Remains 272 /331 variables (removed 59) and now considering 133/192 (removed 59) transitions.
// Phase 1: matrix 133 rows 272 cols
[2023-03-08 04:56:24] [INFO ] Computed 140 place invariants in 2 ms
[2023-03-08 04:56:25] [INFO ] Implicit Places using invariants in 401 ms returned [46, 47, 71, 102, 118, 145, 206, 213, 251, 256, 259]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 416 ms to find 11 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 261/331 places, 133/192 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 261 transition count 131
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 259 transition count 131
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 259 transition count 130
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 258 transition count 130
Applied a total of 6 rules in 15 ms. Remains 258 /261 variables (removed 3) and now considering 130/133 (removed 3) transitions.
// Phase 1: matrix 130 rows 258 cols
[2023-03-08 04:56:25] [INFO ] Computed 129 place invariants in 2 ms
[2023-03-08 04:56:25] [INFO ] Implicit Places using invariants in 401 ms returned []
[2023-03-08 04:56:25] [INFO ] Invariant cache hit.
[2023-03-08 04:56:25] [INFO ] Implicit Places using invariants and state equation in 461 ms returned []
Implicit Place search using SMT with State Equation took 879 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 258/331 places, 130/192 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1339 ms. Remains : 258/331 places, 130/192 transitions.
Running random walk in product with property : CircularTrains-PT-192-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(LEQ s201 s124), p2:(LEQ s234 s101), p1:(LEQ s175 s14)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3799 reset in 1285 ms.
Product exploration explored 100000 steps with 3795 reset in 1074 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X (AND p2 (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0)))))]
Knowledge based reduction with 3 factoid took 365 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Finished random walk after 1266 steps, including 0 resets, run visited all 3 properties in 13 ms. (steps per millisecond=97 )
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X (AND p2 (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (F p0), (F (AND (NOT p0) (NOT p1) p2)), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 3 factoid took 465 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 6 out of 258 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 130/130 transitions.
Applied a total of 0 rules in 4 ms. Remains 258 /258 variables (removed 0) and now considering 130/130 (removed 0) transitions.
[2023-03-08 04:56:29] [INFO ] Invariant cache hit.
[2023-03-08 04:56:30] [INFO ] Implicit Places using invariants in 427 ms returned []
[2023-03-08 04:56:30] [INFO ] Invariant cache hit.
[2023-03-08 04:56:30] [INFO ] Implicit Places using invariants and state equation in 566 ms returned []
Implicit Place search using SMT with State Equation took 995 ms to find 0 implicit places.
[2023-03-08 04:56:30] [INFO ] Invariant cache hit.
[2023-03-08 04:56:30] [INFO ] Dead Transitions using invariants and state equation in 248 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1249 ms. Remains : 258/258 places, 130/130 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
Knowledge based reduction with 3 factoid took 238 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Finished random walk after 156 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=52 )
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (F p0), (F (AND (NOT p0) (NOT p1) p2)), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 3 factoid took 385 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 3811 reset in 1508 ms.
Product exploration explored 100000 steps with 3892 reset in 1302 ms.
Applying partial POR strategy [true, true, false]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 6 out of 258 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 258/258 places, 130/130 transitions.
Applied a total of 0 rules in 5 ms. Remains 258 /258 variables (removed 0) and now considering 130/130 (removed 0) transitions.
[2023-03-08 04:56:35] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 04:56:35] [INFO ] Invariant cache hit.
[2023-03-08 04:56:35] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 162 ms. Remains : 258/258 places, 130/130 transitions.
Support contains 6 out of 258 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 130/130 transitions.
Applied a total of 0 rules in 2 ms. Remains 258 /258 variables (removed 0) and now considering 130/130 (removed 0) transitions.
[2023-03-08 04:56:35] [INFO ] Invariant cache hit.
[2023-03-08 04:56:35] [INFO ] Implicit Places using invariants in 344 ms returned []
[2023-03-08 04:56:35] [INFO ] Invariant cache hit.
[2023-03-08 04:56:36] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 786 ms to find 0 implicit places.
[2023-03-08 04:56:36] [INFO ] Invariant cache hit.
[2023-03-08 04:56:36] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 936 ms. Remains : 258/258 places, 130/130 transitions.
Treatment of property CircularTrains-PT-192-LTLCardinality-06 finished in 11965 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(p0)))'
[2023-03-08 04:56:36] [INFO ] Flatten gal took : 32 ms
[2023-03-08 04:56:36] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2023-03-08 04:56:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 331 places, 192 transitions and 662 arcs took 5 ms.
Total runtime 109948 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT CircularTrains-PT-192
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/366
LTLCardinality

FORMULA CircularTrains-PT-192-LTLCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircularTrains-PT-192-LTLCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircularTrains-PT-192-LTLCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678251422902

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/366/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/366/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/366/LTLCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 1 (type EXCL) for 0 CircularTrains-PT-192-LTLCardinality-01
lola: time limit : 900 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for CircularTrains-PT-192-LTLCardinality-01
lola: result : false
lola: markings : 2364
lola: fired transitions : 2365
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 7 (type EXCL) for 6 CircularTrains-PT-192-LTLCardinality-06
lola: time limit : 1200 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-192-LTLCardinality-01: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-192-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-192-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
CircularTrains-PT-192-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 5/1200 8/32 CircularTrains-PT-192-LTLCardinality-06 1062924 m, 212584 m/sec, 2105037 t fired, .

Time elapsed: 5 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-192-LTLCardinality-01: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-192-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-192-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
CircularTrains-PT-192-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 10/1200 15/32 CircularTrains-PT-192-LTLCardinality-06 2032769 m, 193969 m/sec, 4270458 t fired, .

Time elapsed: 10 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-192-LTLCardinality-01: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-192-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-192-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
CircularTrains-PT-192-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 15/1200 22/32 CircularTrains-PT-192-LTLCardinality-06 3016431 m, 196732 m/sec, 6451453 t fired, .

Time elapsed: 15 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-192-LTLCardinality-01: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-192-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-192-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
CircularTrains-PT-192-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 20/1200 29/32 CircularTrains-PT-192-LTLCardinality-06 4005878 m, 197889 m/sec, 8644391 t fired, .

Time elapsed: 20 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 7 (type EXCL) for CircularTrains-PT-192-LTLCardinality-06 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-192-LTLCardinality-01: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircularTrains-PT-192-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
CircularTrains-PT-192-LTLCardinality-06: LTL 0 0 0 0 1 0 1 0
CircularTrains-PT-192-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 25 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 4 (type EXCL) for 3 CircularTrains-PT-192-LTLCardinality-02
lola: time limit : 1787 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for CircularTrains-PT-192-LTLCardinality-02
lola: result : false
lola: markings : 3770
lola: fired transitions : 3770
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 10 (type EXCL) for 9 CircularTrains-PT-192-LTLCardinality-07
lola: time limit : 3575 sec
lola: memory limit: 32 pages
lola: FINISHED task # 10 (type EXCL) for CircularTrains-PT-192-LTLCardinality-07
lola: result : true
lola: markings : 4959
lola: fired transitions : 5075
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open tasks 4

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircularTrains-PT-192-LTLCardinality-01: LTL false LTL model checker
CircularTrains-PT-192-LTLCardinality-02: LTL false LTL model checker
CircularTrains-PT-192-LTLCardinality-06: LTL unknown AGGR
CircularTrains-PT-192-LTLCardinality-07: LTL true LTL model checker


Time elapsed: 25 secs. Pages in use: 32

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="CircularTrains-PT-192"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is CircularTrains-PT-192, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r071-smll-167814397600179"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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