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.r105-tall-167814481300532.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 ltsminxred
Input is DLCflexbar-PT-3b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-tall-167814481300532
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.9M
-rw-r--r-- 1 mcc users 6.0K Feb 25 15:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 25 15:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 15:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 15:02 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 3.5K Feb 25 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 25 15:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 25 15:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 15:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 25 15:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 2.5M 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 DLCflexbar-PT-3b-LTLFireability-00
FORMULA_NAME DLCflexbar-PT-3b-LTLFireability-01
FORMULA_NAME DLCflexbar-PT-3b-LTLFireability-02
FORMULA_NAME DLCflexbar-PT-3b-LTLFireability-03
FORMULA_NAME DLCflexbar-PT-3b-LTLFireability-04
FORMULA_NAME DLCflexbar-PT-3b-LTLFireability-05
FORMULA_NAME DLCflexbar-PT-3b-LTLFireability-06
FORMULA_NAME DLCflexbar-PT-3b-LTLFireability-07
FORMULA_NAME DLCflexbar-PT-3b-LTLFireability-08
FORMULA_NAME DLCflexbar-PT-3b-LTLFireability-09
FORMULA_NAME DLCflexbar-PT-3b-LTLFireability-10
FORMULA_NAME DLCflexbar-PT-3b-LTLFireability-11
FORMULA_NAME DLCflexbar-PT-3b-LTLFireability-12
FORMULA_NAME DLCflexbar-PT-3b-LTLFireability-13
FORMULA_NAME DLCflexbar-PT-3b-LTLFireability-14
FORMULA_NAME DLCflexbar-PT-3b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678323188412

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCflexbar-PT-3b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-09 00:53:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-09 00:53:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 00:53:10] [INFO ] Load time of PNML (sax parser for PT used): 292 ms
[2023-03-09 00:53:10] [INFO ] Transformed 7245 places.
[2023-03-09 00:53:10] [INFO ] Transformed 10555 transitions.
[2023-03-09 00:53:10] [INFO ] Found NUPN structural information;
[2023-03-09 00:53:10] [INFO ] Parsed PT model containing 7245 places and 10555 transitions and 28284 arcs in 561 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA DLCflexbar-PT-3b-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-3b-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-3b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-3b-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-3b-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 7245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7245/7245 places, 10555/10555 transitions.
Discarding 1194 places :
Symmetric choice reduction at 0 with 1194 rule applications. Total rules 1194 place count 6051 transition count 9361
Iterating global reduction 0 with 1194 rules applied. Total rules applied 2388 place count 6051 transition count 9361
Discarding 1020 places :
Symmetric choice reduction at 0 with 1020 rule applications. Total rules 3408 place count 5031 transition count 8341
Iterating global reduction 0 with 1020 rules applied. Total rules applied 4428 place count 5031 transition count 8341
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 4433 place count 5031 transition count 8336
Discarding 224 places :
Symmetric choice reduction at 1 with 224 rule applications. Total rules 4657 place count 4807 transition count 7919
Iterating global reduction 1 with 224 rules applied. Total rules applied 4881 place count 4807 transition count 7919
Discarding 208 places :
Symmetric choice reduction at 1 with 208 rule applications. Total rules 5089 place count 4599 transition count 7711
Iterating global reduction 1 with 208 rules applied. Total rules applied 5297 place count 4599 transition count 7711
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 5325 place count 4599 transition count 7683
Discarding 92 places :
Symmetric choice reduction at 2 with 92 rule applications. Total rules 5417 place count 4507 transition count 7591
Iterating global reduction 2 with 92 rules applied. Total rules applied 5509 place count 4507 transition count 7591
Discarding 92 places :
Symmetric choice reduction at 2 with 92 rule applications. Total rules 5601 place count 4415 transition count 7499
Iterating global reduction 2 with 92 rules applied. Total rules applied 5693 place count 4415 transition count 7499
Discarding 90 places :
Symmetric choice reduction at 2 with 90 rule applications. Total rules 5783 place count 4325 transition count 7409
Iterating global reduction 2 with 90 rules applied. Total rules applied 5873 place count 4325 transition count 7409
Discarding 84 places :
Symmetric choice reduction at 2 with 84 rule applications. Total rules 5957 place count 4241 transition count 7325
Iterating global reduction 2 with 84 rules applied. Total rules applied 6041 place count 4241 transition count 7325
Discarding 55 places :
Symmetric choice reduction at 2 with 55 rule applications. Total rules 6096 place count 4186 transition count 7270
Iterating global reduction 2 with 55 rules applied. Total rules applied 6151 place count 4186 transition count 7270
Discarding 55 places :
Symmetric choice reduction at 2 with 55 rule applications. Total rules 6206 place count 4131 transition count 7215
Iterating global reduction 2 with 55 rules applied. Total rules applied 6261 place count 4131 transition count 7215
Applied a total of 6261 rules in 5460 ms. Remains 4131 /7245 variables (removed 3114) and now considering 7215/10555 (removed 3340) transitions.
// Phase 1: matrix 7215 rows 4131 cols
[2023-03-09 00:53:16] [INFO ] Computed 355 place invariants in 69 ms
[2023-03-09 00:53:18] [INFO ] Implicit Places using invariants in 1917 ms returned []
[2023-03-09 00:53:18] [INFO ] Invariant cache hit.
[2023-03-09 00:53:19] [INFO ] Implicit Places using invariants and state equation in 1073 ms returned []
Implicit Place search using SMT with State Equation took 3023 ms to find 0 implicit places.
[2023-03-09 00:53:19] [INFO ] Invariant cache hit.
[2023-03-09 00:53:23] [INFO ] Dead Transitions using invariants and state equation in 4121 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4131/7245 places, 7215/10555 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12608 ms. Remains : 4131/7245 places, 7215/10555 transitions.
Support contains 37 out of 4131 places after structural reductions.
[2023-03-09 00:53:24] [INFO ] Flatten gal took : 354 ms
[2023-03-09 00:53:24] [INFO ] Flatten gal took : 218 ms
[2023-03-09 00:53:25] [INFO ] Input system was already deterministic with 7215 transitions.
Support contains 36 out of 4131 places (down from 37) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 639 ms. (steps per millisecond=15 ) properties (out of 28) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-03-09 00:53:26] [INFO ] Invariant cache hit.
[2023-03-09 00:53:28] [INFO ] [Real]Absence check using 355 positive place invariants in 363 ms returned sat
[2023-03-09 00:53:28] [INFO ] After 2152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-09 00:53:30] [INFO ] [Nat]Absence check using 355 positive place invariants in 388 ms returned sat
[2023-03-09 00:53:36] [INFO ] After 5433ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-09 00:53:41] [INFO ] After 10388ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 2394 ms.
[2023-03-09 00:53:43] [INFO ] After 15048ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Fused 13 Parikh solutions to 7 different solutions.
Finished Parikh walk after 279 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=93 )
Parikh walk visited 13 properties in 259 ms.
Computed a total of 696 stabilizing places and 696 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p0||X(p1)) U (p1||X(p2))))))'
Support contains 4 out of 4131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4131/4131 places, 7215/7215 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 4119 transition count 7202
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 4119 transition count 7202
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 34 place count 4109 transition count 7192
Iterating global reduction 0 with 10 rules applied. Total rules applied 44 place count 4109 transition count 7192
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 4109 transition count 7191
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 52 place count 4102 transition count 7184
Iterating global reduction 1 with 7 rules applied. Total rules applied 59 place count 4102 transition count 7184
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 66 place count 4095 transition count 7177
Iterating global reduction 1 with 7 rules applied. Total rules applied 73 place count 4095 transition count 7177
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 76 place count 4092 transition count 7174
Iterating global reduction 1 with 3 rules applied. Total rules applied 79 place count 4092 transition count 7174
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 82 place count 4089 transition count 7171
Iterating global reduction 1 with 3 rules applied. Total rules applied 85 place count 4089 transition count 7171
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 88 place count 4086 transition count 7168
Iterating global reduction 1 with 3 rules applied. Total rules applied 91 place count 4086 transition count 7168
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 94 place count 4083 transition count 7165
Iterating global reduction 1 with 3 rules applied. Total rules applied 97 place count 4083 transition count 7165
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 99 place count 4081 transition count 7163
Iterating global reduction 1 with 2 rules applied. Total rules applied 101 place count 4081 transition count 7163
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 102 place count 4080 transition count 7162
Iterating global reduction 1 with 1 rules applied. Total rules applied 103 place count 4080 transition count 7162
Applied a total of 103 rules in 3591 ms. Remains 4080 /4131 variables (removed 51) and now considering 7162/7215 (removed 53) transitions.
// Phase 1: matrix 7162 rows 4080 cols
[2023-03-09 00:53:48] [INFO ] Computed 355 place invariants in 51 ms
[2023-03-09 00:53:49] [INFO ] Implicit Places using invariants in 1255 ms returned []
[2023-03-09 00:53:49] [INFO ] Invariant cache hit.
[2023-03-09 00:53:50] [INFO ] Implicit Places using invariants and state equation in 1136 ms returned []
Implicit Place search using SMT with State Equation took 2393 ms to find 0 implicit places.
[2023-03-09 00:53:50] [INFO ] Invariant cache hit.
[2023-03-09 00:53:54] [INFO ] Dead Transitions using invariants and state equation in 3884 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4080/4131 places, 7162/7215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9871 ms. Remains : 4080/4131 places, 7162/7215 transitions.
Stuttering acceptance computed with spot in 258 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DLCflexbar-PT-3b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s829 1), p0:(EQ s2685 1), p2:(AND (EQ s1474 1) (EQ s2517 1))], 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 8 reset in 1219 ms.
Stack based approach found an accepted trace after 9409 steps with 0 reset with depth 9410 and stack size 9410 in 119 ms.
FORMULA DLCflexbar-PT-3b-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property DLCflexbar-PT-3b-LTLFireability-00 finished in 11591 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(X(X(p0))))'
Support contains 1 out of 4131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4131/4131 places, 7215/7215 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 4118 transition count 7201
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 4118 transition count 7201
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 4108 transition count 7191
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 4108 transition count 7191
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 4108 transition count 7190
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 54 place count 4101 transition count 7182
Iterating global reduction 1 with 7 rules applied. Total rules applied 61 place count 4101 transition count 7182
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 68 place count 4094 transition count 7175
Iterating global reduction 1 with 7 rules applied. Total rules applied 75 place count 4094 transition count 7175
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 76 place count 4094 transition count 7174
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 78 place count 4092 transition count 7172
Iterating global reduction 2 with 2 rules applied. Total rules applied 80 place count 4092 transition count 7172
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 82 place count 4090 transition count 7170
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 place count 4090 transition count 7170
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 86 place count 4088 transition count 7168
Iterating global reduction 2 with 2 rules applied. Total rules applied 88 place count 4088 transition count 7168
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 90 place count 4086 transition count 7166
Iterating global reduction 2 with 2 rules applied. Total rules applied 92 place count 4086 transition count 7166
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 93 place count 4085 transition count 7165
Iterating global reduction 2 with 1 rules applied. Total rules applied 94 place count 4085 transition count 7165
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 95 place count 4084 transition count 7164
Iterating global reduction 2 with 1 rules applied. Total rules applied 96 place count 4084 transition count 7164
Applied a total of 96 rules in 3540 ms. Remains 4084 /4131 variables (removed 47) and now considering 7164/7215 (removed 51) transitions.
// Phase 1: matrix 7164 rows 4084 cols
[2023-03-09 00:53:59] [INFO ] Computed 355 place invariants in 38 ms
[2023-03-09 00:54:00] [INFO ] Implicit Places using invariants in 1217 ms returned []
[2023-03-09 00:54:00] [INFO ] Invariant cache hit.
[2023-03-09 00:54:03] [INFO ] Implicit Places using invariants and state equation in 2187 ms returned []
Implicit Place search using SMT with State Equation took 3406 ms to find 0 implicit places.
[2023-03-09 00:54:03] [INFO ] Invariant cache hit.
[2023-03-09 00:54:07] [INFO ] Dead Transitions using invariants and state equation in 4372 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4084/4131 places, 7164/7215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11325 ms. Remains : 4084/4131 places, 7164/7215 transitions.
Stuttering acceptance computed with spot in 187 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : DLCflexbar-PT-3b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(EQ s285 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA DLCflexbar-PT-3b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCflexbar-PT-3b-LTLFireability-01 finished in 11602 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||(p1&&X(p2)))))'
Support contains 3 out of 4131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4131/4131 places, 7215/7215 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 4119 transition count 7202
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 4119 transition count 7202
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 33 place count 4110 transition count 7193
Iterating global reduction 0 with 9 rules applied. Total rules applied 42 place count 4110 transition count 7193
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 4110 transition count 7192
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 50 place count 4103 transition count 7184
Iterating global reduction 1 with 7 rules applied. Total rules applied 57 place count 4103 transition count 7184
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 63 place count 4097 transition count 7178
Iterating global reduction 1 with 6 rules applied. Total rules applied 69 place count 4097 transition count 7178
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 70 place count 4097 transition count 7177
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 72 place count 4095 transition count 7175
Iterating global reduction 2 with 2 rules applied. Total rules applied 74 place count 4095 transition count 7175
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 76 place count 4093 transition count 7173
Iterating global reduction 2 with 2 rules applied. Total rules applied 78 place count 4093 transition count 7173
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 80 place count 4091 transition count 7171
Iterating global reduction 2 with 2 rules applied. Total rules applied 82 place count 4091 transition count 7171
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 84 place count 4089 transition count 7169
Iterating global reduction 2 with 2 rules applied. Total rules applied 86 place count 4089 transition count 7169
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 87 place count 4088 transition count 7168
Iterating global reduction 2 with 1 rules applied. Total rules applied 88 place count 4088 transition count 7168
Applied a total of 88 rules in 3257 ms. Remains 4088 /4131 variables (removed 43) and now considering 7168/7215 (removed 47) transitions.
// Phase 1: matrix 7168 rows 4088 cols
[2023-03-09 00:54:10] [INFO ] Computed 355 place invariants in 27 ms
[2023-03-09 00:54:12] [INFO ] Implicit Places using invariants in 1100 ms returned []
[2023-03-09 00:54:12] [INFO ] Invariant cache hit.
[2023-03-09 00:54:13] [INFO ] Implicit Places using invariants and state equation in 1079 ms returned []
Implicit Place search using SMT with State Equation took 2205 ms to find 0 implicit places.
[2023-03-09 00:54:13] [INFO ] Invariant cache hit.
[2023-03-09 00:54:17] [INFO ] Dead Transitions using invariants and state equation in 3899 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4088/4131 places, 7168/7215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9370 ms. Remains : 4088/4131 places, 7168/7215 transitions.
Stuttering acceptance computed with spot in 106 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : DLCflexbar-PT-3b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(NEQ s1071 1), p1:(EQ s1147 1), p2:(NEQ s3660 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 339 steps with 0 reset in 3 ms.
FORMULA DLCflexbar-PT-3b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCflexbar-PT-3b-LTLFireability-02 finished in 9559 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(X(X(G(p0)))) U p1)))'
Support contains 3 out of 4131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4131/4131 places, 7215/7215 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 4118 transition count 7201
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 4118 transition count 7201
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 37 place count 4107 transition count 7190
Iterating global reduction 0 with 11 rules applied. Total rules applied 48 place count 4107 transition count 7190
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 4107 transition count 7189
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 57 place count 4099 transition count 7180
Iterating global reduction 1 with 8 rules applied. Total rules applied 65 place count 4099 transition count 7180
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 73 place count 4091 transition count 7172
Iterating global reduction 1 with 8 rules applied. Total rules applied 81 place count 4091 transition count 7172
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 82 place count 4091 transition count 7171
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 85 place count 4088 transition count 7168
Iterating global reduction 2 with 3 rules applied. Total rules applied 88 place count 4088 transition count 7168
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 91 place count 4085 transition count 7165
Iterating global reduction 2 with 3 rules applied. Total rules applied 94 place count 4085 transition count 7165
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 97 place count 4082 transition count 7162
Iterating global reduction 2 with 3 rules applied. Total rules applied 100 place count 4082 transition count 7162
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 103 place count 4079 transition count 7159
Iterating global reduction 2 with 3 rules applied. Total rules applied 106 place count 4079 transition count 7159
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 108 place count 4077 transition count 7157
Iterating global reduction 2 with 2 rules applied. Total rules applied 110 place count 4077 transition count 7157
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 111 place count 4076 transition count 7156
Iterating global reduction 2 with 1 rules applied. Total rules applied 112 place count 4076 transition count 7156
Applied a total of 112 rules in 3473 ms. Remains 4076 /4131 variables (removed 55) and now considering 7156/7215 (removed 59) transitions.
// Phase 1: matrix 7156 rows 4076 cols
[2023-03-09 00:54:20] [INFO ] Computed 355 place invariants in 23 ms
[2023-03-09 00:54:21] [INFO ] Implicit Places using invariants in 1119 ms returned []
[2023-03-09 00:54:21] [INFO ] Invariant cache hit.
[2023-03-09 00:54:23] [INFO ] Implicit Places using invariants and state equation in 2110 ms returned []
Implicit Place search using SMT with State Equation took 3249 ms to find 0 implicit places.
[2023-03-09 00:54:24] [INFO ] Invariant cache hit.
[2023-03-09 00:54:27] [INFO ] Dead Transitions using invariants and state equation in 3926 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4076/4131 places, 7156/7215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10665 ms. Remains : 4076/4131 places, 7156/7215 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Running random walk in product with property : DLCflexbar-PT-3b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=true, acceptance={0} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s1622 1) (EQ s2969 1)), p0:(EQ s3573 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA DLCflexbar-PT-3b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCflexbar-PT-3b-LTLFireability-03 finished in 10903 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)) U G((p1||X(p2)))))'
Support contains 4 out of 4131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4131/4131 places, 7215/7215 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 4118 transition count 7201
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 4118 transition count 7201
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 4108 transition count 7191
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 4108 transition count 7191
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 4108 transition count 7190
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 54 place count 4101 transition count 7182
Iterating global reduction 1 with 7 rules applied. Total rules applied 61 place count 4101 transition count 7182
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 68 place count 4094 transition count 7175
Iterating global reduction 1 with 7 rules applied. Total rules applied 75 place count 4094 transition count 7175
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 76 place count 4094 transition count 7174
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 78 place count 4092 transition count 7172
Iterating global reduction 2 with 2 rules applied. Total rules applied 80 place count 4092 transition count 7172
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 82 place count 4090 transition count 7170
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 place count 4090 transition count 7170
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 86 place count 4088 transition count 7168
Iterating global reduction 2 with 2 rules applied. Total rules applied 88 place count 4088 transition count 7168
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 90 place count 4086 transition count 7166
Iterating global reduction 2 with 2 rules applied. Total rules applied 92 place count 4086 transition count 7166
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 93 place count 4085 transition count 7165
Iterating global reduction 2 with 1 rules applied. Total rules applied 94 place count 4085 transition count 7165
Applied a total of 94 rules in 3213 ms. Remains 4085 /4131 variables (removed 46) and now considering 7165/7215 (removed 50) transitions.
// Phase 1: matrix 7165 rows 4085 cols
[2023-03-09 00:54:31] [INFO ] Computed 355 place invariants in 23 ms
[2023-03-09 00:54:32] [INFO ] Implicit Places using invariants in 1110 ms returned []
[2023-03-09 00:54:32] [INFO ] Invariant cache hit.
[2023-03-09 00:54:33] [INFO ] Implicit Places using invariants and state equation in 1055 ms returned []
Implicit Place search using SMT with State Equation took 2187 ms to find 0 implicit places.
[2023-03-09 00:54:33] [INFO ] Invariant cache hit.
[2023-03-09 00:54:37] [INFO ] Dead Transitions using invariants and state equation in 3745 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4085/4131 places, 7165/7215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9147 ms. Remains : 4085/4131 places, 7165/7215 transitions.
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), p0, p0]
Running random walk in product with property : DLCflexbar-PT-3b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s2144 1), p2:(EQ s1071 1), p0:(AND (EQ s1519 1) (EQ s2480 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 5 reset in 1062 ms.
Product exploration explored 100000 steps with 9 reset in 1196 ms.
Computed a total of 690 stabilizing places and 690 stable transitions
Computed a total of 690 stabilizing places and 690 stable transitions
Detected a total of 690/4085 stabilizing places and 690/7165 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), true, (X (X (NOT p2))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 662 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 13 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), p0, (OR (AND p0 p1) (AND p0 p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 307 ms. (steps per millisecond=32 ) properties (out of 9) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-09 00:54:41] [INFO ] Invariant cache hit.
[2023-03-09 00:54:42] [INFO ] [Real]Absence check using 355 positive place invariants in 367 ms returned sat
[2023-03-09 00:54:42] [INFO ] After 1356ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 00:54:44] [INFO ] [Nat]Absence check using 355 positive place invariants in 357 ms returned sat
[2023-03-09 00:54:48] [INFO ] After 3962ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-09 00:54:50] [INFO ] After 5990ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1073 ms.
[2023-03-09 00:54:51] [INFO ] After 8485ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Finished Parikh walk after 1318 steps, including 0 resets, run visited all 6 properties in 41 ms. (steps per millisecond=32 )
Parikh walk visited 6 properties in 43 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), true, (X (X (NOT p2))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2) p0)), (F p2), (F (AND (NOT p2) p0)), (F (OR p1 p2)), (F p1), (F (NOT (AND (NOT p1) (NOT p2)))), (F (OR (AND p1 p0) (AND p2 p0))), (F p0)]
Knowledge based reduction with 12 factoid took 746 ms. Reduced automaton from 4 states, 13 edges and 3 AP (stutter insensitive) to 4 states, 13 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 298 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), p0, (OR (AND p0 p1) (AND p0 p2))]
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), p0, (OR (AND p0 p1) (AND p0 p2))]
[2023-03-09 00:54:52] [INFO ] Invariant cache hit.
[2023-03-09 00:54:58] [INFO ] [Real]Absence check using 355 positive place invariants in 1453 ms returned sat
[2023-03-09 00:54:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 00:55:07] [INFO ] [Real]Absence check using state equation in 9118 ms returned unknown
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 4 out of 4085 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4085/4085 places, 7165/7165 transitions.
Graph (trivial) has 3563 edges and 4085 vertex of which 671 / 4085 are part of one of the 51 SCC in 9 ms
Free SCC test removed 620 places
Ensure Unique test removed 692 transitions
Reduce isomorphic transitions removed 692 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 775 transitions
Trivial Post-agglo rules discarded 775 transitions
Performed 775 trivial Post agglomeration. Transition count delta: 775
Iterating post reduction 0 with 775 rules applied. Total rules applied 776 place count 3464 transition count 5697
Reduce places removed 775 places and 0 transitions.
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 1 with 880 rules applied. Total rules applied 1656 place count 2689 transition count 5592
Reduce places removed 70 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 72 rules applied. Total rules applied 1728 place count 2619 transition count 5590
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1730 place count 2617 transition count 5590
Performed 412 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 412 Pre rules applied. Total rules applied 1730 place count 2617 transition count 5178
Deduced a syphon composed of 412 places in 42 ms
Reduce places removed 412 places and 0 transitions.
Iterating global reduction 4 with 824 rules applied. Total rules applied 2554 place count 2205 transition count 5178
Discarding 87 places :
Symmetric choice reduction at 4 with 87 rule applications. Total rules 2641 place count 2118 transition count 4344
Iterating global reduction 4 with 87 rules applied. Total rules applied 2728 place count 2118 transition count 4344
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 4 with 30 rules applied. Total rules applied 2758 place count 2118 transition count 4314
Performed 792 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 792 places in 2 ms
Reduce places removed 792 places and 0 transitions.
Iterating global reduction 5 with 1584 rules applied. Total rules applied 4342 place count 1326 transition count 3517
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 4347 place count 1326 transition count 3512
Renaming transitions due to excessive name length > 1024 char.
Discarding 39 places :
Symmetric choice reduction at 6 with 39 rule applications. Total rules 4386 place count 1287 transition count 3056
Iterating global reduction 6 with 39 rules applied. Total rules applied 4425 place count 1287 transition count 3056
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 6 with 38 rules applied. Total rules applied 4463 place count 1287 transition count 3018
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 4465 place count 1286 transition count 3017
Performed 98 Post agglomeration using F-continuation condition with reduction of 150 identical transitions.
Deduced a syphon composed of 98 places in 2 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 7 with 196 rules applied. Total rules applied 4661 place count 1188 transition count 3513
Discarding 30 places :
Symmetric choice reduction at 7 with 30 rule applications. Total rules 4691 place count 1158 transition count 3203
Iterating global reduction 7 with 30 rules applied. Total rules applied 4721 place count 1158 transition count 3203
Ensure Unique test removed 153 transitions
Reduce isomorphic transitions removed 153 transitions.
Iterating post reduction 7 with 153 rules applied. Total rules applied 4874 place count 1158 transition count 3050
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 4876 place count 1157 transition count 3062
Drop transitions removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 8 with 38 rules applied. Total rules applied 4914 place count 1157 transition count 3024
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 4922 place count 1149 transition count 3008
Iterating global reduction 8 with 8 rules applied. Total rules applied 4930 place count 1149 transition count 3008
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 4938 place count 1141 transition count 2736
Iterating global reduction 8 with 8 rules applied. Total rules applied 4946 place count 1141 transition count 2736
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 4954 place count 1141 transition count 2728
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 4960 place count 1138 transition count 2757
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 9 with 11 rules applied. Total rules applied 4971 place count 1138 transition count 2746
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 4973 place count 1137 transition count 2758
Applied a total of 4973 rules in 1669 ms. Remains 1137 /4085 variables (removed 2948) and now considering 2758/7165 (removed 4407) transitions.
[2023-03-09 00:55:09] [INFO ] Flow matrix only has 2669 transitions (discarded 89 similar events)
// Phase 1: matrix 2669 rows 1137 cols
[2023-03-09 00:55:09] [INFO ] Computed 355 place invariants in 8 ms
[2023-03-09 00:55:09] [INFO ] Implicit Places using invariants in 545 ms returned []
[2023-03-09 00:55:09] [INFO ] Flow matrix only has 2669 transitions (discarded 89 similar events)
[2023-03-09 00:55:09] [INFO ] Invariant cache hit.
[2023-03-09 00:55:10] [INFO ] State equation strengthened by 474 read => feed constraints.
[2023-03-09 00:55:12] [INFO ] Implicit Places using invariants and state equation in 2538 ms returned []
Implicit Place search using SMT with State Equation took 3088 ms to find 0 implicit places.
[2023-03-09 00:55:12] [INFO ] Redundant transitions in 227 ms returned []
[2023-03-09 00:55:12] [INFO ] Flow matrix only has 2669 transitions (discarded 89 similar events)
[2023-03-09 00:55:12] [INFO ] Invariant cache hit.
[2023-03-09 00:55:13] [INFO ] Dead Transitions using invariants and state equation in 1090 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1137/4085 places, 2758/7165 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6082 ms. Remains : 1137/4085 places, 2758/7165 transitions.
Computed a total of 5 stabilizing places and 36 stable transitions
Computed a total of 5 stabilizing places and 36 stable transitions
Detected a total of 5/1137 stabilizing places and 36/2758 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (OR p1 p2))), (X (NOT (OR (AND p1 p0) (AND p2 p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT p2)), (X (NOT p1)), (X (NOT (AND p1 (NOT p2)))), (X (NOT p0)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p2) p0))), (X (X (NOT (OR (AND p1 p0) (AND p2 p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (OR p1 p2))), (X (X (NOT (OR p1 p2)))), (X (X (NOT p2))), (X (X p2)), (X (X (NOT p1))), (X (X p1)), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 16 factoid took 997 ms. Reduced automaton from 4 states, 13 edges and 3 AP (stutter insensitive) to 4 states, 13 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), p0, (OR (AND p0 p1) (AND p0 p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 273 ms. (steps per millisecond=36 ) properties (out of 9) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-09 00:55:15] [INFO ] Flow matrix only has 2669 transitions (discarded 89 similar events)
[2023-03-09 00:55:15] [INFO ] Invariant cache hit.
[2023-03-09 00:55:15] [INFO ] [Real]Absence check using 355 positive place invariants in 58 ms returned sat
[2023-03-09 00:55:16] [INFO ] After 1023ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 00:55:16] [INFO ] [Nat]Absence check using 355 positive place invariants in 61 ms returned sat
[2023-03-09 00:55:17] [INFO ] After 787ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 00:55:17] [INFO ] State equation strengthened by 474 read => feed constraints.
[2023-03-09 00:55:17] [INFO ] After 135ms SMT Verify possible using 474 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 00:55:17] [INFO ] After 254ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 94 ms.
[2023-03-09 00:55:17] [INFO ] After 1375ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 1137 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1137/1137 places, 2758/2758 transitions.
Drop transitions removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 1137 transition count 2706
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 62 place count 1132 transition count 2701
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 66 place count 1128 transition count 2565
Iterating global reduction 1 with 4 rules applied. Total rules applied 70 place count 1128 transition count 2565
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 74 place count 1128 transition count 2561
Free-agglomeration rule applied 713 times with reduction of 427 identical transitions.
Iterating global reduction 2 with 713 rules applied. Total rules applied 787 place count 1128 transition count 1421
Reduce places removed 713 places and 0 transitions.
Drop transitions removed 785 transitions
Reduce isomorphic transitions removed 785 transitions.
Graph (complete) has 1017 edges and 415 vertex of which 180 are kept as prefixes of interest. Removing 235 places using SCC suffix rule.2 ms
Discarding 235 places :
Also discarding 176 output transitions
Drop transitions removed 176 transitions
Iterating post reduction 2 with 1499 rules applied. Total rules applied 2286 place count 180 transition count 460
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 3 with 44 rules applied. Total rules applied 2330 place count 180 transition count 416
Discarding 96 places :
Symmetric choice reduction at 4 with 96 rule applications. Total rules 2426 place count 84 transition count 222
Iterating global reduction 4 with 96 rules applied. Total rules applied 2522 place count 84 transition count 222
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2526 place count 82 transition count 244
Drop transitions removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 4 with 18 rules applied. Total rules applied 2544 place count 82 transition count 226
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 5 with 21 rules applied. Total rules applied 2565 place count 82 transition count 205
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2567 place count 81 transition count 212
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 2568 place count 81 transition count 211
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 2569 place count 81 transition count 211
Applied a total of 2569 rules in 313 ms. Remains 81 /1137 variables (removed 1056) and now considering 211/2758 (removed 2547) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 315 ms. Remains : 81/1137 places, 211/2758 transitions.
Finished random walk after 27 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=27 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (OR p1 p2))), (X (NOT (OR (AND p1 p0) (AND p2 p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT p2)), (X (NOT p1)), (X (NOT (AND p1 (NOT p2)))), (X (NOT p0)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p2) p0))), (X (X (NOT (OR (AND p1 p0) (AND p2 p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (OR p1 p2))), (X (X (NOT (OR p1 p2)))), (X (X (NOT p2))), (X (X p2)), (X (X (NOT p1))), (X (X p1)), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2) p0)), (F p2), (F (AND (NOT p2) p0)), (F (OR p1 p2)), (F p1), (F (NOT (AND (NOT p1) (NOT p2)))), (F (OR (AND p1 p0) (AND p2 p0))), (F p0)]
Knowledge based reduction with 16 factoid took 1164 ms. Reduced automaton from 4 states, 13 edges and 3 AP (stutter insensitive) to 4 states, 13 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), p0, (OR (AND p0 p1) (AND p0 p2))]
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), p0, (OR (AND p0 p1) (AND p0 p2))]
[2023-03-09 00:55:19] [INFO ] Flow matrix only has 2669 transitions (discarded 89 similar events)
[2023-03-09 00:55:19] [INFO ] Invariant cache hit.
[2023-03-09 00:55:21] [INFO ] [Real]Absence check using 355 positive place invariants in 170 ms returned sat
[2023-03-09 00:55:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 00:55:23] [INFO ] [Real]Absence check using state equation in 1674 ms returned sat
[2023-03-09 00:55:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 00:55:25] [INFO ] [Nat]Absence check using 355 positive place invariants in 201 ms returned sat
[2023-03-09 00:55:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 00:55:26] [INFO ] [Nat]Absence check using state equation in 1636 ms returned sat
[2023-03-09 00:55:26] [INFO ] State equation strengthened by 474 read => feed constraints.
[2023-03-09 00:55:27] [INFO ] [Nat]Added 474 Read/Feed constraints in 106 ms returned sat
[2023-03-09 00:55:27] [INFO ] Computed and/alt/rep : 1542/4374/1542 causal constraints (skipped 1111 transitions) in 225 ms.
[2023-03-09 00:55:28] [INFO ] Added : 21 causal constraints over 5 iterations in 916 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), p0, (OR (AND p0 p1) (AND p0 p2))]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA DLCflexbar-PT-3b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCflexbar-PT-3b-LTLFireability-04 finished in 60131 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(X(G(p1))))))'
Support contains 3 out of 4131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4131/4131 places, 7215/7215 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 4118 transition count 7201
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 4118 transition count 7201
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 4108 transition count 7191
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 4108 transition count 7191
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 4108 transition count 7190
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 55 place count 4100 transition count 7181
Iterating global reduction 1 with 8 rules applied. Total rules applied 63 place count 4100 transition count 7181
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 71 place count 4092 transition count 7173
Iterating global reduction 1 with 8 rules applied. Total rules applied 79 place count 4092 transition count 7173
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 80 place count 4092 transition count 7172
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 83 place count 4089 transition count 7169
Iterating global reduction 2 with 3 rules applied. Total rules applied 86 place count 4089 transition count 7169
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 89 place count 4086 transition count 7166
Iterating global reduction 2 with 3 rules applied. Total rules applied 92 place count 4086 transition count 7166
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 95 place count 4083 transition count 7163
Iterating global reduction 2 with 3 rules applied. Total rules applied 98 place count 4083 transition count 7163
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 101 place count 4080 transition count 7160
Iterating global reduction 2 with 3 rules applied. Total rules applied 104 place count 4080 transition count 7160
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 106 place count 4078 transition count 7158
Iterating global reduction 2 with 2 rules applied. Total rules applied 108 place count 4078 transition count 7158
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 109 place count 4077 transition count 7157
Iterating global reduction 2 with 1 rules applied. Total rules applied 110 place count 4077 transition count 7157
Applied a total of 110 rules in 2714 ms. Remains 4077 /4131 variables (removed 54) and now considering 7157/7215 (removed 58) transitions.
// Phase 1: matrix 7157 rows 4077 cols
[2023-03-09 00:55:31] [INFO ] Computed 355 place invariants in 26 ms
[2023-03-09 00:55:32] [INFO ] Implicit Places using invariants in 1189 ms returned []
[2023-03-09 00:55:32] [INFO ] Invariant cache hit.
[2023-03-09 00:55:34] [INFO ] Implicit Places using invariants and state equation in 2271 ms returned []
Implicit Place search using SMT with State Equation took 3473 ms to find 0 implicit places.
[2023-03-09 00:55:34] [INFO ] Invariant cache hit.
[2023-03-09 00:55:38] [INFO ] Dead Transitions using invariants and state equation in 3817 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4077/4131 places, 7157/7215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10007 ms. Remains : 4077/4131 places, 7157/7215 transitions.
Stuttering acceptance computed with spot in 260 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DLCflexbar-PT-3b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=p0, acceptance={} source=5 dest: 2}], [{ cond=true, acceptance={} source=6 dest: 7}], [{ cond=(NOT p0), acceptance={} source=7 dest: 4}, { cond=p0, acceptance={} source=7 dest: 5}]], initial=6, aps=[p1:(NEQ s2729 1), p0:(OR (EQ s1823 0) (EQ s3859 0))], 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, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 31274 steps with 0 reset in 304 ms.
FORMULA DLCflexbar-PT-3b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCflexbar-PT-3b-LTLFireability-05 finished in 10650 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))))))'
Support contains 2 out of 4131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4131/4131 places, 7215/7215 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 4119 transition count 7203
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 4119 transition count 7203
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 33 place count 4110 transition count 7194
Iterating global reduction 0 with 9 rules applied. Total rules applied 42 place count 4110 transition count 7194
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 49 place count 4103 transition count 7186
Iterating global reduction 0 with 7 rules applied. Total rules applied 56 place count 4103 transition count 7186
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 63 place count 4096 transition count 7179
Iterating global reduction 0 with 7 rules applied. Total rules applied 70 place count 4096 transition count 7179
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 71 place count 4096 transition count 7178
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 74 place count 4093 transition count 7175
Iterating global reduction 1 with 3 rules applied. Total rules applied 77 place count 4093 transition count 7175
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 80 place count 4090 transition count 7172
Iterating global reduction 1 with 3 rules applied. Total rules applied 83 place count 4090 transition count 7172
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 86 place count 4087 transition count 7169
Iterating global reduction 1 with 3 rules applied. Total rules applied 89 place count 4087 transition count 7169
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 92 place count 4084 transition count 7166
Iterating global reduction 1 with 3 rules applied. Total rules applied 95 place count 4084 transition count 7166
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 97 place count 4082 transition count 7164
Iterating global reduction 1 with 2 rules applied. Total rules applied 99 place count 4082 transition count 7164
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 100 place count 4081 transition count 7163
Iterating global reduction 1 with 1 rules applied. Total rules applied 101 place count 4081 transition count 7163
Applied a total of 101 rules in 2443 ms. Remains 4081 /4131 variables (removed 50) and now considering 7163/7215 (removed 52) transitions.
// Phase 1: matrix 7163 rows 4081 cols
[2023-03-09 00:55:41] [INFO ] Computed 355 place invariants in 25 ms
[2023-03-09 00:55:42] [INFO ] Implicit Places using invariants in 1094 ms returned []
[2023-03-09 00:55:42] [INFO ] Invariant cache hit.
[2023-03-09 00:55:44] [INFO ] Implicit Places using invariants and state equation in 2033 ms returned []
Implicit Place search using SMT with State Equation took 3140 ms to find 0 implicit places.
[2023-03-09 00:55:44] [INFO ] Invariant cache hit.
[2023-03-09 00:55:48] [INFO ] Dead Transitions using invariants and state equation in 3742 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4081/4131 places, 7163/7215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9327 ms. Remains : 4081/4131 places, 7163/7215 transitions.
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DLCflexbar-PT-3b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s1256 1), p1:(EQ s1024 0)], 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 120 reset in 837 ms.
Product exploration explored 100000 steps with 72 reset in 1052 ms.
Computed a total of 684 stabilizing places and 684 stable transitions
Computed a total of 684 stabilizing places and 684 stable transitions
Detected a total of 684/4081 stabilizing places and 684/7163 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 214 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1075 steps, including 0 resets, run visited all 2 properties in 8 ms. (steps per millisecond=134 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 232 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 4081 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4081/4081 places, 7163/7163 transitions.
Applied a total of 0 rules in 236 ms. Remains 4081 /4081 variables (removed 0) and now considering 7163/7163 (removed 0) transitions.
[2023-03-09 00:55:51] [INFO ] Invariant cache hit.
[2023-03-09 00:55:52] [INFO ] Implicit Places using invariants in 1084 ms returned []
[2023-03-09 00:55:52] [INFO ] Invariant cache hit.
[2023-03-09 00:55:54] [INFO ] Implicit Places using invariants and state equation in 1144 ms returned []
Implicit Place search using SMT with State Equation took 2230 ms to find 0 implicit places.
[2023-03-09 00:55:54] [INFO ] Invariant cache hit.
[2023-03-09 00:55:57] [INFO ] Dead Transitions using invariants and state equation in 3905 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6372 ms. Remains : 4081/4081 places, 7163/7163 transitions.
Computed a total of 684 stabilizing places and 684 stable transitions
Computed a total of 684 stabilizing places and 684 stable transitions
Detected a total of 684/4081 stabilizing places and 684/7163 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 226 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-09 00:55:58] [INFO ] Invariant cache hit.
[2023-03-09 00:55:59] [INFO ] [Real]Absence check using 355 positive place invariants in 381 ms returned sat
[2023-03-09 00:56:02] [INFO ] After 2955ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 00:56:03] [INFO ] After 3457ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 188 ms.
[2023-03-09 00:56:03] [INFO ] After 4692ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 345 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=86 )
Parikh walk visited 1 properties in 5 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 218 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 110 reset in 723 ms.
Product exploration explored 100000 steps with 111 reset in 993 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 4081 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4081/4081 places, 7163/7163 transitions.
Graph (trivial) has 3564 edges and 4081 vertex of which 685 / 4081 are part of one of the 50 SCC in 5 ms
Free SCC test removed 635 places
Ensure Unique test removed 711 transitions
Reduce isomorphic transitions removed 711 transitions.
Performed 765 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 765 rules applied. Total rules applied 766 place count 3446 transition count 6452
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 70 rules applied. Total rules applied 836 place count 3446 transition count 6417
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 61 Pre rules applied. Total rules applied 836 place count 3446 transition count 6447
Deduced a syphon composed of 861 places in 45 ms
Iterating global reduction 2 with 61 rules applied. Total rules applied 897 place count 3446 transition count 6447
Discarding 382 places :
Symmetric choice reduction at 2 with 382 rule applications. Total rules 1279 place count 3064 transition count 5285
Deduced a syphon composed of 568 places in 37 ms
Iterating global reduction 2 with 382 rules applied. Total rules applied 1661 place count 3064 transition count 5285
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 1691 place count 3064 transition count 5255
Performed 1165 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1733 places in 1 ms
Iterating global reduction 3 with 1165 rules applied. Total rules applied 2856 place count 3064 transition count 5260
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 2861 place count 3064 transition count 5255
Renaming transitions due to excessive name length > 1024 char.
Discarding 907 places :
Symmetric choice reduction at 4 with 907 rule applications. Total rules 3768 place count 2157 transition count 3898
Deduced a syphon composed of 866 places in 1 ms
Iterating global reduction 4 with 907 rules applied. Total rules applied 4675 place count 2157 transition count 3898
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 4 with 40 rules applied. Total rules applied 4715 place count 2157 transition count 3858
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 4720 place count 2152 transition count 3853
Deduced a syphon composed of 861 places in 1 ms
Iterating global reduction 5 with 5 rules applied. Total rules applied 4725 place count 2152 transition count 3853
Performed 101 Post agglomeration using F-continuation condition with reduction of 150 identical transitions.
Deduced a syphon composed of 962 places in 1 ms
Iterating global reduction 5 with 101 rules applied. Total rules applied 4826 place count 2152 transition count 4669
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Iterating post reduction 5 with 65 rules applied. Total rules applied 4891 place count 2152 transition count 4604
Discarding 136 places :
Symmetric choice reduction at 6 with 136 rule applications. Total rules 5027 place count 2016 transition count 4057
Deduced a syphon composed of 856 places in 1 ms
Iterating global reduction 6 with 136 rules applied. Total rules applied 5163 place count 2016 transition count 4057
Ensure Unique test removed 180 transitions
Reduce isomorphic transitions removed 180 transitions.
Iterating post reduction 6 with 180 rules applied. Total rules applied 5343 place count 2016 transition count 3877
Discarding 60 places :
Symmetric choice reduction at 7 with 60 rule applications. Total rules 5403 place count 1956 transition count 3757
Deduced a syphon composed of 796 places in 1 ms
Iterating global reduction 7 with 60 rules applied. Total rules applied 5463 place count 1956 transition count 3757
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 798 places in 1 ms
Iterating global reduction 7 with 2 rules applied. Total rules applied 5465 place count 1956 transition count 3787
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 5467 place count 1954 transition count 3783
Deduced a syphon composed of 796 places in 1 ms
Iterating global reduction 7 with 2 rules applied. Total rules applied 5469 place count 1954 transition count 3783
Deduced a syphon composed of 796 places in 1 ms
Drop transitions removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 7 with 25 rules applied. Total rules applied 5494 place count 1954 transition count 3758
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 5504 place count 1944 transition count 3738
Deduced a syphon composed of 796 places in 1 ms
Iterating global reduction 7 with 10 rules applied. Total rules applied 5514 place count 1944 transition count 3738
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 5524 place count 1934 transition count 3394
Deduced a syphon composed of 796 places in 1 ms
Iterating global reduction 7 with 10 rules applied. Total rules applied 5534 place count 1934 transition count 3394
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 5549 place count 1934 transition count 3379
Discarding 10 places :
Symmetric choice reduction at 8 with 10 rule applications. Total rules 5559 place count 1924 transition count 3364
Deduced a syphon composed of 786 places in 1 ms
Iterating global reduction 8 with 10 rules applied. Total rules applied 5569 place count 1924 transition count 3364
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 787 places in 2 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 5570 place count 1924 transition count 3375
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 5571 place count 1923 transition count 3373
Deduced a syphon composed of 786 places in 1 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 5572 place count 1923 transition count 3373
Deduced a syphon composed of 786 places in 1 ms
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 5576 place count 1923 transition count 3369
Deduced a syphon composed of 786 places in 1 ms
Applied a total of 5576 rules in 5849 ms. Remains 1923 /4081 variables (removed 2158) and now considering 3369/7163 (removed 3794) transitions.
[2023-03-09 00:56:12] [INFO ] Redundant transitions in 251 ms returned []
[2023-03-09 00:56:12] [INFO ] Flow matrix only has 3327 transitions (discarded 42 similar events)
// Phase 1: matrix 3327 rows 1923 cols
[2023-03-09 00:56:12] [INFO ] Computed 355 place invariants in 301 ms
[2023-03-09 00:56:14] [INFO ] Dead Transitions using invariants and state equation in 2056 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1923/4081 places, 3369/7163 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8177 ms. Remains : 1923/4081 places, 3369/7163 transitions.
Support contains 2 out of 4081 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4081/4081 places, 7163/7163 transitions.
Applied a total of 0 rules in 219 ms. Remains 4081 /4081 variables (removed 0) and now considering 7163/7163 (removed 0) transitions.
// Phase 1: matrix 7163 rows 4081 cols
[2023-03-09 00:56:14] [INFO ] Computed 355 place invariants in 27 ms
[2023-03-09 00:56:15] [INFO ] Implicit Places using invariants in 1081 ms returned []
[2023-03-09 00:56:15] [INFO ] Invariant cache hit.
[2023-03-09 00:56:16] [INFO ] Implicit Places using invariants and state equation in 1144 ms returned []
Implicit Place search using SMT with State Equation took 2227 ms to find 0 implicit places.
[2023-03-09 00:56:16] [INFO ] Invariant cache hit.
[2023-03-09 00:56:20] [INFO ] Dead Transitions using invariants and state equation in 3829 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6278 ms. Remains : 4081/4081 places, 7163/7163 transitions.
Treatment of property DLCflexbar-PT-3b-LTLFireability-09 finished in 42231 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&&((p1 U (p2||G(p1))) U ((X(p3)&&(p1 U (p2||G(p1))))||G((p1 U (p2||G(p1)))))))))'
Support contains 3 out of 4131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4131/4131 places, 7215/7215 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 4118 transition count 7201
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 4118 transition count 7201
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 4108 transition count 7191
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 4108 transition count 7191
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 4108 transition count 7190
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 54 place count 4101 transition count 7182
Iterating global reduction 1 with 7 rules applied. Total rules applied 61 place count 4101 transition count 7182
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 68 place count 4094 transition count 7175
Iterating global reduction 1 with 7 rules applied. Total rules applied 75 place count 4094 transition count 7175
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 76 place count 4094 transition count 7174
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 78 place count 4092 transition count 7172
Iterating global reduction 2 with 2 rules applied. Total rules applied 80 place count 4092 transition count 7172
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 82 place count 4090 transition count 7170
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 place count 4090 transition count 7170
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 86 place count 4088 transition count 7168
Iterating global reduction 2 with 2 rules applied. Total rules applied 88 place count 4088 transition count 7168
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 90 place count 4086 transition count 7166
Iterating global reduction 2 with 2 rules applied. Total rules applied 92 place count 4086 transition count 7166
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 94 place count 4084 transition count 7164
Iterating global reduction 2 with 2 rules applied. Total rules applied 96 place count 4084 transition count 7164
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 97 place count 4083 transition count 7163
Iterating global reduction 2 with 1 rules applied. Total rules applied 98 place count 4083 transition count 7163
Applied a total of 98 rules in 2472 ms. Remains 4083 /4131 variables (removed 48) and now considering 7163/7215 (removed 52) transitions.
// Phase 1: matrix 7163 rows 4083 cols
[2023-03-09 00:56:23] [INFO ] Computed 355 place invariants in 27 ms
[2023-03-09 00:56:24] [INFO ] Implicit Places using invariants in 1067 ms returned []
[2023-03-09 00:56:24] [INFO ] Invariant cache hit.
[2023-03-09 00:56:25] [INFO ] Implicit Places using invariants and state equation in 1001 ms returned []
Implicit Place search using SMT with State Equation took 2072 ms to find 0 implicit places.
[2023-03-09 00:56:25] [INFO ] Invariant cache hit.
[2023-03-09 00:56:29] [INFO ] Dead Transitions using invariants and state equation in 3665 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4083/4131 places, 7163/7215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8210 ms. Remains : 4083/4131 places, 7163/7215 transitions.
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DLCflexbar-PT-3b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p2) (NOT p1)) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND p2 p0) (AND p1 p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=1 dest: 0}, { cond=(OR (AND p2 (NOT p3)) (AND p1 (NOT p3))), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(AND (NEQ s1688 1) (NEQ s575 1)), p1:(NEQ s575 1), p0:(NEQ s1688 1), p3:(NEQ s290 1)], 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 50000 reset in 2159 ms.
Product exploration explored 100000 steps with 50000 reset in 2199 ms.
Computed a total of 680 stabilizing places and 680 stable transitions
Computed a total of 680 stabilizing places and 680 stable transitions
Detected a total of 680/4083 stabilizing places and 680/7163 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p2 p1 p0 p3), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (OR (AND p2 (NOT p3)) (AND p1 (NOT p3))))), (X (NOT (AND (NOT p2) p1 (NOT p3)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (OR (AND (NOT p2) (NOT p1)) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p2) p1 p0))), (X (OR (AND p2 p0) (AND p1 p0))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND p2 (NOT p3)) (AND p1 (NOT p3)))))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (OR (AND (NOT p2) (NOT p1)) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (OR (AND p2 p0) (AND p1 p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p2 p1 p0 p3)
Knowledge based reduction with 18 factoid took 577 ms. Reduced automaton from 3 states, 8 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DLCflexbar-PT-3b-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCflexbar-PT-3b-LTLFireability-11 finished in 13674 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)&&F((p1||X(F(p2))))&&(!p3 U (p4||G(!p3)))))'
Support contains 6 out of 4131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4131/4131 places, 7215/7215 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 4119 transition count 7202
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 4119 transition count 7202
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 34 place count 4109 transition count 7192
Iterating global reduction 0 with 10 rules applied. Total rules applied 44 place count 4109 transition count 7192
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 4109 transition count 7191
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 52 place count 4102 transition count 7183
Iterating global reduction 1 with 7 rules applied. Total rules applied 59 place count 4102 transition count 7183
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 66 place count 4095 transition count 7176
Iterating global reduction 1 with 7 rules applied. Total rules applied 73 place count 4095 transition count 7176
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 74 place count 4095 transition count 7175
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 77 place count 4092 transition count 7172
Iterating global reduction 2 with 3 rules applied. Total rules applied 80 place count 4092 transition count 7172
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 83 place count 4089 transition count 7169
Iterating global reduction 2 with 3 rules applied. Total rules applied 86 place count 4089 transition count 7169
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 89 place count 4086 transition count 7166
Iterating global reduction 2 with 3 rules applied. Total rules applied 92 place count 4086 transition count 7166
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 95 place count 4083 transition count 7163
Iterating global reduction 2 with 3 rules applied. Total rules applied 98 place count 4083 transition count 7163
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 100 place count 4081 transition count 7161
Iterating global reduction 2 with 2 rules applied. Total rules applied 102 place count 4081 transition count 7161
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 103 place count 4080 transition count 7160
Iterating global reduction 2 with 1 rules applied. Total rules applied 104 place count 4080 transition count 7160
Applied a total of 104 rules in 2567 ms. Remains 4080 /4131 variables (removed 51) and now considering 7160/7215 (removed 55) transitions.
// Phase 1: matrix 7160 rows 4080 cols
[2023-03-09 00:56:37] [INFO ] Computed 355 place invariants in 28 ms
[2023-03-09 00:56:38] [INFO ] Implicit Places using invariants in 1106 ms returned []
[2023-03-09 00:56:38] [INFO ] Invariant cache hit.
[2023-03-09 00:56:40] [INFO ] Implicit Places using invariants and state equation in 2128 ms returned []
Implicit Place search using SMT with State Equation took 3266 ms to find 0 implicit places.
[2023-03-09 00:56:40] [INFO ] Invariant cache hit.
[2023-03-09 00:56:44] [INFO ] Dead Transitions using invariants and state equation in 3828 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4080/4131 places, 7160/7215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9667 ms. Remains : 4080/4131 places, 7160/7215 transitions.
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND p3 (NOT p4))), true, (NOT p0), (AND (NOT p4) p3), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DLCflexbar-PT-3b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p4) p3), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p0) p4) (AND (NOT p0) (NOT p3))), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p4) (NOT p3)), acceptance={} source=0 dest: 3}, { cond=(OR (AND (NOT p1) p4) (AND (NOT p1) (NOT p3))), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p4) p3), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p4) (NOT p3)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p4:(AND (EQ s3179 1) (NOT (AND (EQ s939 1) (EQ s3832 1)))), p3:(AND (EQ s939 1) (EQ s3832 1)), p0:(EQ s3549 0), p1:(EQ s1049 1), p2:(EQ s1097 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 92299 steps with 16 reset in 753 ms.
FORMULA DLCflexbar-PT-3b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCflexbar-PT-3b-LTLFireability-12 finished in 10716 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(G(p0)) U p0)))'
Support contains 1 out of 4131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4131/4131 places, 7215/7215 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 4117 transition count 7200
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 4117 transition count 7200
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 39 place count 4106 transition count 7189
Iterating global reduction 0 with 11 rules applied. Total rules applied 50 place count 4106 transition count 7189
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 4106 transition count 7188
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 58 place count 4099 transition count 7180
Iterating global reduction 1 with 7 rules applied. Total rules applied 65 place count 4099 transition count 7180
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 72 place count 4092 transition count 7173
Iterating global reduction 1 with 7 rules applied. Total rules applied 79 place count 4092 transition count 7173
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 80 place count 4092 transition count 7172
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 83 place count 4089 transition count 7169
Iterating global reduction 2 with 3 rules applied. Total rules applied 86 place count 4089 transition count 7169
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 89 place count 4086 transition count 7166
Iterating global reduction 2 with 3 rules applied. Total rules applied 92 place count 4086 transition count 7166
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 95 place count 4083 transition count 7163
Iterating global reduction 2 with 3 rules applied. Total rules applied 98 place count 4083 transition count 7163
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 101 place count 4080 transition count 7160
Iterating global reduction 2 with 3 rules applied. Total rules applied 104 place count 4080 transition count 7160
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 106 place count 4078 transition count 7158
Iterating global reduction 2 with 2 rules applied. Total rules applied 108 place count 4078 transition count 7158
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 109 place count 4077 transition count 7157
Iterating global reduction 2 with 1 rules applied. Total rules applied 110 place count 4077 transition count 7157
Applied a total of 110 rules in 2592 ms. Remains 4077 /4131 variables (removed 54) and now considering 7157/7215 (removed 58) transitions.
// Phase 1: matrix 7157 rows 4077 cols
[2023-03-09 00:56:48] [INFO ] Computed 355 place invariants in 20 ms
[2023-03-09 00:56:49] [INFO ] Implicit Places using invariants in 1133 ms returned []
[2023-03-09 00:56:49] [INFO ] Invariant cache hit.
[2023-03-09 00:56:50] [INFO ] Implicit Places using invariants and state equation in 1093 ms returned []
Implicit Place search using SMT with State Equation took 2229 ms to find 0 implicit places.
[2023-03-09 00:56:50] [INFO ] Invariant cache hit.
[2023-03-09 00:56:54] [INFO ] Dead Transitions using invariants and state equation in 4005 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4077/4131 places, 7157/7215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8829 ms. Remains : 4077/4131 places, 7157/7215 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DLCflexbar-PT-3b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s1097 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 23626 steps with 0 reset in 209 ms.
FORMULA DLCflexbar-PT-3b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCflexbar-PT-3b-LTLFireability-14 finished in 9232 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((G(F(p1))||p0))))'
Support contains 6 out of 4131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4131/4131 places, 7215/7215 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 4117 transition count 7200
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 4117 transition count 7200
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 39 place count 4106 transition count 7189
Iterating global reduction 0 with 11 rules applied. Total rules applied 50 place count 4106 transition count 7189
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 4106 transition count 7188
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 59 place count 4098 transition count 7179
Iterating global reduction 1 with 8 rules applied. Total rules applied 67 place count 4098 transition count 7179
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 75 place count 4090 transition count 7171
Iterating global reduction 1 with 8 rules applied. Total rules applied 83 place count 4090 transition count 7171
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 84 place count 4090 transition count 7170
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 87 place count 4087 transition count 7167
Iterating global reduction 2 with 3 rules applied. Total rules applied 90 place count 4087 transition count 7167
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 93 place count 4084 transition count 7164
Iterating global reduction 2 with 3 rules applied. Total rules applied 96 place count 4084 transition count 7164
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 99 place count 4081 transition count 7161
Iterating global reduction 2 with 3 rules applied. Total rules applied 102 place count 4081 transition count 7161
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 105 place count 4078 transition count 7158
Iterating global reduction 2 with 3 rules applied. Total rules applied 108 place count 4078 transition count 7158
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 110 place count 4076 transition count 7156
Iterating global reduction 2 with 2 rules applied. Total rules applied 112 place count 4076 transition count 7156
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 113 place count 4075 transition count 7155
Iterating global reduction 2 with 1 rules applied. Total rules applied 114 place count 4075 transition count 7155
Applied a total of 114 rules in 2614 ms. Remains 4075 /4131 variables (removed 56) and now considering 7155/7215 (removed 60) transitions.
// Phase 1: matrix 7155 rows 4075 cols
[2023-03-09 00:56:57] [INFO ] Computed 355 place invariants in 24 ms
[2023-03-09 00:56:58] [INFO ] Implicit Places using invariants in 1179 ms returned []
[2023-03-09 00:56:58] [INFO ] Invariant cache hit.
[2023-03-09 00:56:59] [INFO ] Implicit Places using invariants and state equation in 1121 ms returned []
Implicit Place search using SMT with State Equation took 2312 ms to find 0 implicit places.
[2023-03-09 00:56:59] [INFO ] Invariant cache hit.
[2023-03-09 00:57:03] [INFO ] Dead Transitions using invariants and state equation in 4019 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4075/4131 places, 7155/7215 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8953 ms. Remains : 4075/4131 places, 7155/7215 transitions.
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DLCflexbar-PT-3b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s1138 0) (EQ s3520 0)), p1:(OR (EQ s671 0) (EQ s3035 0) (EQ s1618 0) (EQ s2938 0))], 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 50000 reset in 2256 ms.
Product exploration explored 100000 steps with 50000 reset in 2246 ms.
Computed a total of 680 stabilizing places and 680 stable transitions
Computed a total of 680 stabilizing places and 680 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 82 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DLCflexbar-PT-3b-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCflexbar-PT-3b-LTLFireability-15 finished in 14012 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))))))'
Found a Shortening insensitive property : DLCflexbar-PT-3b-LTLFireability-09
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 4131 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 4131/4131 places, 7215/7215 transitions.
Graph (trivial) has 3616 edges and 4131 vertex of which 686 / 4131 are part of one of the 50 SCC in 2 ms
Free SCC test removed 636 places
Ensure Unique test removed 711 transitions
Reduce isomorphic transitions removed 711 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 797 transitions
Trivial Post-agglo rules discarded 797 transitions
Performed 797 trivial Post agglomeration. Transition count delta: 797
Iterating post reduction 0 with 797 rules applied. Total rules applied 798 place count 3494 transition count 5706
Reduce places removed 797 places and 0 transitions.
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 1 with 904 rules applied. Total rules applied 1702 place count 2697 transition count 5599
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 73 rules applied. Total rules applied 1775 place count 2626 transition count 5597
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1776 place count 2625 transition count 5597
Performed 412 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 412 Pre rules applied. Total rules applied 1776 place count 2625 transition count 5185
Deduced a syphon composed of 412 places in 45 ms
Reduce places removed 412 places and 0 transitions.
Iterating global reduction 4 with 824 rules applied. Total rules applied 2600 place count 2213 transition count 5185
Discarding 96 places :
Symmetric choice reduction at 4 with 96 rule applications. Total rules 2696 place count 2117 transition count 4313
Iterating global reduction 4 with 96 rules applied. Total rules applied 2792 place count 2117 transition count 4313
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 4 with 29 rules applied. Total rules applied 2821 place count 2117 transition count 4284
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 2821 place count 2117 transition count 4279
Deduced a syphon composed of 5 places in 36 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 2831 place count 2112 transition count 4279
Performed 789 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 789 places in 1 ms
Reduce places removed 789 places and 0 transitions.
Iterating global reduction 5 with 1578 rules applied. Total rules applied 4409 place count 1323 transition count 3485
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 4415 place count 1323 transition count 3479
Renaming transitions due to excessive name length > 1024 char.
Discarding 41 places :
Symmetric choice reduction at 6 with 41 rule applications. Total rules 4456 place count 1282 transition count 2984
Iterating global reduction 6 with 41 rules applied. Total rules applied 4497 place count 1282 transition count 2984
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 6 with 41 rules applied. Total rules applied 4538 place count 1282 transition count 2943
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 7 with 2 rules applied. Total rules applied 4540 place count 1281 transition count 2942
Performed 95 Post agglomeration using F-continuation condition with reduction of 150 identical transitions.
Deduced a syphon composed of 95 places in 0 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 7 with 190 rules applied. Total rules applied 4730 place count 1186 transition count 3402
Discarding 30 places :
Symmetric choice reduction at 7 with 30 rule applications. Total rules 4760 place count 1156 transition count 3096
Iterating global reduction 7 with 30 rules applied. Total rules applied 4790 place count 1156 transition count 3096
Ensure Unique test removed 151 transitions
Reduce isomorphic transitions removed 151 transitions.
Iterating post reduction 7 with 151 rules applied. Total rules applied 4941 place count 1156 transition count 2945
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 4945 place count 1156 transition count 2941
Applied a total of 4945 rules in 730 ms. Remains 1156 /4131 variables (removed 2975) and now considering 2941/7215 (removed 4274) transitions.
[2023-03-09 00:57:09] [INFO ] Flow matrix only has 2887 transitions (discarded 54 similar events)
// Phase 1: matrix 2887 rows 1156 cols
[2023-03-09 00:57:09] [INFO ] Computed 355 place invariants in 11 ms
[2023-03-09 00:57:10] [INFO ] Implicit Places using invariants in 538 ms returned []
[2023-03-09 00:57:10] [INFO ] Flow matrix only has 2887 transitions (discarded 54 similar events)
[2023-03-09 00:57:10] [INFO ] Invariant cache hit.
[2023-03-09 00:57:11] [INFO ] State equation strengthened by 485 read => feed constraints.
[2023-03-09 00:57:12] [INFO ] Implicit Places using invariants and state equation in 2459 ms returned []
Implicit Place search using SMT with State Equation took 2998 ms to find 0 implicit places.
[2023-03-09 00:57:12] [INFO ] Flow matrix only has 2887 transitions (discarded 54 similar events)
[2023-03-09 00:57:12] [INFO ] Invariant cache hit.
[2023-03-09 00:57:13] [INFO ] Dead Transitions using invariants and state equation in 1167 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 1156/4131 places, 2941/7215 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 4896 ms. Remains : 1156/4131 places, 2941/7215 transitions.
Running random walk in product with property : DLCflexbar-PT-3b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s132 1), p1:(EQ s107 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 695 steps with 0 reset in 24 ms.
Treatment of property DLCflexbar-PT-3b-LTLFireability-09 finished in 5123 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2023-03-09 00:57:14] [INFO ] Flatten gal took : 182 ms
[2023-03-09 00:57:14] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-09 00:57:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 4131 places, 7215 transitions and 21264 arcs took 43 ms.
Total runtime 243985 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1522/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : DLCflexbar-PT-3b-LTLFireability-09

BK_STOP 1678323438893

--------------------
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 LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name DLCflexbar-PT-3b-LTLFireability-09
ltl formula formula --ltl=/tmp/1522/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 4131 places, 7215 transitions and 21264 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.750 real 0.240 user 0.280 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1522/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1522/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1522/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1522/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:

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="DLCflexbar-PT-3b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is DLCflexbar-PT-3b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r105-tall-167814481300532"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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