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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 8.0K Feb 25 14:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 14:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 14:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 25 14:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 14:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Feb 25 14:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 14:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 14:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.5M Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Echo-PT-d02r19-LTLCardinality-00
FORMULA_NAME Echo-PT-d02r19-LTLCardinality-01
FORMULA_NAME Echo-PT-d02r19-LTLCardinality-02
FORMULA_NAME Echo-PT-d02r19-LTLCardinality-03
FORMULA_NAME Echo-PT-d02r19-LTLCardinality-04
FORMULA_NAME Echo-PT-d02r19-LTLCardinality-05
FORMULA_NAME Echo-PT-d02r19-LTLCardinality-06
FORMULA_NAME Echo-PT-d02r19-LTLCardinality-07
FORMULA_NAME Echo-PT-d02r19-LTLCardinality-08
FORMULA_NAME Echo-PT-d02r19-LTLCardinality-09
FORMULA_NAME Echo-PT-d02r19-LTLCardinality-10
FORMULA_NAME Echo-PT-d02r19-LTLCardinality-11
FORMULA_NAME Echo-PT-d02r19-LTLCardinality-12
FORMULA_NAME Echo-PT-d02r19-LTLCardinality-13
FORMULA_NAME Echo-PT-d02r19-LTLCardinality-14
FORMULA_NAME Echo-PT-d02r19-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678473168009

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Echo-PT-d02r19
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-10 18:32:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-10 18:32:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 18:32:49] [INFO ] Load time of PNML (sax parser for PT used): 223 ms
[2023-03-10 18:32:50] [INFO ] Transformed 3455 places.
[2023-03-10 18:32:50] [INFO ] Transformed 2730 transitions.
[2023-03-10 18:32:50] [INFO ] Found NUPN structural information;
[2023-03-10 18:32:50] [INFO ] Parsed PT model containing 3455 places and 2730 transitions and 15940 arcs in 455 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA Echo-PT-d02r19-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r19-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r19-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r19-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r19-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r19-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r19-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r19-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r19-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 3455 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3455/3455 places, 2730/2730 transitions.
Reduce places removed 358 places and 0 transitions.
Iterating post reduction 0 with 358 rules applied. Total rules applied 358 place count 3097 transition count 2730
Applied a total of 358 rules in 324 ms. Remains 3097 /3455 variables (removed 358) and now considering 2730/2730 (removed 0) transitions.
// Phase 1: matrix 2730 rows 3097 cols
[2023-03-10 18:32:52] [INFO ] Invariants computation overflowed in 2235 ms
[2023-03-10 18:32:53] [INFO ] Implicit Places using invariants in 2826 ms returned []
// Phase 1: matrix 2730 rows 3097 cols
[2023-03-10 18:32:55] [INFO ] Invariants computation overflowed in 2167 ms
[2023-03-10 18:32:56] [INFO ] Implicit Places using invariants and state equation in 3003 ms returned []
Implicit Place search using SMT with State Equation took 5864 ms to find 0 implicit places.
// Phase 1: matrix 2730 rows 3097 cols
[2023-03-10 18:32:58] [INFO ] Invariants computation overflowed in 2223 ms
[2023-03-10 18:33:00] [INFO ] Dead Transitions using invariants and state equation in 3968 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3097/3455 places, 2730/2730 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10158 ms. Remains : 3097/3455 places, 2730/2730 transitions.
Support contains 24 out of 3097 places after structural reductions.
[2023-03-10 18:33:00] [INFO ] Flatten gal took : 319 ms
[2023-03-10 18:33:01] [INFO ] Flatten gal took : 171 ms
[2023-03-10 18:33:01] [INFO ] Input system was already deterministic with 2730 transitions.
Incomplete random walk after 10000 steps, including 13 resets, run finished after 373 ms. (steps per millisecond=26 ) properties (out of 13) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2730 rows 3097 cols
[2023-03-10 18:33:04] [INFO ] Invariants computation overflowed in 2312 ms
[2023-03-10 18:33:29] [INFO ] After 25028ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 3097 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3097/3097 places, 2730/2730 transitions.
Graph (complete) has 9355 edges and 3097 vertex of which 3085 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.13 ms
Discarding 12 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 3085 transition count 2725
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 3084 transition count 2724
Applied a total of 6 rules in 408 ms. Remains 3084 /3097 variables (removed 13) and now considering 2724/2730 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 409 ms. Remains : 3084/3097 places, 2724/2730 transitions.
Incomplete random walk after 10000 steps, including 13 resets, run finished after 254 ms. (steps per millisecond=39 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 228268 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :{}
Probabilistic random walk after 228268 steps, saw 80223 distinct states, run finished after 3004 ms. (steps per millisecond=75 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2724 rows 3084 cols
[2023-03-10 18:33:36] [INFO ] Invariants computation overflowed in 3374 ms
[2023-03-10 18:34:01] [INFO ] After 25020ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 3084 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3084/3084 places, 2724/2724 transitions.
Applied a total of 0 rules in 178 ms. Remains 3084 /3084 variables (removed 0) and now considering 2724/2724 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 179 ms. Remains : 3084/3084 places, 2724/2724 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3084/3084 places, 2724/2724 transitions.
Applied a total of 0 rules in 150 ms. Remains 3084 /3084 variables (removed 0) and now considering 2724/2724 (removed 0) transitions.
// Phase 1: matrix 2724 rows 3084 cols
[2023-03-10 18:34:05] [INFO ] Invariants computation overflowed in 3610 ms
[2023-03-10 18:34:07] [INFO ] Implicit Places using invariants in 6053 ms returned []
// Phase 1: matrix 2724 rows 3084 cols
[2023-03-10 18:34:11] [INFO ] Invariants computation overflowed in 3644 ms
[2023-03-10 18:34:12] [INFO ] Implicit Places using invariants and state equation in 4375 ms returned []
Implicit Place search using SMT with State Equation took 10449 ms to find 0 implicit places.
[2023-03-10 18:34:12] [INFO ] Redundant transitions in 151 ms returned []
// Phase 1: matrix 2724 rows 3084 cols
[2023-03-10 18:34:15] [INFO ] Invariants computation overflowed in 3525 ms
[2023-03-10 18:34:17] [INFO ] Dead Transitions using invariants and state equation in 5132 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15891 ms. Remains : 3084/3084 places, 2724/2724 transitions.
Applied a total of 0 rules in 147 ms. Remains 3084 /3084 variables (removed 0) and now considering 2724/2724 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2724 rows 3084 cols
[2023-03-10 18:34:21] [INFO ] Invariants computation overflowed in 3599 ms
[2023-03-10 18:37:14] [INFO ] After 173478ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Computed a total of 3097 stabilizing places and 2730 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3097 transition count 2730
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(G(p0)))'
Support contains 4 out of 3097 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3097/3097 places, 2730/2730 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 3094 transition count 2730
Applied a total of 3 rules in 274 ms. Remains 3094 /3097 variables (removed 3) and now considering 2730/2730 (removed 0) transitions.
// Phase 1: matrix 2730 rows 3094 cols
[2023-03-10 18:37:20] [INFO ] Computed 1368 place invariants in 4849 ms
[2023-03-10 18:37:20] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 18:37:22] [INFO ] Implicit Places using invariants in 7383 ms returned []
[2023-03-10 18:37:22] [INFO ] Invariant cache hit.
[2023-03-10 18:37:23] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 18:37:25] [INFO ] Implicit Places using invariants and state equation in 2891 ms returned []
Implicit Place search using SMT with State Equation took 10300 ms to find 0 implicit places.
[2023-03-10 18:37:25] [INFO ] Invariant cache hit.
[2023-03-10 18:37:26] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 18:37:27] [INFO ] Dead Transitions using invariants and state equation in 2002 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3094/3097 places, 2730/2730 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12594 ms. Remains : 3094/3097 places, 2730/2730 transitions.
Stuttering acceptance computed with spot in 189 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Echo-PT-d02r19-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s128 0) (EQ s1667 1) (EQ s2416 0) (EQ s659 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 138 reset in 2463 ms.
Product exploration explored 100000 steps with 138 reset in 2545 ms.
Computed a total of 3094 stabilizing places and 2730 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3094 transition count 2730
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), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 201 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 13 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 221420 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :{}
Probabilistic random walk after 221420 steps, saw 79059 distinct states, run finished after 3001 ms. (steps per millisecond=73 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-10 18:37:37] [INFO ] Invariant cache hit.
[2023-03-10 18:37:42] [INFO ] [Real]Absence check using 0 positive and 1368 generalized place invariants in 4127 ms returned sat
[2023-03-10 18:37:43] [INFO ] After 5080ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 18:37:56] [INFO ] [Nat]Absence check using 0 positive and 1368 generalized place invariants in 12591 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:631)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-10 18:38:08] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-10 18:38:08] [INFO ] After 25027ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 3094 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3094/3094 places, 2730/2730 transitions.
Graph (complete) has 9333 edges and 3094 vertex of which 3085 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 3085 transition count 2725
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 3084 transition count 2724
Applied a total of 6 rules in 370 ms. Remains 3084 /3094 variables (removed 10) and now considering 2724/2730 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 371 ms. Remains : 3084/3094 places, 2724/2730 transitions.
Incomplete random walk after 10000 steps, including 13 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 239666 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :{}
Probabilistic random walk after 239666 steps, saw 82155 distinct states, run finished after 3003 ms. (steps per millisecond=79 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2724 rows 3084 cols
[2023-03-10 18:38:15] [INFO ] Invariants computation overflowed in 3393 ms
[2023-03-10 18:38:40] [INFO ] After 25033ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 3084 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3084/3084 places, 2724/2724 transitions.
Applied a total of 0 rules in 138 ms. Remains 3084 /3084 variables (removed 0) and now considering 2724/2724 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 3084/3084 places, 2724/2724 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3084/3084 places, 2724/2724 transitions.
Applied a total of 0 rules in 155 ms. Remains 3084 /3084 variables (removed 0) and now considering 2724/2724 (removed 0) transitions.
// Phase 1: matrix 2724 rows 3084 cols
[2023-03-10 18:38:43] [INFO ] Invariants computation overflowed in 3403 ms
[2023-03-10 18:38:46] [INFO ] Implicit Places using invariants in 5626 ms returned []
// Phase 1: matrix 2724 rows 3084 cols
[2023-03-10 18:38:49] [INFO ] Invariants computation overflowed in 3423 ms
[2023-03-10 18:38:50] [INFO ] Implicit Places using invariants and state equation in 4305 ms returned []
Implicit Place search using SMT with State Equation took 9941 ms to find 0 implicit places.
[2023-03-10 18:38:50] [INFO ] Redundant transitions in 52 ms returned []
// Phase 1: matrix 2724 rows 3084 cols
[2023-03-10 18:38:53] [INFO ] Invariants computation overflowed in 3327 ms
[2023-03-10 18:38:55] [INFO ] Dead Transitions using invariants and state equation in 4926 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15086 ms. Remains : 3084/3084 places, 2724/2724 transitions.
Applied a total of 0 rules in 162 ms. Remains 3084 /3084 variables (removed 0) and now considering 2724/2724 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2724 rows 3084 cols
[2023-03-10 18:38:58] [INFO ] Invariants computation overflowed in 3364 ms
[2023-03-10 18:41:54] [INFO ] After 175243ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 207 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Support contains 4 out of 3094 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3094/3094 places, 2730/2730 transitions.
Applied a total of 0 rules in 142 ms. Remains 3094 /3094 variables (removed 0) and now considering 2730/2730 (removed 0) transitions.
[2023-03-10 18:41:54] [INFO ] Invariant cache hit.
[2023-03-10 18:41:55] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 18:41:57] [INFO ] Implicit Places using invariants in 2685 ms returned []
[2023-03-10 18:41:57] [INFO ] Invariant cache hit.
[2023-03-10 18:41:57] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 18:42:00] [INFO ] Implicit Places using invariants and state equation in 2684 ms returned []
Implicit Place search using SMT with State Equation took 5400 ms to find 0 implicit places.
[2023-03-10 18:42:00] [INFO ] Invariant cache hit.
[2023-03-10 18:42:00] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 18:42:02] [INFO ] Dead Transitions using invariants and state equation in 2005 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7571 ms. Remains : 3094/3094 places, 2730/2730 transitions.
Computed a total of 3094 stabilizing places and 2730 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3094 transition count 2730
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), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 208 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 13 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 208416 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :{}
Probabilistic random walk after 208416 steps, saw 76671 distinct states, run finished after 3001 ms. (steps per millisecond=69 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-10 18:42:07] [INFO ] Invariant cache hit.
[2023-03-10 18:42:12] [INFO ] [Real]Absence check using 0 positive and 1368 generalized place invariants in 4216 ms returned sat
[2023-03-10 18:42:12] [INFO ] After 5195ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 18:42:25] [INFO ] [Nat]Absence check using 0 positive and 1368 generalized place invariants in 12528 ms returned sat
[2023-03-10 18:42:37] [INFO ] After 25013ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 3094 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3094/3094 places, 2730/2730 transitions.
Graph (complete) has 9333 edges and 3094 vertex of which 3085 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Discarding 9 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 3085 transition count 2725
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 3084 transition count 2724
Applied a total of 6 rules in 282 ms. Remains 3084 /3094 variables (removed 10) and now considering 2724/2730 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 282 ms. Remains : 3084/3094 places, 2724/2730 transitions.
Incomplete random walk after 10000 steps, including 13 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 1) seen :0
Finished Best-First random walk after 5027 steps, including 1 resets, run visited all 1 properties in 41 ms. (steps per millisecond=122 )
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 238 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 138 reset in 2125 ms.
Product exploration explored 100000 steps with 138 reset in 2378 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p0), (NOT p0)]
Support contains 4 out of 3094 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3094/3094 places, 2730/2730 transitions.
Graph (complete) has 9333 edges and 3094 vertex of which 3089 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.22 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Applied a total of 1 rules in 299 ms. Remains 3089 /3094 variables (removed 5) and now considering 2729/2730 (removed 1) transitions.
[2023-03-10 18:42:43] [INFO ] Redundant transitions in 107 ms returned []
// Phase 1: matrix 2729 rows 3089 cols
[2023-03-10 18:42:50] [INFO ] Computed 1364 place invariants in 6978 ms
[2023-03-10 18:42:51] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 18:42:52] [INFO ] Dead Transitions using invariants and state equation in 9056 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3089/3094 places, 2729/2730 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9518 ms. Remains : 3089/3094 places, 2729/2730 transitions.
Support contains 4 out of 3094 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3094/3094 places, 2730/2730 transitions.
Applied a total of 0 rules in 168 ms. Remains 3094 /3094 variables (removed 0) and now considering 2730/2730 (removed 0) transitions.
// Phase 1: matrix 2730 rows 3094 cols
[2023-03-10 18:42:57] [INFO ] Computed 1368 place invariants in 4366 ms
[2023-03-10 18:42:57] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 18:42:59] [INFO ] Implicit Places using invariants in 6685 ms returned []
[2023-03-10 18:42:59] [INFO ] Invariant cache hit.
[2023-03-10 18:43:00] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 18:43:02] [INFO ] Implicit Places using invariants and state equation in 2630 ms returned []
Implicit Place search using SMT with State Equation took 9356 ms to find 0 implicit places.
[2023-03-10 18:43:02] [INFO ] Invariant cache hit.
[2023-03-10 18:43:02] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 18:43:04] [INFO ] Dead Transitions using invariants and state equation in 2022 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11549 ms. Remains : 3094/3094 places, 2730/2730 transitions.
Treatment of property Echo-PT-d02r19-LTLCardinality-02 finished in 349927 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G((p1 U p2))))))'
Support contains 5 out of 3097 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3097/3097 places, 2730/2730 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 3095 transition count 2730
Applied a total of 2 rules in 166 ms. Remains 3095 /3097 variables (removed 2) and now considering 2730/2730 (removed 0) transitions.
// Phase 1: matrix 2730 rows 3095 cols
[2023-03-10 18:43:09] [INFO ] Computed 1369 place invariants in 4706 ms
[2023-03-10 18:43:11] [INFO ] Implicit Places using invariants in 6867 ms returned []
[2023-03-10 18:43:11] [INFO ] Invariant cache hit.
[2023-03-10 18:43:14] [INFO ] Implicit Places using invariants and state equation in 2322 ms returned []
Implicit Place search using SMT with State Equation took 9228 ms to find 0 implicit places.
[2023-03-10 18:43:14] [INFO ] Invariant cache hit.
[2023-03-10 18:43:16] [INFO ] Dead Transitions using invariants and state equation in 1724 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3095/3097 places, 2730/2730 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11120 ms. Remains : 3095/3097 places, 2730/2730 transitions.
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Echo-PT-d02r19-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(AND (EQ s2722 0) (EQ s2455 1)), p2:(OR (EQ s2225 0) (EQ s710 1)), p1:(EQ s50 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 201 reset in 2494 ms.
Product exploration explored 100000 steps with 187 reset in 2737 ms.
Computed a total of 3095 stabilizing places and 2730 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3095 transition count 2730
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) (NOT p2) (NOT p1)), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 414 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 5314 steps, including 7 resets, run visited all 3 properties in 217 ms. (steps per millisecond=24 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
Knowledge based reduction with 10 factoid took 584 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
[2023-03-10 18:43:24] [INFO ] Invariant cache hit.
[2023-03-10 18:43:30] [INFO ] [Real]Absence check using 4 positive place invariants in 217 ms returned sat
[2023-03-10 18:43:39] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 18:43:39] [INFO ] [Real]Absence check using 4 positive and 1365 generalized place invariants in 9112 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 5 out of 3095 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3095/3095 places, 2730/2730 transitions.
Applied a total of 0 rules in 122 ms. Remains 3095 /3095 variables (removed 0) and now considering 2730/2730 (removed 0) transitions.
[2023-03-10 18:43:39] [INFO ] Invariant cache hit.
[2023-03-10 18:43:41] [INFO ] Implicit Places using invariants in 2159 ms returned []
[2023-03-10 18:43:41] [INFO ] Invariant cache hit.
[2023-03-10 18:43:44] [INFO ] Implicit Places using invariants and state equation in 2182 ms returned []
Implicit Place search using SMT with State Equation took 4372 ms to find 0 implicit places.
[2023-03-10 18:43:44] [INFO ] Invariant cache hit.
[2023-03-10 18:43:46] [INFO ] Dead Transitions using invariants and state equation in 1955 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6460 ms. Remains : 3095/3095 places, 2730/2730 transitions.
Computed a total of 3095 stabilizing places and 2730 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3095 transition count 2730
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) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 387 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 1641 steps, including 2 resets, run visited all 3 properties in 39 ms. (steps per millisecond=42 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (OR (AND (NOT p0) p2) (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p2) p1)), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1))))]
Knowledge based reduction with 10 factoid took 555 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
[2023-03-10 18:43:48] [INFO ] Invariant cache hit.
[2023-03-10 18:43:54] [INFO ] [Real]Absence check using 4 positive place invariants in 83 ms returned sat
[2023-03-10 18:44:03] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 18:44:03] [INFO ] [Real]Absence check using 4 positive and 1365 generalized place invariants in 9162 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 193 reset in 2414 ms.
Product exploration explored 100000 steps with 193 reset in 2705 ms.
Applying partial POR strategy [true, true, false]
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 3095 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3095/3095 places, 2730/2730 transitions.
Graph (complete) has 9341 edges and 3095 vertex of which 3090 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.6 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Applied a total of 1 rules in 154 ms. Remains 3090 /3095 variables (removed 5) and now considering 2729/2730 (removed 1) transitions.
[2023-03-10 18:44:09] [INFO ] Redundant transitions in 99 ms returned []
// Phase 1: matrix 2729 rows 3090 cols
[2023-03-10 18:44:11] [INFO ] Invariants computation overflowed in 2186 ms
[2023-03-10 18:44:13] [INFO ] Dead Transitions using invariants and state equation in 4047 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3090/3095 places, 2729/2730 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4311 ms. Remains : 3090/3095 places, 2729/2730 transitions.
Support contains 5 out of 3095 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3095/3095 places, 2730/2730 transitions.
Applied a total of 0 rules in 122 ms. Remains 3095 /3095 variables (removed 0) and now considering 2730/2730 (removed 0) transitions.
[2023-03-10 18:44:13] [INFO ] Invariant cache hit.
[2023-03-10 18:44:16] [INFO ] Implicit Places using invariants in 2156 ms returned []
[2023-03-10 18:44:16] [INFO ] Invariant cache hit.
[2023-03-10 18:44:18] [INFO ] Implicit Places using invariants and state equation in 2146 ms returned []
Implicit Place search using SMT with State Equation took 4325 ms to find 0 implicit places.
[2023-03-10 18:44:18] [INFO ] Invariant cache hit.
[2023-03-10 18:44:19] [INFO ] Dead Transitions using invariants and state equation in 1750 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6198 ms. Remains : 3095/3095 places, 2730/2730 transitions.
Treatment of property Echo-PT-d02r19-LTLCardinality-04 finished in 75184 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0 U (!p1&&X(X(F(!p2)))))))'
Support contains 5 out of 3097 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3097/3097 places, 2730/2730 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 3094 transition count 2730
Applied a total of 3 rules in 131 ms. Remains 3094 /3097 variables (removed 3) and now considering 2730/2730 (removed 0) transitions.
// Phase 1: matrix 2730 rows 3094 cols
[2023-03-10 18:44:24] [INFO ] Computed 1368 place invariants in 4368 ms
[2023-03-10 18:44:25] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 18:44:26] [INFO ] Implicit Places using invariants in 6600 ms returned []
[2023-03-10 18:44:26] [INFO ] Invariant cache hit.
[2023-03-10 18:44:27] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 18:44:29] [INFO ] Implicit Places using invariants and state equation in 2622 ms returned []
Implicit Place search using SMT with State Equation took 9244 ms to find 0 implicit places.
[2023-03-10 18:44:29] [INFO ] Invariant cache hit.
[2023-03-10 18:44:29] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 18:44:31] [INFO ] Dead Transitions using invariants and state equation in 2038 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3094/3097 places, 2730/2730 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11442 ms. Remains : 3094/3097 places, 2730/2730 transitions.
Stuttering acceptance computed with spot in 179 ms :[(OR p1 p2), (OR p1 p2), true, p2, p2]
Running random walk in product with property : Echo-PT-d02r19-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 2}, { cond=(NOT p1), acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p2, acceptance={0} source=4 dest: 4}]], initial=1, aps=[p1:(OR (EQ s1670 0) (EQ s753 1)), p0:(OR (EQ s2994 0) (EQ s1234 1)), p2:(OR (EQ s1913 0) (EQ s1234 1))], 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Echo-PT-d02r19-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r19-LTLCardinality-05 finished in 11667 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 3097 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3097/3097 places, 2730/2730 transitions.
Graph (complete) has 9355 edges and 3097 vertex of which 3090 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.6 ms
Discarding 7 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 151 ms. Remains 3089 /3097 variables (removed 8) and now considering 2728/2730 (removed 2) transitions.
// Phase 1: matrix 2728 rows 3089 cols
[2023-03-10 18:44:38] [INFO ] Invariants computation overflowed in 6131 ms
[2023-03-10 18:44:40] [INFO ] Implicit Places using invariants in 8229 ms returned []
// Phase 1: matrix 2728 rows 3089 cols
[2023-03-10 18:44:46] [INFO ] Invariants computation overflowed in 6119 ms
[2023-03-10 18:44:46] [INFO ] Implicit Places using invariants and state equation in 6802 ms returned []
Implicit Place search using SMT with State Equation took 15050 ms to find 0 implicit places.
[2023-03-10 18:44:47] [INFO ] Redundant transitions in 85 ms returned []
// Phase 1: matrix 2728 rows 3089 cols
[2023-03-10 18:44:53] [INFO ] Invariants computation overflowed in 6141 ms
[2023-03-10 18:44:54] [INFO ] Dead Transitions using invariants and state equation in 7817 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3089/3097 places, 2728/2730 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 23124 ms. Remains : 3089/3097 places, 2728/2730 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Echo-PT-d02r19-LTLCardinality-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 (EQ s1808 0) (EQ s2453 1))], 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 175 reset in 2397 ms.
Product exploration explored 100000 steps with 178 reset in 2658 ms.
Computed a total of 3089 stabilizing places and 2728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3089 transition count 2728
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 (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 146 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 64 ms :[(NOT p0), (NOT p0)]
Finished random walk after 602 steps, including 0 resets, run visited all 1 properties in 16 ms. (steps per millisecond=37 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 149 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 55 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 2728 rows 3089 cols
[2023-03-10 18:45:08] [INFO ] Invariants computation overflowed in 6118 ms
[2023-03-10 18:45:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:45:23] [INFO ] [Real]Absence check using state equation in 9433 ms returned unknown
Could not prove EG (NOT p0)
Support contains 2 out of 3089 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3089/3089 places, 2728/2728 transitions.
Applied a total of 0 rules in 167 ms. Remains 3089 /3089 variables (removed 0) and now considering 2728/2728 (removed 0) transitions.
// Phase 1: matrix 2728 rows 3089 cols
[2023-03-10 18:45:29] [INFO ] Invariants computation overflowed in 6116 ms
[2023-03-10 18:45:31] [INFO ] Implicit Places using invariants in 8248 ms returned []
// Phase 1: matrix 2728 rows 3089 cols
[2023-03-10 18:45:37] [INFO ] Invariants computation overflowed in 6210 ms
[2023-03-10 18:45:38] [INFO ] Implicit Places using invariants and state equation in 6947 ms returned []
Implicit Place search using SMT with State Equation took 15238 ms to find 0 implicit places.
[2023-03-10 18:45:38] [INFO ] Redundant transitions in 85 ms returned []
// Phase 1: matrix 2728 rows 3089 cols
[2023-03-10 18:45:44] [INFO ] Invariants computation overflowed in 6110 ms
[2023-03-10 18:45:46] [INFO ] Dead Transitions using invariants and state equation in 7678 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 23175 ms. Remains : 3089/3089 places, 2728/2728 transitions.
Computed a total of 3089 stabilizing places and 2728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3089 transition count 2728
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 (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 133 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 78 ms :[(NOT p0), (NOT p0)]
Finished random walk after 231 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=28 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 167 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 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 2728 rows 3089 cols
[2023-03-10 18:45:54] [INFO ] Invariants computation overflowed in 6135 ms
[2023-03-10 18:45:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:46:09] [INFO ] [Real]Absence check using state equation in 9539 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 179 reset in 2406 ms.
Product exploration explored 100000 steps with 174 reset in 2644 ms.
Support contains 2 out of 3089 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3089/3089 places, 2728/2728 transitions.
Applied a total of 0 rules in 144 ms. Remains 3089 /3089 variables (removed 0) and now considering 2728/2728 (removed 0) transitions.
// Phase 1: matrix 2728 rows 3089 cols
[2023-03-10 18:46:20] [INFO ] Invariants computation overflowed in 6118 ms
[2023-03-10 18:46:22] [INFO ] Implicit Places using invariants in 8148 ms returned []
// Phase 1: matrix 2728 rows 3089 cols
[2023-03-10 18:46:28] [INFO ] Invariants computation overflowed in 6111 ms
[2023-03-10 18:46:29] [INFO ] Implicit Places using invariants and state equation in 6926 ms returned []
Implicit Place search using SMT with State Equation took 15089 ms to find 0 implicit places.
[2023-03-10 18:46:29] [INFO ] Redundant transitions in 101 ms returned []
// Phase 1: matrix 2728 rows 3089 cols
[2023-03-10 18:46:35] [INFO ] Invariants computation overflowed in 6112 ms
[2023-03-10 18:46:37] [INFO ] Dead Transitions using invariants and state equation in 7720 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 23064 ms. Remains : 3089/3089 places, 2728/2728 transitions.
Treatment of property Echo-PT-d02r19-LTLCardinality-06 finished in 125862 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)))'
Support contains 2 out of 3097 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3097/3097 places, 2730/2730 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 3094 transition count 2730
Applied a total of 3 rules in 130 ms. Remains 3094 /3097 variables (removed 3) and now considering 2730/2730 (removed 0) transitions.
[2023-03-10 18:46:37] [INFO ] Invariant cache hit.
[2023-03-10 18:46:38] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 18:46:40] [INFO ] Implicit Places using invariants in 2706 ms returned []
[2023-03-10 18:46:40] [INFO ] Invariant cache hit.
[2023-03-10 18:46:40] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 18:46:43] [INFO ] Implicit Places using invariants and state equation in 2588 ms returned []
Implicit Place search using SMT with State Equation took 5304 ms to find 0 implicit places.
[2023-03-10 18:46:43] [INFO ] Invariant cache hit.
[2023-03-10 18:46:43] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 18:46:45] [INFO ] Dead Transitions using invariants and state equation in 1977 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3094/3097 places, 2730/2730 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7447 ms. Remains : 3094/3097 places, 2730/2730 transitions.
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Echo-PT-d02r19-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s2934 0) (EQ s2717 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 305 steps with 0 reset in 11 ms.
FORMULA Echo-PT-d02r19-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r19-LTLCardinality-07 finished in 7552 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((p0||F(G(p1))))))'
Support contains 4 out of 3097 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3097/3097 places, 2730/2730 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 3095 transition count 2730
Applied a total of 2 rules in 129 ms. Remains 3095 /3097 variables (removed 2) and now considering 2730/2730 (removed 0) transitions.
// Phase 1: matrix 2730 rows 3095 cols
[2023-03-10 18:46:47] [INFO ] Invariants computation overflowed in 2531 ms
[2023-03-10 18:46:49] [INFO ] Implicit Places using invariants in 4600 ms returned []
// Phase 1: matrix 2730 rows 3095 cols
[2023-03-10 18:46:52] [INFO ] Invariants computation overflowed in 2539 ms
[2023-03-10 18:46:53] [INFO ] Implicit Places using invariants and state equation in 3385 ms returned []
Implicit Place search using SMT with State Equation took 8006 ms to find 0 implicit places.
// Phase 1: matrix 2730 rows 3095 cols
[2023-03-10 18:46:55] [INFO ] Invariants computation overflowed in 2550 ms
[2023-03-10 18:46:57] [INFO ] Dead Transitions using invariants and state equation in 4168 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3095/3097 places, 2730/2730 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12317 ms. Remains : 3095/3097 places, 2730/2730 transitions.
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Echo-PT-d02r19-LTLCardinality-14 automaton TGBA Formula[mat=[[{ 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}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (OR (EQ s2188 0) (EQ s750 1)) (OR (EQ s817 0) (EQ s1729 1))), p1:(OR (EQ s817 0) (EQ s1729 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 138 reset in 2132 ms.
Product exploration explored 100000 steps with 138 reset in 2415 ms.
Computed a total of 3095 stabilizing places and 2730 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3095 transition count 2730
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 (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 158 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p1)]
Finished random walk after 124 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=41 )
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 159 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p1)]
Support contains 2 out of 3095 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 3095/3095 places, 2730/2730 transitions.
Graph (complete) has 9339 edges and 3095 vertex of which 3090 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.6 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 152 ms. Remains 3089 /3095 variables (removed 6) and now considering 2728/2730 (removed 2) transitions.
// Phase 1: matrix 2728 rows 3089 cols
[2023-03-10 18:47:07] [INFO ] Invariants computation overflowed in 2931 ms
[2023-03-10 18:47:09] [INFO ] Implicit Places using invariants in 4989 ms returned []
// Phase 1: matrix 2728 rows 3089 cols
[2023-03-10 18:47:12] [INFO ] Invariants computation overflowed in 2912 ms
[2023-03-10 18:47:12] [INFO ] Implicit Places using invariants and state equation in 3627 ms returned []
Implicit Place search using SMT with State Equation took 8631 ms to find 0 implicit places.
[2023-03-10 18:47:12] [INFO ] Redundant transitions in 106 ms returned []
// Phase 1: matrix 2728 rows 3089 cols
[2023-03-10 18:47:15] [INFO ] Invariants computation overflowed in 2921 ms
[2023-03-10 18:47:17] [INFO ] Dead Transitions using invariants and state equation in 4490 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3089/3095 places, 2728/2730 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13388 ms. Remains : 3089/3095 places, 2728/2730 transitions.
Computed a total of 3089 stabilizing places and 2728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3089 transition count 2728
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 : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 150 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p1)]
Finished random walk after 72 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=24 )
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 158 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p1)]
Product exploration explored 100000 steps with 138 reset in 2131 ms.
Product exploration explored 100000 steps with 138 reset in 2380 ms.
Support contains 2 out of 3089 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3089/3089 places, 2728/2728 transitions.
Graph (complete) has 9314 edges and 3089 vertex of which 3088 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 154 ms. Remains 3088 /3089 variables (removed 1) and now considering 2728/2728 (removed 0) transitions.
// Phase 1: matrix 2728 rows 3088 cols
[2023-03-10 18:47:28] [INFO ] Computed 1364 place invariants in 4818 ms
[2023-03-10 18:47:29] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 18:47:30] [INFO ] Implicit Places using invariants in 7076 ms returned []
[2023-03-10 18:47:30] [INFO ] Invariant cache hit.
[2023-03-10 18:47:31] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 18:47:33] [INFO ] Implicit Places using invariants and state equation in 2344 ms returned []
Implicit Place search using SMT with State Equation took 9453 ms to find 0 implicit places.
[2023-03-10 18:47:33] [INFO ] Redundant transitions in 59 ms returned []
[2023-03-10 18:47:33] [INFO ] Invariant cache hit.
[2023-03-10 18:47:33] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 18:47:35] [INFO ] Dead Transitions using invariants and state equation in 1830 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3088/3089 places, 2728/2728 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11520 ms. Remains : 3088/3089 places, 2728/2728 transitions.
Treatment of property Echo-PT-d02r19-LTLCardinality-14 finished in 50121 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)||p0)))'
Support contains 2 out of 3097 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3097/3097 places, 2730/2730 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 3094 transition count 2730
Applied a total of 3 rules in 125 ms. Remains 3094 /3097 variables (removed 3) and now considering 2730/2730 (removed 0) transitions.
// Phase 1: matrix 2730 rows 3094 cols
[2023-03-10 18:47:39] [INFO ] Computed 1368 place invariants in 4370 ms
[2023-03-10 18:47:40] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 18:47:42] [INFO ] Implicit Places using invariants in 6646 ms returned []
[2023-03-10 18:47:42] [INFO ] Invariant cache hit.
[2023-03-10 18:47:42] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 18:47:44] [INFO ] Implicit Places using invariants and state equation in 2585 ms returned []
Implicit Place search using SMT with State Equation took 9262 ms to find 0 implicit places.
[2023-03-10 18:47:44] [INFO ] Invariant cache hit.
[2023-03-10 18:47:45] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 18:47:46] [INFO ] Dead Transitions using invariants and state equation in 1944 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3094/3097 places, 2730/2730 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11351 ms. Remains : 3094/3097 places, 2730/2730 transitions.
Stuttering acceptance computed with spot in 108 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Echo-PT-d02r19-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(OR (EQ s1397 0) (EQ s331 1)), p0:(OR (EQ s1397 0) (EQ s331 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2117 ms.
Product exploration explored 100000 steps with 50000 reset in 2243 ms.
Computed a total of 3094 stabilizing places and 2730 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3094 transition count 2730
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 p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), true, (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1)))
Knowledge based reduction with 7 factoid took 137 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Echo-PT-d02r19-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d02r19-LTLCardinality-15 finished in 17314 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)))'
Found a Lengthening insensitive property : Echo-PT-d02r19-LTLCardinality-02
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Support contains 4 out of 3097 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3097/3097 places, 2730/2730 transitions.
Graph (complete) has 9355 edges and 3097 vertex of which 3089 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.8 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 146 ms. Remains 3088 /3097 variables (removed 9) and now considering 2728/2730 (removed 2) transitions.
// Phase 1: matrix 2728 rows 3088 cols
[2023-03-10 18:47:57] [INFO ] Computed 1364 place invariants in 4815 ms
[2023-03-10 18:47:58] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 18:47:59] [INFO ] Implicit Places using invariants in 7055 ms returned []
[2023-03-10 18:47:59] [INFO ] Invariant cache hit.
[2023-03-10 18:48:00] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 18:48:02] [INFO ] Implicit Places using invariants and state equation in 2319 ms returned []
Implicit Place search using SMT with State Equation took 9393 ms to find 0 implicit places.
[2023-03-10 18:48:02] [INFO ] Invariant cache hit.
[2023-03-10 18:48:02] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 18:48:04] [INFO ] Dead Transitions using invariants and state equation in 1848 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 3088/3097 places, 2728/2730 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 11397 ms. Remains : 3088/3097 places, 2728/2730 transitions.
Running random walk in product with property : Echo-PT-d02r19-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s128 0) (EQ s1666 1) (EQ s2414 0) (EQ s659 1))], 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, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 138 reset in 2155 ms.
Product exploration explored 100000 steps with 138 reset in 2419 ms.
Computed a total of 3088 stabilizing places and 2728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3088 transition count 2728
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), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 186 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 13 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 213474 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :{}
Probabilistic random walk after 213474 steps, saw 77546 distinct states, run finished after 3001 ms. (steps per millisecond=71 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-10 18:48:13] [INFO ] Invariant cache hit.
[2023-03-10 18:48:18] [INFO ] [Real]Absence check using 0 positive and 1364 generalized place invariants in 4245 ms returned sat
[2023-03-10 18:48:30] [INFO ] After 16531ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 3088 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3088/3088 places, 2728/2728 transitions.
Graph (complete) has 9308 edges and 3088 vertex of which 3084 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.4 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 3084 transition count 2724
Applied a total of 5 rules in 160 ms. Remains 3084 /3088 variables (removed 4) and now considering 2724/2728 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 3084/3088 places, 2724/2728 transitions.
Incomplete random walk after 10000 steps, including 13 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 214218 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :{}
Probabilistic random walk after 214218 steps, saw 77638 distinct states, run finished after 3001 ms. (steps per millisecond=71 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2724 rows 3084 cols
[2023-03-10 18:48:37] [INFO ] Invariants computation overflowed in 3341 ms
[2023-03-10 18:49:02] [INFO ] After 25016ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 3084 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3084/3084 places, 2724/2724 transitions.
Applied a total of 0 rules in 155 ms. Remains 3084 /3084 variables (removed 0) and now considering 2724/2724 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 3084/3084 places, 2724/2724 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3084/3084 places, 2724/2724 transitions.
Applied a total of 0 rules in 149 ms. Remains 3084 /3084 variables (removed 0) and now considering 2724/2724 (removed 0) transitions.
// Phase 1: matrix 2724 rows 3084 cols
[2023-03-10 18:49:05] [INFO ] Invariants computation overflowed in 3326 ms
[2023-03-10 18:49:07] [INFO ] Implicit Places using invariants in 5339 ms returned []
// Phase 1: matrix 2724 rows 3084 cols
[2023-03-10 18:49:10] [INFO ] Invariants computation overflowed in 3317 ms
[2023-03-10 18:49:11] [INFO ] Implicit Places using invariants and state equation in 4010 ms returned []
Implicit Place search using SMT with State Equation took 9365 ms to find 0 implicit places.
[2023-03-10 18:49:11] [INFO ] Redundant transitions in 60 ms returned []
// Phase 1: matrix 2724 rows 3084 cols
[2023-03-10 18:49:15] [INFO ] Invariants computation overflowed in 3328 ms
[2023-03-10 18:49:16] [INFO ] Dead Transitions using invariants and state equation in 4938 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14537 ms. Remains : 3084/3084 places, 2724/2724 transitions.
Applied a total of 0 rules in 142 ms. Remains 3084 /3084 variables (removed 0) and now considering 2724/2724 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2724 rows 3084 cols
[2023-03-10 18:49:20] [INFO ] Invariants computation overflowed in 3317 ms
[2023-03-10 18:52:10] [INFO ] After 170768ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 259 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0), (NOT p0)]
Support contains 4 out of 3088 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3088/3088 places, 2728/2728 transitions.
Applied a total of 0 rules in 116 ms. Remains 3088 /3088 variables (removed 0) and now considering 2728/2728 (removed 0) transitions.
[2023-03-10 18:52:11] [INFO ] Invariant cache hit.
[2023-03-10 18:52:12] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 18:52:14] [INFO ] Implicit Places using invariants in 2509 ms returned []
[2023-03-10 18:52:14] [INFO ] Invariant cache hit.
[2023-03-10 18:52:14] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 18:52:16] [INFO ] Implicit Places using invariants and state equation in 2434 ms returned []
Implicit Place search using SMT with State Equation took 4946 ms to find 0 implicit places.
[2023-03-10 18:52:16] [INFO ] Invariant cache hit.
[2023-03-10 18:52:17] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 18:52:18] [INFO ] Dead Transitions using invariants and state equation in 1922 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6986 ms. Remains : 3088/3088 places, 2728/2728 transitions.
Computed a total of 3088 stabilizing places and 2728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3088 transition count 2728
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), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 203 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 13 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 215739 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :{}
Probabilistic random walk after 215739 steps, saw 77919 distinct states, run finished after 3001 ms. (steps per millisecond=71 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-10 18:52:23] [INFO ] Invariant cache hit.
[2023-03-10 18:52:28] [INFO ] [Real]Absence check using 0 positive and 1364 generalized place invariants in 4300 ms returned sat
[2023-03-10 18:52:40] [INFO ] After 16706ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 3088 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3088/3088 places, 2728/2728 transitions.
Graph (complete) has 9308 edges and 3088 vertex of which 3084 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 3084 transition count 2724
Applied a total of 5 rules in 171 ms. Remains 3084 /3088 variables (removed 4) and now considering 2724/2728 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 171 ms. Remains : 3084/3088 places, 2724/2728 transitions.
Incomplete random walk after 10000 steps, including 13 resets, run finished after 235 ms. (steps per millisecond=42 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 211634 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :{}
Probabilistic random walk after 211634 steps, saw 77201 distinct states, run finished after 3001 ms. (steps per millisecond=70 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2724 rows 3084 cols
[2023-03-10 18:52:47] [INFO ] Invariants computation overflowed in 3429 ms
[2023-03-10 18:53:12] [INFO ] After 25031ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 3084 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3084/3084 places, 2724/2724 transitions.
Applied a total of 0 rules in 161 ms. Remains 3084 /3084 variables (removed 0) and now considering 2724/2724 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 161 ms. Remains : 3084/3084 places, 2724/2724 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3084/3084 places, 2724/2724 transitions.
Applied a total of 0 rules in 161 ms. Remains 3084 /3084 variables (removed 0) and now considering 2724/2724 (removed 0) transitions.
// Phase 1: matrix 2724 rows 3084 cols
[2023-03-10 18:53:15] [INFO ] Invariants computation overflowed in 3527 ms
[2023-03-10 18:53:18] [INFO ] Implicit Places using invariants in 5748 ms returned []
// Phase 1: matrix 2724 rows 3084 cols
[2023-03-10 18:53:21] [INFO ] Invariants computation overflowed in 3504 ms
[2023-03-10 18:53:22] [INFO ] Implicit Places using invariants and state equation in 4263 ms returned []
Implicit Place search using SMT with State Equation took 10015 ms to find 0 implicit places.
[2023-03-10 18:53:22] [INFO ] Redundant transitions in 62 ms returned []
// Phase 1: matrix 2724 rows 3084 cols
[2023-03-10 18:53:25] [INFO ] Invariants computation overflowed in 3346 ms
[2023-03-10 18:53:27] [INFO ] Dead Transitions using invariants and state equation in 5048 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15300 ms. Remains : 3084/3084 places, 2724/2724 transitions.
Applied a total of 0 rules in 143 ms. Remains 3084 /3084 variables (removed 0) and now considering 2724/2724 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2724 rows 3084 cols
[2023-03-10 18:53:31] [INFO ] Invariants computation overflowed in 3364 ms
[2023-03-10 18:56:23] [INFO ] After 172862ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 181 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0), (NOT p0)]
Entered a terminal (fully accepting) state of product in 20276 steps with 28 reset in 417 ms.
Treatment of property Echo-PT-d02r19-LTLCardinality-02 finished in 512286 ms.
FORMULA Echo-PT-d02r19-LTLCardinality-02 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G((p1 U p2))))))'
Found a Shortening insensitive property : Echo-PT-d02r19-LTLCardinality-04
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 3097 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3097/3097 places, 2730/2730 transitions.
Graph (complete) has 9355 edges and 3097 vertex of which 3090 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.4 ms
Discarding 7 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 136 ms. Remains 3089 /3097 variables (removed 8) and now considering 2728/2730 (removed 2) transitions.
// Phase 1: matrix 2728 rows 3089 cols
[2023-03-10 18:56:32] [INFO ] Computed 1365 place invariants in 6915 ms
[2023-03-10 18:56:34] [INFO ] Implicit Places using invariants in 9108 ms returned []
[2023-03-10 18:56:34] [INFO ] Invariant cache hit.
[2023-03-10 18:56:36] [INFO ] Implicit Places using invariants and state equation in 2120 ms returned []
Implicit Place search using SMT with State Equation took 11236 ms to find 0 implicit places.
[2023-03-10 18:56:36] [INFO ] Invariant cache hit.
[2023-03-10 18:56:38] [INFO ] Dead Transitions using invariants and state equation in 1742 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 3089/3097 places, 2728/2730 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 13114 ms. Remains : 3089/3097 places, 2728/2730 transitions.
Running random walk in product with property : Echo-PT-d02r19-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(AND (EQ s2716 0) (EQ s2453 1)), p2:(OR (EQ s2223 0) (EQ s710 1)), p1:(EQ s50 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 195 reset in 2613 ms.
Product exploration explored 100000 steps with 188 reset in 2902 ms.
Computed a total of 3089 stabilizing places and 2728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3089 transition count 2728
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) (NOT p2) (NOT p1)), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 514 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 13 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-10 18:56:46] [INFO ] Invariant cache hit.
[2023-03-10 18:56:46] [INFO ] After 494ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 18:56:47] [INFO ] [Nat]Absence check using 4 positive place invariants in 65 ms returned sat
[2023-03-10 18:56:54] [INFO ] [Nat]Absence check using 4 positive and 1361 generalized place invariants in 7266 ms returned sat
[2023-03-10 18:57:11] [INFO ] After 25025ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 3089 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3089/3089 places, 2728/2728 transitions.
Graph (complete) has 9316 edges and 3089 vertex of which 3085 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 3085 transition count 2724
Applied a total of 5 rules in 151 ms. Remains 3085 /3089 variables (removed 4) and now considering 2724/2728 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 151 ms. Remains : 3085/3089 places, 2724/2728 transitions.
Incomplete random walk after 10000 steps, including 13 resets, run finished after 221 ms. (steps per millisecond=45 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 219597 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :{}
Probabilistic random walk after 219597 steps, saw 78651 distinct states, run finished after 3001 ms. (steps per millisecond=73 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2724 rows 3085 cols
[2023-03-10 18:57:17] [INFO ] Invariants computation overflowed in 1981 ms
[2023-03-10 18:57:17] [INFO ] After 493ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 18:57:42] [INFO ] After 25012ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 3085 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3085/3085 places, 2724/2724 transitions.
Applied a total of 0 rules in 139 ms. Remains 3085 /3085 variables (removed 0) and now considering 2724/2724 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 3085/3085 places, 2724/2724 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3085/3085 places, 2724/2724 transitions.
Applied a total of 0 rules in 150 ms. Remains 3085 /3085 variables (removed 0) and now considering 2724/2724 (removed 0) transitions.
// Phase 1: matrix 2724 rows 3085 cols
[2023-03-10 18:57:44] [INFO ] Invariants computation overflowed in 2037 ms
[2023-03-10 18:57:47] [INFO ] Implicit Places using invariants in 4148 ms returned []
// Phase 1: matrix 2724 rows 3085 cols
[2023-03-10 18:57:49] [INFO ] Invariants computation overflowed in 2063 ms
[2023-03-10 18:57:49] [INFO ] Implicit Places using invariants and state equation in 2847 ms returned []
Implicit Place search using SMT with State Equation took 7010 ms to find 0 implicit places.
[2023-03-10 18:57:49] [INFO ] Redundant transitions in 67 ms returned []
// Phase 1: matrix 2724 rows 3085 cols
[2023-03-10 18:57:52] [INFO ] Invariants computation overflowed in 2076 ms
[2023-03-10 18:57:53] [INFO ] Dead Transitions using invariants and state equation in 3564 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10817 ms. Remains : 3085/3085 places, 2724/2724 transitions.
Applied a total of 0 rules in 146 ms. Remains 3085 /3085 variables (removed 0) and now considering 2724/2724 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2724 rows 3085 cols
[2023-03-10 18:57:55] [INFO ] Invariants computation overflowed in 2163 ms
[2023-03-10 18:57:56] [INFO ] After 514ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 19:01:41] [INFO ] After 225037ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
Knowledge based reduction with 10 factoid took 440 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
[2023-03-10 19:01:42] [INFO ] Invariant cache hit.
[2023-03-10 19:01:47] [INFO ] [Real]Absence check using 4 positive place invariants in 172 ms returned sat
[2023-03-10 19:01:57] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 19:01:57] [INFO ] [Real]Absence check using 4 positive and 1361 generalized place invariants in 9156 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 5 out of 3089 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3089/3089 places, 2728/2728 transitions.
Applied a total of 0 rules in 182 ms. Remains 3089 /3089 variables (removed 0) and now considering 2728/2728 (removed 0) transitions.
[2023-03-10 19:01:57] [INFO ] Invariant cache hit.
[2023-03-10 19:01:59] [INFO ] Implicit Places using invariants in 2508 ms returned []
[2023-03-10 19:01:59] [INFO ] Invariant cache hit.
[2023-03-10 19:02:02] [INFO ] Implicit Places using invariants and state equation in 2332 ms returned []
Implicit Place search using SMT with State Equation took 4882 ms to find 0 implicit places.
[2023-03-10 19:02:02] [INFO ] Invariant cache hit.
[2023-03-10 19:02:04] [INFO ] Dead Transitions using invariants and state equation in 1830 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6895 ms. Remains : 3089/3089 places, 2728/2728 transitions.
Computed a total of 3089 stabilizing places and 2728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3089 transition count 2728
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) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 425 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 13 resets, run finished after 247 ms. (steps per millisecond=40 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-10 19:02:06] [INFO ] Invariant cache hit.
[2023-03-10 19:02:06] [INFO ] After 451ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 19:02:07] [INFO ] [Nat]Absence check using 4 positive place invariants in 62 ms returned sat
[2023-03-10 19:02:14] [INFO ] [Nat]Absence check using 4 positive and 1361 generalized place invariants in 7136 ms returned sat
[2023-03-10 19:02:31] [INFO ] After 25019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 3089 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3089/3089 places, 2728/2728 transitions.
Graph (complete) has 9316 edges and 3089 vertex of which 3085 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.4 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 3085 transition count 2724
Applied a total of 5 rules in 186 ms. Remains 3085 /3089 variables (removed 4) and now considering 2724/2728 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 186 ms. Remains : 3085/3089 places, 2724/2728 transitions.
Incomplete random walk after 10000 steps, including 13 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 201665 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :{}
Probabilistic random walk after 201665 steps, saw 75437 distinct states, run finished after 3001 ms. (steps per millisecond=67 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2724 rows 3085 cols
[2023-03-10 19:02:37] [INFO ] Invariants computation overflowed in 2285 ms
[2023-03-10 19:02:38] [INFO ] After 465ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 19:03:03] [INFO ] After 25022ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 3085 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3085/3085 places, 2724/2724 transitions.
Applied a total of 0 rules in 167 ms. Remains 3085 /3085 variables (removed 0) and now considering 2724/2724 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 3085/3085 places, 2724/2724 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3085/3085 places, 2724/2724 transitions.
Applied a total of 0 rules in 146 ms. Remains 3085 /3085 variables (removed 0) and now considering 2724/2724 (removed 0) transitions.
// Phase 1: matrix 2724 rows 3085 cols
[2023-03-10 19:03:05] [INFO ] Invariants computation overflowed in 2354 ms
[2023-03-10 19:03:07] [INFO ] Implicit Places using invariants in 4468 ms returned []
// Phase 1: matrix 2724 rows 3085 cols
[2023-03-10 19:03:10] [INFO ] Invariants computation overflowed in 2347 ms
[2023-03-10 19:03:10] [INFO ] Implicit Places using invariants and state equation in 3050 ms returned []
Implicit Place search using SMT with State Equation took 7524 ms to find 0 implicit places.
[2023-03-10 19:03:10] [INFO ] Redundant transitions in 63 ms returned []
// Phase 1: matrix 2724 rows 3085 cols
[2023-03-10 19:03:13] [INFO ] Invariants computation overflowed in 2407 ms
[2023-03-10 19:03:15] [INFO ] Dead Transitions using invariants and state equation in 4073 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11825 ms. Remains : 3085/3085 places, 2724/2724 transitions.
Applied a total of 0 rules in 175 ms. Remains 3085 /3085 variables (removed 0) and now considering 2724/2724 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2724 rows 3085 cols
[2023-03-10 19:03:17] [INFO ] Invariants computation overflowed in 2390 ms
[2023-03-10 19:03:18] [INFO ] After 508ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 19:07:03] [INFO ] After 225020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (OR (AND (NOT p0) p2) (AND (NOT p0) p1))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1))))]
Knowledge based reduction with 10 factoid took 522 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
[2023-03-10 19:07:04] [INFO ] Invariant cache hit.
[2023-03-10 19:07:09] [INFO ] [Real]Absence check using 4 positive place invariants in 87 ms returned sat
[2023-03-10 19:07:19] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 19:07:19] [INFO ] [Real]Absence check using 4 positive and 1361 generalized place invariants in 9094 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 204 reset in 2558 ms.
Product exploration explored 100000 steps with 187 reset in 2803 ms.
Applying partial POR strategy [true, true, false]
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 3089 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3089/3089 places, 2728/2728 transitions.
Applied a total of 0 rules in 171 ms. Remains 3089 /3089 variables (removed 0) and now considering 2728/2728 (removed 0) transitions.
[2023-03-10 19:07:24] [INFO ] Redundant transitions in 59 ms returned []
[2023-03-10 19:07:24] [INFO ] Invariant cache hit.
[2023-03-10 19:07:26] [INFO ] Dead Transitions using invariants and state equation in 1956 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2196 ms. Remains : 3089/3089 places, 2728/2728 transitions.
Support contains 5 out of 3089 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3089/3089 places, 2728/2728 transitions.
Applied a total of 0 rules in 153 ms. Remains 3089 /3089 variables (removed 0) and now considering 2728/2728 (removed 0) transitions.
[2023-03-10 19:07:27] [INFO ] Invariant cache hit.
[2023-03-10 19:07:29] [INFO ] Implicit Places using invariants in 2281 ms returned []
[2023-03-10 19:07:29] [INFO ] Invariant cache hit.
[2023-03-10 19:07:31] [INFO ] Implicit Places using invariants and state equation in 2282 ms returned []
Implicit Place search using SMT with State Equation took 4565 ms to find 0 implicit places.
[2023-03-10 19:07:31] [INFO ] Invariant cache hit.
[2023-03-10 19:07:33] [INFO ] Dead Transitions using invariants and state equation in 1853 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6572 ms. Remains : 3089/3089 places, 2728/2728 transitions.
Treatment of property Echo-PT-d02r19-LTLCardinality-04 finished in 668754 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(X((p0||F(G(p1))))))'
[2023-03-10 19:07:33] [INFO ] Flatten gal took : 135 ms
[2023-03-10 19:07:33] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-10 19:07:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3097 places, 2730 transitions and 14586 arcs took 25 ms.
Total runtime 2084449 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2179/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2179/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2179/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2179/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : Echo-PT-d02r19-LTLCardinality-02
Could not compute solution for formula : Echo-PT-d02r19-LTLCardinality-04
Could not compute solution for formula : Echo-PT-d02r19-LTLCardinality-06
Could not compute solution for formula : Echo-PT-d02r19-LTLCardinality-14

BK_STOP 1678475260978

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name Echo-PT-d02r19-LTLCardinality-02
ltl formula formula --ltl=/tmp/2179/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 3097 places, 2730 transitions and 14586 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.300 real 0.110 user 0.100 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2179/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2179/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2179/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2179/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name Echo-PT-d02r19-LTLCardinality-04
ltl formula formula --ltl=/tmp/2179/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 3097 places, 2730 transitions and 14586 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.310 real 0.120 user 0.090 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2179/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2179/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2179/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2179/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
ltl formula name Echo-PT-d02r19-LTLCardinality-06
ltl formula formula --ltl=/tmp/2179/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 3097 places, 2730 transitions and 14586 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.290 real 0.110 user 0.090 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2179/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2179/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2179/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2179/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name Echo-PT-d02r19-LTLCardinality-14
ltl formula formula --ltl=/tmp/2179/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 3097 places, 2730 transitions and 14586 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.310 real 0.090 user 0.120 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2179/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2179/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2179/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2179/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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="Echo-PT-d02r19"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is Echo-PT-d02r19, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r169-tall-167838855300075"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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