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.r167-tall-167838852900316.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is FamilyReunion-COL-L00050M0005C002P002G001, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-167838852900316
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 7.2K Feb 26 12:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 12:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 12:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 12:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Feb 25 16:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 26 12:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Feb 26 12:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 26 12:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 12:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 24 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 137K 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 FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-00
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-01
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-02
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-03
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-04
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-05
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-06
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-07
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-08
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-09
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-10
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-11
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-12
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-13
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-14
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678449517031

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-COL-L00050M0005C002P002G001
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-10 11:58:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-10 11:58:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 11:58:38] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-10 11:58:38] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-10 11:58:39] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 665 ms
[2023-03-10 11:58:39] [INFO ] Detected 5 constant HL places corresponding to 17 PT places.
[2023-03-10 11:58:39] [INFO ] Imported 104 HL places and 66 HL transitions for a total of 12245 PT places and 10611.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2023-03-10 11:58:39] [INFO ] Built PT skeleton of HLPN with 104 places and 66 transitions 198 arcs in 5 ms.
[2023-03-10 11:58:39] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 104 stabilizing places and 66 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 104 transition count 66
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 14 properties that can be checked using skeleton over-approximation.
Reduce places removed 5 places and 0 transitions.
Computed a total of 99 stabilizing places and 66 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 99 transition count 66
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10034 steps, including 3 resets, run finished after 35 ms. (steps per millisecond=286 ) properties (out of 25) seen :24
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 66 rows 99 cols
[2023-03-10 11:58:39] [INFO ] Computed 33 place invariants in 12 ms
[2023-03-10 11:58:39] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-10 11:58:39] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 7 ms returned sat
[2023-03-10 11:58:39] [INFO ] After 169ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 11:58:39] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-10 11:58:39] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 7 ms returned sat
[2023-03-10 11:58:39] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 11:58:39] [INFO ] After 54ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-10 11:58:39] [INFO ] After 119ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 134 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=67 )
Parikh walk visited 1 properties in 2 ms.
[2023-03-10 11:58:39] [INFO ] Flatten gal took : 28 ms
[2023-03-10 11:58:39] [INFO ] Flatten gal took : 9 ms
Transition Gate2ANDJoin forces synchronizations/join behavior on parameter l of sort LegalResident
Transition ReceiveLangChoice forces synchronizations/join behavior on parameter m of sort MICSystem
Symmetric sort wr.t. initial and guards and successors and join/free detected :CINFORMI
Symmetric sort wr.t. initial detected :CINFORMI
Symmetric sort wr.t. initial and guards detected :CINFORMI
Applying symmetric unfolding of full symmetric sort :CINFORMI domain size was 3
Transition Gate1ANDJoin forces synchronizations/join behavior on parameter p of sort PublicAdminOffice
Symmetric sort wr.t. initial and guards and successors and join/free detected :Response
Symmetric sort wr.t. initial detected :Response
Transition SendClearanceToRel : guard parameter $r(Response:2) in guard (EQ $r 0)introduces in Response(2) partition with 2 elements
Symmetric sort wr.t. initial and guards and successors and join/free detected :GovernmentCommission
Symmetric sort wr.t. initial detected :GovernmentCommission
Symmetric sort wr.t. initial and guards detected :GovernmentCommission
Applying symmetric unfolding of full symmetric sort :GovernmentCommission domain size was 2
[2023-03-10 11:58:39] [INFO ] Unfolded HLPN to a Petri net with 11467 places and 9336 transitions 26832 arcs in 80 ms.
[2023-03-10 11:58:39] [INFO ] Unfolded 14 HLPN properties in 2 ms.
[2023-03-10 11:58:39] [INFO ] Reduced 51 identical enabling conditions.
[2023-03-10 11:58:39] [INFO ] Reduced 102 identical enabling conditions.
Deduced a syphon composed of 51 places in 45 ms
Reduce places removed 64 places and 0 transitions.
Support contains 4852 out of 11403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11403/11403 places, 9336/9336 transitions.
Reduce places removed 168 places and 0 transitions.
Discarding 663 places :
Implicit places reduction removed 663 places
Iterating post reduction 0 with 831 rules applied. Total rules applied 831 place count 10572 transition count 9336
Discarding 461 places :
Symmetric choice reduction at 1 with 461 rule applications. Total rules 1292 place count 10111 transition count 8875
Iterating global reduction 1 with 461 rules applied. Total rules applied 1753 place count 10111 transition count 8875
Discarding 305 places :
Symmetric choice reduction at 1 with 305 rule applications. Total rules 2058 place count 9806 transition count 8570
Iterating global reduction 1 with 305 rules applied. Total rules applied 2363 place count 9806 transition count 8570
Discarding 255 places :
Symmetric choice reduction at 1 with 255 rule applications. Total rules 2618 place count 9551 transition count 8315
Iterating global reduction 1 with 255 rules applied. Total rules applied 2873 place count 9551 transition count 8315
Applied a total of 2873 rules in 2857 ms. Remains 9551 /11403 variables (removed 1852) and now considering 8315/9336 (removed 1021) transitions.
// Phase 1: matrix 8315 rows 9551 cols
[2023-03-10 11:58:43] [INFO ] Computed 1994 place invariants in 523 ms
[2023-03-10 11:58:44] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 11:58:45] [INFO ] Implicit Places using invariants in 2381 ms returned []
[2023-03-10 11:58:45] [INFO ] Invariant cache hit.
[2023-03-10 11:58:46] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 11:58:46] [INFO ] Implicit Places using invariants and state equation in 884 ms returned []
Implicit Place search using SMT with State Equation took 3270 ms to find 0 implicit places.
[2023-03-10 11:58:46] [INFO ] Invariant cache hit.
[2023-03-10 11:58:46] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 11:58:47] [INFO ] Dead Transitions using invariants and state equation in 841 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 9551/11403 places, 8315/9336 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6971 ms. Remains : 9551/11403 places, 8315/9336 transitions.
Support contains 4852 out of 9551 places after structural reductions.
[2023-03-10 11:58:47] [INFO ] Flatten gal took : 342 ms
[2023-03-10 11:58:47] [INFO ] Flatten gal took : 239 ms
[2023-03-10 11:58:48] [INFO ] Input system was already deterministic with 8315 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 316 ms. (steps per millisecond=31 ) properties (out of 29) seen :28
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-10 11:58:49] [INFO ] Invariant cache hit.
[2023-03-10 11:58:51] [INFO ] [Real]Absence check using 0 positive and 1994 generalized place invariants in 743 ms returned sat
[2023-03-10 11:58:51] [INFO ] After 1890ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 11:58:53] [INFO ] [Nat]Absence check using 0 positive and 1994 generalized place invariants in 709 ms returned sat
[2023-03-10 11:59:10] [INFO ] After 19301ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 714 out of 9551 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9551/9551 places, 8315/8315 transitions.
Graph (complete) has 13669 edges and 9551 vertex of which 8730 are kept as prefixes of interest. Removing 821 places using SCC suffix rule.16 ms
Discarding 821 places :
Also discarding 716 output transitions
Drop transitions removed 716 transitions
Discarding 969 places :
Implicit places reduction removed 969 places
Drop transitions removed 3162 transitions
Trivial Post-agglo rules discarded 3162 transitions
Performed 3162 trivial Post agglomeration. Transition count delta: 3162
Iterating post reduction 0 with 4131 rules applied. Total rules applied 4132 place count 7761 transition count 4437
Reduce places removed 3162 places and 0 transitions.
Performed 306 Post agglomeration using F-continuation condition.Transition count delta: 306
Iterating post reduction 1 with 3468 rules applied. Total rules applied 7600 place count 4599 transition count 4131
Reduce places removed 306 places and 0 transitions.
Iterating post reduction 2 with 306 rules applied. Total rules applied 7906 place count 4293 transition count 4131
Performed 1020 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1020 Pre rules applied. Total rules applied 7906 place count 4293 transition count 3111
Deduced a syphon composed of 1020 places in 1 ms
Ensure Unique test removed 306 places
Reduce places removed 1326 places and 0 transitions.
Iterating global reduction 3 with 2346 rules applied. Total rules applied 10252 place count 2967 transition count 3111
Drop transitions removed 153 transitions
Trivial Post-agglo rules discarded 153 transitions
Performed 153 trivial Post agglomeration. Transition count delta: 153
Iterating post reduction 3 with 153 rules applied. Total rules applied 10405 place count 2967 transition count 2958
Reduce places removed 153 places and 0 transitions.
Iterating post reduction 4 with 153 rules applied. Total rules applied 10558 place count 2814 transition count 2958
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 51 Pre rules applied. Total rules applied 10558 place count 2814 transition count 2907
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 5 with 102 rules applied. Total rules applied 10660 place count 2763 transition count 2907
Discarding 362 places :
Symmetric choice reduction at 5 with 362 rule applications. Total rules 11022 place count 2401 transition count 2295
Iterating global reduction 5 with 362 rules applied. Total rules applied 11384 place count 2401 transition count 2295
Discarding 51 places :
Implicit places reduction removed 51 places
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 5 with 102 rules applied. Total rules applied 11486 place count 2350 transition count 2244
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 6 with 51 rules applied. Total rules applied 11537 place count 2299 transition count 2244
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 102 Pre rules applied. Total rules applied 11537 place count 2299 transition count 2142
Deduced a syphon composed of 102 places in 0 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 7 with 204 rules applied. Total rules applied 11741 place count 2197 transition count 2142
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 11743 place count 2195 transition count 2040
Iterating global reduction 7 with 2 rules applied. Total rules applied 11745 place count 2195 transition count 2040
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 102 places :
Implicit places reduction removed 102 places
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 7 with 255 rules applied. Total rules applied 12000 place count 2093 transition count 1887
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 8 with 51 rules applied. Total rules applied 12051 place count 2042 transition count 1887
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 51 Pre rules applied. Total rules applied 12051 place count 2042 transition count 1836
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 9 with 102 rules applied. Total rules applied 12153 place count 1991 transition count 1836
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 2 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 9 with 102 rules applied. Total rules applied 12255 place count 1940 transition count 1785
Free-agglomeration rule (complex) applied 357 times.
Iterating global reduction 9 with 357 rules applied. Total rules applied 12612 place count 1940 transition count 1428
Reduce places removed 357 places and 0 transitions.
Iterating post reduction 9 with 357 rules applied. Total rules applied 12969 place count 1583 transition count 1428
Applied a total of 12969 rules in 1122 ms. Remains 1583 /9551 variables (removed 7968) and now considering 1428/8315 (removed 6887) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1123 ms. Remains : 1583/9551 places, 1428/8315 transitions.
Finished random walk after 142 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=35 )
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 9551 stabilizing places and 8315 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 9551 transition count 8315
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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(X(G((X((!p1 U (!p2||G(!p1))))&&p0)))))))'
Support contains 153 out of 9551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9551/9551 places, 8315/8315 transitions.
Discarding 1326 places :
Implicit places reduction removed 1326 places
Iterating post reduction 0 with 1326 rules applied. Total rules applied 1326 place count 8225 transition count 8315
Discarding 362 places :
Symmetric choice reduction at 1 with 362 rule applications. Total rules 1688 place count 7863 transition count 7703
Iterating global reduction 1 with 362 rules applied. Total rules applied 2050 place count 7863 transition count 7703
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 2101 place count 7812 transition count 7703
Discarding 257 places :
Symmetric choice reduction at 2 with 257 rule applications. Total rules 2358 place count 7555 transition count 7346
Iterating global reduction 2 with 257 rules applied. Total rules applied 2615 place count 7555 transition count 7346
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 2 with 51 rules applied. Total rules applied 2666 place count 7504 transition count 7346
Discarding 357 places :
Symmetric choice reduction at 3 with 357 rule applications. Total rules 3023 place count 7147 transition count 6989
Iterating global reduction 3 with 357 rules applied. Total rules applied 3380 place count 7147 transition count 6989
Discarding 357 places :
Symmetric choice reduction at 3 with 357 rule applications. Total rules 3737 place count 6790 transition count 6632
Iterating global reduction 3 with 357 rules applied. Total rules applied 4094 place count 6790 transition count 6632
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 4349 place count 6535 transition count 6377
Iterating global reduction 3 with 255 rules applied. Total rules applied 4604 place count 6535 transition count 6377
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 4859 place count 6280 transition count 6122
Iterating global reduction 3 with 255 rules applied. Total rules applied 5114 place count 6280 transition count 6122
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 5369 place count 6025 transition count 5867
Iterating global reduction 3 with 255 rules applied. Total rules applied 5624 place count 6025 transition count 5867
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 5879 place count 5770 transition count 5612
Iterating global reduction 3 with 255 rules applied. Total rules applied 6134 place count 5770 transition count 5612
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 6389 place count 5515 transition count 5357
Iterating global reduction 3 with 255 rules applied. Total rules applied 6644 place count 5515 transition count 5357
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 6899 place count 5260 transition count 5102
Iterating global reduction 3 with 255 rules applied. Total rules applied 7154 place count 5260 transition count 5102
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 7409 place count 5005 transition count 4847
Iterating global reduction 3 with 255 rules applied. Total rules applied 7664 place count 5005 transition count 4847
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 7919 place count 4750 transition count 4592
Iterating global reduction 3 with 255 rules applied. Total rules applied 8174 place count 4750 transition count 4592
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 8429 place count 4495 transition count 4337
Iterating global reduction 3 with 255 rules applied. Total rules applied 8684 place count 4495 transition count 4337
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 8939 place count 4240 transition count 4082
Iterating global reduction 3 with 255 rules applied. Total rules applied 9194 place count 4240 transition count 4082
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 3 with 306 rules applied. Total rules applied 9500 place count 4189 transition count 3827
Applied a total of 9500 rules in 14597 ms. Remains 4189 /9551 variables (removed 5362) and now considering 3827/8315 (removed 4488) transitions.
// Phase 1: matrix 3827 rows 4189 cols
[2023-03-10 11:59:27] [INFO ] Computed 515 place invariants in 90 ms
[2023-03-10 11:59:28] [INFO ] Implicit Places using invariants in 1117 ms returned [1711, 1717, 1723, 2595]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 1126 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4185/9551 places, 3827/8315 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 4180 transition count 3822
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 4180 transition count 3822
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 4178 transition count 3818
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 4178 transition count 3818
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 4176 transition count 3816
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 4176 transition count 3816
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 4174 transition count 3814
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 4174 transition count 3814
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 4172 transition count 3812
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 4172 transition count 3812
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 4170 transition count 3810
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 4170 transition count 3810
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 4168 transition count 3808
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 4168 transition count 3808
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 4166 transition count 3806
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 4166 transition count 3806
Applied a total of 38 rules in 4298 ms. Remains 4166 /4185 variables (removed 19) and now considering 3806/3827 (removed 21) transitions.
// Phase 1: matrix 3806 rows 4166 cols
[2023-03-10 11:59:32] [INFO ] Computed 511 place invariants in 51 ms
[2023-03-10 11:59:33] [INFO ] Implicit Places using invariants in 1007 ms returned [2545]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1012 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 4165/9551 places, 3806/8315 transitions.
Applied a total of 0 rules in 472 ms. Remains 4165 /4165 variables (removed 0) and now considering 3806/3806 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 21508 ms. Remains : 4165/9551 places, 3806/8315 transitions.
Stuttering acceptance computed with spot in 350 ms :[true, (OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2))]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (AND p2 p1)), acceptance={} source=2 dest: 0}, { cond=(OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 4}]], initial=5, aps=[p0:(AND (OR (LT s2232 1) (LT s2436 1)) (OR (LT s2264 1) (LT s2468 1)) (OR (LT s2269 1) (LT s2473 1)) (OR (LT s2237 1) (LT s2441 1)) (OR (LT s2259 1) (LT s...], 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][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 937 steps with 0 reset in 22 ms.
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-01 finished in 21951 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)))'
Support contains 51 out of 9551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9551/9551 places, 8315/8315 transitions.
Discarding 1377 places :
Implicit places reduction removed 1377 places
Iterating post reduction 0 with 1377 rules applied. Total rules applied 1377 place count 8174 transition count 8315
Discarding 362 places :
Symmetric choice reduction at 1 with 362 rule applications. Total rules 1739 place count 7812 transition count 7703
Iterating global reduction 1 with 362 rules applied. Total rules applied 2101 place count 7812 transition count 7703
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 2152 place count 7761 transition count 7703
Discarding 257 places :
Symmetric choice reduction at 2 with 257 rule applications. Total rules 2409 place count 7504 transition count 7346
Iterating global reduction 2 with 257 rules applied. Total rules applied 2666 place count 7504 transition count 7346
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 2 with 51 rules applied. Total rules applied 2717 place count 7453 transition count 7346
Discarding 357 places :
Symmetric choice reduction at 3 with 357 rule applications. Total rules 3074 place count 7096 transition count 6989
Iterating global reduction 3 with 357 rules applied. Total rules applied 3431 place count 7096 transition count 6989
Discarding 357 places :
Symmetric choice reduction at 3 with 357 rule applications. Total rules 3788 place count 6739 transition count 6632
Iterating global reduction 3 with 357 rules applied. Total rules applied 4145 place count 6739 transition count 6632
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 4400 place count 6484 transition count 6377
Iterating global reduction 3 with 255 rules applied. Total rules applied 4655 place count 6484 transition count 6377
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 4910 place count 6229 transition count 6122
Iterating global reduction 3 with 255 rules applied. Total rules applied 5165 place count 6229 transition count 6122
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 5420 place count 5974 transition count 5867
Iterating global reduction 3 with 255 rules applied. Total rules applied 5675 place count 5974 transition count 5867
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 5930 place count 5719 transition count 5612
Iterating global reduction 3 with 255 rules applied. Total rules applied 6185 place count 5719 transition count 5612
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 6440 place count 5464 transition count 5357
Iterating global reduction 3 with 255 rules applied. Total rules applied 6695 place count 5464 transition count 5357
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 6950 place count 5209 transition count 5102
Iterating global reduction 3 with 255 rules applied. Total rules applied 7205 place count 5209 transition count 5102
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 7460 place count 4954 transition count 4847
Iterating global reduction 3 with 255 rules applied. Total rules applied 7715 place count 4954 transition count 4847
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 7970 place count 4699 transition count 4592
Iterating global reduction 3 with 255 rules applied. Total rules applied 8225 place count 4699 transition count 4592
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 8480 place count 4444 transition count 4337
Iterating global reduction 3 with 255 rules applied. Total rules applied 8735 place count 4444 transition count 4337
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 8990 place count 4189 transition count 4082
Iterating global reduction 3 with 255 rules applied. Total rules applied 9245 place count 4189 transition count 4082
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 3 with 306 rules applied. Total rules applied 9551 place count 4138 transition count 3827
Applied a total of 9551 rules in 16005 ms. Remains 4138 /9551 variables (removed 5413) and now considering 3827/8315 (removed 4488) transitions.
// Phase 1: matrix 3827 rows 4138 cols
[2023-03-10 11:59:50] [INFO ] Computed 464 place invariants in 47 ms
[2023-03-10 11:59:51] [INFO ] Implicit Places using invariants in 1048 ms returned [1711, 1717, 1723, 2536]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 1051 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4134/9551 places, 3827/8315 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 4129 transition count 3822
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 4129 transition count 3822
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 4127 transition count 3818
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 4127 transition count 3818
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 4125 transition count 3816
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 4125 transition count 3816
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 4123 transition count 3814
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 4123 transition count 3814
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 4121 transition count 3812
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 4121 transition count 3812
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 4119 transition count 3810
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 4119 transition count 3810
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 4117 transition count 3808
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 4117 transition count 3808
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 4115 transition count 3806
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 4115 transition count 3806
Applied a total of 38 rules in 4173 ms. Remains 4115 /4134 variables (removed 19) and now considering 3806/3827 (removed 21) transitions.
// Phase 1: matrix 3806 rows 4115 cols
[2023-03-10 11:59:55] [INFO ] Computed 460 place invariants in 45 ms
[2023-03-10 11:59:56] [INFO ] Implicit Places using invariants in 991 ms returned [2490, 2520]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 995 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 4113/9551 places, 3806/8315 transitions.
Applied a total of 0 rules in 447 ms. Remains 4113 /4113 variables (removed 0) and now considering 3806/3806 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 22675 ms. Remains : 4113/9551 places, 3806/8315 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (LT s3882 1) (LT s3884 1) (LT s3878 1) (LT s3880 1) (LT s3890 1) (LT s3892 1) (LT s3886 1) (LT s3888 1) (LT s3898 1) (LT s3900 1) (LT s3894 1) (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 2240 ms.
Product exploration explored 100000 steps with 50000 reset in 2162 ms.
Computed a total of 4113 stabilizing places and 3806 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4113 transition count 3806
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 78 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-02 finished in 28179 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(G(p1)))))'
Support contains 765 out of 9551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9551/9551 places, 8315/8315 transitions.
Discarding 1071 places :
Implicit places reduction removed 1071 places
Iterating post reduction 0 with 1071 rules applied. Total rules applied 1071 place count 8480 transition count 8315
Discarding 107 places :
Symmetric choice reduction at 1 with 107 rule applications. Total rules 1178 place count 8373 transition count 7958
Iterating global reduction 1 with 107 rules applied. Total rules applied 1285 place count 8373 transition count 7958
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 1336 place count 8322 transition count 7958
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1338 place count 8320 transition count 7856
Iterating global reduction 2 with 2 rules applied. Total rules applied 1340 place count 8320 transition count 7856
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 2 with 51 rules applied. Total rules applied 1391 place count 8269 transition count 7856
Applied a total of 1391 rules in 4935 ms. Remains 8269 /9551 variables (removed 1282) and now considering 7856/8315 (removed 459) transitions.
// Phase 1: matrix 7856 rows 8269 cols
[2023-03-10 12:00:07] [INFO ] Computed 821 place invariants in 146 ms
[2023-03-10 12:00:08] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 12:00:09] [INFO ] Implicit Places using invariants in 1933 ms returned [898]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1939 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 8268/9551 places, 7856/8315 transitions.
Applied a total of 0 rules in 1636 ms. Remains 8268 /8268 variables (removed 0) and now considering 7856/7856 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8512 ms. Remains : 8268/9551 places, 7856/8315 transitions.
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(OR (AND (GEQ s5207 1) (GEQ s5513 1)) (AND (GEQ s5059 1) (GEQ s5365 1)) (AND (GEQ s5202 1) (GEQ s5508 1)) (AND (GEQ s5054 1) (GEQ s5360 1)) (AND (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 34 reset in 1293 ms.
Product exploration explored 100000 steps with 34 reset in 1327 ms.
Computed a total of 8268 stabilizing places and 7856 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 8268 transition count 7856
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0))), (X (X p1)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 6 factoid took 138 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-04 finished in 13959 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 306 out of 9551 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9551/9551 places, 8315/8315 transitions.
Graph (complete) has 13669 edges and 9551 vertex of which 8730 are kept as prefixes of interest. Removing 821 places using SCC suffix rule.20 ms
Discarding 821 places :
Also discarding 716 output transitions
Drop transitions removed 716 transitions
Reduce places removed 51 places and 51 transitions.
Discarding 1275 places :
Implicit places reduction removed 1275 places
Drop transitions removed 4641 transitions
Trivial Post-agglo rules discarded 4641 transitions
Performed 4641 trivial Post agglomeration. Transition count delta: 4641
Iterating post reduction 0 with 5916 rules applied. Total rules applied 5917 place count 7404 transition count 2907
Reduce places removed 4641 places and 0 transitions.
Iterating post reduction 1 with 4641 rules applied. Total rules applied 10558 place count 2763 transition count 2907
Performed 765 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 765 Pre rules applied. Total rules applied 10558 place count 2763 transition count 2142
Deduced a syphon composed of 765 places in 1 ms
Ensure Unique test removed 306 places
Reduce places removed 1071 places and 0 transitions.
Iterating global reduction 2 with 1836 rules applied. Total rules applied 12394 place count 1692 transition count 2142
Drop transitions removed 153 transitions
Trivial Post-agglo rules discarded 153 transitions
Performed 153 trivial Post agglomeration. Transition count delta: 153
Iterating post reduction 2 with 153 rules applied. Total rules applied 12547 place count 1692 transition count 1989
Reduce places removed 153 places and 0 transitions.
Iterating post reduction 3 with 153 rules applied. Total rules applied 12700 place count 1539 transition count 1989
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 51 Pre rules applied. Total rules applied 12700 place count 1539 transition count 1938
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 4 with 102 rules applied. Total rules applied 12802 place count 1488 transition count 1938
Discarding 260 places :
Symmetric choice reduction at 4 with 260 rule applications. Total rules 13062 place count 1228 transition count 1428
Iterating global reduction 4 with 260 rules applied. Total rules applied 13322 place count 1228 transition count 1428
Discarding 51 places :
Implicit places reduction removed 51 places
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 4 with 102 rules applied. Total rules applied 13424 place count 1177 transition count 1377
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 5 with 51 rules applied. Total rules applied 13475 place count 1126 transition count 1377
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 51 Pre rules applied. Total rules applied 13475 place count 1126 transition count 1326
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 6 with 102 rules applied. Total rules applied 13577 place count 1075 transition count 1326
Discarding 255 places :
Symmetric choice reduction at 6 with 255 rule applications. Total rules 13832 place count 820 transition count 1071
Iterating global reduction 6 with 255 rules applied. Total rules applied 14087 place count 820 transition count 1071
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 6 with 255 rules applied. Total rules applied 14342 place count 820 transition count 816
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 51 Pre rules applied. Total rules applied 14342 place count 820 transition count 765
Deduced a syphon composed of 51 places in 0 ms
Ensure Unique test removed 51 places
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 7 with 153 rules applied. Total rules applied 14495 place count 718 transition count 765
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Ensure Unique test removed 51 places
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 7 with 153 rules applied. Total rules applied 14648 place count 616 transition count 714
Reduce places removed 51 places and 51 transitions.
Iterating global reduction 7 with 51 rules applied. Total rules applied 14699 place count 565 transition count 663
Applied a total of 14699 rules in 431 ms. Remains 565 /9551 variables (removed 8986) and now considering 663/8315 (removed 7652) transitions.
// Phase 1: matrix 663 rows 565 cols
[2023-03-10 12:00:16] [INFO ] Computed 104 place invariants in 3 ms
[2023-03-10 12:00:17] [INFO ] Implicit Places using invariants in 201 ms returned [204]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 203 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 564/9551 places, 663/8315 transitions.
Applied a total of 0 rules in 8 ms. Remains 564 /564 variables (removed 0) and now considering 663/663 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 643 ms. Remains : 564/9551 places, 663/8315 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (AND (GEQ s14 1) (GEQ s116 1)) (AND (GEQ s19 1) (GEQ s121 1)) (AND (GEQ s9 1) (GEQ s111 1)) (AND (GEQ s4 1) (GEQ s106 1)) (AND (GEQ s24 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 304 reset in 828 ms.
Product exploration explored 100000 steps with 304 reset in 830 ms.
Computed a total of 564 stabilizing places and 663 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 564 transition count 663
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 135 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Finished random walk after 337 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=67 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 163 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 663 rows 564 cols
[2023-03-10 12:00:19] [INFO ] Computed 103 place invariants in 9 ms
[2023-03-10 12:00:22] [INFO ] [Real]Absence check using 0 positive and 103 generalized place invariants in 88 ms returned sat
[2023-03-10 12:00:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 12:00:23] [INFO ] [Real]Absence check using state equation in 571 ms returned sat
[2023-03-10 12:00:23] [INFO ] Computed and/alt/rep : 357/765/357 causal constraints (skipped 153 transitions) in 45 ms.
[2023-03-10 12:00:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 12:00:26] [INFO ] [Nat]Absence check using 0 positive and 103 generalized place invariants in 69 ms returned sat
[2023-03-10 12:00:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 12:00:27] [INFO ] [Nat]Absence check using state equation in 661 ms returned sat
[2023-03-10 12:00:27] [INFO ] Computed and/alt/rep : 357/765/357 causal constraints (skipped 153 transitions) in 58 ms.
[2023-03-10 12:00:29] [INFO ] Added : 226 causal constraints over 46 iterations in 2058 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 306 out of 564 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 564/564 places, 663/663 transitions.
Applied a total of 0 rules in 11 ms. Remains 564 /564 variables (removed 0) and now considering 663/663 (removed 0) transitions.
[2023-03-10 12:00:29] [INFO ] Invariant cache hit.
[2023-03-10 12:00:29] [INFO ] Implicit Places using invariants in 114 ms returned []
[2023-03-10 12:00:29] [INFO ] Invariant cache hit.
[2023-03-10 12:00:30] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
[2023-03-10 12:00:30] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-10 12:00:30] [INFO ] Invariant cache hit.
[2023-03-10 12:00:30] [INFO ] Dead Transitions using invariants and state equation in 232 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 645 ms. Remains : 564/564 places, 663/663 transitions.
Computed a total of 564 stabilizing places and 663 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 564 transition count 663
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 135 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Finished random walk after 323 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=64 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 165 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
[2023-03-10 12:00:31] [INFO ] Invariant cache hit.
[2023-03-10 12:00:34] [INFO ] [Real]Absence check using 0 positive and 103 generalized place invariants in 94 ms returned sat
[2023-03-10 12:00:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 12:00:34] [INFO ] [Real]Absence check using state equation in 600 ms returned sat
[2023-03-10 12:00:34] [INFO ] Computed and/alt/rep : 357/765/357 causal constraints (skipped 153 transitions) in 49 ms.
[2023-03-10 12:00:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 12:00:38] [INFO ] [Nat]Absence check using 0 positive and 103 generalized place invariants in 69 ms returned sat
[2023-03-10 12:00:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 12:00:38] [INFO ] [Nat]Absence check using state equation in 584 ms returned sat
[2023-03-10 12:00:38] [INFO ] Computed and/alt/rep : 357/765/357 causal constraints (skipped 153 transitions) in 33 ms.
[2023-03-10 12:00:40] [INFO ] Added : 220 causal constraints over 44 iterations in 1935 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 304 reset in 796 ms.
Product exploration explored 100000 steps with 304 reset in 802 ms.
Support contains 306 out of 564 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 564/564 places, 663/663 transitions.
Applied a total of 0 rules in 6 ms. Remains 564 /564 variables (removed 0) and now considering 663/663 (removed 0) transitions.
[2023-03-10 12:00:42] [INFO ] Invariant cache hit.
[2023-03-10 12:00:42] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-10 12:00:42] [INFO ] Invariant cache hit.
[2023-03-10 12:00:42] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
[2023-03-10 12:00:42] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-10 12:00:42] [INFO ] Invariant cache hit.
[2023-03-10 12:00:43] [INFO ] Dead Transitions using invariants and state equation in 229 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 601 ms. Remains : 564/564 places, 663/663 transitions.
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-06 finished in 27106 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)))'
Support contains 102 out of 9551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9551/9551 places, 8315/8315 transitions.
Discarding 1326 places :
Implicit places reduction removed 1326 places
Iterating post reduction 0 with 1326 rules applied. Total rules applied 1326 place count 8225 transition count 8315
Discarding 362 places :
Symmetric choice reduction at 1 with 362 rule applications. Total rules 1688 place count 7863 transition count 7703
Iterating global reduction 1 with 362 rules applied. Total rules applied 2050 place count 7863 transition count 7703
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 2101 place count 7812 transition count 7703
Discarding 257 places :
Symmetric choice reduction at 2 with 257 rule applications. Total rules 2358 place count 7555 transition count 7346
Iterating global reduction 2 with 257 rules applied. Total rules applied 2615 place count 7555 transition count 7346
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 2 with 51 rules applied. Total rules applied 2666 place count 7504 transition count 7346
Discarding 357 places :
Symmetric choice reduction at 3 with 357 rule applications. Total rules 3023 place count 7147 transition count 6989
Iterating global reduction 3 with 357 rules applied. Total rules applied 3380 place count 7147 transition count 6989
Discarding 357 places :
Symmetric choice reduction at 3 with 357 rule applications. Total rules 3737 place count 6790 transition count 6632
Iterating global reduction 3 with 357 rules applied. Total rules applied 4094 place count 6790 transition count 6632
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 4349 place count 6535 transition count 6377
Iterating global reduction 3 with 255 rules applied. Total rules applied 4604 place count 6535 transition count 6377
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 4859 place count 6280 transition count 6122
Iterating global reduction 3 with 255 rules applied. Total rules applied 5114 place count 6280 transition count 6122
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 5369 place count 6025 transition count 5867
Iterating global reduction 3 with 255 rules applied. Total rules applied 5624 place count 6025 transition count 5867
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 5879 place count 5770 transition count 5612
Iterating global reduction 3 with 255 rules applied. Total rules applied 6134 place count 5770 transition count 5612
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 6389 place count 5515 transition count 5357
Iterating global reduction 3 with 255 rules applied. Total rules applied 6644 place count 5515 transition count 5357
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 6899 place count 5260 transition count 5102
Iterating global reduction 3 with 255 rules applied. Total rules applied 7154 place count 5260 transition count 5102
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 7409 place count 5005 transition count 4847
Iterating global reduction 3 with 255 rules applied. Total rules applied 7664 place count 5005 transition count 4847
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 7919 place count 4750 transition count 4592
Iterating global reduction 3 with 255 rules applied. Total rules applied 8174 place count 4750 transition count 4592
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 8429 place count 4495 transition count 4337
Iterating global reduction 3 with 255 rules applied. Total rules applied 8684 place count 4495 transition count 4337
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 8939 place count 4240 transition count 4082
Iterating global reduction 3 with 255 rules applied. Total rules applied 9194 place count 4240 transition count 4082
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 3 with 306 rules applied. Total rules applied 9500 place count 4189 transition count 3827
Applied a total of 9500 rules in 15315 ms. Remains 4189 /9551 variables (removed 5362) and now considering 3827/8315 (removed 4488) transitions.
// Phase 1: matrix 3827 rows 4189 cols
[2023-03-10 12:00:58] [INFO ] Computed 515 place invariants in 45 ms
[2023-03-10 12:00:59] [INFO ] Implicit Places using invariants in 976 ms returned [1743, 1749, 2562, 2595]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 981 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4185/9551 places, 3827/8315 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 4182 transition count 3824
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 4182 transition count 3824
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 4181 transition count 3822
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 4181 transition count 3822
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 4180 transition count 3821
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 4180 transition count 3821
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 4179 transition count 3820
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 4179 transition count 3820
Applied a total of 12 rules in 2289 ms. Remains 4179 /4185 variables (removed 6) and now considering 3820/3827 (removed 7) transitions.
// Phase 1: matrix 3820 rows 4179 cols
[2023-03-10 12:01:02] [INFO ] Computed 511 place invariants in 45 ms
[2023-03-10 12:01:03] [INFO ] Implicit Places using invariants in 969 ms returned [2565]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 972 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 4178/9551 places, 3820/8315 transitions.
Applied a total of 0 rules in 432 ms. Remains 4178 /4178 variables (removed 0) and now considering 3820/3820 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 19991 ms. Remains : 4178/9551 places, 3820/8315 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s1048 1) (LT s1457 1)) (OR (LT s1021 1) (LT s1430 1)) (OR (LT s1033 1) (LT s1442 1)) (OR (LT s1043 1) (LT s1452 1)) (OR (LT s1053 1) (LT s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 2154 ms.
Product exploration explored 100000 steps with 50000 reset in 2178 ms.
Computed a total of 4178 stabilizing places and 3820 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4178 transition count 3820
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 58 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-07 finished in 25404 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(G((X((!p1 U (!p2||G(!p1))))&&p0)))))'
Support contains 204 out of 9551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9551/9551 places, 8315/8315 transitions.
Discarding 1377 places :
Implicit places reduction removed 1377 places
Iterating post reduction 0 with 1377 rules applied. Total rules applied 1377 place count 8174 transition count 8315
Discarding 362 places :
Symmetric choice reduction at 1 with 362 rule applications. Total rules 1739 place count 7812 transition count 7703
Iterating global reduction 1 with 362 rules applied. Total rules applied 2101 place count 7812 transition count 7703
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 2152 place count 7761 transition count 7703
Discarding 257 places :
Symmetric choice reduction at 2 with 257 rule applications. Total rules 2409 place count 7504 transition count 7346
Iterating global reduction 2 with 257 rules applied. Total rules applied 2666 place count 7504 transition count 7346
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 2 with 51 rules applied. Total rules applied 2717 place count 7453 transition count 7346
Discarding 357 places :
Symmetric choice reduction at 3 with 357 rule applications. Total rules 3074 place count 7096 transition count 6989
Iterating global reduction 3 with 357 rules applied. Total rules applied 3431 place count 7096 transition count 6989
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 3686 place count 6841 transition count 6734
Iterating global reduction 3 with 255 rules applied. Total rules applied 3941 place count 6841 transition count 6734
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 4196 place count 6586 transition count 6479
Iterating global reduction 3 with 255 rules applied. Total rules applied 4451 place count 6586 transition count 6479
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 4706 place count 6331 transition count 6224
Iterating global reduction 3 with 255 rules applied. Total rules applied 4961 place count 6331 transition count 6224
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 5216 place count 6076 transition count 5969
Iterating global reduction 3 with 255 rules applied. Total rules applied 5471 place count 6076 transition count 5969
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 5726 place count 5821 transition count 5714
Iterating global reduction 3 with 255 rules applied. Total rules applied 5981 place count 5821 transition count 5714
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 6236 place count 5566 transition count 5459
Iterating global reduction 3 with 255 rules applied. Total rules applied 6491 place count 5566 transition count 5459
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 6746 place count 5311 transition count 5204
Iterating global reduction 3 with 255 rules applied. Total rules applied 7001 place count 5311 transition count 5204
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 7256 place count 5056 transition count 4949
Iterating global reduction 3 with 255 rules applied. Total rules applied 7511 place count 5056 transition count 4949
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 7766 place count 4801 transition count 4694
Iterating global reduction 3 with 255 rules applied. Total rules applied 8021 place count 4801 transition count 4694
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 8276 place count 4546 transition count 4439
Iterating global reduction 3 with 255 rules applied. Total rules applied 8531 place count 4546 transition count 4439
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 8786 place count 4291 transition count 4184
Iterating global reduction 3 with 255 rules applied. Total rules applied 9041 place count 4291 transition count 4184
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 3 with 306 rules applied. Total rules applied 9347 place count 4240 transition count 3929
Applied a total of 9347 rules in 15342 ms. Remains 4240 /9551 variables (removed 5311) and now considering 3929/8315 (removed 4386) transitions.
// Phase 1: matrix 3929 rows 4240 cols
[2023-03-10 12:01:24] [INFO ] Computed 464 place invariants in 50 ms
[2023-03-10 12:01:25] [INFO ] Implicit Places using invariants in 990 ms returned [1711, 1717, 1723]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 993 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4237/9551 places, 3929/8315 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 4232 transition count 3924
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 4232 transition count 3924
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 4230 transition count 3920
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 4230 transition count 3920
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 4228 transition count 3918
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 4228 transition count 3918
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 4226 transition count 3916
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 4226 transition count 3916
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 4224 transition count 3914
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 4224 transition count 3914
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 4222 transition count 3912
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 4222 transition count 3912
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 4220 transition count 3910
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 4220 transition count 3910
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 4218 transition count 3908
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 4218 transition count 3908
Applied a total of 38 rules in 4070 ms. Remains 4218 /4237 variables (removed 19) and now considering 3908/3929 (removed 21) transitions.
// Phase 1: matrix 3908 rows 4218 cols
[2023-03-10 12:01:29] [INFO ] Computed 461 place invariants in 44 ms
[2023-03-10 12:01:30] [INFO ] Implicit Places using invariants in 993 ms returned [2486, 3605]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1009 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 4216/9551 places, 3908/8315 transitions.
Applied a total of 0 rules in 439 ms. Remains 4216 /4216 variables (removed 0) and now considering 3908/3908 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 21854 ms. Remains : 4216/9551 places, 3908/8315 transitions.
Stuttering acceptance computed with spot in 171 ms :[true, (OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2))]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (AND p2 p1)), acceptance={} source=2 dest: 0}, { cond=(OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(AND (LT s406 1) (LT s371 1) (LT s369 1) (LT s367 1) (LT s365 1) (LT s363 1) (LT s361 1) (LT s359 1) (LT s357 1) (LT s387 1) (LT s385 1) (LT s383 1) (L...], 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1719 steps with 0 reset in 25 ms.
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-08 finished in 22092 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((((!p1 U (p2||G(!p1)))||p0) U (p3&&X(G(p4))))))'
Support contains 204 out of 9551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9551/9551 places, 8315/8315 transitions.
Discarding 1377 places :
Implicit places reduction removed 1377 places
Iterating post reduction 0 with 1377 rules applied. Total rules applied 1377 place count 8174 transition count 8315
Discarding 362 places :
Symmetric choice reduction at 1 with 362 rule applications. Total rules 1739 place count 7812 transition count 7703
Iterating global reduction 1 with 362 rules applied. Total rules applied 2101 place count 7812 transition count 7703
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 2152 place count 7761 transition count 7703
Discarding 257 places :
Symmetric choice reduction at 2 with 257 rule applications. Total rules 2409 place count 7504 transition count 7346
Iterating global reduction 2 with 257 rules applied. Total rules applied 2666 place count 7504 transition count 7346
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 2 with 51 rules applied. Total rules applied 2717 place count 7453 transition count 7346
Discarding 357 places :
Symmetric choice reduction at 3 with 357 rule applications. Total rules 3074 place count 7096 transition count 6989
Iterating global reduction 3 with 357 rules applied. Total rules applied 3431 place count 7096 transition count 6989
Discarding 357 places :
Symmetric choice reduction at 3 with 357 rule applications. Total rules 3788 place count 6739 transition count 6632
Iterating global reduction 3 with 357 rules applied. Total rules applied 4145 place count 6739 transition count 6632
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 4400 place count 6484 transition count 6377
Iterating global reduction 3 with 255 rules applied. Total rules applied 4655 place count 6484 transition count 6377
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 4910 place count 6229 transition count 6122
Iterating global reduction 3 with 255 rules applied. Total rules applied 5165 place count 6229 transition count 6122
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 5420 place count 5974 transition count 5867
Iterating global reduction 3 with 255 rules applied. Total rules applied 5675 place count 5974 transition count 5867
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 5930 place count 5719 transition count 5612
Iterating global reduction 3 with 255 rules applied. Total rules applied 6185 place count 5719 transition count 5612
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 6440 place count 5464 transition count 5357
Iterating global reduction 3 with 255 rules applied. Total rules applied 6695 place count 5464 transition count 5357
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 6950 place count 5209 transition count 5102
Iterating global reduction 3 with 255 rules applied. Total rules applied 7205 place count 5209 transition count 5102
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 7460 place count 4954 transition count 4847
Iterating global reduction 3 with 255 rules applied. Total rules applied 7715 place count 4954 transition count 4847
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 7970 place count 4699 transition count 4592
Iterating global reduction 3 with 255 rules applied. Total rules applied 8225 place count 4699 transition count 4592
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 8480 place count 4444 transition count 4337
Iterating global reduction 3 with 255 rules applied. Total rules applied 8735 place count 4444 transition count 4337
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 8990 place count 4189 transition count 4082
Iterating global reduction 3 with 255 rules applied. Total rules applied 9245 place count 4189 transition count 4082
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 3 with 306 rules applied. Total rules applied 9551 place count 4138 transition count 3827
Applied a total of 9551 rules in 14839 ms. Remains 4138 /9551 variables (removed 5413) and now considering 3827/8315 (removed 4488) transitions.
// Phase 1: matrix 3827 rows 4138 cols
[2023-03-10 12:01:45] [INFO ] Computed 464 place invariants in 45 ms
[2023-03-10 12:01:46] [INFO ] Implicit Places using invariants in 974 ms returned [1711, 1717, 1723, 2536]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 977 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4134/9551 places, 3827/8315 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 4129 transition count 3822
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 4129 transition count 3822
Applied a total of 10 rules in 874 ms. Remains 4129 /4134 variables (removed 5) and now considering 3822/3827 (removed 5) transitions.
// Phase 1: matrix 3822 rows 4129 cols
[2023-03-10 12:01:47] [INFO ] Computed 460 place invariants in 78 ms
[2023-03-10 12:01:48] [INFO ] Implicit Places using invariants in 1008 ms returned [2499, 2533]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1011 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 4127/9551 places, 3822/8315 transitions.
Applied a total of 0 rules in 422 ms. Remains 4127 /4127 variables (removed 0) and now considering 3822/3822 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 18125 ms. Remains : 4127/9551 places, 3822/8315 transitions.
Stuttering acceptance computed with spot in 291 ms :[(OR (NOT p3) (NOT p4)), true, (NOT p4), (AND (NOT p2) p1), (OR (NOT p3) (NOT p4)), (OR (AND p1 (NOT p2) p3 (NOT p4)) (AND p0 p1 (NOT p2) (NOT p4))), (NOT p4)]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(OR p3 p0 p2 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 1}, { cond=(AND p3 (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(OR (AND (NOT p3) p0) (AND (NOT p3) p2) (AND (NOT p3) (NOT p1))), acceptance={} source=0 dest: 4}, { cond=(AND p3 (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 5}, { cond=(OR (AND p3 p0) (AND p3 p2) (AND p3 (NOT p1))), acceptance={} source=0 dest: 6}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p4), acceptance={} source=2 dest: 1}, { cond=p4, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p2) p1), acceptance={} source=4 dest: 1}, { cond=(AND p3 (NOT p0) (NOT p2) p1), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(OR (AND (NOT p3) p0) (AND (NOT p3) p2) (AND (NOT p3) (NOT p1))), acceptance={0} source=4 dest: 4}, { cond=(AND p3 (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(OR (AND p3 p0) (AND p3 p2) (AND p3 (NOT p1))), acceptance={0} source=4 dest: 6}], [{ cond=(OR (AND p3 (NOT p2) p1 (NOT p4)) (AND p0 (NOT p2) p1 (NOT p4))), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p2) p1 p4), acceptance={} source=5 dest: 2}, { cond=(OR (AND p3 (NOT p2) (NOT p1) (NOT p4)) (AND p0 (NOT p2) (NOT p1) (NOT p4))), acceptance={} source=5 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1) p4), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p2) p1 (NOT p4)), acceptance={} source=6 dest: 1}, { cond=(OR (AND p3 (NOT p0) (NOT p2) p1) (AND (NOT p0) (NOT p2) p1 p4)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1) (NOT p4)), acceptance={} source=6 dest: 3}, { cond=(OR (AND (NOT p3) p0 (NOT p4)) (AND (NOT p3) p2 (NOT p4)) (AND (NOT p3) (NOT p1) (NOT p4))), acceptance={0} source=6 dest: 4}, { cond=(OR (AND p3 (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p1) p4)), acceptance={} source=6 dest: 5}, { cond=(OR (AND p0 p4) (AND p2 p4) (AND (NOT p1) p4)), acceptance={} source=6 dest: 6}, { cond=(OR (AND p3 p0 (NOT p4)) (AND p3 p2 (NOT p4)) (AND p3 (NOT p1) (NOT p4))), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p3:(OR (GEQ s3766 1) (GEQ s3764 1) (GEQ s3768 1) (GEQ s3719 1) (GEQ s3723 1) (GEQ s3721 1) (GEQ s3727 1) (GEQ s3725 1) (GEQ s3731 1) (GEQ s3729 1) (GEQ s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 514 steps with 0 reset in 31 ms.
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-09 finished in 18487 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 51 out of 9551 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9551/9551 places, 8315/8315 transitions.
Graph (complete) has 13669 edges and 9551 vertex of which 6534 are kept as prefixes of interest. Removing 3017 places using SCC suffix rule.12 ms
Discarding 3017 places :
Also discarding 2552 output transitions
Drop transitions removed 2552 transitions
Reduce places removed 51 places and 51 transitions.
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 1275 places :
Implicit places reduction removed 1275 places
Drop transitions removed 4131 transitions
Trivial Post-agglo rules discarded 4131 transitions
Performed 4131 trivial Post agglomeration. Transition count delta: 4131
Iterating post reduction 0 with 5508 rules applied. Total rules applied 5509 place count 5208 transition count 1479
Reduce places removed 4131 places and 0 transitions.
Iterating post reduction 1 with 4131 rules applied. Total rules applied 9640 place count 1077 transition count 1479
Performed 153 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 153 Pre rules applied. Total rules applied 9640 place count 1077 transition count 1326
Deduced a syphon composed of 153 places in 0 ms
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 2 with 306 rules applied. Total rules applied 9946 place count 924 transition count 1326
Discarding 260 places :
Symmetric choice reduction at 2 with 260 rule applications. Total rules 10206 place count 664 transition count 816
Iterating global reduction 2 with 260 rules applied. Total rules applied 10466 place count 664 transition count 816
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 2 with 51 rules applied. Total rules applied 10517 place count 613 transition count 816
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 51 Pre rules applied. Total rules applied 10517 place count 613 transition count 765
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 10619 place count 562 transition count 765
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 10874 place count 307 transition count 510
Iterating global reduction 3 with 255 rules applied. Total rules applied 11129 place count 307 transition count 510
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 3 with 255 rules applied. Total rules applied 11384 place count 307 transition count 255
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 51 Pre rules applied. Total rules applied 11384 place count 307 transition count 204
Deduced a syphon composed of 51 places in 1 ms
Ensure Unique test removed 51 places
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 4 with 153 rules applied. Total rules applied 11537 place count 205 transition count 204
Reduce places removed 51 places and 51 transitions.
Iterating global reduction 4 with 51 rules applied. Total rules applied 11588 place count 154 transition count 153
Applied a total of 11588 rules in 142 ms. Remains 154 /9551 variables (removed 9397) and now considering 153/8315 (removed 8162) transitions.
// Phase 1: matrix 153 rows 154 cols
[2023-03-10 12:01:49] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-10 12:01:49] [INFO ] Implicit Places using invariants in 290 ms returned [51]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 292 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 153/9551 places, 153/8315 transitions.
Reduce places removed 51 places and 51 transitions.
Applied a total of 0 rules in 1 ms. Remains 102 /153 variables (removed 51) and now considering 102/153 (removed 51) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 435 ms. Remains : 102/9551 places, 102/8315 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s57 1) (GEQ s55 1) (GEQ s61 1) (GEQ s59 1) (GEQ s53 1) (GEQ s51 1) (GEQ s73 1) (GEQ s71 1) (GEQ s77 1) (GEQ s75 1) (GEQ s65 1) (GEQ s63 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 104 steps with 1 reset in 0 ms.
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-10 finished in 504 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(F(p0)) U G(p1))))'
Support contains 108 out of 9551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9551/9551 places, 8315/8315 transitions.
Discarding 1377 places :
Implicit places reduction removed 1377 places
Iterating post reduction 0 with 1377 rules applied. Total rules applied 1377 place count 8174 transition count 8315
Discarding 357 places :
Symmetric choice reduction at 1 with 357 rule applications. Total rules 1734 place count 7817 transition count 7958
Iterating global reduction 1 with 357 rules applied. Total rules applied 2091 place count 7817 transition count 7958
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 2093 place count 7815 transition count 7856
Iterating global reduction 1 with 2 rules applied. Total rules applied 2095 place count 7815 transition count 7856
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 2146 place count 7764 transition count 7856
Discarding 102 places :
Symmetric choice reduction at 2 with 102 rule applications. Total rules 2248 place count 7662 transition count 7754
Iterating global reduction 2 with 102 rules applied. Total rules applied 2350 place count 7662 transition count 7754
Discarding 102 places :
Symmetric choice reduction at 2 with 102 rule applications. Total rules 2452 place count 7560 transition count 7652
Iterating global reduction 2 with 102 rules applied. Total rules applied 2554 place count 7560 transition count 7652
Applied a total of 2554 rules in 8362 ms. Remains 7560 /9551 variables (removed 1991) and now considering 7652/8315 (removed 663) transitions.
// Phase 1: matrix 7652 rows 7560 cols
[2023-03-10 12:01:58] [INFO ] Computed 566 place invariants in 98 ms
[2023-03-10 12:01:59] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 12:02:00] [INFO ] Implicit Places using invariants in 1837 ms returned [898]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1843 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 7559/9551 places, 7652/8315 transitions.
Applied a total of 0 rules in 1564 ms. Remains 7559 /7559 variables (removed 0) and now considering 7652/7652 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 11771 ms. Remains : 7559/9551 places, 7652/8315 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (AND (GEQ s5314 1) (GEQ s5360 1)) (AND (GEQ s5324 1) (GEQ s5362 1)) (AND (GEQ s5334 1) (GEQ s5364 1)) (AND (GEQ s5353 1) (GEQ s5362 1)) (AND (GEQ s...], 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 128 reset in 826 ms.
Product exploration explored 100000 steps with 141 reset in 886 ms.
Computed a total of 7559 stabilizing places and 7652 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 7559 transition count 7652
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 332 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Finished random walk after 1509 steps, including 0 resets, run visited all 4 properties in 35 ms. (steps per millisecond=43 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F p1), (F p0), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 465 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
// Phase 1: matrix 7652 rows 7559 cols
[2023-03-10 12:02:07] [INFO ] Computed 565 place invariants in 94 ms
[2023-03-10 12:02:21] [INFO ] [Real]Absence check using 0 positive and 565 generalized place invariants in 1201 ms returned sat
[2023-03-10 12:02:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 12:02:22] [INFO ] [Real]Absence check using state equation in 731 ms returned unknown
Could not prove EG (NOT p1)
[2023-03-10 12:02:22] [INFO ] Invariant cache hit.
[2023-03-10 12:02:30] [INFO ] [Real]Absence check using 0 positive and 565 generalized place invariants in 840 ms returned sat
[2023-03-10 12:02:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 12:02:37] [INFO ] [Real]Absence check using state equation in 6677 ms returned unknown
Could not prove EG (NOT p0)
Support contains 108 out of 7559 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7559/7559 places, 7652/7652 transitions.
Graph (complete) has 9837 edges and 7559 vertex of which 6636 are kept as prefixes of interest. Removing 923 places using SCC suffix rule.8 ms
Discarding 923 places :
Also discarding 869 output transitions
Drop transitions removed 869 transitions
Reduce places removed 51 places and 51 transitions.
Drop transitions removed 4239 transitions
Trivial Post-agglo rules discarded 4239 transitions
Performed 4239 trivial Post agglomeration. Transition count delta: 4239
Iterating post reduction 0 with 4239 rules applied. Total rules applied 4240 place count 6585 transition count 2493
Reduce places removed 4239 places and 0 transitions.
Iterating post reduction 1 with 4239 rules applied. Total rules applied 8479 place count 2346 transition count 2493
Performed 714 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 714 Pre rules applied. Total rules applied 8479 place count 2346 transition count 1779
Deduced a syphon composed of 714 places in 0 ms
Ensure Unique test removed 306 places
Reduce places removed 1020 places and 0 transitions.
Iterating global reduction 2 with 1734 rules applied. Total rules applied 10213 place count 1326 transition count 1779
Drop transitions removed 153 transitions
Trivial Post-agglo rules discarded 153 transitions
Performed 153 trivial Post agglomeration. Transition count delta: 153
Iterating post reduction 2 with 153 rules applied. Total rules applied 10366 place count 1326 transition count 1626
Reduce places removed 153 places and 0 transitions.
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Iterating post reduction 3 with 255 rules applied. Total rules applied 10621 place count 1173 transition count 1524
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 1 ms
Ensure Unique test removed 51 places
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 4 with 153 rules applied. Total rules applied 10774 place count 1071 transition count 1473
Applied a total of 10774 rules in 235 ms. Remains 1071 /7559 variables (removed 6488) and now considering 1473/7652 (removed 6179) transitions.
// Phase 1: matrix 1473 rows 1071 cols
[2023-03-10 12:02:37] [INFO ] Computed 103 place invariants in 15 ms
[2023-03-10 12:02:38] [INFO ] Implicit Places using invariants in 372 ms returned [402, 403, 404, 405, 406, 407, 408, 409, 410, 411, 412, 413, 414, 415, 416, 417, 418, 419, 420, 421, 422, 423, 424, 425, 426, 427, 428, 429, 430, 431, 432, 433, 434, 435, 436, 437, 438, 439, 440, 441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451, 917, 918, 919, 920, 921, 922, 923, 924, 925, 926, 927, 928, 929, 930, 931, 932, 933, 934, 935, 936, 937, 938, 939, 940, 941, 942, 943, 944, 945, 946, 947, 948, 949, 950, 951, 952, 953, 954, 955, 956, 957, 958, 959, 960, 961, 962, 963, 964, 965, 966, 967, 1019]
Discarding 102 places :
Implicit Place search using SMT only with invariants took 374 ms to find 102 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 969/7559 places, 1473/7652 transitions.
Drop transitions removed 351 transitions
Trivial Post-agglo rules discarded 351 transitions
Performed 351 trivial Post agglomeration. Transition count delta: 351
Iterating post reduction 0 with 351 rules applied. Total rules applied 351 place count 969 transition count 1122
Reduce places removed 351 places and 0 transitions.
Iterating post reduction 1 with 351 rules applied. Total rules applied 702 place count 618 transition count 1122
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 702 place count 618 transition count 1071
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 804 place count 567 transition count 1071
Applied a total of 804 rules in 25 ms. Remains 567 /969 variables (removed 402) and now considering 1071/1473 (removed 402) transitions.
// Phase 1: matrix 1071 rows 567 cols
[2023-03-10 12:02:38] [INFO ] Computed 1 place invariants in 11 ms
[2023-03-10 12:02:38] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-10 12:02:38] [INFO ] Invariant cache hit.
[2023-03-10 12:02:38] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 567/7559 places, 1071/7652 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 941 ms. Remains : 567/7559 places, 1071/7652 transitions.
Computed a total of 567 stabilizing places and 1071 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 567 transition count 1071
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 473 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Finished random walk after 88 steps, including 0 resets, run visited all 4 properties in 4 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F p1), (F p0), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 483 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
[2023-03-10 12:02:43] [INFO ] Invariant cache hit.
[2023-03-10 12:02:46] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 6 ms returned sat
[2023-03-10 12:02:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 12:02:46] [INFO ] [Real]Absence check using state equation in 449 ms returned sat
[2023-03-10 12:02:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 12:02:50] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-10 12:02:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 12:02:50] [INFO ] [Nat]Absence check using state equation in 451 ms returned sat
[2023-03-10 12:02:50] [INFO ] Computed and/alt/rep : 459/969/459 causal constraints (skipped 306 transitions) in 51 ms.
[2023-03-10 12:02:51] [INFO ] Added : 51 causal constraints over 11 iterations in 577 ms. Result :sat
Could not prove EG (NOT p1)
[2023-03-10 12:02:51] [INFO ] Invariant cache hit.
[2023-03-10 12:02:51] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-10 12:02:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 12:02:51] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2023-03-10 12:02:51] [INFO ] Computed and/alt/rep : 459/969/459 causal constraints (skipped 306 transitions) in 51 ms.
[2023-03-10 12:02:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 12:02:52] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-10 12:02:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 12:02:52] [INFO ] [Nat]Absence check using state equation in 191 ms returned sat
[2023-03-10 12:02:52] [INFO ] Computed and/alt/rep : 459/969/459 causal constraints (skipped 306 transitions) in 51 ms.
[2023-03-10 12:02:54] [INFO ] Added : 134 causal constraints over 28 iterations in 1392 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 2379 reset in 1076 ms.
Product exploration explored 100000 steps with 2323 reset in 1090 ms.
Support contains 108 out of 567 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 567/567 places, 1071/1071 transitions.
Applied a total of 0 rules in 13 ms. Remains 567 /567 variables (removed 0) and now considering 1071/1071 (removed 0) transitions.
[2023-03-10 12:02:56] [INFO ] Invariant cache hit.
[2023-03-10 12:02:56] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-10 12:02:56] [INFO ] Invariant cache hit.
[2023-03-10 12:02:56] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
[2023-03-10 12:02:56] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-10 12:02:56] [INFO ] Invariant cache hit.
[2023-03-10 12:02:57] [INFO ] Dead Transitions using invariants and state equation in 306 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 752 ms. Remains : 567/567 places, 1071/1071 transitions.
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-11 finished in 67466 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((G(p0)&&F(p1)))))'
Support contains 357 out of 9551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9551/9551 places, 8315/8315 transitions.
Discarding 1377 places :
Implicit places reduction removed 1377 places
Iterating post reduction 0 with 1377 rules applied. Total rules applied 1377 place count 8174 transition count 8315
Discarding 362 places :
Symmetric choice reduction at 1 with 362 rule applications. Total rules 1739 place count 7812 transition count 7703
Iterating global reduction 1 with 362 rules applied. Total rules applied 2101 place count 7812 transition count 7703
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 2152 place count 7761 transition count 7703
Discarding 257 places :
Symmetric choice reduction at 2 with 257 rule applications. Total rules 2409 place count 7504 transition count 7346
Iterating global reduction 2 with 257 rules applied. Total rules applied 2666 place count 7504 transition count 7346
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 2 with 51 rules applied. Total rules applied 2717 place count 7453 transition count 7346
Discarding 357 places :
Symmetric choice reduction at 3 with 357 rule applications. Total rules 3074 place count 7096 transition count 6989
Iterating global reduction 3 with 357 rules applied. Total rules applied 3431 place count 7096 transition count 6989
Discarding 357 places :
Symmetric choice reduction at 3 with 357 rule applications. Total rules 3788 place count 6739 transition count 6632
Iterating global reduction 3 with 357 rules applied. Total rules applied 4145 place count 6739 transition count 6632
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 4400 place count 6484 transition count 6377
Iterating global reduction 3 with 255 rules applied. Total rules applied 4655 place count 6484 transition count 6377
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 4910 place count 6229 transition count 6122
Iterating global reduction 3 with 255 rules applied. Total rules applied 5165 place count 6229 transition count 6122
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 5420 place count 5974 transition count 5867
Iterating global reduction 3 with 255 rules applied. Total rules applied 5675 place count 5974 transition count 5867
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 5930 place count 5719 transition count 5612
Iterating global reduction 3 with 255 rules applied. Total rules applied 6185 place count 5719 transition count 5612
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 6440 place count 5464 transition count 5357
Iterating global reduction 3 with 255 rules applied. Total rules applied 6695 place count 5464 transition count 5357
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 6950 place count 5209 transition count 5102
Iterating global reduction 3 with 255 rules applied. Total rules applied 7205 place count 5209 transition count 5102
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 7460 place count 4954 transition count 4847
Iterating global reduction 3 with 255 rules applied. Total rules applied 7715 place count 4954 transition count 4847
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 7970 place count 4699 transition count 4592
Iterating global reduction 3 with 255 rules applied. Total rules applied 8225 place count 4699 transition count 4592
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 8480 place count 4444 transition count 4337
Iterating global reduction 3 with 255 rules applied. Total rules applied 8735 place count 4444 transition count 4337
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 8990 place count 4189 transition count 4082
Iterating global reduction 3 with 255 rules applied. Total rules applied 9245 place count 4189 transition count 4082
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 3 with 306 rules applied. Total rules applied 9551 place count 4138 transition count 3827
Applied a total of 9551 rules in 13941 ms. Remains 4138 /9551 variables (removed 5413) and now considering 3827/8315 (removed 4488) transitions.
// Phase 1: matrix 3827 rows 4138 cols
[2023-03-10 12:03:11] [INFO ] Computed 464 place invariants in 47 ms
[2023-03-10 12:03:12] [INFO ] Implicit Places using invariants in 830 ms returned [1711, 1717, 1723, 2536]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 833 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4134/9551 places, 3827/8315 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 4129 transition count 3822
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 4129 transition count 3822
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 4127 transition count 3818
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 4127 transition count 3818
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 4125 transition count 3816
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 4125 transition count 3816
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 4123 transition count 3814
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 4123 transition count 3814
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 4121 transition count 3812
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 4121 transition count 3812
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 4119 transition count 3810
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 4119 transition count 3810
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 4117 transition count 3808
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 4117 transition count 3808
Applied a total of 34 rules in 3261 ms. Remains 4117 /4134 variables (removed 17) and now considering 3808/3827 (removed 19) transitions.
// Phase 1: matrix 3808 rows 4117 cols
[2023-03-10 12:03:15] [INFO ] Computed 460 place invariants in 42 ms
[2023-03-10 12:03:16] [INFO ] Implicit Places using invariants in 821 ms returned [2513]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 824 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 4116/9551 places, 3808/8315 transitions.
Applied a total of 0 rules in 398 ms. Remains 4116 /4116 variables (removed 0) and now considering 3808/3808 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 19258 ms. Remains : 4116/9551 places, 3808/8315 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=4 dest: 0}, { cond=(NOT p0), acceptance={0} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(AND (LT s1039 1) (LT s1041 1) (LT s1035 1) (LT s1037 1) (LT s1031 1) (LT s1033 1) (LT s1027 1) (LT s1029 1) (LT s1023 1) (LT s1025 1) (LT s1021 1) (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2120 steps with 0 reset in 34 ms.
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-12 finished in 19475 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 52 out of 9551 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9551/9551 places, 8315/8315 transitions.
Graph (complete) has 13669 edges and 9551 vertex of which 9345 are kept as prefixes of interest. Removing 206 places using SCC suffix rule.9 ms
Discarding 206 places :
Also discarding 206 output transitions
Drop transitions removed 206 transitions
Reduce places removed 51 places and 51 transitions.
Discarding 1377 places :
Implicit places reduction removed 1377 places
Drop transitions removed 4947 transitions
Trivial Post-agglo rules discarded 4947 transitions
Performed 4947 trivial Post agglomeration. Transition count delta: 4947
Iterating post reduction 0 with 6324 rules applied. Total rules applied 6325 place count 7917 transition count 3111
Reduce places removed 4947 places and 0 transitions.
Iterating post reduction 1 with 4947 rules applied. Total rules applied 11272 place count 2970 transition count 3111
Performed 765 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 765 Pre rules applied. Total rules applied 11272 place count 2970 transition count 2346
Deduced a syphon composed of 765 places in 1 ms
Ensure Unique test removed 306 places
Reduce places removed 1071 places and 0 transitions.
Iterating global reduction 2 with 1836 rules applied. Total rules applied 13108 place count 1899 transition count 2346
Drop transitions removed 204 transitions
Trivial Post-agglo rules discarded 204 transitions
Performed 204 trivial Post agglomeration. Transition count delta: 204
Iterating post reduction 2 with 204 rules applied. Total rules applied 13312 place count 1899 transition count 2142
Reduce places removed 204 places and 0 transitions.
Iterating post reduction 3 with 204 rules applied. Total rules applied 13516 place count 1695 transition count 2142
Discarding 362 places :
Symmetric choice reduction at 4 with 362 rule applications. Total rules 13878 place count 1333 transition count 1530
Iterating global reduction 4 with 362 rules applied. Total rules applied 14240 place count 1333 transition count 1530
Discarding 51 places :
Implicit places reduction removed 51 places
Drop transitions removed 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 4 with 153 rules applied. Total rules applied 14393 place count 1282 transition count 1428
Reduce places removed 102 places and 0 transitions.
Iterating post reduction 5 with 102 rules applied. Total rules applied 14495 place count 1180 transition count 1428
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 51 Pre rules applied. Total rules applied 14495 place count 1180 transition count 1377
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 6 with 102 rules applied. Total rules applied 14597 place count 1129 transition count 1377
Discarding 257 places :
Symmetric choice reduction at 6 with 257 rule applications. Total rules 14854 place count 872 transition count 1020
Iterating global reduction 6 with 257 rules applied. Total rules applied 15111 place count 872 transition count 1020
Ensure Unique test removed 357 transitions
Reduce isomorphic transitions removed 357 transitions.
Discarding 102 places :
Implicit places reduction removed 102 places
Drop transitions removed 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 6 with 561 rules applied. Total rules applied 15672 place count 770 transition count 561
Reduce places removed 102 places and 0 transitions.
Iterating post reduction 7 with 102 rules applied. Total rules applied 15774 place count 668 transition count 561
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 102 Pre rules applied. Total rules applied 15774 place count 668 transition count 459
Deduced a syphon composed of 102 places in 0 ms
Ensure Unique test removed 51 places
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 8 with 255 rules applied. Total rules applied 16029 place count 515 transition count 459
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 8 with 102 rules applied. Total rules applied 16131 place count 464 transition count 408
Reduce places removed 51 places and 51 transitions.
Iterating global reduction 8 with 51 rules applied. Total rules applied 16182 place count 413 transition count 357
Applied a total of 16182 rules in 281 ms. Remains 413 /9551 variables (removed 9138) and now considering 357/8315 (removed 7958) transitions.
// Phase 1: matrix 357 rows 413 cols
[2023-03-10 12:03:17] [INFO ] Computed 56 place invariants in 6 ms
[2023-03-10 12:03:17] [INFO ] Implicit Places using invariants in 201 ms returned [51, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 360, 412]
Discarding 54 places :
Implicit Place search using SMT only with invariants took 202 ms to find 54 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 359/9551 places, 357/8315 transitions.
Reduce places removed 51 places and 51 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 308 transition count 255
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 102 place count 257 transition count 255
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 102 place count 257 transition count 204
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 204 place count 206 transition count 204
Applied a total of 204 rules in 6 ms. Remains 206 /359 variables (removed 153) and now considering 204/357 (removed 153) transitions.
// Phase 1: matrix 204 rows 206 cols
[2023-03-10 12:03:17] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-10 12:03:17] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-10 12:03:17] [INFO ] Invariant cache hit.
[2023-03-10 12:03:17] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 206/9551 places, 204/8315 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 655 ms. Remains : 206/9551 places, 204/8315 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s124 1) (LT s154 1)) (OR (LT s134 1) (LT s154 1)) (OR (LT s153 1) (LT s154 1)) (OR (LT s104 1) (LT s154 1)) (OR (LT s143 1) (LT s154 1)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 11111 reset in 598 ms.
Product exploration explored 100000 steps with 11111 reset in 620 ms.
Computed a total of 206 stabilizing places and 204 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 206 transition count 204
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 78 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-13 finished in 2084 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) U p1)||X((X((p0 U F(p0))) U p2))))'
Support contains 1938 out of 9551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9551/9551 places, 8315/8315 transitions.
Discarding 408 places :
Implicit places reduction removed 408 places
Iterating post reduction 0 with 408 rules applied. Total rules applied 408 place count 9143 transition count 8315
Discarding 362 places :
Symmetric choice reduction at 1 with 362 rule applications. Total rules 770 place count 8781 transition count 7703
Iterating global reduction 1 with 362 rules applied. Total rules applied 1132 place count 8781 transition count 7703
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 1183 place count 8730 transition count 7703
Discarding 257 places :
Symmetric choice reduction at 2 with 257 rule applications. Total rules 1440 place count 8473 transition count 7346
Iterating global reduction 2 with 257 rules applied. Total rules applied 1697 place count 8473 transition count 7346
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 2 with 51 rules applied. Total rules applied 1748 place count 8422 transition count 7346
Discarding 102 places :
Symmetric choice reduction at 3 with 102 rule applications. Total rules 1850 place count 8320 transition count 7244
Iterating global reduction 3 with 102 rules applied. Total rules applied 1952 place count 8320 transition count 7244
Discarding 102 places :
Symmetric choice reduction at 3 with 102 rule applications. Total rules 2054 place count 8218 transition count 7142
Iterating global reduction 3 with 102 rules applied. Total rules applied 2156 place count 8218 transition count 7142
Applied a total of 2156 rules in 6139 ms. Remains 8218 /9551 variables (removed 1333) and now considering 7142/8315 (removed 1173) transitions.
// Phase 1: matrix 7142 rows 8218 cols
[2023-03-10 12:03:25] [INFO ] Computed 1484 place invariants in 147 ms
[2023-03-10 12:03:26] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 12:03:27] [INFO ] Implicit Places using invariants in 1958 ms returned [5769]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1962 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 8217/9551 places, 7142/8315 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 8216 transition count 7141
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 8216 transition count 7141
Applied a total of 2 rules in 2222 ms. Remains 8216 /8217 variables (removed 1) and now considering 7141/7142 (removed 1) transitions.
// Phase 1: matrix 7141 rows 8216 cols
[2023-03-10 12:03:29] [INFO ] Computed 1483 place invariants in 150 ms
[2023-03-10 12:03:30] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 12:03:31] [INFO ] Implicit Places using invariants in 1986 ms returned [6612]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1990 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 8215/9551 places, 7141/8315 transitions.
Applied a total of 0 rules in 1092 ms. Remains 8215 /8215 variables (removed 0) and now considering 7141/7141 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 13406 ms. Remains : 8215/9551 places, 7141/8315 transitions.
Stuttering acceptance computed with spot in 228 ms :[(NOT p0), (NOT p2), (NOT p0), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (NOT p0))]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 6}], [{ cond=(NOT p2), acceptance={} source=1 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 4}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={0} source=5 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 6}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=6 dest: 2}, { cond=(NOT p2), acceptance={0} source=6 dest: 6}]], initial=3, aps=[p0:(OR (AND (GEQ s1950 1) (GEQ s2563 1)) (AND (GEQ s1802 1) (GEQ s2415 1)) (AND (GEQ s1797 1) (GEQ s2410 1)) (AND (GEQ s1945 1) (GEQ s2558 1)) (AND (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2923 steps with 0 reset in 78 ms.
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-14 finished in 13759 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!p0&&G(!p1)) U X(p2))))'
Support contains 663 out of 9551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9551/9551 places, 8315/8315 transitions.
Discarding 1377 places :
Implicit places reduction removed 1377 places
Iterating post reduction 0 with 1377 rules applied. Total rules applied 1377 place count 8174 transition count 8315
Discarding 362 places :
Symmetric choice reduction at 1 with 362 rule applications. Total rules 1739 place count 7812 transition count 7703
Iterating global reduction 1 with 362 rules applied. Total rules applied 2101 place count 7812 transition count 7703
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 2152 place count 7761 transition count 7703
Discarding 257 places :
Symmetric choice reduction at 2 with 257 rule applications. Total rules 2409 place count 7504 transition count 7346
Iterating global reduction 2 with 257 rules applied. Total rules applied 2666 place count 7504 transition count 7346
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 2 with 51 rules applied. Total rules applied 2717 place count 7453 transition count 7346
Discarding 357 places :
Symmetric choice reduction at 3 with 357 rule applications. Total rules 3074 place count 7096 transition count 6989
Iterating global reduction 3 with 357 rules applied. Total rules applied 3431 place count 7096 transition count 6989
Discarding 357 places :
Symmetric choice reduction at 3 with 357 rule applications. Total rules 3788 place count 6739 transition count 6632
Iterating global reduction 3 with 357 rules applied. Total rules applied 4145 place count 6739 transition count 6632
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 4400 place count 6484 transition count 6377
Iterating global reduction 3 with 255 rules applied. Total rules applied 4655 place count 6484 transition count 6377
Applied a total of 4655 rules in 7471 ms. Remains 6484 /9551 variables (removed 3067) and now considering 6377/8315 (removed 1938) transitions.
// Phase 1: matrix 6377 rows 6484 cols
[2023-03-10 12:03:40] [INFO ] Computed 515 place invariants in 76 ms
[2023-03-10 12:03:40] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 12:03:41] [INFO ] Implicit Places using invariants in 1449 ms returned [898, 4886, 4890]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 1454 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 6481/9551 places, 6377/8315 transitions.
Applied a total of 0 rules in 950 ms. Remains 6481 /6481 variables (removed 0) and now considering 6377/6377 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 9878 ms. Remains : 6481/9551 places, 6377/8315 transitions.
Stuttering acceptance computed with spot in 197 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true, p1]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 4}, { cond=(NOT p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (GEQ s3458 1) (GEQ s3255 1) (GEQ s3393 1) (GEQ s3190 1) (GEQ s3328 1) (GEQ s3336 1) (GEQ s3247 1) (GEQ s3182 1) (GEQ s3466 1) (GEQ s3401 1) (GEQ s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1208 steps with 0 reset in 22 ms.
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-15 finished in 10133 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)))'
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(F(p0)) U G(p1))))'
Found a Lengthening insensitive property : FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-11
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Support contains 108 out of 9551 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 9551/9551 places, 8315/8315 transitions.
Graph (complete) has 13669 edges and 9551 vertex of which 8526 are kept as prefixes of interest. Removing 1025 places using SCC suffix rule.14 ms
Discarding 1025 places :
Also discarding 869 output transitions
Drop transitions removed 869 transitions
Reduce places removed 51 places and 51 transitions.
Discarding 1275 places :
Implicit places reduction removed 1275 places
Drop transitions removed 4335 transitions
Trivial Post-agglo rules discarded 4335 transitions
Performed 4335 trivial Post agglomeration. Transition count delta: 4335
Iterating post reduction 0 with 5610 rules applied. Total rules applied 5611 place count 7200 transition count 3060
Reduce places removed 4335 places and 0 transitions.
Iterating post reduction 1 with 4335 rules applied. Total rules applied 9946 place count 2865 transition count 3060
Performed 663 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 663 Pre rules applied. Total rules applied 9946 place count 2865 transition count 2397
Deduced a syphon composed of 663 places in 0 ms
Ensure Unique test removed 306 places
Reduce places removed 969 places and 0 transitions.
Iterating global reduction 2 with 1632 rules applied. Total rules applied 11578 place count 1896 transition count 2397
Drop transitions removed 153 transitions
Trivial Post-agglo rules discarded 153 transitions
Performed 153 trivial Post agglomeration. Transition count delta: 153
Iterating post reduction 2 with 153 rules applied. Total rules applied 11731 place count 1896 transition count 2244
Reduce places removed 153 places and 0 transitions.
Iterating post reduction 3 with 153 rules applied. Total rules applied 11884 place count 1743 transition count 2244
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 51 Pre rules applied. Total rules applied 11884 place count 1743 transition count 2193
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 4 with 102 rules applied. Total rules applied 11986 place count 1692 transition count 2193
Discarding 357 places :
Symmetric choice reduction at 4 with 357 rule applications. Total rules 12343 place count 1335 transition count 1836
Iterating global reduction 4 with 357 rules applied. Total rules applied 12700 place count 1335 transition count 1836
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 51 Pre rules applied. Total rules applied 12700 place count 1335 transition count 1785
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 4 with 102 rules applied. Total rules applied 12802 place count 1284 transition count 1785
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 12804 place count 1282 transition count 1683
Iterating global reduction 4 with 2 rules applied. Total rules applied 12806 place count 1282 transition count 1683
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 102 places :
Implicit places reduction removed 102 places
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 4 with 255 rules applied. Total rules applied 13061 place count 1180 transition count 1530
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 5 with 51 rules applied. Total rules applied 13112 place count 1129 transition count 1530
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 51 Pre rules applied. Total rules applied 13112 place count 1129 transition count 1479
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 6 with 102 rules applied. Total rules applied 13214 place count 1078 transition count 1479
Applied a total of 13214 rules in 345 ms. Remains 1078 /9551 variables (removed 8473) and now considering 1479/8315 (removed 6836) transitions.
// Phase 1: matrix 1479 rows 1078 cols
[2023-03-10 12:03:43] [INFO ] Computed 104 place invariants in 10 ms
[2023-03-10 12:03:44] [INFO ] Implicit Places using invariants in 389 ms returned [408, 409, 410, 411, 412, 413, 414, 415, 416, 417, 418, 419, 420, 421, 422, 423, 424, 425, 426, 427, 428, 429, 430, 431, 432, 433, 434, 435, 436, 437, 438, 439, 440, 441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451, 452, 453, 454, 455, 456, 457, 458, 924, 925, 926, 927, 928, 929, 930, 931, 932, 933, 934, 935, 936, 937, 938, 939, 940, 941, 942, 943, 944, 945, 946, 947, 948, 949, 950, 951, 952, 953, 954, 955, 956, 957, 958, 959, 960, 961, 962, 963, 964, 965, 966, 967, 968, 969, 970, 971, 972, 973, 974, 1026]
Discarding 103 places :
Implicit Place search using SMT only with invariants took 390 ms to find 103 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 975/9551 places, 1479/8315 transitions.
Drop transitions removed 357 transitions
Trivial Post-agglo rules discarded 357 transitions
Performed 357 trivial Post agglomeration. Transition count delta: 357
Iterating post reduction 0 with 357 rules applied. Total rules applied 357 place count 975 transition count 1122
Reduce places removed 357 places and 0 transitions.
Iterating post reduction 1 with 357 rules applied. Total rules applied 714 place count 618 transition count 1122
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 714 place count 618 transition count 1071
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 816 place count 567 transition count 1071
Applied a total of 816 rules in 18 ms. Remains 567 /975 variables (removed 408) and now considering 1071/1479 (removed 408) transitions.
// Phase 1: matrix 1071 rows 567 cols
[2023-03-10 12:03:44] [INFO ] Computed 1 place invariants in 7 ms
[2023-03-10 12:03:44] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-10 12:03:44] [INFO ] Invariant cache hit.
[2023-03-10 12:03:44] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 567/9551 places, 1071/8315 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1078 ms. Remains : 567/9551 places, 1071/8315 transitions.
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (AND (GEQ s467 1) (GEQ s511 1)) (AND (GEQ s477 1) (GEQ s513 1)) (AND (GEQ s487 1) (GEQ s515 1)) (AND (GEQ s506 1) (GEQ s513 1)) (AND (GEQ s491 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2295 reset in 1216 ms.
Product exploration explored 100000 steps with 2175 reset in 1227 ms.
Computed a total of 567 stabilizing places and 1071 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 567 transition count 1071
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 434 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Finished random walk after 66 steps, including 0 resets, run visited all 4 properties in 6 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F p1), (F p0), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 452 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
[2023-03-10 12:03:51] [INFO ] Invariant cache hit.
[2023-03-10 12:03:54] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 7 ms returned sat
[2023-03-10 12:03:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 12:03:55] [INFO ] [Real]Absence check using state equation in 453 ms returned sat
[2023-03-10 12:03:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 12:03:58] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-10 12:03:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 12:03:59] [INFO ] [Nat]Absence check using state equation in 480 ms returned sat
[2023-03-10 12:03:59] [INFO ] Computed and/alt/rep : 459/969/459 causal constraints (skipped 306 transitions) in 51 ms.
[2023-03-10 12:03:59] [INFO ] Added : 51 causal constraints over 11 iterations in 569 ms. Result :sat
Could not prove EG (NOT p1)
[2023-03-10 12:03:59] [INFO ] Invariant cache hit.
[2023-03-10 12:03:59] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-10 12:03:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 12:04:00] [INFO ] [Real]Absence check using state equation in 201 ms returned sat
[2023-03-10 12:04:00] [INFO ] Computed and/alt/rep : 459/969/459 causal constraints (skipped 306 transitions) in 49 ms.
[2023-03-10 12:04:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 12:04:01] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-10 12:04:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 12:04:01] [INFO ] [Nat]Absence check using state equation in 184 ms returned sat
[2023-03-10 12:04:01] [INFO ] Computed and/alt/rep : 459/969/459 causal constraints (skipped 306 transitions) in 48 ms.
[2023-03-10 12:04:02] [INFO ] Added : 134 causal constraints over 28 iterations in 1423 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 108 out of 567 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 567/567 places, 1071/1071 transitions.
Applied a total of 0 rules in 11 ms. Remains 567 /567 variables (removed 0) and now considering 1071/1071 (removed 0) transitions.
[2023-03-10 12:04:02] [INFO ] Invariant cache hit.
[2023-03-10 12:04:02] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-10 12:04:02] [INFO ] Invariant cache hit.
[2023-03-10 12:04:03] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
[2023-03-10 12:04:03] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-10 12:04:03] [INFO ] Invariant cache hit.
[2023-03-10 12:04:03] [INFO ] Dead Transitions using invariants and state equation in 313 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 650 ms. Remains : 567/567 places, 1071/1071 transitions.
Computed a total of 567 stabilizing places and 1071 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 567 transition count 1071
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 439 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Finished random walk after 70 steps, including 0 resets, run visited all 4 properties in 6 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F p1), (F p0), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 560 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
[2023-03-10 12:04:08] [INFO ] Invariant cache hit.
[2023-03-10 12:04:11] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 7 ms returned sat
[2023-03-10 12:04:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 12:04:12] [INFO ] [Real]Absence check using state equation in 439 ms returned sat
[2023-03-10 12:04:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 12:04:15] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-10 12:04:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 12:04:15] [INFO ] [Nat]Absence check using state equation in 463 ms returned sat
[2023-03-10 12:04:15] [INFO ] Computed and/alt/rep : 459/969/459 causal constraints (skipped 306 transitions) in 56 ms.
[2023-03-10 12:04:16] [INFO ] Added : 51 causal constraints over 11 iterations in 564 ms. Result :sat
Could not prove EG (NOT p1)
[2023-03-10 12:04:16] [INFO ] Invariant cache hit.
[2023-03-10 12:04:16] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-10 12:04:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 12:04:16] [INFO ] [Real]Absence check using state equation in 197 ms returned sat
[2023-03-10 12:04:17] [INFO ] Computed and/alt/rep : 459/969/459 causal constraints (skipped 306 transitions) in 47 ms.
[2023-03-10 12:04:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 12:04:17] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-10 12:04:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 12:04:17] [INFO ] [Nat]Absence check using state equation in 201 ms returned sat
[2023-03-10 12:04:18] [INFO ] Computed and/alt/rep : 459/969/459 causal constraints (skipped 306 transitions) in 47 ms.
[2023-03-10 12:04:19] [INFO ] Added : 134 causal constraints over 28 iterations in 1378 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 2274 reset in 1084 ms.
Product exploration explored 100000 steps with 2244 reset in 1116 ms.
Support contains 108 out of 567 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 567/567 places, 1071/1071 transitions.
Applied a total of 0 rules in 11 ms. Remains 567 /567 variables (removed 0) and now considering 1071/1071 (removed 0) transitions.
[2023-03-10 12:04:21] [INFO ] Invariant cache hit.
[2023-03-10 12:04:21] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-10 12:04:21] [INFO ] Invariant cache hit.
[2023-03-10 12:04:22] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
[2023-03-10 12:04:22] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-10 12:04:22] [INFO ] Invariant cache hit.
[2023-03-10 12:04:22] [INFO ] Dead Transitions using invariants and state equation in 314 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 643 ms. Remains : 567/567 places, 1071/1071 transitions.
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-11 finished in 39498 ms.
[2023-03-10 12:04:22] [INFO ] Flatten gal took : 213 ms
[2023-03-10 12:04:22] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2023-03-10 12:04:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 9551 places, 8315 transitions and 22341 arcs took 38 ms.
Total runtime 344520 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT FamilyReunion-COL-L00050M0005C002P002G001
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLFireability

FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678450434304

--------------------
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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:430
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 1.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-06
lola: time limit : 1549 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-11: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 2/1549 2/32 FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-06 61268 m, 12253 m/sec, 118810 t fired, .

Time elapsed: 504 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 7/1549 4/32 FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-06 190680 m, 25882 m/sec, 385873 t fired, .

Time elapsed: 509 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 12/1549 7/32 FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-06 310767 m, 24017 m/sec, 663647 t fired, .

Time elapsed: 514 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 17/1549 9/32 FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-06 440335 m, 25913 m/sec, 932285 t fired, .

Time elapsed: 519 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 22/1549 12/32 FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-06 577306 m, 27394 m/sec, 1215179 t fired, .

Time elapsed: 524 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 27/1549 14/32 FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-06 690344 m, 22607 m/sec, 1466685 t fired, .

Time elapsed: 529 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 32/1549 16/32 FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-06 805672 m, 23065 m/sec, 1737640 t fired, .

Time elapsed: 534 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 37/1549 19/32 FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-06 919692 m, 22804 m/sec, 2013320 t fired, .

Time elapsed: 539 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 42/1549 21/32 FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-06 1036143 m, 23290 m/sec, 2307312 t fired, .

Time elapsed: 544 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 47/1549 23/32 FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-06 1152160 m, 23203 m/sec, 2565507 t fired, .

Time elapsed: 549 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 52/1549 25/32 FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-06 1266545 m, 22877 m/sec, 2851815 t fired, .

Time elapsed: 554 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 57/1549 28/32 FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-06 1391101 m, 24911 m/sec, 3129524 t fired, .

Time elapsed: 559 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 62/1549 30/32 FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-06 1526130 m, 27005 m/sec, 3407171 t fired, .

Time elapsed: 564 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 1 (type EXCL) for FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-06 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-11: LTL 0 1 0 0 1 0 0 0

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

Time elapsed: 569 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 4 (type EXCL) for 3 FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-11
lola: time limit : 3031 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-11
lola: result : false
lola: markings : 2924
lola: fired transitions : 2924
lola: time used : 1.000000
lola: memory pages used : 1
lola: Portfolio finished: no open tasks 2

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-06: LTL unknown AGGR
FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-11: LTL false LTL model checker


Time elapsed: 570 secs. Pages in use: 32

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is FamilyReunion-COL-L00050M0005C002P002G001, 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 r167-tall-167838852900316"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FamilyReunion-COL-L00050M0005C002P002G001.tgz
mv FamilyReunion-COL-L00050M0005C002P002G001 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 ;