Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r091-tall-171624187100164.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is CloudReconfiguration-PT-307, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r091-tall-171624187100164
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 22 14:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 22 14:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 19:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Apr 11 19:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 11 19:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 11 19:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 660K May 18 16:42 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 CloudReconfiguration-PT-307-LTLFireability-00
FORMULA_NAME CloudReconfiguration-PT-307-LTLFireability-01
FORMULA_NAME CloudReconfiguration-PT-307-LTLFireability-02
FORMULA_NAME CloudReconfiguration-PT-307-LTLFireability-03
FORMULA_NAME CloudReconfiguration-PT-307-LTLFireability-04
FORMULA_NAME CloudReconfiguration-PT-307-LTLFireability-05
FORMULA_NAME CloudReconfiguration-PT-307-LTLFireability-06
FORMULA_NAME CloudReconfiguration-PT-307-LTLFireability-07
FORMULA_NAME CloudReconfiguration-PT-307-LTLFireability-08
FORMULA_NAME CloudReconfiguration-PT-307-LTLFireability-09
FORMULA_NAME CloudReconfiguration-PT-307-LTLFireability-10
FORMULA_NAME CloudReconfiguration-PT-307-LTLFireability-11
FORMULA_NAME CloudReconfiguration-PT-307-LTLFireability-12
FORMULA_NAME CloudReconfiguration-PT-307-LTLFireability-13
FORMULA_NAME CloudReconfiguration-PT-307-LTLFireability-14
FORMULA_NAME CloudReconfiguration-PT-307-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716263342133

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudReconfiguration-PT-307
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 03:49:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 03:49:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 03:49:03] [INFO ] Load time of PNML (sax parser for PT used): 158 ms
[2024-05-21 03:49:03] [INFO ] Transformed 2584 places.
[2024-05-21 03:49:03] [INFO ] Transformed 3094 transitions.
[2024-05-21 03:49:03] [INFO ] Found NUPN structural information;
[2024-05-21 03:49:03] [INFO ] Parsed PT model containing 2584 places and 3094 transitions and 6459 arcs in 274 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CloudReconfiguration-PT-307-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-307-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 2584 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2584/2584 places, 3094/3094 transitions.
Discarding 516 places :
Symmetric choice reduction at 0 with 516 rule applications. Total rules 516 place count 2068 transition count 2578
Iterating global reduction 0 with 516 rules applied. Total rules applied 1032 place count 2068 transition count 2578
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 1059 place count 2068 transition count 2551
Discarding 240 places :
Symmetric choice reduction at 1 with 240 rule applications. Total rules 1299 place count 1828 transition count 2311
Iterating global reduction 1 with 240 rules applied. Total rules applied 1539 place count 1828 transition count 2311
Discarding 88 places :
Symmetric choice reduction at 1 with 88 rule applications. Total rules 1627 place count 1740 transition count 2223
Iterating global reduction 1 with 88 rules applied. Total rules applied 1715 place count 1740 transition count 2223
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 1732 place count 1740 transition count 2206
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 1780 place count 1692 transition count 2158
Iterating global reduction 2 with 48 rules applied. Total rules applied 1828 place count 1692 transition count 2158
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 1836 place count 1692 transition count 2150
Discarding 37 places :
Symmetric choice reduction at 3 with 37 rule applications. Total rules 1873 place count 1655 transition count 2108
Iterating global reduction 3 with 37 rules applied. Total rules applied 1910 place count 1655 transition count 2108
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 1937 place count 1628 transition count 2081
Iterating global reduction 3 with 27 rules applied. Total rules applied 1964 place count 1628 transition count 2081
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 1989 place count 1603 transition count 2056
Iterating global reduction 3 with 25 rules applied. Total rules applied 2014 place count 1603 transition count 2056
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 2038 place count 1579 transition count 2032
Iterating global reduction 3 with 24 rules applied. Total rules applied 2062 place count 1579 transition count 2032
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 2082 place count 1559 transition count 2000
Iterating global reduction 3 with 20 rules applied. Total rules applied 2102 place count 1559 transition count 2000
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 2108 place count 1553 transition count 1990
Iterating global reduction 3 with 6 rules applied. Total rules applied 2114 place count 1553 transition count 1990
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 2120 place count 1547 transition count 1981
Iterating global reduction 3 with 6 rules applied. Total rules applied 2126 place count 1547 transition count 1981
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2127 place count 1547 transition count 1980
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 2130 place count 1544 transition count 1977
Iterating global reduction 4 with 3 rules applied. Total rules applied 2133 place count 1544 transition count 1977
Applied a total of 2133 rules in 1647 ms. Remains 1544 /2584 variables (removed 1040) and now considering 1977/3094 (removed 1117) transitions.
// Phase 1: matrix 1977 rows 1544 cols
[2024-05-21 03:49:05] [INFO ] Computed 4 invariants in 25 ms
[2024-05-21 03:49:06] [INFO ] Implicit Places using invariants in 406 ms returned []
[2024-05-21 03:49:06] [INFO ] Invariant cache hit.
[2024-05-21 03:49:07] [INFO ] Implicit Places using invariants and state equation in 998 ms returned [1533]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1554 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1543/2584 places, 1977/3094 transitions.
Applied a total of 0 rules in 57 ms. Remains 1543 /1543 variables (removed 0) and now considering 1977/1977 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3275 ms. Remains : 1543/2584 places, 1977/3094 transitions.
Support contains 30 out of 1543 places after structural reductions.
[2024-05-21 03:49:07] [INFO ] Flatten gal took : 144 ms
[2024-05-21 03:49:07] [INFO ] Flatten gal took : 73 ms
[2024-05-21 03:49:07] [INFO ] Input system was already deterministic with 1977 transitions.
RANDOM walk for 40000 steps (342 resets) in 1833 ms. (21 steps per ms) remains 19/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (10 resets) in 26 ms. (148 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (10 resets) in 27 ms. (142 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (10 resets) in 33 ms. (117 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (9 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (10 resets) in 25 ms. (153 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (10 resets) in 22 ms. (174 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (10 resets) in 25 ms. (154 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (11 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (10 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (10 resets) in 32 ms. (121 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (12 resets) in 63 ms. (62 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (10 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (11 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (11 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (9 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (10 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (9 resets) in 13 ms. (285 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (10 resets) in 31 ms. (125 steps per ms) remains 19/19 properties
// Phase 1: matrix 1977 rows 1543 cols
[2024-05-21 03:49:08] [INFO ] Computed 3 invariants in 19 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 1500/1520 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1520 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 1959/3479 variables, 1520/1523 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3479 variables, 0/1523 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 7/3486 variables, 5/1528 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3486 variables, 0/1528 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 6/3492 variables, 3/1531 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3492 variables, 0/1531 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 6/3498 variables, 3/1534 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3498 variables, 0/1534 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (OVERLAPS) 6/3504 variables, 3/1537 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3504/3520 variables, and 1537 constraints, problems are : Problem set: 0 solved, 19 unsolved in 5009 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1534/1543 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 1500/1520 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1520 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 1959/3479 variables, 1520/1523 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3479 variables, 19/1542 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3479 variables, 0/1542 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 7/3486 variables, 5/1547 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3486 variables, 0/1547 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 6/3492 variables, 3/1550 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3492 variables, 0/1550 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 6/3498 variables, 3/1553 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3498 variables, 0/1553 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (OVERLAPS) 6/3504 variables, 3/1556 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 0)
(s2 0)
(s3 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 2)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 1)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 1)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 1)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 2)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 1)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 1)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 1)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 1)
(s194 1)
(s195 1)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 1)
(s299 5)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 1)
(s345 0)
(s346 0)
(s347 0)
(s348 1)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3504/3520 variables, and 1556 constraints, problems are : Problem set: 0 solved, 19 unsolved in 5023 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1534/1543 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
After SMT, in 10099ms problems are : Problem set: 0 solved, 19 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 20 out of 1543 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1543/1543 places, 1977/1977 transitions.
Graph (trivial) has 1846 edges and 1543 vertex of which 666 / 1543 are part of one of the 62 SCC in 9 ms
Free SCC test removed 604 places
Drop transitions (Empty/Sink Transition effects.) removed 764 transitions
Reduce isomorphic transitions removed 764 transitions.
Graph (complete) has 1382 edges and 939 vertex of which 931 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.3 ms
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 503 transitions
Trivial Post-agglo rules discarded 503 transitions
Performed 503 trivial Post agglomeration. Transition count delta: 503
Iterating post reduction 0 with 510 rules applied. Total rules applied 512 place count 931 transition count 699
Reduce places removed 503 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 556 rules applied. Total rules applied 1068 place count 428 transition count 646
Reduce places removed 34 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 41 rules applied. Total rules applied 1109 place count 394 transition count 639
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 1116 place count 387 transition count 639
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 51 Pre rules applied. Total rules applied 1116 place count 387 transition count 588
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 4 with 102 rules applied. Total rules applied 1218 place count 336 transition count 588
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1225 place count 329 transition count 579
Iterating global reduction 4 with 7 rules applied. Total rules applied 1232 place count 329 transition count 579
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 1233 place count 329 transition count 578
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1234 place count 328 transition count 578
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 1239 place count 323 transition count 573
Iterating global reduction 6 with 5 rules applied. Total rules applied 1244 place count 323 transition count 573
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1249 place count 323 transition count 568
Performed 160 Post agglomeration using F-continuation condition with reduction of 99 identical transitions.
Deduced a syphon composed of 160 places in 1 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 7 with 320 rules applied. Total rules applied 1569 place count 163 transition count 309
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 7 with 19 rules applied. Total rules applied 1588 place count 163 transition count 290
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1592 place count 159 transition count 286
Iterating global reduction 8 with 4 rules applied. Total rules applied 1596 place count 159 transition count 286
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1597 place count 158 transition count 285
Iterating global reduction 8 with 1 rules applied. Total rules applied 1598 place count 158 transition count 285
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1599 place count 158 transition count 284
Performed 12 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 9 with 24 rules applied. Total rules applied 1623 place count 146 transition count 271
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 9 with 15 rules applied. Total rules applied 1638 place count 146 transition count 256
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1640 place count 145 transition count 255
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1642 place count 145 transition count 253
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 1644 place count 144 transition count 252
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 1645 place count 144 transition count 251
Performed 31 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 12 with 62 rules applied. Total rules applied 1707 place count 113 transition count 288
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 12 with 32 rules applied. Total rules applied 1739 place count 113 transition count 256
Discarding 17 places :
Symmetric choice reduction at 13 with 17 rule applications. Total rules 1756 place count 96 transition count 227
Iterating global reduction 13 with 17 rules applied. Total rules applied 1773 place count 96 transition count 227
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 13 with 10 rules applied. Total rules applied 1783 place count 96 transition count 217
Discarding 2 places :
Symmetric choice reduction at 14 with 2 rule applications. Total rules 1785 place count 94 transition count 213
Iterating global reduction 14 with 2 rules applied. Total rules applied 1787 place count 94 transition count 213
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 1789 place count 94 transition count 211
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 15 with 21 rules applied. Total rules applied 1810 place count 94 transition count 190
Discarding 3 places :
Symmetric choice reduction at 15 with 3 rule applications. Total rules 1813 place count 91 transition count 185
Iterating global reduction 15 with 3 rules applied. Total rules applied 1816 place count 91 transition count 185
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 1817 place count 90 transition count 184
Iterating global reduction 15 with 1 rules applied. Total rules applied 1818 place count 90 transition count 184
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 1819 place count 90 transition count 183
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 1820 place count 90 transition count 182
Free-agglomeration rule applied 6 times.
Iterating global reduction 16 with 6 rules applied. Total rules applied 1826 place count 90 transition count 176
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 16 with 8 rules applied. Total rules applied 1834 place count 84 transition count 174
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 17 with 2 rules applied. Total rules applied 1836 place count 84 transition count 172
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 1837 place count 83 transition count 171
Iterating global reduction 17 with 1 rules applied. Total rules applied 1838 place count 83 transition count 171
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 17 with 2 rules applied. Total rules applied 1840 place count 83 transition count 171
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 1841 place count 83 transition count 170
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 18 with 3 rules applied. Total rules applied 1844 place count 83 transition count 170
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 18 with 1 rules applied. Total rules applied 1845 place count 82 transition count 169
Applied a total of 1845 rules in 205 ms. Remains 82 /1543 variables (removed 1461) and now considering 169/1977 (removed 1808) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 205 ms. Remains : 82/1543 places, 169/1977 transitions.
RANDOM walk for 40000 steps (659 resets) in 692 ms. (57 steps per ms) remains 1/19 properties
BEST_FIRST walk for 40003 steps (174 resets) in 161 ms. (246 steps per ms) remains 1/1 properties
[2024-05-21 03:49:19] [INFO ] Flow matrix only has 161 transitions (discarded 8 similar events)
// Phase 1: matrix 161 rows 82 cols
[2024-05-21 03:49:19] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 03:49:19] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp12 is UNSAT
After SMT solving in domain Real declared 19/243 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 24 ms.
Refiners :[Positive P Invariants (semi-flows): 1/4 constraints, State Equation: 0/82 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 30ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
FORMULA CloudReconfiguration-PT-307-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 26 stabilizing places and 28 stable transitions
Graph (complete) has 2150 edges and 1543 vertex of which 1535 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.22 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F((p1||G(p2)))))'
Support contains 3 out of 1543 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1543/1543 places, 1977/1977 transitions.
Graph (trivial) has 1883 edges and 1543 vertex of which 689 / 1543 are part of one of the 62 SCC in 3 ms
Free SCC test removed 627 places
Ensure Unique test removed 729 transitions
Reduce isomorphic transitions removed 729 transitions.
Graph (complete) has 1416 edges and 916 vertex of which 908 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.3 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 499 transitions
Trivial Post-agglo rules discarded 499 transitions
Performed 499 trivial Post agglomeration. Transition count delta: 499
Iterating post reduction 0 with 499 rules applied. Total rules applied 501 place count 907 transition count 743
Reduce places removed 499 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 521 rules applied. Total rules applied 1022 place count 408 transition count 721
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 12 rules applied. Total rules applied 1034 place count 397 transition count 720
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1035 place count 396 transition count 720
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 48 Pre rules applied. Total rules applied 1035 place count 396 transition count 672
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 1131 place count 348 transition count 672
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 1145 place count 334 transition count 649
Iterating global reduction 4 with 14 rules applied. Total rules applied 1159 place count 334 transition count 649
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 1160 place count 334 transition count 648
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1161 place count 333 transition count 648
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1171 place count 323 transition count 633
Iterating global reduction 6 with 10 rules applied. Total rules applied 1181 place count 323 transition count 633
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 6 rules applied. Total rules applied 1187 place count 323 transition count 627
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1188 place count 322 transition count 627
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1190 place count 320 transition count 623
Iterating global reduction 8 with 2 rules applied. Total rules applied 1192 place count 320 transition count 623
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1194 place count 318 transition count 619
Iterating global reduction 8 with 2 rules applied. Total rules applied 1196 place count 318 transition count 619
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1198 place count 316 transition count 615
Iterating global reduction 8 with 2 rules applied. Total rules applied 1200 place count 316 transition count 615
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1202 place count 314 transition count 611
Iterating global reduction 8 with 2 rules applied. Total rules applied 1204 place count 314 transition count 611
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1206 place count 312 transition count 607
Iterating global reduction 8 with 2 rules applied. Total rules applied 1208 place count 312 transition count 607
Performed 147 Post agglomeration using F-continuation condition with reduction of 84 identical transitions.
Deduced a syphon composed of 147 places in 0 ms
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 8 with 294 rules applied. Total rules applied 1502 place count 165 transition count 376
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 1520 place count 165 transition count 358
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 1527 place count 158 transition count 342
Iterating global reduction 9 with 7 rules applied. Total rules applied 1534 place count 158 transition count 342
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1535 place count 157 transition count 341
Iterating global reduction 9 with 1 rules applied. Total rules applied 1536 place count 157 transition count 341
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1537 place count 157 transition count 340
Performed 14 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 10 with 28 rules applied. Total rules applied 1565 place count 143 transition count 324
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 10 with 14 rules applied. Total rules applied 1579 place count 143 transition count 310
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 11 with 34 rules applied. Total rules applied 1613 place count 126 transition count 344
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 11 with 17 rules applied. Total rules applied 1630 place count 126 transition count 327
Discarding 9 places :
Symmetric choice reduction at 12 with 9 rule applications. Total rules 1639 place count 117 transition count 309
Iterating global reduction 12 with 9 rules applied. Total rules applied 1648 place count 117 transition count 309
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 1654 place count 117 transition count 303
Drop transitions (Redundant composition of simpler transitions.) removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 13 with 37 rules applied. Total rules applied 1691 place count 117 transition count 266
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 1692 place count 117 transition count 266
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 1693 place count 116 transition count 265
Applied a total of 1693 rules in 134 ms. Remains 116 /1543 variables (removed 1427) and now considering 265/1977 (removed 1712) transitions.
[2024-05-21 03:49:19] [INFO ] Flow matrix only has 209 transitions (discarded 56 similar events)
// Phase 1: matrix 209 rows 116 cols
[2024-05-21 03:49:19] [INFO ] Computed 0 invariants in 3 ms
[2024-05-21 03:49:19] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-21 03:49:19] [INFO ] Flow matrix only has 209 transitions (discarded 56 similar events)
[2024-05-21 03:49:19] [INFO ] Invariant cache hit.
[2024-05-21 03:49:19] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 03:49:19] [INFO ] Implicit Places using invariants and state equation in 112 ms returned [8, 43, 78]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 168 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 113/1543 places, 265/1977 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 111 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 110 transition count 262
Applied a total of 3 rules in 13 ms. Remains 110 /113 variables (removed 3) and now considering 262/265 (removed 3) transitions.
[2024-05-21 03:49:19] [INFO ] Flow matrix only has 206 transitions (discarded 56 similar events)
// Phase 1: matrix 206 rows 110 cols
[2024-05-21 03:49:19] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 03:49:19] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-21 03:49:19] [INFO ] Flow matrix only has 206 transitions (discarded 56 similar events)
[2024-05-21 03:49:19] [INFO ] Invariant cache hit.
[2024-05-21 03:49:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 03:49:20] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 110/1543 places, 262/1977 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 473 ms. Remains : 110/1543 places, 262/1977 transitions.
Stuttering acceptance computed with spot in 331 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CloudReconfiguration-PT-307-LTLFireability-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-307-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-307-LTLFireability-00 finished in 861 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(G(p1))))'
Support contains 2 out of 1543 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1543/1543 places, 1977/1977 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1527 transition count 1960
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1527 transition count 1960
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 1527 transition count 1958
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 41 place count 1520 transition count 1950
Iterating global reduction 1 with 7 rules applied. Total rules applied 48 place count 1520 transition count 1950
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 54 place count 1514 transition count 1943
Iterating global reduction 1 with 6 rules applied. Total rules applied 60 place count 1514 transition count 1943
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 61 place count 1514 transition count 1942
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 65 place count 1510 transition count 1938
Iterating global reduction 2 with 4 rules applied. Total rules applied 69 place count 1510 transition count 1938
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 71 place count 1510 transition count 1936
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 73 place count 1508 transition count 1933
Iterating global reduction 3 with 2 rules applied. Total rules applied 75 place count 1508 transition count 1933
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 77 place count 1506 transition count 1930
Iterating global reduction 3 with 2 rules applied. Total rules applied 79 place count 1506 transition count 1930
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 81 place count 1504 transition count 1928
Iterating global reduction 3 with 2 rules applied. Total rules applied 83 place count 1504 transition count 1928
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 84 place count 1504 transition count 1927
Applied a total of 84 rules in 521 ms. Remains 1504 /1543 variables (removed 39) and now considering 1927/1977 (removed 50) transitions.
// Phase 1: matrix 1927 rows 1504 cols
[2024-05-21 03:49:20] [INFO ] Computed 3 invariants in 17 ms
[2024-05-21 03:49:21] [INFO ] Implicit Places using invariants in 237 ms returned []
[2024-05-21 03:49:21] [INFO ] Invariant cache hit.
[2024-05-21 03:49:22] [INFO ] Implicit Places using invariants and state equation in 910 ms returned []
Implicit Place search using SMT with State Equation took 1157 ms to find 0 implicit places.
Running 1926 sub problems to find dead transitions.
[2024-05-21 03:49:22] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 127.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 0.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 0.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)timeout

(s837 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1503 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1926 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1503/3431 variables, and 3 constraints, problems are : Problem set: 0 solved, 1926 unsolved in 30056 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1504 constraints, PredecessorRefiner: 1926/1926 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1926 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1503 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1926 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1503/3431 variables, and 3 constraints, problems are : Problem set: 0 solved, 1926 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1504 constraints, PredecessorRefiner: 0/1926 constraints, Known Traps: 0/0 constraints]
After SMT, in 60768ms problems are : Problem set: 0 solved, 1926 unsolved
Search for dead transitions found 0 dead transitions in 60795ms
Starting structural reductions in LTL mode, iteration 1 : 1504/1543 places, 1927/1977 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62489 ms. Remains : 1504/1543 places, 1927/1977 transitions.
Stuttering acceptance computed with spot in 161 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-307-LTLFireability-01
Product exploration explored 100000 steps with 846 reset in 294 ms.
Product exploration explored 100000 steps with 857 reset in 190 ms.
Computed a total of 25 stabilizing places and 27 stable transitions
Graph (complete) has 2100 edges and 1504 vertex of which 1496 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.6 ms
Computed a total of 25 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 153 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
RANDOM walk for 40000 steps (333 resets) in 170 ms. (233 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (108 resets) in 159 ms. (250 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (102 resets) in 149 ms. (266 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (97 resets) in 123 ms. (322 steps per ms) remains 3/3 properties
[2024-05-21 03:50:24] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1479/1481 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1481 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1909/3390 variables, 1481/1484 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3390 variables, 0/1484 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 7/3397 variables, 5/1489 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3397 variables, 0/1489 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 6/3403 variables, 3/1492 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3403 variables, 0/1492 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 6/3409 variables, 3/1495 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3409 variables, 0/1495 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 6/3415 variables, 3/1498 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3415 variables, 0/1498 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 3/3418 variables, 2/1500 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3418 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 2/3420 variables, 1/1501 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3420 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 2/3422 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3422 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 2/3424 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3424 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 2/3426 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3426 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 2/3428 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3428 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 2/3430 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3430 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf2 is UNSAT
At refinement iteration 27 (OVERLAPS) 1/3431 variables, 1/1507 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3431 variables, 0/1507 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/3431 variables, 0/1507 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3431/3431 variables, and 1507 constraints, problems are : Problem set: 1 solved, 2 unsolved in 2405 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1504/1504 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1479/1481 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1481 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1909/3390 variables, 1481/1484 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3390 variables, 2/1486 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3390 variables, 0/1486 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 7/3397 variables, 5/1491 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3397 variables, 0/1491 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 6/3403 variables, 3/1494 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3403 variables, 0/1494 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 6/3409 variables, 3/1497 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3409 variables, 0/1497 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 6/3415 variables, 3/1500 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3415 variables, 0/1500 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 3/3418 variables, 2/1502 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3418 variables, 0/1502 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/3420 variables, 1/1503 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3420 variables, 0/1503 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/3422 variables, 1/1504 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3422 variables, 0/1504 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/3424 variables, 1/1505 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3424 variables, 0/1505 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 2/3426 variables, 1/1506 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3426 variables, 0/1506 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 2/3428 variables, 1/1507 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3428 variables, 0/1507 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 2/3430 variables, 1/1508 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3430 variables, 0/1508 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 1/3431 variables, 1/1509 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3431 variables, 0/1509 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 0/3431 variables, 0/1509 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3431/3431 variables, and 1509 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1981 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1504/1504 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 4398ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 733 steps, including 3 resets, run visited all 2 properties in 10 ms. (steps per millisecond=73 )
Parikh walk visited 2 properties in 17 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT p1))]
Knowledge based reduction with 14 factoid took 295 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 2 out of 1504 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1504/1504 places, 1927/1927 transitions.
Graph (trivial) has 1837 edges and 1504 vertex of which 693 / 1504 are part of one of the 63 SCC in 3 ms
Free SCC test removed 630 places
Ensure Unique test removed 732 transitions
Reduce isomorphic transitions removed 732 transitions.
Graph (complete) has 1362 edges and 874 vertex of which 866 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 469 transitions
Trivial Post-agglo rules discarded 469 transitions
Performed 469 trivial Post agglomeration. Transition count delta: 469
Iterating post reduction 0 with 469 rules applied. Total rules applied 471 place count 865 transition count 720
Reduce places removed 469 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 493 rules applied. Total rules applied 964 place count 396 transition count 696
Reduce places removed 12 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 14 rules applied. Total rules applied 978 place count 384 transition count 694
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 980 place count 382 transition count 694
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 980 place count 382 transition count 647
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 1074 place count 335 transition count 647
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 1090 place count 319 transition count 621
Iterating global reduction 4 with 16 rules applied. Total rules applied 1106 place count 319 transition count 621
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 3 rules applied. Total rules applied 1109 place count 319 transition count 618
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1112 place count 316 transition count 618
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1122 place count 306 transition count 604
Iterating global reduction 6 with 10 rules applied. Total rules applied 1132 place count 306 transition count 604
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1138 place count 306 transition count 598
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1140 place count 304 transition count 594
Iterating global reduction 7 with 2 rules applied. Total rules applied 1142 place count 304 transition count 594
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1144 place count 302 transition count 590
Iterating global reduction 7 with 2 rules applied. Total rules applied 1146 place count 302 transition count 590
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1148 place count 300 transition count 586
Iterating global reduction 7 with 2 rules applied. Total rules applied 1150 place count 300 transition count 586
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1152 place count 298 transition count 582
Iterating global reduction 7 with 2 rules applied. Total rules applied 1154 place count 298 transition count 582
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1156 place count 296 transition count 578
Iterating global reduction 7 with 2 rules applied. Total rules applied 1158 place count 296 transition count 578
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1160 place count 294 transition count 564
Iterating global reduction 7 with 2 rules applied. Total rules applied 1162 place count 294 transition count 564
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 1163 place count 294 transition count 563
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1164 place count 293 transition count 563
Performed 135 Post agglomeration using F-continuation condition with reduction of 73 identical transitions.
Deduced a syphon composed of 135 places in 0 ms
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 9 with 270 rules applied. Total rules applied 1434 place count 158 transition count 355
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 15 rules applied. Total rules applied 1449 place count 158 transition count 340
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1451 place count 157 transition count 339
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 1455 place count 153 transition count 334
Iterating global reduction 11 with 4 rules applied. Total rules applied 1459 place count 153 transition count 334
Performed 12 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 11 with 24 rules applied. Total rules applied 1483 place count 141 transition count 319
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 11 with 12 rules applied. Total rules applied 1495 place count 141 transition count 307
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 12 with 34 rules applied. Total rules applied 1529 place count 124 transition count 341
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 12 with 17 rules applied. Total rules applied 1546 place count 124 transition count 324
Discarding 9 places :
Symmetric choice reduction at 13 with 9 rule applications. Total rules 1555 place count 115 transition count 306
Iterating global reduction 13 with 9 rules applied. Total rules applied 1564 place count 115 transition count 306
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 1570 place count 115 transition count 300
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 14 with 36 rules applied. Total rules applied 1606 place count 115 transition count 264
Partial Post-agglomeration rule applied 8 times.
Drop transitions (Partial Post agglomeration) removed 8 transitions
Iterating global reduction 14 with 8 rules applied. Total rules applied 1614 place count 115 transition count 264
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 1615 place count 114 transition count 263
Applied a total of 1615 rules in 103 ms. Remains 114 /1504 variables (removed 1390) and now considering 263/1927 (removed 1664) transitions.
[2024-05-21 03:50:29] [INFO ] Flow matrix only has 206 transitions (discarded 57 similar events)
// Phase 1: matrix 206 rows 114 cols
[2024-05-21 03:50:29] [INFO ] Computed 0 invariants in 2 ms
[2024-05-21 03:50:29] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-21 03:50:29] [INFO ] Flow matrix only has 206 transitions (discarded 57 similar events)
[2024-05-21 03:50:29] [INFO ] Invariant cache hit.
[2024-05-21 03:50:29] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 03:50:29] [INFO ] Implicit Places using invariants and state equation in 105 ms returned [8, 41, 74]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 174 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 111/1504 places, 263/1927 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 109 transition count 261
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 108 transition count 260
Applied a total of 3 rules in 8 ms. Remains 108 /111 variables (removed 3) and now considering 260/263 (removed 3) transitions.
[2024-05-21 03:50:29] [INFO ] Flow matrix only has 203 transitions (discarded 57 similar events)
// Phase 1: matrix 203 rows 108 cols
[2024-05-21 03:50:29] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 03:50:29] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-21 03:50:29] [INFO ] Flow matrix only has 203 transitions (discarded 57 similar events)
[2024-05-21 03:50:29] [INFO ] Invariant cache hit.
[2024-05-21 03:50:29] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 03:50:29] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 108/1504 places, 260/1927 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 414 ms. Remains : 108/1504 places, 260/1927 transitions.
Computed a total of 1 stabilizing places and 23 stable transitions
Computed a total of 1 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND p1 p0), (X (AND p0 p1)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 113 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
RANDOM walk for 40000 steps (5485 resets) in 755 ms. (52 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (937 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
[2024-05-21 03:50:29] [INFO ] Flow matrix only has 203 transitions (discarded 57 similar events)
[2024-05-21 03:50:29] [INFO ] Invariant cache hit.
[2024-05-21 03:50:29] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/42 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 128/170 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Real declared 305/311 variables, and 103 constraints, problems are : Problem set: 1 solved, 0 unsolved in 60 ms.
Refiners :[State Equation: 103/108 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 66ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (AND p0 p1)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT p1))]
Knowledge based reduction with 14 factoid took 329 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Entered a terminal (fully accepting) state of product in 50518 steps with 5652 reset in 116 ms.
FORMULA CloudReconfiguration-PT-307-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-307-LTLFireability-01 finished in 70491 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||G(p1)))'
Support contains 2 out of 1543 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1543/1543 places, 1977/1977 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1528 transition count 1961
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1528 transition count 1961
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 1528 transition count 1959
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 38 place count 1522 transition count 1952
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 1522 transition count 1952
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 49 place count 1517 transition count 1946
Iterating global reduction 1 with 5 rules applied. Total rules applied 54 place count 1517 transition count 1946
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 55 place count 1517 transition count 1945
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 58 place count 1514 transition count 1942
Iterating global reduction 2 with 3 rules applied. Total rules applied 61 place count 1514 transition count 1942
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 63 place count 1514 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 64 place count 1513 transition count 1938
Iterating global reduction 3 with 1 rules applied. Total rules applied 65 place count 1513 transition count 1938
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 66 place count 1512 transition count 1936
Iterating global reduction 3 with 1 rules applied. Total rules applied 67 place count 1512 transition count 1936
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 68 place count 1511 transition count 1935
Iterating global reduction 3 with 1 rules applied. Total rules applied 69 place count 1511 transition count 1935
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 70 place count 1511 transition count 1934
Applied a total of 70 rules in 419 ms. Remains 1511 /1543 variables (removed 32) and now considering 1934/1977 (removed 43) transitions.
// Phase 1: matrix 1934 rows 1511 cols
[2024-05-21 03:50:31] [INFO ] Computed 3 invariants in 18 ms
[2024-05-21 03:50:31] [INFO ] Implicit Places using invariants in 248 ms returned []
[2024-05-21 03:50:31] [INFO ] Invariant cache hit.
[2024-05-21 03:50:32] [INFO ] Implicit Places using invariants and state equation in 905 ms returned []
Implicit Place search using SMT with State Equation took 1155 ms to find 0 implicit places.
Running 1933 sub problems to find dead transitions.
[2024-05-21 03:50:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1510 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1933 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1510/3445 variables, and 3 constraints, problems are : Problem set: 0 solved, 1933 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1511 constraints, PredecessorRefiner: 1933/1933 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1933 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1510 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1933 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1510/3445 variables, and 3 constraints, problems are : Problem set: 0 solved, 1933 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1511 constraints, PredecessorRefiner: 0/1933 constraints, Known Traps: 0/0 constraints]
After SMT, in 60659ms problems are : Problem set: 0 solved, 1933 unsolved
Search for dead transitions found 0 dead transitions in 60677ms
Starting structural reductions in LTL mode, iteration 1 : 1511/1543 places, 1934/1977 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62260 ms. Remains : 1511/1543 places, 1934/1977 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CloudReconfiguration-PT-307-LTLFireability-03
Stuttering criterion allowed to conclude after 117 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-307-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-307-LTLFireability-03 finished in 62420 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||X(G(p1)))))))'
Support contains 2 out of 1543 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1543/1543 places, 1977/1977 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1529 transition count 1962
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1529 transition count 1962
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 1529 transition count 1960
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 36 place count 1523 transition count 1953
Iterating global reduction 1 with 6 rules applied. Total rules applied 42 place count 1523 transition count 1953
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 47 place count 1518 transition count 1947
Iterating global reduction 1 with 5 rules applied. Total rules applied 52 place count 1518 transition count 1947
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 56 place count 1514 transition count 1943
Iterating global reduction 1 with 4 rules applied. Total rules applied 60 place count 1514 transition count 1943
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 62 place count 1514 transition count 1941
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 64 place count 1512 transition count 1938
Iterating global reduction 2 with 2 rules applied. Total rules applied 66 place count 1512 transition count 1938
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 68 place count 1510 transition count 1935
Iterating global reduction 2 with 2 rules applied. Total rules applied 70 place count 1510 transition count 1935
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 72 place count 1508 transition count 1933
Iterating global reduction 2 with 2 rules applied. Total rules applied 74 place count 1508 transition count 1933
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 75 place count 1508 transition count 1932
Applied a total of 75 rules in 431 ms. Remains 1508 /1543 variables (removed 35) and now considering 1932/1977 (removed 45) transitions.
// Phase 1: matrix 1932 rows 1508 cols
[2024-05-21 03:51:33] [INFO ] Computed 3 invariants in 14 ms
[2024-05-21 03:51:33] [INFO ] Implicit Places using invariants in 231 ms returned []
[2024-05-21 03:51:33] [INFO ] Invariant cache hit.
[2024-05-21 03:51:34] [INFO ] Implicit Places using invariants and state equation in 935 ms returned []
Implicit Place search using SMT with State Equation took 1169 ms to find 0 implicit places.
Running 1931 sub problems to find dead transitions.
[2024-05-21 03:51:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1507 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1931 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1507/3440 variables, and 3 constraints, problems are : Problem set: 0 solved, 1931 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 1931/1931 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1931 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1507 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1931 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1507/3440 variables, and 3 constraints, problems are : Problem set: 0 solved, 1931 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 0/1931 constraints, Known Traps: 0/0 constraints]
After SMT, in 60498ms problems are : Problem set: 0 solved, 1931 unsolved
Search for dead transitions found 0 dead transitions in 60523ms
Starting structural reductions in LTL mode, iteration 1 : 1508/1543 places, 1932/1977 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62131 ms. Remains : 1508/1543 places, 1932/1977 transitions.
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CloudReconfiguration-PT-307-LTLFireability-04
Product exploration explored 100000 steps with 838 reset in 131 ms.
Product exploration explored 100000 steps with 837 reset in 142 ms.
Computed a total of 25 stabilizing places and 27 stable transitions
Graph (complete) has 2105 edges and 1508 vertex of which 1500 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.6 ms
Computed a total of 25 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 100 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (334 resets) in 168 ms. (236 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (105 resets) in 50 ms. (784 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (105 resets) in 90 ms. (439 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 375486 steps, run timeout after 3001 ms. (steps per millisecond=125 ) properties seen :0 out of 2
Probabilistic random walk after 375486 steps, saw 86721 distinct states, run finished after 3004 ms. (steps per millisecond=124 ) properties seen :0
[2024-05-21 03:52:39] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1082/1084 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1084 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 401/1485 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1485 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1914/3399 variables, 1485/1488 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3399 variables, 0/1488 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 7/3406 variables, 5/1493 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3406 variables, 0/1493 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 6/3412 variables, 3/1496 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3412 variables, 0/1496 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 6/3418 variables, 3/1499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3418 variables, 0/1499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 6/3424 variables, 3/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3424 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 3/3427 variables, 2/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3427 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/3429 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3429 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/3431 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3431 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 2/3433 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3433 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 2/3435 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3435 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 2/3437 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3437 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 2/3439 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3439 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 1/3440 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/3440 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 0/3440 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3440/3440 variables, and 1511 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1808 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1508/1508 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1082/1084 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1084 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 401/1485 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1485 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1914/3399 variables, 1485/1488 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3399 variables, 2/1490 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3399 variables, 0/1490 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 7/3406 variables, 5/1495 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3406 variables, 0/1495 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 6/3412 variables, 3/1498 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3412 variables, 0/1498 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 6/3418 variables, 3/1501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3418 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 6/3424 variables, 3/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3424 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 3/3427 variables, 2/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3427 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/3429 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3429 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/3431 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3431 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 2/3433 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3433 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 2/3435 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3435 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 2/3437 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3437 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 2/3439 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3439 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 1/3440 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/3440 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (OVERLAPS) 0/3440 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3440/3440 variables, and 1513 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2043 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1508/1508 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 3868ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 237 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=59 )
Parikh walk visited 2 properties in 4 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (X p0))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 218 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 1508 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1508/1508 places, 1932/1932 transitions.
Applied a total of 0 rules in 51 ms. Remains 1508 /1508 variables (removed 0) and now considering 1932/1932 (removed 0) transitions.
[2024-05-21 03:52:43] [INFO ] Invariant cache hit.
[2024-05-21 03:52:44] [INFO ] Implicit Places using invariants in 214 ms returned []
[2024-05-21 03:52:44] [INFO ] Invariant cache hit.
[2024-05-21 03:52:44] [INFO ] Implicit Places using invariants and state equation in 897 ms returned []
Implicit Place search using SMT with State Equation took 1113 ms to find 0 implicit places.
Running 1931 sub problems to find dead transitions.
[2024-05-21 03:52:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1507 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1931 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1507/3440 variables, and 3 constraints, problems are : Problem set: 0 solved, 1931 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 1931/1931 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1931 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1507 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1931 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1507/3440 variables, and 3 constraints, problems are : Problem set: 0 solved, 1931 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 0/1931 constraints, Known Traps: 0/0 constraints]
After SMT, in 60544ms problems are : Problem set: 0 solved, 1931 unsolved
Search for dead transitions found 0 dead transitions in 60563ms
Finished structural reductions in LTL mode , in 1 iterations and 61734 ms. Remains : 1508/1508 places, 1932/1932 transitions.
Computed a total of 25 stabilizing places and 27 stable transitions
Graph (complete) has 2105 edges and 1508 vertex of which 1500 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.12 ms
Computed a total of 25 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (331 resets) in 175 ms. (227 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (102 resets) in 52 ms. (754 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (104 resets) in 38 ms. (1025 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 411682 steps, run timeout after 3001 ms. (steps per millisecond=137 ) properties seen :0 out of 2
Probabilistic random walk after 411682 steps, saw 94813 distinct states, run finished after 3001 ms. (steps per millisecond=137 ) properties seen :0
[2024-05-21 03:53:48] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1082/1084 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1084 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 401/1485 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1485 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1914/3399 variables, 1485/1488 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3399 variables, 0/1488 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 7/3406 variables, 5/1493 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3406 variables, 0/1493 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 6/3412 variables, 3/1496 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3412 variables, 0/1496 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 6/3418 variables, 3/1499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3418 variables, 0/1499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 6/3424 variables, 3/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3424 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 3/3427 variables, 2/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3427 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/3429 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3429 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/3431 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3431 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 2/3433 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3433 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 2/3435 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3435 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 2/3437 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3437 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 2/3439 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3439 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 1/3440 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/3440 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 0/3440 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3440/3440 variables, and 1511 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1871 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1508/1508 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1082/1084 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1084 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 401/1485 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1485 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1914/3399 variables, 1485/1488 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3399 variables, 2/1490 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3399 variables, 0/1490 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 7/3406 variables, 5/1495 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3406 variables, 0/1495 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 6/3412 variables, 3/1498 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3412 variables, 0/1498 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 6/3418 variables, 3/1501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3418 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 6/3424 variables, 3/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3424 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 3/3427 variables, 2/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3427 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/3429 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3429 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/3431 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3431 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 2/3433 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3433 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 2/3435 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3435 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 2/3437 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3437 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 2/3439 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3439 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 1/3440 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/3440 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (OVERLAPS) 0/3440 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3440/3440 variables, and 1513 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1981 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1508/1508 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 3866ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 237 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=118 )
Parikh walk visited 2 properties in 2 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (X p0))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 129 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 139 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 845 reset in 130 ms.
Product exploration explored 100000 steps with 819 reset in 141 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 166 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 1508 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1508/1508 places, 1932/1932 transitions.
Graph (trivial) has 1842 edges and 1508 vertex of which 693 / 1508 are part of one of the 63 SCC in 1 ms
Free SCC test removed 630 places
Ensure Unique test removed 732 transitions
Reduce isomorphic transitions removed 732 transitions.
Graph (complete) has 1367 edges and 878 vertex of which 870 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 475 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 475 rules applied. Total rules applied 477 place count 870 transition count 1195
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 489 place count 870 transition count 1183
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 489 place count 870 transition count 1195
Deduced a syphon composed of 496 places in 1 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 510 place count 870 transition count 1195
Discarding 282 places :
Symmetric choice reduction at 2 with 282 rule applications. Total rules 792 place count 588 transition count 904
Deduced a syphon composed of 229 places in 0 ms
Iterating global reduction 2 with 282 rules applied. Total rules applied 1074 place count 588 transition count 904
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1085 place count 577 transition count 890
Deduced a syphon composed of 227 places in 2 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 1096 place count 577 transition count 890
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1102 place count 577 transition count 884
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1112 place count 567 transition count 874
Deduced a syphon composed of 218 places in 1 ms
Iterating global reduction 3 with 10 rules applied. Total rules applied 1122 place count 567 transition count 874
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1123 place count 566 transition count 872
Deduced a syphon composed of 218 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 1124 place count 566 transition count 872
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1125 place count 565 transition count 870
Deduced a syphon composed of 218 places in 1 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 1126 place count 565 transition count 870
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1128 place count 563 transition count 868
Deduced a syphon composed of 217 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1130 place count 563 transition count 868
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1131 place count 562 transition count 866
Deduced a syphon composed of 217 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 1132 place count 562 transition count 866
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1133 place count 561 transition count 864
Deduced a syphon composed of 217 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 1134 place count 561 transition count 864
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1136 place count 559 transition count 861
Deduced a syphon composed of 216 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1138 place count 559 transition count 861
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1140 place count 557 transition count 853
Deduced a syphon composed of 215 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1142 place count 557 transition count 853
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1144 place count 555 transition count 851
Deduced a syphon composed of 214 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1146 place count 555 transition count 851
Performed 109 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 323 places in 1 ms
Iterating global reduction 3 with 109 rules applied. Total rules applied 1255 place count 555 transition count 926
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 3 with 41 rules applied. Total rules applied 1296 place count 555 transition count 885
Discarding 103 places :
Symmetric choice reduction at 4 with 103 rule applications. Total rules 1399 place count 452 transition count 772
Deduced a syphon composed of 230 places in 1 ms
Iterating global reduction 4 with 103 rules applied. Total rules applied 1502 place count 452 transition count 772
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1508 place count 446 transition count 763
Deduced a syphon composed of 224 places in 0 ms
Iterating global reduction 4 with 6 rules applied. Total rules applied 1514 place count 446 transition count 763
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 231 places in 0 ms
Iterating global reduction 4 with 7 rules applied. Total rules applied 1521 place count 446 transition count 763
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 1526 place count 446 transition count 758
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 1541 place count 431 transition count 739
Deduced a syphon composed of 220 places in 0 ms
Iterating global reduction 5 with 15 rules applied. Total rules applied 1556 place count 431 transition count 739
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1562 place count 431 transition count 733
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1566 place count 427 transition count 729
Deduced a syphon composed of 216 places in 1 ms
Iterating global reduction 6 with 4 rules applied. Total rules applied 1570 place count 427 transition count 729
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 219 places in 1 ms
Iterating global reduction 6 with 3 rules applied. Total rules applied 1573 place count 427 transition count 729
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1579 place count 427 transition count 723
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1582 place count 424 transition count 720
Deduced a syphon composed of 216 places in 0 ms
Iterating global reduction 7 with 3 rules applied. Total rules applied 1585 place count 424 transition count 720
Performed 74 Post agglomeration using F-continuation condition with reduction of 123 identical transitions.
Deduced a syphon composed of 290 places in 0 ms
Iterating global reduction 7 with 74 rules applied. Total rules applied 1659 place count 424 transition count 1057
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 124 transitions.
Iterating post reduction 7 with 124 rules applied. Total rules applied 1783 place count 424 transition count 933
Discarding 129 places :
Symmetric choice reduction at 8 with 129 rule applications. Total rules 1912 place count 295 transition count 590
Deduced a syphon composed of 170 places in 0 ms
Iterating global reduction 8 with 129 rules applied. Total rules applied 2041 place count 295 transition count 590
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 8 with 15 rules applied. Total rules applied 2056 place count 295 transition count 575
Discarding 27 places :
Symmetric choice reduction at 9 with 27 rule applications. Total rules 2083 place count 268 transition count 518
Deduced a syphon composed of 143 places in 0 ms
Iterating global reduction 9 with 27 rules applied. Total rules applied 2110 place count 268 transition count 518
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 146 places in 0 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 2113 place count 268 transition count 566
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 2116 place count 265 transition count 539
Deduced a syphon composed of 143 places in 1 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 2119 place count 265 transition count 539
Deduced a syphon composed of 143 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 55 transitions
Redundant transition composition rules discarded 55 transitions
Iterating global reduction 9 with 55 rules applied. Total rules applied 2174 place count 265 transition count 484
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 2178 place count 261 transition count 480
Deduced a syphon composed of 139 places in 0 ms
Iterating global reduction 9 with 4 rules applied. Total rules applied 2182 place count 261 transition count 480
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 142 places in 0 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 2185 place count 261 transition count 540
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 2188 place count 258 transition count 525
Deduced a syphon composed of 139 places in 0 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 2191 place count 258 transition count 525
Deduced a syphon composed of 139 places in 0 ms
Applied a total of 2191 rules in 414 ms. Remains 258 /1508 variables (removed 1250) and now considering 525/1932 (removed 1407) transitions.
[2024-05-21 03:53:54] [INFO ] Redundant transitions in 30 ms returned []
Running 524 sub problems to find dead transitions.
[2024-05-21 03:53:54] [INFO ] Flow matrix only has 466 transitions (discarded 59 similar events)
// Phase 1: matrix 466 rows 258 cols
[2024-05-21 03:53:54] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 03:53:54] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/257 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 524 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
At refinement iteration 1 (OVERLAPS) 465/722 variables, 257/257 constraints. Problems are: Problem set: 248 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/722 variables, 3/260 constraints. Problems are: Problem set: 248 solved, 276 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/722 variables, 0/260 constraints. Problems are: Problem set: 248 solved, 276 unsolved
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/723 variables, 1/261 constraints. Problems are: Problem set: 253 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/723 variables, 0/261 constraints. Problems are: Problem set: 253 solved, 271 unsolved
At refinement iteration 6 (OVERLAPS) 1/724 variables, 1/262 constraints. Problems are: Problem set: 253 solved, 271 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/724 variables, 0/262 constraints. Problems are: Problem set: 253 solved, 271 unsolved
At refinement iteration 8 (OVERLAPS) 0/724 variables, 0/262 constraints. Problems are: Problem set: 253 solved, 271 unsolved
No progress, stopping.
After SMT solving in domain Real declared 724/724 variables, and 262 constraints, problems are : Problem set: 253 solved, 271 unsolved in 19432 ms.
Refiners :[State Equation: 258/258 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 524/524 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 253 solved, 271 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 253 solved, 271 unsolved
At refinement iteration 1 (OVERLAPS) 462/580 variables, 118/118 constraints. Problems are: Problem set: 253 solved, 271 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/580 variables, 3/121 constraints. Problems are: Problem set: 253 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 271/392 constraints. Problems are: Problem set: 253 solved, 271 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/580 variables, 0/392 constraints. Problems are: Problem set: 253 solved, 271 unsolved
At refinement iteration 5 (OVERLAPS) 143/723 variables, 140/532 constraints. Problems are: Problem set: 253 solved, 271 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/723 variables, 0/532 constraints. Problems are: Problem set: 253 solved, 271 unsolved
At refinement iteration 7 (OVERLAPS) 1/724 variables, 1/533 constraints. Problems are: Problem set: 253 solved, 271 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/724 variables, 0/533 constraints. Problems are: Problem set: 253 solved, 271 unsolved
At refinement iteration 9 (OVERLAPS) 0/724 variables, 0/533 constraints. Problems are: Problem set: 253 solved, 271 unsolved
No progress, stopping.
After SMT solving in domain Int declared 724/724 variables, and 533 constraints, problems are : Problem set: 253 solved, 271 unsolved in 28855 ms.
Refiners :[State Equation: 258/258 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 271/524 constraints, Known Traps: 0/0 constraints]
After SMT, in 48506ms problems are : Problem set: 253 solved, 271 unsolved
Search for dead transitions found 253 dead transitions in 48510ms
Found 253 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 253 transitions
Dead transitions reduction (with SMT) removed 253 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 258/1508 places, 272/1932 transitions.
Graph (complete) has 413 edges and 258 vertex of which 119 are kept as prefixes of interest. Removing 139 places using SCC suffix rule.0 ms
Discarding 139 places :
Also discarding 0 output transitions
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 18 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 8 place count 112 transition count 254
Applied a total of 8 rules in 5 ms. Remains 112 /258 variables (removed 146) and now considering 254/272 (removed 18) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 112/1508 places, 254/1932 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 48980 ms. Remains : 112/1508 places, 254/1932 transitions.
Support contains 2 out of 1508 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1508/1508 places, 1932/1932 transitions.
Applied a total of 0 rules in 41 ms. Remains 1508 /1508 variables (removed 0) and now considering 1932/1932 (removed 0) transitions.
// Phase 1: matrix 1932 rows 1508 cols
[2024-05-21 03:54:43] [INFO ] Computed 3 invariants in 16 ms
[2024-05-21 03:54:43] [INFO ] Implicit Places using invariants in 394 ms returned []
[2024-05-21 03:54:43] [INFO ] Invariant cache hit.
[2024-05-21 03:54:44] [INFO ] Implicit Places using invariants and state equation in 891 ms returned []
Implicit Place search using SMT with State Equation took 1289 ms to find 0 implicit places.
Running 1931 sub problems to find dead transitions.
[2024-05-21 03:54:44] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1507 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1931 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1507/3440 variables, and 3 constraints, problems are : Problem set: 0 solved, 1931 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 1931/1931 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1931 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1507 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1931 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1507/3440 variables, and 3 constraints, problems are : Problem set: 0 solved, 1931 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 0/1931 constraints, Known Traps: 0/0 constraints]
After SMT, in 60508ms problems are : Problem set: 0 solved, 1931 unsolved
Search for dead transitions found 0 dead transitions in 60527ms
Finished structural reductions in LTL mode , in 1 iterations and 61864 ms. Remains : 1508/1508 places, 1932/1932 transitions.
Treatment of property CloudReconfiguration-PT-307-LTLFireability-04 finished in 251738 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&(p1 U (p2||G(p1))))))'
Support contains 3 out of 1543 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1543/1543 places, 1977/1977 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1529 transition count 1962
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1529 transition count 1962
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 1529 transition count 1960
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 36 place count 1523 transition count 1953
Iterating global reduction 1 with 6 rules applied. Total rules applied 42 place count 1523 transition count 1953
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 48 place count 1517 transition count 1946
Iterating global reduction 1 with 6 rules applied. Total rules applied 54 place count 1517 transition count 1946
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 55 place count 1517 transition count 1945
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 59 place count 1513 transition count 1941
Iterating global reduction 2 with 4 rules applied. Total rules applied 63 place count 1513 transition count 1941
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 65 place count 1513 transition count 1939
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 67 place count 1511 transition count 1936
Iterating global reduction 3 with 2 rules applied. Total rules applied 69 place count 1511 transition count 1936
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 71 place count 1509 transition count 1933
Iterating global reduction 3 with 2 rules applied. Total rules applied 73 place count 1509 transition count 1933
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 75 place count 1507 transition count 1931
Iterating global reduction 3 with 2 rules applied. Total rules applied 77 place count 1507 transition count 1931
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 78 place count 1507 transition count 1930
Applied a total of 78 rules in 393 ms. Remains 1507 /1543 variables (removed 36) and now considering 1930/1977 (removed 47) transitions.
// Phase 1: matrix 1930 rows 1507 cols
[2024-05-21 03:55:45] [INFO ] Computed 3 invariants in 8 ms
[2024-05-21 03:55:45] [INFO ] Implicit Places using invariants in 209 ms returned []
[2024-05-21 03:55:45] [INFO ] Invariant cache hit.
[2024-05-21 03:55:46] [INFO ] Implicit Places using invariants and state equation in 885 ms returned []
Implicit Place search using SMT with State Equation took 1096 ms to find 0 implicit places.
Running 1929 sub problems to find dead transitions.
[2024-05-21 03:55:46] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1506/3437 variables, and 3 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 1929/1929 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1929 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1506/3437 variables, and 3 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 0/1929 constraints, Known Traps: 0/0 constraints]
After SMT, in 60515ms problems are : Problem set: 0 solved, 1929 unsolved
Search for dead transitions found 0 dead transitions in 60535ms
Starting structural reductions in LTL mode, iteration 1 : 1507/1543 places, 1930/1977 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62034 ms. Remains : 1507/1543 places, 1930/1977 transitions.
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p2) (NOT p1)), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : CloudReconfiguration-PT-307-LTLFireability-05
Product exploration explored 100000 steps with 50000 reset in 467 ms.
Product exploration explored 100000 steps with 50000 reset in 485 ms.
Computed a total of 25 stabilizing places and 27 stable transitions
Graph (complete) has 2103 edges and 1507 vertex of which 1499 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.5 ms
Computed a total of 25 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) p1))), (X p0), (X p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 16 factoid took 14 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudReconfiguration-PT-307-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-307-LTLFireability-05 finished in 63208 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(F(p1)))))'
Support contains 2 out of 1543 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1543/1543 places, 1977/1977 transitions.
Graph (trivial) has 1887 edges and 1543 vertex of which 691 / 1543 are part of one of the 63 SCC in 2 ms
Free SCC test removed 628 places
Ensure Unique test removed 730 transitions
Reduce isomorphic transitions removed 730 transitions.
Graph (complete) has 1415 edges and 915 vertex of which 907 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 502 transitions
Trivial Post-agglo rules discarded 502 transitions
Performed 502 trivial Post agglomeration. Transition count delta: 502
Iterating post reduction 0 with 502 rules applied. Total rules applied 504 place count 906 transition count 739
Reduce places removed 502 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 526 rules applied. Total rules applied 1030 place count 404 transition count 715
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1042 place count 392 transition count 715
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 1042 place count 392 transition count 668
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 1136 place count 345 transition count 668
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1150 place count 331 transition count 645
Iterating global reduction 3 with 14 rules applied. Total rules applied 1164 place count 331 transition count 645
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 1165 place count 331 transition count 644
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1166 place count 330 transition count 644
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 1176 place count 320 transition count 629
Iterating global reduction 5 with 10 rules applied. Total rules applied 1186 place count 320 transition count 629
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 6 rules applied. Total rules applied 1192 place count 320 transition count 623
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1193 place count 319 transition count 623
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1195 place count 317 transition count 619
Iterating global reduction 7 with 2 rules applied. Total rules applied 1197 place count 317 transition count 619
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1199 place count 315 transition count 615
Iterating global reduction 7 with 2 rules applied. Total rules applied 1201 place count 315 transition count 615
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1203 place count 313 transition count 611
Iterating global reduction 7 with 2 rules applied. Total rules applied 1205 place count 313 transition count 611
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1207 place count 311 transition count 607
Iterating global reduction 7 with 2 rules applied. Total rules applied 1209 place count 311 transition count 607
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1211 place count 309 transition count 603
Iterating global reduction 7 with 2 rules applied. Total rules applied 1213 place count 309 transition count 603
Performed 147 Post agglomeration using F-continuation condition with reduction of 87 identical transitions.
Deduced a syphon composed of 147 places in 0 ms
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 7 with 294 rules applied. Total rules applied 1507 place count 162 transition count 369
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 1522 place count 162 transition count 354
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 1529 place count 155 transition count 338
Iterating global reduction 8 with 7 rules applied. Total rules applied 1536 place count 155 transition count 338
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1537 place count 154 transition count 337
Iterating global reduction 8 with 1 rules applied. Total rules applied 1538 place count 154 transition count 337
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1539 place count 154 transition count 336
Performed 13 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 9 with 26 rules applied. Total rules applied 1565 place count 141 transition count 321
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 9 with 14 rules applied. Total rules applied 1579 place count 141 transition count 307
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 10 with 34 rules applied. Total rules applied 1613 place count 124 transition count 341
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 10 with 17 rules applied. Total rules applied 1630 place count 124 transition count 324
Discarding 9 places :
Symmetric choice reduction at 11 with 9 rule applications. Total rules 1639 place count 115 transition count 306
Iterating global reduction 11 with 9 rules applied. Total rules applied 1648 place count 115 transition count 306
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 1654 place count 115 transition count 300
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 12 with 36 rules applied. Total rules applied 1690 place count 115 transition count 264
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 1691 place count 115 transition count 264
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1692 place count 114 transition count 263
Applied a total of 1692 rules in 68 ms. Remains 114 /1543 variables (removed 1429) and now considering 263/1977 (removed 1714) transitions.
[2024-05-21 03:56:48] [INFO ] Flow matrix only has 206 transitions (discarded 57 similar events)
// Phase 1: matrix 206 rows 114 cols
[2024-05-21 03:56:48] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 03:56:48] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-21 03:56:48] [INFO ] Flow matrix only has 206 transitions (discarded 57 similar events)
[2024-05-21 03:56:48] [INFO ] Invariant cache hit.
[2024-05-21 03:56:48] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 03:56:48] [INFO ] Implicit Places using invariants and state equation in 119 ms returned [8, 43, 76]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 181 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 111/1543 places, 263/1977 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 109 transition count 261
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 108 transition count 260
Applied a total of 3 rules in 6 ms. Remains 108 /111 variables (removed 3) and now considering 260/263 (removed 3) transitions.
[2024-05-21 03:56:48] [INFO ] Flow matrix only has 203 transitions (discarded 57 similar events)
// Phase 1: matrix 203 rows 108 cols
[2024-05-21 03:56:48] [INFO ] Computed 0 invariants in 3 ms
[2024-05-21 03:56:48] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-21 03:56:48] [INFO ] Flow matrix only has 203 transitions (discarded 57 similar events)
[2024-05-21 03:56:48] [INFO ] Invariant cache hit.
[2024-05-21 03:56:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 03:56:48] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 108/1543 places, 260/1977 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 418 ms. Remains : 108/1543 places, 260/1977 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-307-LTLFireability-07
Stuttering criterion allowed to conclude after 40333 steps with 4468 reset in 49 ms.
FORMULA CloudReconfiguration-PT-307-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-307-LTLFireability-07 finished in 602 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Support contains 2 out of 1543 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1543/1543 places, 1977/1977 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1527 transition count 1960
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1527 transition count 1960
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 1527 transition count 1958
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 41 place count 1520 transition count 1950
Iterating global reduction 1 with 7 rules applied. Total rules applied 48 place count 1520 transition count 1950
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 54 place count 1514 transition count 1943
Iterating global reduction 1 with 6 rules applied. Total rules applied 60 place count 1514 transition count 1943
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 61 place count 1514 transition count 1942
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 65 place count 1510 transition count 1938
Iterating global reduction 2 with 4 rules applied. Total rules applied 69 place count 1510 transition count 1938
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 71 place count 1510 transition count 1936
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 73 place count 1508 transition count 1933
Iterating global reduction 3 with 2 rules applied. Total rules applied 75 place count 1508 transition count 1933
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 77 place count 1506 transition count 1930
Iterating global reduction 3 with 2 rules applied. Total rules applied 79 place count 1506 transition count 1930
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 81 place count 1504 transition count 1928
Iterating global reduction 3 with 2 rules applied. Total rules applied 83 place count 1504 transition count 1928
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 84 place count 1504 transition count 1927
Applied a total of 84 rules in 347 ms. Remains 1504 /1543 variables (removed 39) and now considering 1927/1977 (removed 50) transitions.
// Phase 1: matrix 1927 rows 1504 cols
[2024-05-21 03:56:49] [INFO ] Computed 3 invariants in 16 ms
[2024-05-21 03:56:49] [INFO ] Implicit Places using invariants in 226 ms returned []
[2024-05-21 03:56:49] [INFO ] Invariant cache hit.
[2024-05-21 03:56:50] [INFO ] Implicit Places using invariants and state equation in 907 ms returned []
Implicit Place search using SMT with State Equation took 1147 ms to find 0 implicit places.
Running 1926 sub problems to find dead transitions.
[2024-05-21 03:56:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1503 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1926 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1503/3431 variables, and 3 constraints, problems are : Problem set: 0 solved, 1926 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1504 constraints, PredecessorRefiner: 1926/1926 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1926 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1503 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1926 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1503/3431 variables, and 3 constraints, problems are : Problem set: 0 solved, 1926 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1504 constraints, PredecessorRefiner: 0/1926 constraints, Known Traps: 0/0 constraints]
After SMT, in 60486ms problems are : Problem set: 0 solved, 1926 unsolved
Search for dead transitions found 0 dead transitions in 60506ms
Starting structural reductions in LTL mode, iteration 1 : 1504/1543 places, 1927/1977 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62006 ms. Remains : 1504/1543 places, 1927/1977 transitions.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CloudReconfiguration-PT-307-LTLFireability-08
Product exploration explored 100000 steps with 50000 reset in 451 ms.
Product exploration explored 100000 steps with 50000 reset in 454 ms.
Computed a total of 25 stabilizing places and 27 stable transitions
Graph (complete) has 2100 edges and 1504 vertex of which 1496 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.5 ms
Computed a total of 25 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 16 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudReconfiguration-PT-307-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-307-LTLFireability-08 finished in 63036 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U p1)))'
Support contains 2 out of 1543 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1543/1543 places, 1977/1977 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1529 transition count 1962
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1529 transition count 1962
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 1529 transition count 1960
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 35 place count 1524 transition count 1954
Iterating global reduction 1 with 5 rules applied. Total rules applied 40 place count 1524 transition count 1954
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 44 place count 1520 transition count 1949
Iterating global reduction 1 with 4 rules applied. Total rules applied 48 place count 1520 transition count 1949
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 49 place count 1520 transition count 1948
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 52 place count 1517 transition count 1945
Iterating global reduction 2 with 3 rules applied. Total rules applied 55 place count 1517 transition count 1945
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 56 place count 1517 transition count 1944
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 58 place count 1515 transition count 1941
Iterating global reduction 3 with 2 rules applied. Total rules applied 60 place count 1515 transition count 1941
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 62 place count 1513 transition count 1938
Iterating global reduction 3 with 2 rules applied. Total rules applied 64 place count 1513 transition count 1938
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 66 place count 1511 transition count 1936
Iterating global reduction 3 with 2 rules applied. Total rules applied 68 place count 1511 transition count 1936
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 69 place count 1511 transition count 1935
Applied a total of 69 rules in 339 ms. Remains 1511 /1543 variables (removed 32) and now considering 1935/1977 (removed 42) transitions.
// Phase 1: matrix 1935 rows 1511 cols
[2024-05-21 03:57:52] [INFO ] Computed 3 invariants in 7 ms
[2024-05-21 03:57:52] [INFO ] Implicit Places using invariants in 209 ms returned []
[2024-05-21 03:57:52] [INFO ] Invariant cache hit.
[2024-05-21 03:57:53] [INFO ] Implicit Places using invariants and state equation in 879 ms returned []
Implicit Place search using SMT with State Equation took 1090 ms to find 0 implicit places.
Running 1934 sub problems to find dead transitions.
[2024-05-21 03:57:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1510 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1510/3446 variables, and 3 constraints, problems are : Problem set: 0 solved, 1934 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1511 constraints, PredecessorRefiner: 1934/1934 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1934 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1510 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1510/3446 variables, and 3 constraints, problems are : Problem set: 0 solved, 1934 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1511 constraints, PredecessorRefiner: 0/1934 constraints, Known Traps: 0/0 constraints]
After SMT, in 60499ms problems are : Problem set: 0 solved, 1934 unsolved
Search for dead transitions found 0 dead transitions in 60517ms
Starting structural reductions in LTL mode, iteration 1 : 1511/1543 places, 1935/1977 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61954 ms. Remains : 1511/1543 places, 1935/1977 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : CloudReconfiguration-PT-307-LTLFireability-09
Product exploration explored 100000 steps with 50000 reset in 455 ms.
Product exploration explored 100000 steps with 50000 reset in 462 ms.
Computed a total of 25 stabilizing places and 27 stable transitions
Graph (complete) has 2108 edges and 1511 vertex of which 1503 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.4 ms
Computed a total of 25 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 12 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudReconfiguration-PT-307-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-307-LTLFireability-09 finished in 62991 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 1543 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1543/1543 places, 1977/1977 transitions.
Graph (trivial) has 1883 edges and 1543 vertex of which 697 / 1543 are part of one of the 63 SCC in 1 ms
Free SCC test removed 634 places
Ensure Unique test removed 737 transitions
Reduce isomorphic transitions removed 737 transitions.
Graph (complete) has 1408 edges and 909 vertex of which 901 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 495 transitions
Trivial Post-agglo rules discarded 495 transitions
Performed 495 trivial Post agglomeration. Transition count delta: 495
Iterating post reduction 0 with 495 rules applied. Total rules applied 497 place count 900 transition count 739
Reduce places removed 495 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 519 rules applied. Total rules applied 1016 place count 405 transition count 715
Reduce places removed 12 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 15 rules applied. Total rules applied 1031 place count 393 transition count 712
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1034 place count 390 transition count 712
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 1034 place count 390 transition count 665
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 1128 place count 343 transition count 665
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 1142 place count 329 transition count 642
Iterating global reduction 4 with 14 rules applied. Total rules applied 1156 place count 329 transition count 642
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 1157 place count 329 transition count 641
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1158 place count 328 transition count 641
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1168 place count 318 transition count 626
Iterating global reduction 6 with 10 rules applied. Total rules applied 1178 place count 318 transition count 626
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 6 rules applied. Total rules applied 1184 place count 318 transition count 620
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1185 place count 317 transition count 620
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1187 place count 315 transition count 616
Iterating global reduction 8 with 2 rules applied. Total rules applied 1189 place count 315 transition count 616
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1191 place count 313 transition count 612
Iterating global reduction 8 with 2 rules applied. Total rules applied 1193 place count 313 transition count 612
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1195 place count 311 transition count 608
Iterating global reduction 8 with 2 rules applied. Total rules applied 1197 place count 311 transition count 608
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1199 place count 309 transition count 604
Iterating global reduction 8 with 2 rules applied. Total rules applied 1201 place count 309 transition count 604
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1203 place count 307 transition count 600
Iterating global reduction 8 with 2 rules applied. Total rules applied 1205 place count 307 transition count 600
Performed 147 Post agglomeration using F-continuation condition with reduction of 87 identical transitions.
Deduced a syphon composed of 147 places in 0 ms
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 8 with 294 rules applied. Total rules applied 1499 place count 160 transition count 366
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 8 with 16 rules applied. Total rules applied 1515 place count 160 transition count 350
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 1521 place count 154 transition count 339
Iterating global reduction 9 with 6 rules applied. Total rules applied 1527 place count 154 transition count 339
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1528 place count 153 transition count 338
Iterating global reduction 9 with 1 rules applied. Total rules applied 1529 place count 153 transition count 338
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1530 place count 153 transition count 337
Performed 12 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 10 with 24 rules applied. Total rules applied 1554 place count 141 transition count 323
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 10 with 13 rules applied. Total rules applied 1567 place count 141 transition count 310
Performed 18 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 11 with 36 rules applied. Total rules applied 1603 place count 123 transition count 344
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 11 with 19 rules applied. Total rules applied 1622 place count 123 transition count 325
Discarding 9 places :
Symmetric choice reduction at 12 with 9 rule applications. Total rules 1631 place count 114 transition count 307
Iterating global reduction 12 with 9 rules applied. Total rules applied 1640 place count 114 transition count 307
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 1646 place count 114 transition count 301
Drop transitions (Redundant composition of simpler transitions.) removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 13 with 37 rules applied. Total rules applied 1683 place count 114 transition count 264
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 1684 place count 113 transition count 263
Applied a total of 1684 rules in 81 ms. Remains 113 /1543 variables (removed 1430) and now considering 263/1977 (removed 1714) transitions.
[2024-05-21 03:58:54] [INFO ] Flow matrix only has 207 transitions (discarded 56 similar events)
// Phase 1: matrix 207 rows 113 cols
[2024-05-21 03:58:54] [INFO ] Computed 0 invariants in 2 ms
[2024-05-21 03:58:55] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-21 03:58:55] [INFO ] Flow matrix only has 207 transitions (discarded 56 similar events)
[2024-05-21 03:58:55] [INFO ] Invariant cache hit.
[2024-05-21 03:58:55] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 03:58:55] [INFO ] Implicit Places using invariants and state equation in 115 ms returned [10, 43, 76]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 170 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 110/1543 places, 263/1977 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 108 transition count 261
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 107 transition count 260
Applied a total of 3 rules in 5 ms. Remains 107 /110 variables (removed 3) and now considering 260/263 (removed 3) transitions.
[2024-05-21 03:58:55] [INFO ] Flow matrix only has 204 transitions (discarded 56 similar events)
// Phase 1: matrix 204 rows 107 cols
[2024-05-21 03:58:55] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 03:58:55] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-21 03:58:55] [INFO ] Flow matrix only has 204 transitions (discarded 56 similar events)
[2024-05-21 03:58:55] [INFO ] Invariant cache hit.
[2024-05-21 03:58:55] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 03:58:55] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 107/1543 places, 260/1977 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 391 ms. Remains : 107/1543 places, 260/1977 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-307-LTLFireability-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-307-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-307-LTLFireability-10 finished in 466 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((X(p0)||G(p1)))||X(p2))))'
Support contains 3 out of 1543 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1543/1543 places, 1977/1977 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1528 transition count 1961
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1528 transition count 1961
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 1528 transition count 1959
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 39 place count 1521 transition count 1951
Iterating global reduction 1 with 7 rules applied. Total rules applied 46 place count 1521 transition count 1951
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 52 place count 1515 transition count 1944
Iterating global reduction 1 with 6 rules applied. Total rules applied 58 place count 1515 transition count 1944
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 59 place count 1515 transition count 1943
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 63 place count 1511 transition count 1939
Iterating global reduction 2 with 4 rules applied. Total rules applied 67 place count 1511 transition count 1939
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 69 place count 1511 transition count 1937
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 71 place count 1509 transition count 1934
Iterating global reduction 3 with 2 rules applied. Total rules applied 73 place count 1509 transition count 1934
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 75 place count 1507 transition count 1931
Iterating global reduction 3 with 2 rules applied. Total rules applied 77 place count 1507 transition count 1931
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 79 place count 1505 transition count 1929
Iterating global reduction 3 with 2 rules applied. Total rules applied 81 place count 1505 transition count 1929
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 82 place count 1505 transition count 1928
Applied a total of 82 rules in 354 ms. Remains 1505 /1543 variables (removed 38) and now considering 1928/1977 (removed 49) transitions.
// Phase 1: matrix 1928 rows 1505 cols
[2024-05-21 03:58:55] [INFO ] Computed 3 invariants in 14 ms
[2024-05-21 03:58:55] [INFO ] Implicit Places using invariants in 225 ms returned []
[2024-05-21 03:58:55] [INFO ] Invariant cache hit.
[2024-05-21 03:58:56] [INFO ] Implicit Places using invariants and state equation in 880 ms returned []
Implicit Place search using SMT with State Equation took 1112 ms to find 0 implicit places.
Running 1927 sub problems to find dead transitions.
[2024-05-21 03:58:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1504 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1504/3433 variables, and 3 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1505 constraints, PredecessorRefiner: 1927/1927 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1927 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1504 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1504/3433 variables, and 3 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1505 constraints, PredecessorRefiner: 0/1927 constraints, Known Traps: 0/0 constraints]
After SMT, in 60518ms problems are : Problem set: 0 solved, 1927 unsolved
Search for dead transitions found 0 dead transitions in 60536ms
Starting structural reductions in LTL mode, iteration 1 : 1505/1543 places, 1928/1977 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62010 ms. Remains : 1505/1543 places, 1928/1977 transitions.
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CloudReconfiguration-PT-307-LTLFireability-11
Stuttering criterion allowed to conclude after 238 steps with 1 reset in 1 ms.
FORMULA CloudReconfiguration-PT-307-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-307-LTLFireability-11 finished in 62150 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0)) U G(p1)))))'
Support contains 2 out of 1543 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1543/1543 places, 1977/1977 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1529 transition count 1962
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1529 transition count 1962
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 1529 transition count 1960
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 36 place count 1523 transition count 1953
Iterating global reduction 1 with 6 rules applied. Total rules applied 42 place count 1523 transition count 1953
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 47 place count 1518 transition count 1947
Iterating global reduction 1 with 5 rules applied. Total rules applied 52 place count 1518 transition count 1947
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 53 place count 1518 transition count 1946
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 56 place count 1515 transition count 1943
Iterating global reduction 2 with 3 rules applied. Total rules applied 59 place count 1515 transition count 1943
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 61 place count 1515 transition count 1941
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 62 place count 1514 transition count 1940
Iterating global reduction 3 with 1 rules applied. Total rules applied 63 place count 1514 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 64 place count 1513 transition count 1939
Iterating global reduction 3 with 1 rules applied. Total rules applied 65 place count 1513 transition count 1939
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 66 place count 1512 transition count 1938
Iterating global reduction 3 with 1 rules applied. Total rules applied 67 place count 1512 transition count 1938
Applied a total of 67 rules in 360 ms. Remains 1512 /1543 variables (removed 31) and now considering 1938/1977 (removed 39) transitions.
// Phase 1: matrix 1938 rows 1512 cols
[2024-05-21 03:59:57] [INFO ] Computed 3 invariants in 13 ms
[2024-05-21 03:59:58] [INFO ] Implicit Places using invariants in 226 ms returned []
[2024-05-21 03:59:58] [INFO ] Invariant cache hit.
[2024-05-21 03:59:58] [INFO ] Implicit Places using invariants and state equation in 874 ms returned []
Implicit Place search using SMT with State Equation took 1102 ms to find 0 implicit places.
Running 1937 sub problems to find dead transitions.
[2024-05-21 03:59:58] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1511 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1937 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1511/3450 variables, and 3 constraints, problems are : Problem set: 0 solved, 1937 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1512 constraints, PredecessorRefiner: 1937/1937 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1937 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1511 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1937 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1511/3450 variables, and 3 constraints, problems are : Problem set: 0 solved, 1937 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1512 constraints, PredecessorRefiner: 0/1937 constraints, Known Traps: 0/0 constraints]
After SMT, in 60504ms problems are : Problem set: 0 solved, 1937 unsolved
Search for dead transitions found 0 dead transitions in 60522ms
Starting structural reductions in LTL mode, iteration 1 : 1512/1543 places, 1938/1977 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61990 ms. Remains : 1512/1543 places, 1938/1977 transitions.
Stuttering acceptance computed with spot in 156 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-307-LTLFireability-12
Product exploration explored 100000 steps with 836 reset in 137 ms.
Product exploration explored 100000 steps with 846 reset in 142 ms.
Computed a total of 25 stabilizing places and 27 stable transitions
Graph (complete) has 2111 edges and 1512 vertex of which 1504 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.4 ms
Computed a total of 25 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 155 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0)]
RANDOM walk for 40000 steps (339 resets) in 89 ms. (444 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (100 resets) in 40 ms. (975 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (98 resets) in 33 ms. (1176 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 426793 steps, run timeout after 3001 ms. (steps per millisecond=142 ) properties seen :0 out of 2
Probabilistic random walk after 426793 steps, saw 98364 distinct states, run finished after 3001 ms. (steps per millisecond=142 ) properties seen :0
[2024-05-21 04:01:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1487/1489 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1489 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1920/3409 variables, 1489/1492 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3409 variables, 0/1492 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 7/3416 variables, 5/1497 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3416 variables, 0/1497 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 6/3422 variables, 3/1500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3422 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 6/3428 variables, 3/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3428 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 6/3434 variables, 3/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3434 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 3/3437 variables, 2/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3437 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/3439 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3439 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/3441 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3441 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/3443 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3443 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 2/3445 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3445 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 2/3447 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3447 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 2/3449 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3449 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 1/3450 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3450 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/3450 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3450/3450 variables, and 1515 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2557 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1512/1512 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1487/1489 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1489 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1920/3409 variables, 1489/1492 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3409 variables, 2/1494 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3409 variables, 0/1494 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 7/3416 variables, 5/1499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3416 variables, 0/1499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 6/3422 variables, 3/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3422 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 6/3428 variables, 3/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3428 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 6/3434 variables, 3/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3434 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 3/3437 variables, 2/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3437 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/3439 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3439 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/3441 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3441 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/3443 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3443 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 2/3445 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3445 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 2/3447 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3447 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 2/3449 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3449 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 1/3450 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3450 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 0/3450 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3450/3450 variables, and 1517 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1908 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1512/1512 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 4474ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 134 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=67 )
Parikh walk visited 2 properties in 3 ms.
Knowledge obtained : [(AND p1 p0), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 115 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0)]
Support contains 2 out of 1512 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1512/1512 places, 1938/1938 transitions.
Applied a total of 0 rules in 48 ms. Remains 1512 /1512 variables (removed 0) and now considering 1938/1938 (removed 0) transitions.
[2024-05-21 04:01:08] [INFO ] Invariant cache hit.
[2024-05-21 04:01:08] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-05-21 04:01:08] [INFO ] Invariant cache hit.
[2024-05-21 04:01:09] [INFO ] Implicit Places using invariants and state equation in 891 ms returned []
Implicit Place search using SMT with State Equation took 1104 ms to find 0 implicit places.
Running 1937 sub problems to find dead transitions.
[2024-05-21 04:01:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1511 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1937 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1511/3450 variables, and 3 constraints, problems are : Problem set: 0 solved, 1937 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1512 constraints, PredecessorRefiner: 1937/1937 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1937 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1511 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1937 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1511/3450 variables, and 3 constraints, problems are : Problem set: 0 solved, 1937 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1512 constraints, PredecessorRefiner: 0/1937 constraints, Known Traps: 0/0 constraints]
After SMT, in 60505ms problems are : Problem set: 0 solved, 1937 unsolved
Search for dead transitions found 0 dead transitions in 60522ms
Finished structural reductions in LTL mode , in 1 iterations and 61677 ms. Remains : 1512/1512 places, 1938/1938 transitions.
Computed a total of 25 stabilizing places and 27 stable transitions
Graph (complete) has 2111 edges and 1512 vertex of which 1504 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.4 ms
Computed a total of 25 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 71 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0)]
RANDOM walk for 40000 steps (338 resets) in 125 ms. (317 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40002 steps (104 resets) in 23 ms. (1666 steps per ms) remains 1/1 properties
[2024-05-21 04:02:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 810/811 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/811 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 678/1489 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1489 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1920/3409 variables, 1489/1492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3409 variables, 0/1492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/3416 variables, 5/1497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3416 variables, 0/1497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/3422 variables, 3/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3422 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/3428 variables, 3/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3428 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/3434 variables, 3/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3434 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/3437 variables, 2/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3437 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/3439 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3439 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/3441 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3441 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/3443 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3443 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/3445 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3445 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/3447 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3447 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 2/3449 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3449 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 1/3450 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/3450 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/3450 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3450/3450 variables, and 1515 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1798 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1512/1512 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 810/811 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/811 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 678/1489 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1489 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1920/3409 variables, 1489/1492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3409 variables, 1/1493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3409 variables, 0/1493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/3416 variables, 5/1498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3416 variables, 0/1498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/3422 variables, 3/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3422 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/3428 variables, 3/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3428 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 6/3434 variables, 3/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3434 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3/3437 variables, 2/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3437 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/3439 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3439 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/3441 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3441 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/3443 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3443 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/3445 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3445 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 2/3447 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3447 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 2/3449 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3449 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 1/3450 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/3450 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 0/3450 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3450/3450 variables, and 1516 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1423 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1512/1512 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3240ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 184 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=184 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p1 p0), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 140 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 161 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 838 reset in 150 ms.
Product exploration explored 100000 steps with 861 reset in 158 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 138 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0)]
Support contains 2 out of 1512 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1512/1512 places, 1938/1938 transitions.
Graph (trivial) has 1848 edges and 1512 vertex of which 693 / 1512 are part of one of the 63 SCC in 1 ms
Free SCC test removed 630 places
Ensure Unique test removed 732 transitions
Reduce isomorphic transitions removed 732 transitions.
Graph (complete) has 1373 edges and 882 vertex of which 874 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 476 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 476 rules applied. Total rules applied 478 place count 874 transition count 1201
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 490 place count 874 transition count 1189
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 490 place count 874 transition count 1201
Deduced a syphon composed of 497 places in 0 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 511 place count 874 transition count 1201
Discarding 282 places :
Symmetric choice reduction at 2 with 282 rule applications. Total rules 793 place count 592 transition count 909
Deduced a syphon composed of 231 places in 1 ms
Iterating global reduction 2 with 282 rules applied. Total rules applied 1075 place count 592 transition count 909
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1087 place count 580 transition count 893
Deduced a syphon composed of 229 places in 0 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 1099 place count 580 transition count 893
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1105 place count 580 transition count 887
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1117 place count 568 transition count 875
Deduced a syphon composed of 219 places in 0 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 1129 place count 568 transition count 875
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1131 place count 566 transition count 871
Deduced a syphon composed of 219 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1133 place count 566 transition count 871
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1135 place count 564 transition count 867
Deduced a syphon composed of 219 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1137 place count 564 transition count 867
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1141 place count 560 transition count 863
Deduced a syphon composed of 217 places in 1 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1145 place count 560 transition count 863
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1147 place count 558 transition count 859
Deduced a syphon composed of 217 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1149 place count 558 transition count 859
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1151 place count 556 transition count 855
Deduced a syphon composed of 217 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1153 place count 556 transition count 855
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1157 place count 552 transition count 849
Deduced a syphon composed of 215 places in 1 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1161 place count 552 transition count 849
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1165 place count 548 transition count 833
Deduced a syphon composed of 213 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1169 place count 548 transition count 833
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 3 with 1 rules applied. Total rules applied 1170 place count 548 transition count 833
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1174 place count 544 transition count 829
Deduced a syphon composed of 212 places in 0 ms
Iterating global reduction 4 with 4 rules applied. Total rules applied 1178 place count 544 transition count 829
Performed 107 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 319 places in 0 ms
Iterating global reduction 4 with 107 rules applied. Total rules applied 1285 place count 544 transition count 907
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 4 with 39 rules applied. Total rules applied 1324 place count 544 transition count 868
Discarding 102 places :
Symmetric choice reduction at 5 with 102 rule applications. Total rules 1426 place count 442 transition count 756
Deduced a syphon composed of 227 places in 0 ms
Iterating global reduction 5 with 102 rules applied. Total rules applied 1528 place count 442 transition count 756
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 1534 place count 436 transition count 747
Deduced a syphon composed of 221 places in 0 ms
Iterating global reduction 5 with 6 rules applied. Total rules applied 1540 place count 436 transition count 747
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 228 places in 0 ms
Iterating global reduction 5 with 7 rules applied. Total rules applied 1547 place count 436 transition count 747
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1551 place count 436 transition count 743
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 1566 place count 421 transition count 724
Deduced a syphon composed of 217 places in 0 ms
Iterating global reduction 6 with 15 rules applied. Total rules applied 1581 place count 421 transition count 724
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1587 place count 421 transition count 718
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1591 place count 417 transition count 714
Deduced a syphon composed of 213 places in 0 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 1595 place count 417 transition count 714
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 216 places in 0 ms
Iterating global reduction 7 with 3 rules applied. Total rules applied 1598 place count 417 transition count 714
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1604 place count 417 transition count 708
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1607 place count 414 transition count 705
Deduced a syphon composed of 213 places in 0 ms
Iterating global reduction 8 with 3 rules applied. Total rules applied 1610 place count 414 transition count 705
Performed 71 Post agglomeration using F-continuation condition with reduction of 111 identical transitions.
Deduced a syphon composed of 284 places in 1 ms
Iterating global reduction 8 with 71 rules applied. Total rules applied 1681 place count 414 transition count 1030
Ensure Unique test removed 125 transitions
Reduce isomorphic transitions removed 125 transitions.
Iterating post reduction 8 with 125 rules applied. Total rules applied 1806 place count 414 transition count 905
Discarding 125 places :
Symmetric choice reduction at 9 with 125 rule applications. Total rules 1931 place count 289 transition count 577
Deduced a syphon composed of 168 places in 0 ms
Iterating global reduction 9 with 125 rules applied. Total rules applied 2056 place count 289 transition count 577
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 9 with 15 rules applied. Total rules applied 2071 place count 289 transition count 562
Discarding 27 places :
Symmetric choice reduction at 10 with 27 rule applications. Total rules 2098 place count 262 transition count 504
Deduced a syphon composed of 141 places in 0 ms
Iterating global reduction 10 with 27 rules applied. Total rules applied 2125 place count 262 transition count 504
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -44
Deduced a syphon composed of 144 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2128 place count 262 transition count 548
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 2132 place count 262 transition count 544
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 2136 place count 258 transition count 516
Deduced a syphon composed of 140 places in 0 ms
Iterating global reduction 11 with 4 rules applied. Total rules applied 2140 place count 258 transition count 516
Deduced a syphon composed of 140 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 44 transitions
Redundant transition composition rules discarded 44 transitions
Iterating global reduction 11 with 44 rules applied. Total rules applied 2184 place count 258 transition count 472
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 2188 place count 254 transition count 468
Deduced a syphon composed of 136 places in 0 ms
Iterating global reduction 11 with 4 rules applied. Total rules applied 2192 place count 254 transition count 468
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 139 places in 0 ms
Iterating global reduction 11 with 3 rules applied. Total rules applied 2195 place count 254 transition count 528
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 2198 place count 251 transition count 513
Deduced a syphon composed of 136 places in 0 ms
Iterating global reduction 11 with 3 rules applied. Total rules applied 2201 place count 251 transition count 513
Deduced a syphon composed of 136 places in 0 ms
Applied a total of 2201 rules in 177 ms. Remains 251 /1512 variables (removed 1261) and now considering 513/1938 (removed 1425) transitions.
[2024-05-21 04:02:14] [INFO ] Redundant transitions in 9 ms returned []
Running 512 sub problems to find dead transitions.
[2024-05-21 04:02:14] [INFO ] Flow matrix only has 456 transitions (discarded 57 similar events)
// Phase 1: matrix 456 rows 251 cols
[2024-05-21 04:02:14] [INFO ] Computed 0 invariants in 7 ms
[2024-05-21 04:02:14] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
At refinement iteration 1 (OVERLAPS) 455/705 variables, 250/250 constraints. Problems are: Problem set: 247 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/705 variables, 2/252 constraints. Problems are: Problem set: 247 solved, 265 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/705 variables, 0/252 constraints. Problems are: Problem set: 247 solved, 265 unsolved
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/706 variables, 1/253 constraints. Problems are: Problem set: 252 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/706 variables, 0/253 constraints. Problems are: Problem set: 252 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 1/707 variables, 1/254 constraints. Problems are: Problem set: 252 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/707 variables, 0/254 constraints. Problems are: Problem set: 252 solved, 260 unsolved
At refinement iteration 8 (OVERLAPS) 0/707 variables, 0/254 constraints. Problems are: Problem set: 252 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 707/707 variables, and 254 constraints, problems are : Problem set: 252 solved, 260 unsolved in 18402 ms.
Refiners :[State Equation: 251/251 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 512/512 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 252 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 252 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 452/566 variables, 114/114 constraints. Problems are: Problem set: 252 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/566 variables, 2/116 constraints. Problems are: Problem set: 252 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/566 variables, 260/376 constraints. Problems are: Problem set: 252 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/566 variables, 0/376 constraints. Problems are: Problem set: 252 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 140/706 variables, 137/513 constraints. Problems are: Problem set: 252 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/706 variables, 0/513 constraints. Problems are: Problem set: 252 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 1/707 variables, 1/514 constraints. Problems are: Problem set: 252 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/707 variables, 0/514 constraints. Problems are: Problem set: 252 solved, 260 unsolved
At refinement iteration 9 (OVERLAPS) 0/707 variables, 0/514 constraints. Problems are: Problem set: 252 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Int declared 707/707 variables, and 514 constraints, problems are : Problem set: 252 solved, 260 unsolved in 26823 ms.
Refiners :[State Equation: 251/251 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 260/512 constraints, Known Traps: 0/0 constraints]
After SMT, in 45492ms problems are : Problem set: 252 solved, 260 unsolved
Search for dead transitions found 252 dead transitions in 45500ms
Found 252 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 252 transitions
Dead transitions reduction (with SMT) removed 252 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 251/1512 places, 261/1938 transitions.
Graph (complete) has 403 edges and 251 vertex of which 115 are kept as prefixes of interest. Removing 136 places using SCC suffix rule.0 ms
Discarding 136 places :
Also discarding 0 output transitions
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 18 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 8 place count 108 transition count 243
Applied a total of 8 rules in 11 ms. Remains 108 /251 variables (removed 143) and now considering 243/261 (removed 18) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 108/1512 places, 243/1938 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 45703 ms. Remains : 108/1512 places, 243/1938 transitions.
Support contains 2 out of 1512 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1512/1512 places, 1938/1938 transitions.
Applied a total of 0 rules in 43 ms. Remains 1512 /1512 variables (removed 0) and now considering 1938/1938 (removed 0) transitions.
// Phase 1: matrix 1938 rows 1512 cols
[2024-05-21 04:03:00] [INFO ] Computed 3 invariants in 12 ms
[2024-05-21 04:03:00] [INFO ] Implicit Places using invariants in 225 ms returned []
[2024-05-21 04:03:00] [INFO ] Invariant cache hit.
[2024-05-21 04:03:01] [INFO ] Implicit Places using invariants and state equation in 899 ms returned []
Implicit Place search using SMT with State Equation took 1125 ms to find 0 implicit places.
Running 1937 sub problems to find dead transitions.
[2024-05-21 04:03:01] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1511 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1937 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1511/3450 variables, and 3 constraints, problems are : Problem set: 0 solved, 1937 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1512 constraints, PredecessorRefiner: 1937/1937 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1937 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1511 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1937 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1511/3450 variables, and 3 constraints, problems are : Problem set: 0 solved, 1937 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1512 constraints, PredecessorRefiner: 0/1937 constraints, Known Traps: 0/0 constraints]
After SMT, in 60530ms problems are : Problem set: 0 solved, 1937 unsolved
Search for dead transitions found 0 dead transitions in 60548ms
Finished structural reductions in LTL mode , in 1 iterations and 61722 ms. Remains : 1512/1512 places, 1938/1938 transitions.
Treatment of property CloudReconfiguration-PT-307-LTLFireability-12 finished in 244624 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U X(p1)))))'
Support contains 2 out of 1543 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1543/1543 places, 1977/1977 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1528 transition count 1961
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1528 transition count 1961
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 1528 transition count 1959
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 39 place count 1521 transition count 1951
Iterating global reduction 1 with 7 rules applied. Total rules applied 46 place count 1521 transition count 1951
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 52 place count 1515 transition count 1944
Iterating global reduction 1 with 6 rules applied. Total rules applied 58 place count 1515 transition count 1944
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 59 place count 1515 transition count 1943
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 63 place count 1511 transition count 1939
Iterating global reduction 2 with 4 rules applied. Total rules applied 67 place count 1511 transition count 1939
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 69 place count 1511 transition count 1937
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 71 place count 1509 transition count 1934
Iterating global reduction 3 with 2 rules applied. Total rules applied 73 place count 1509 transition count 1934
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 75 place count 1507 transition count 1931
Iterating global reduction 3 with 2 rules applied. Total rules applied 77 place count 1507 transition count 1931
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 79 place count 1505 transition count 1929
Iterating global reduction 3 with 2 rules applied. Total rules applied 81 place count 1505 transition count 1929
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 82 place count 1505 transition count 1928
Applied a total of 82 rules in 367 ms. Remains 1505 /1543 variables (removed 38) and now considering 1928/1977 (removed 49) transitions.
// Phase 1: matrix 1928 rows 1505 cols
[2024-05-21 04:04:02] [INFO ] Computed 3 invariants in 14 ms
[2024-05-21 04:04:02] [INFO ] Implicit Places using invariants in 220 ms returned []
[2024-05-21 04:04:02] [INFO ] Invariant cache hit.
[2024-05-21 04:04:03] [INFO ] Implicit Places using invariants and state equation in 843 ms returned []
Implicit Place search using SMT with State Equation took 1065 ms to find 0 implicit places.
Running 1927 sub problems to find dead transitions.
[2024-05-21 04:04:03] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1504 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1504/3433 variables, and 3 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1505 constraints, PredecessorRefiner: 1927/1927 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1927 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1504 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1504/3433 variables, and 3 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1505 constraints, PredecessorRefiner: 0/1927 constraints, Known Traps: 0/0 constraints]
After SMT, in 60495ms problems are : Problem set: 0 solved, 1927 unsolved
Search for dead transitions found 0 dead transitions in 60513ms
Starting structural reductions in LTL mode, iteration 1 : 1505/1543 places, 1928/1977 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61953 ms. Remains : 1505/1543 places, 1928/1977 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : CloudReconfiguration-PT-307-LTLFireability-13
Product exploration explored 100000 steps with 2785 reset in 176 ms.
Product exploration explored 100000 steps with 2804 reset in 222 ms.
Computed a total of 26 stabilizing places and 28 stable transitions
Graph (complete) has 2101 edges and 1505 vertex of which 1497 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.5 ms
Computed a total of 26 stabilizing places and 28 stable transitions
Detected a total of 26/1505 stabilizing places and 28/1928 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 134 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (NOT p1), (NOT p1)]
Reduction of identical properties reduced properties to check from 6 to 3
RANDOM walk for 40000 steps (340 resets) in 69 ms. (571 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (98 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
[2024-05-21 04:05:04] [INFO ] Invariant cache hit.
Problem apf0 is UNSAT
After SMT solving in domain Real declared 2/3433 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 16 ms.
Refiners :[Generalized P Invariants (flows): 0/3 constraints, State Equation: 0/1505 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 27ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (F (OR (G p1) (G (NOT p1)))), (G (OR p0 p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 12 factoid took 321 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2024-05-21 04:05:05] [INFO ] Invariant cache hit.
[2024-05-21 04:05:06] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 13 ms returned sat
[2024-05-21 04:05:06] [INFO ] [Real]Absence check using state equation in 574 ms returned sat
[2024-05-21 04:05:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 04:05:07] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 12 ms returned sat
[2024-05-21 04:05:07] [INFO ] [Nat]Absence check using state equation in 587 ms returned sat
[2024-05-21 04:05:07] [INFO ] Computed and/alt/rep : 1921/2347/1921 causal constraints (skipped 6 transitions) in 92 ms.
[2024-05-21 04:05:21] [INFO ] Added : 800 causal constraints over 160 iterations in 13832 ms. Result :unknown
Could not prove EG (NOT p1)
Support contains 2 out of 1505 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1505/1505 places, 1928/1928 transitions.
Graph (trivial) has 1839 edges and 1505 vertex of which 693 / 1505 are part of one of the 63 SCC in 0 ms
Free SCC test removed 630 places
Ensure Unique test removed 732 transitions
Reduce isomorphic transitions removed 732 transitions.
Graph (complete) has 1363 edges and 875 vertex of which 867 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 470 transitions
Trivial Post-agglo rules discarded 470 transitions
Performed 470 trivial Post agglomeration. Transition count delta: 470
Iterating post reduction 0 with 470 rules applied. Total rules applied 472 place count 866 transition count 720
Reduce places removed 470 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 494 rules applied. Total rules applied 966 place count 396 transition count 696
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 979 place count 384 transition count 695
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 980 place count 383 transition count 695
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 980 place count 383 transition count 648
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 1074 place count 336 transition count 648
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 1090 place count 320 transition count 622
Iterating global reduction 4 with 16 rules applied. Total rules applied 1106 place count 320 transition count 622
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 3 rules applied. Total rules applied 1109 place count 320 transition count 619
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1112 place count 317 transition count 619
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1122 place count 307 transition count 605
Iterating global reduction 6 with 10 rules applied. Total rules applied 1132 place count 307 transition count 605
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1138 place count 307 transition count 599
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1140 place count 305 transition count 595
Iterating global reduction 7 with 2 rules applied. Total rules applied 1142 place count 305 transition count 595
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1144 place count 303 transition count 591
Iterating global reduction 7 with 2 rules applied. Total rules applied 1146 place count 303 transition count 591
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1148 place count 301 transition count 587
Iterating global reduction 7 with 2 rules applied. Total rules applied 1150 place count 301 transition count 587
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1152 place count 299 transition count 583
Iterating global reduction 7 with 2 rules applied. Total rules applied 1154 place count 299 transition count 583
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1156 place count 297 transition count 579
Iterating global reduction 7 with 2 rules applied. Total rules applied 1158 place count 297 transition count 579
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1160 place count 295 transition count 565
Iterating global reduction 7 with 2 rules applied. Total rules applied 1162 place count 295 transition count 565
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 1163 place count 295 transition count 564
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1164 place count 294 transition count 564
Performed 136 Post agglomeration using F-continuation condition with reduction of 78 identical transitions.
Deduced a syphon composed of 136 places in 0 ms
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 9 with 272 rules applied. Total rules applied 1436 place count 158 transition count 350
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 12 rules applied. Total rules applied 1448 place count 158 transition count 338
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1450 place count 157 transition count 337
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 1454 place count 153 transition count 332
Iterating global reduction 11 with 4 rules applied. Total rules applied 1458 place count 153 transition count 332
Performed 12 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 11 with 24 rules applied. Total rules applied 1482 place count 141 transition count 317
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 11 with 12 rules applied. Total rules applied 1494 place count 141 transition count 305
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 12 with 34 rules applied. Total rules applied 1528 place count 124 transition count 339
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 12 with 17 rules applied. Total rules applied 1545 place count 124 transition count 322
Discarding 9 places :
Symmetric choice reduction at 13 with 9 rule applications. Total rules 1554 place count 115 transition count 304
Iterating global reduction 13 with 9 rules applied. Total rules applied 1563 place count 115 transition count 304
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 1569 place count 115 transition count 298
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 14 with 36 rules applied. Total rules applied 1605 place count 115 transition count 262
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 1606 place count 114 transition count 261
Applied a total of 1606 rules in 57 ms. Remains 114 /1505 variables (removed 1391) and now considering 261/1928 (removed 1667) transitions.
[2024-05-21 04:05:21] [INFO ] Flow matrix only has 204 transitions (discarded 57 similar events)
// Phase 1: matrix 204 rows 114 cols
[2024-05-21 04:05:21] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 04:05:21] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-21 04:05:21] [INFO ] Flow matrix only has 204 transitions (discarded 57 similar events)
[2024-05-21 04:05:21] [INFO ] Invariant cache hit.
[2024-05-21 04:05:21] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 04:05:21] [INFO ] Implicit Places using invariants and state equation in 107 ms returned [8, 44, 77]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 161 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 111/1505 places, 261/1928 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 109 transition count 259
Applied a total of 2 rules in 3 ms. Remains 109 /111 variables (removed 2) and now considering 259/261 (removed 2) transitions.
[2024-05-21 04:05:21] [INFO ] Flow matrix only has 202 transitions (discarded 57 similar events)
// Phase 1: matrix 202 rows 109 cols
[2024-05-21 04:05:21] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 04:05:21] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-21 04:05:21] [INFO ] Flow matrix only has 202 transitions (discarded 57 similar events)
[2024-05-21 04:05:21] [INFO ] Invariant cache hit.
[2024-05-21 04:05:22] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 04:05:22] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 109/1505 places, 259/1928 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 357 ms. Remains : 109/1505 places, 259/1928 transitions.
Computed a total of 3 stabilizing places and 17 stable transitions
Computed a total of 3 stabilizing places and 17 stable transitions
Detected a total of 3/109 stabilizing places and 17/259 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (OR p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 6 factoid took 543 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter insensitive) to 3 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 133 ms :[(NOT p1), (NOT p1), (NOT p1)]
Reduction of identical properties reduced properties to check from 6 to 3
RANDOM walk for 40000 steps (4469 resets) in 59 ms. (666 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (997 resets) in 20 ms. (1904 steps per ms) remains 1/1 properties
[2024-05-21 04:05:22] [INFO ] Flow matrix only has 202 transitions (discarded 57 similar events)
[2024-05-21 04:05:22] [INFO ] Invariant cache hit.
[2024-05-21 04:05:22] [INFO ] State equation strengthened by 2 read => feed constraints.
Problem apf0 is UNSAT
After SMT solving in domain Real declared 2/311 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 12 ms.
Refiners :[State Equation: 0/109 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 14ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (OR p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (G (OR p0 p1)), (G (OR p0 p1))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 8 factoid took 708 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter insensitive) to 3 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2024-05-21 04:05:23] [INFO ] Flow matrix only has 202 transitions (discarded 57 similar events)
[2024-05-21 04:05:23] [INFO ] Invariant cache hit.
[2024-05-21 04:05:23] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2024-05-21 04:05:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 04:05:23] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-21 04:05:23] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 04:05:23] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-21 04:05:23] [INFO ] Computed and/alt/rep : 149/241/149 causal constraints (skipped 45 transitions) in 11 ms.
[2024-05-21 04:05:23] [INFO ] Added : 1 causal constraints over 1 iterations in 39 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-307-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-307-LTLFireability-13 finished in 81962 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||X(G(p0))) U (p1 U p2)))'
Support contains 3 out of 1543 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1543/1543 places, 1977/1977 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1528 transition count 1961
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1528 transition count 1961
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 1528 transition count 1960
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 38 place count 1521 transition count 1952
Iterating global reduction 1 with 7 rules applied. Total rules applied 45 place count 1521 transition count 1952
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 51 place count 1515 transition count 1945
Iterating global reduction 1 with 6 rules applied. Total rules applied 57 place count 1515 transition count 1945
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 58 place count 1515 transition count 1944
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 62 place count 1511 transition count 1940
Iterating global reduction 2 with 4 rules applied. Total rules applied 66 place count 1511 transition count 1940
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 68 place count 1511 transition count 1938
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 70 place count 1509 transition count 1935
Iterating global reduction 3 with 2 rules applied. Total rules applied 72 place count 1509 transition count 1935
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 74 place count 1507 transition count 1932
Iterating global reduction 3 with 2 rules applied. Total rules applied 76 place count 1507 transition count 1932
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 78 place count 1505 transition count 1930
Iterating global reduction 3 with 2 rules applied. Total rules applied 80 place count 1505 transition count 1930
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 81 place count 1505 transition count 1929
Applied a total of 81 rules in 368 ms. Remains 1505 /1543 variables (removed 38) and now considering 1929/1977 (removed 48) transitions.
// Phase 1: matrix 1929 rows 1505 cols
[2024-05-21 04:05:24] [INFO ] Computed 3 invariants in 9 ms
[2024-05-21 04:05:24] [INFO ] Implicit Places using invariants in 209 ms returned []
[2024-05-21 04:05:24] [INFO ] Invariant cache hit.
[2024-05-21 04:05:25] [INFO ] Implicit Places using invariants and state equation in 883 ms returned []
Implicit Place search using SMT with State Equation took 1101 ms to find 0 implicit places.
Running 1928 sub problems to find dead transitions.
[2024-05-21 04:05:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1504 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1504/3434 variables, and 3 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1505 constraints, PredecessorRefiner: 1928/1928 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1504 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1504/3434 variables, and 3 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1505 constraints, PredecessorRefiner: 0/1928 constraints, Known Traps: 0/0 constraints]
After SMT, in 60499ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 60516ms
Starting structural reductions in LTL mode, iteration 1 : 1505/1543 places, 1929/1977 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61995 ms. Remains : 1505/1543 places, 1929/1977 transitions.
Stuttering acceptance computed with spot in 182 ms :[(NOT p2), (NOT p0), (AND (NOT p0) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : CloudReconfiguration-PT-307-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-307-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-307-LTLFireability-14 finished in 62196 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||X(G(p1)))))))'
Found a Lengthening insensitive property : CloudReconfiguration-PT-307-LTLFireability-04
Stuttering acceptance computed with spot in 158 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 1543 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1543/1543 places, 1977/1977 transitions.
Graph (trivial) has 1887 edges and 1543 vertex of which 694 / 1543 are part of one of the 63 SCC in 1 ms
Free SCC test removed 631 places
Ensure Unique test removed 733 transitions
Reduce isomorphic transitions removed 733 transitions.
Graph (complete) has 1412 edges and 912 vertex of which 904 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.5 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 499 transitions
Trivial Post-agglo rules discarded 499 transitions
Performed 499 trivial Post agglomeration. Transition count delta: 499
Iterating post reduction 0 with 499 rules applied. Total rules applied 501 place count 903 transition count 739
Reduce places removed 499 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 523 rules applied. Total rules applied 1024 place count 404 transition count 715
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1036 place count 392 transition count 715
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 1036 place count 392 transition count 668
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 1130 place count 345 transition count 668
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1143 place count 332 transition count 647
Iterating global reduction 3 with 13 rules applied. Total rules applied 1156 place count 332 transition count 647
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 1157 place count 332 transition count 646
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1158 place count 331 transition count 646
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 1167 place count 322 transition count 633
Iterating global reduction 5 with 9 rules applied. Total rules applied 1176 place count 322 transition count 633
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 6 rules applied. Total rules applied 1182 place count 322 transition count 627
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1183 place count 321 transition count 627
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1184 place count 320 transition count 625
Iterating global reduction 7 with 1 rules applied. Total rules applied 1185 place count 320 transition count 625
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1186 place count 319 transition count 623
Iterating global reduction 7 with 1 rules applied. Total rules applied 1187 place count 319 transition count 623
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1188 place count 318 transition count 621
Iterating global reduction 7 with 1 rules applied. Total rules applied 1189 place count 318 transition count 621
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1190 place count 317 transition count 619
Iterating global reduction 7 with 1 rules applied. Total rules applied 1191 place count 317 transition count 619
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1192 place count 316 transition count 617
Iterating global reduction 7 with 1 rules applied. Total rules applied 1193 place count 316 transition count 617
Performed 148 Post agglomeration using F-continuation condition with reduction of 87 identical transitions.
Deduced a syphon composed of 148 places in 1 ms
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 7 with 296 rules applied. Total rules applied 1489 place count 168 transition count 382
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 7 with 16 rules applied. Total rules applied 1505 place count 168 transition count 366
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 1511 place count 162 transition count 355
Iterating global reduction 8 with 6 rules applied. Total rules applied 1517 place count 162 transition count 355
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1518 place count 161 transition count 354
Iterating global reduction 8 with 1 rules applied. Total rules applied 1519 place count 161 transition count 354
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1520 place count 161 transition count 353
Performed 13 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 9 with 26 rules applied. Total rules applied 1546 place count 148 transition count 338
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 9 with 13 rules applied. Total rules applied 1559 place count 148 transition count 325
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1560 place count 147 transition count 323
Iterating global reduction 10 with 1 rules applied. Total rules applied 1561 place count 147 transition count 323
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 10 with 38 rules applied. Total rules applied 1599 place count 128 transition count 360
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 10 with 22 rules applied. Total rules applied 1621 place count 128 transition count 338
Discarding 9 places :
Symmetric choice reduction at 11 with 9 rule applications. Total rules 1630 place count 119 transition count 320
Iterating global reduction 11 with 9 rules applied. Total rules applied 1639 place count 119 transition count 320
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 1645 place count 119 transition count 314
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1646 place count 118 transition count 313
Applied a total of 1646 rules in 62 ms. Remains 118 /1543 variables (removed 1425) and now considering 313/1977 (removed 1664) transitions.
[2024-05-21 04:06:26] [INFO ] Flow matrix only has 254 transitions (discarded 59 similar events)
// Phase 1: matrix 254 rows 118 cols
[2024-05-21 04:06:26] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 04:06:26] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-21 04:06:26] [INFO ] Flow matrix only has 254 transitions (discarded 59 similar events)
[2024-05-21 04:06:26] [INFO ] Invariant cache hit.
[2024-05-21 04:06:26] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-21 04:06:26] [INFO ] Implicit Places using invariants and state equation in 103 ms returned [14, 48, 81]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 150 ms to find 3 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 115/1543 places, 313/1977 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 113 transition count 311
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 112 transition count 310
Applied a total of 3 rules in 7 ms. Remains 112 /115 variables (removed 3) and now considering 310/313 (removed 3) transitions.
[2024-05-21 04:06:26] [INFO ] Flow matrix only has 251 transitions (discarded 59 similar events)
// Phase 1: matrix 251 rows 112 cols
[2024-05-21 04:06:26] [INFO ] Computed 0 invariants in 0 ms
[2024-05-21 04:06:26] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-21 04:06:26] [INFO ] Flow matrix only has 251 transitions (discarded 59 similar events)
[2024-05-21 04:06:26] [INFO ] Invariant cache hit.
[2024-05-21 04:06:26] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 04:06:26] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 112/1543 places, 310/1977 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 357 ms. Remains : 112/1543 places, 310/1977 transitions.
Running random walk in product with property : CloudReconfiguration-PT-307-LTLFireability-04
Entered a terminal (fully accepting) state of product in 4584 steps with 511 reset in 8 ms.
Treatment of property CloudReconfiguration-PT-307-LTLFireability-04 finished in 626 ms.
FORMULA CloudReconfiguration-PT-307-LTLFireability-04 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0)) U G(p1)))))'
Found a Lengthening insensitive property : CloudReconfiguration-PT-307-LTLFireability-12
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0)]
Support contains 2 out of 1543 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1543/1543 places, 1977/1977 transitions.
Graph (trivial) has 1887 edges and 1543 vertex of which 697 / 1543 are part of one of the 63 SCC in 2 ms
Free SCC test removed 634 places
Ensure Unique test removed 737 transitions
Reduce isomorphic transitions removed 737 transitions.
Graph (complete) has 1408 edges and 909 vertex of which 901 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 496 transitions
Trivial Post-agglo rules discarded 496 transitions
Performed 496 trivial Post agglomeration. Transition count delta: 496
Iterating post reduction 0 with 496 rules applied. Total rules applied 498 place count 900 transition count 738
Reduce places removed 496 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 520 rules applied. Total rules applied 1018 place count 404 transition count 714
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1030 place count 392 transition count 714
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 1030 place count 392 transition count 667
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 1124 place count 345 transition count 667
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1138 place count 331 transition count 644
Iterating global reduction 3 with 14 rules applied. Total rules applied 1152 place count 331 transition count 644
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 1153 place count 331 transition count 643
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1154 place count 330 transition count 643
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 1164 place count 320 transition count 628
Iterating global reduction 5 with 10 rules applied. Total rules applied 1174 place count 320 transition count 628
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 6 rules applied. Total rules applied 1180 place count 320 transition count 622
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1181 place count 319 transition count 622
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1183 place count 317 transition count 618
Iterating global reduction 7 with 2 rules applied. Total rules applied 1185 place count 317 transition count 618
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1187 place count 315 transition count 614
Iterating global reduction 7 with 2 rules applied. Total rules applied 1189 place count 315 transition count 614
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1191 place count 313 transition count 610
Iterating global reduction 7 with 2 rules applied. Total rules applied 1193 place count 313 transition count 610
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1195 place count 311 transition count 606
Iterating global reduction 7 with 2 rules applied. Total rules applied 1197 place count 311 transition count 606
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1199 place count 309 transition count 602
Iterating global reduction 7 with 2 rules applied. Total rules applied 1201 place count 309 transition count 602
Performed 147 Post agglomeration using F-continuation condition with reduction of 86 identical transitions.
Deduced a syphon composed of 147 places in 0 ms
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 7 with 294 rules applied. Total rules applied 1495 place count 162 transition count 369
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 7 with 16 rules applied. Total rules applied 1511 place count 162 transition count 353
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 1518 place count 155 transition count 337
Iterating global reduction 8 with 7 rules applied. Total rules applied 1525 place count 155 transition count 337
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1526 place count 154 transition count 336
Iterating global reduction 8 with 1 rules applied. Total rules applied 1527 place count 154 transition count 336
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1528 place count 154 transition count 335
Performed 13 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 9 with 26 rules applied. Total rules applied 1554 place count 141 transition count 320
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 9 with 14 rules applied. Total rules applied 1568 place count 141 transition count 306
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 10 with 34 rules applied. Total rules applied 1602 place count 124 transition count 340
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 10 with 17 rules applied. Total rules applied 1619 place count 124 transition count 323
Discarding 9 places :
Symmetric choice reduction at 11 with 9 rule applications. Total rules 1628 place count 115 transition count 305
Iterating global reduction 11 with 9 rules applied. Total rules applied 1637 place count 115 transition count 305
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 1643 place count 115 transition count 299
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1644 place count 114 transition count 298
Applied a total of 1644 rules in 60 ms. Remains 114 /1543 variables (removed 1429) and now considering 298/1977 (removed 1679) transitions.
[2024-05-21 04:06:27] [INFO ] Flow matrix only has 241 transitions (discarded 57 similar events)
// Phase 1: matrix 241 rows 114 cols
[2024-05-21 04:06:27] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 04:06:27] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-21 04:06:27] [INFO ] Flow matrix only has 241 transitions (discarded 57 similar events)
[2024-05-21 04:06:27] [INFO ] Invariant cache hit.
[2024-05-21 04:06:27] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 04:06:27] [INFO ] Implicit Places using invariants and state equation in 104 ms returned [8, 42, 75]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 238 ms to find 3 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 111/1543 places, 298/1977 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 109 transition count 296
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 108 transition count 295
Applied a total of 3 rules in 4 ms. Remains 108 /111 variables (removed 3) and now considering 295/298 (removed 3) transitions.
[2024-05-21 04:06:27] [INFO ] Flow matrix only has 238 transitions (discarded 57 similar events)
// Phase 1: matrix 238 rows 108 cols
[2024-05-21 04:06:27] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 04:06:27] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-21 04:06:27] [INFO ] Flow matrix only has 238 transitions (discarded 57 similar events)
[2024-05-21 04:06:27] [INFO ] Invariant cache hit.
[2024-05-21 04:06:27] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 04:06:27] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 108/1543 places, 295/1977 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 728 ms. Remains : 108/1543 places, 295/1977 transitions.
Running random walk in product with property : CloudReconfiguration-PT-307-LTLFireability-12
Stuttering criterion allowed to conclude after 13399 steps with 1498 reset in 19 ms.
Treatment of property CloudReconfiguration-PT-307-LTLFireability-12 finished in 983 ms.
FORMULA CloudReconfiguration-PT-307-LTLFireability-12 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2024-05-21 04:06:27] [INFO ] Flatten gal took : 70 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 1044742 ms.
ITS solved all properties within timeout

BK_STOP 1716264388075

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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="CloudReconfiguration-PT-307"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is CloudReconfiguration-PT-307, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r091-tall-171624187100164"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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