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-171624187300236.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-316, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r091-tall-171624187300236
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K 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.5K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 19:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Apr 11 19:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 11 19:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 11 19:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:35 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-316-LTLFireability-00
FORMULA_NAME CloudReconfiguration-PT-316-LTLFireability-01
FORMULA_NAME CloudReconfiguration-PT-316-LTLFireability-02
FORMULA_NAME CloudReconfiguration-PT-316-LTLFireability-03
FORMULA_NAME CloudReconfiguration-PT-316-LTLFireability-04
FORMULA_NAME CloudReconfiguration-PT-316-LTLFireability-05
FORMULA_NAME CloudReconfiguration-PT-316-LTLFireability-06
FORMULA_NAME CloudReconfiguration-PT-316-LTLFireability-07
FORMULA_NAME CloudReconfiguration-PT-316-LTLFireability-08
FORMULA_NAME CloudReconfiguration-PT-316-LTLFireability-09
FORMULA_NAME CloudReconfiguration-PT-316-LTLFireability-10
FORMULA_NAME CloudReconfiguration-PT-316-LTLFireability-11
FORMULA_NAME CloudReconfiguration-PT-316-LTLFireability-12
FORMULA_NAME CloudReconfiguration-PT-316-LTLFireability-13
FORMULA_NAME CloudReconfiguration-PT-316-LTLFireability-14
FORMULA_NAME CloudReconfiguration-PT-316-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716271808194

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-316
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 06:10:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 06:10:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 06:10:09] [INFO ] Load time of PNML (sax parser for PT used): 161 ms
[2024-05-21 06:10:09] [INFO ] Transformed 2585 places.
[2024-05-21 06:10:09] [INFO ] Transformed 3095 transitions.
[2024-05-21 06:10:09] [INFO ] Found NUPN structural information;
[2024-05-21 06:10:09] [INFO ] Parsed PT model containing 2585 places and 3095 transitions and 6463 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-316-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-316-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 2585 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2585/2585 places, 3095/3095 transitions.
Discarding 515 places :
Symmetric choice reduction at 0 with 515 rule applications. Total rules 515 place count 2070 transition count 2580
Iterating global reduction 0 with 515 rules applied. Total rules applied 1030 place count 2070 transition count 2580
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 1057 place count 2070 transition count 2553
Discarding 237 places :
Symmetric choice reduction at 1 with 237 rule applications. Total rules 1294 place count 1833 transition count 2316
Iterating global reduction 1 with 237 rules applied. Total rules applied 1531 place count 1833 transition count 2316
Discarding 90 places :
Symmetric choice reduction at 1 with 90 rule applications. Total rules 1621 place count 1743 transition count 2226
Iterating global reduction 1 with 90 rules applied. Total rules applied 1711 place count 1743 transition count 2226
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 1729 place count 1743 transition count 2208
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 1777 place count 1695 transition count 2160
Iterating global reduction 2 with 48 rules applied. Total rules applied 1825 place count 1695 transition count 2160
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 1834 place count 1695 transition count 2151
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 1872 place count 1657 transition count 2108
Iterating global reduction 3 with 38 rules applied. Total rules applied 1910 place count 1657 transition count 2108
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 1937 place count 1630 transition count 2081
Iterating global reduction 3 with 27 rules applied. Total rules applied 1964 place count 1630 transition count 2081
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 1988 place count 1606 transition count 2057
Iterating global reduction 3 with 24 rules applied. Total rules applied 2012 place count 1606 transition count 2057
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 2036 place count 1582 transition count 2033
Iterating global reduction 3 with 24 rules applied. Total rules applied 2060 place count 1582 transition count 2033
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 2079 place count 1563 transition count 2002
Iterating global reduction 3 with 19 rules applied. Total rules applied 2098 place count 1563 transition count 2002
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 2105 place count 1556 transition count 1991
Iterating global reduction 3 with 7 rules applied. Total rules applied 2112 place count 1556 transition count 1991
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 2119 place count 1549 transition count 1983
Iterating global reduction 3 with 7 rules applied. Total rules applied 2126 place count 1549 transition count 1983
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 2129 place count 1549 transition count 1980
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 2130 place count 1548 transition count 1979
Iterating global reduction 4 with 1 rules applied. Total rules applied 2131 place count 1548 transition count 1979
Applied a total of 2131 rules in 1547 ms. Remains 1548 /2585 variables (removed 1037) and now considering 1979/3095 (removed 1116) transitions.
// Phase 1: matrix 1979 rows 1548 cols
[2024-05-21 06:10:11] [INFO ] Computed 4 invariants in 35 ms
[2024-05-21 06:10:11] [INFO ] Implicit Places using invariants in 467 ms returned []
[2024-05-21 06:10:11] [INFO ] Invariant cache hit.
[2024-05-21 06:10:13] [INFO ] Implicit Places using invariants and state equation in 1125 ms returned []
Implicit Place search using SMT with State Equation took 1669 ms to find 0 implicit places.
Running 1978 sub problems to find dead transitions.
[2024-05-21 06:10:13] [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/1547 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1978 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1547/3527 variables, and 4 constraints, problems are : Problem set: 0 solved, 1978 unsolved in 30077 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1548 constraints, PredecessorRefiner: 1978/1978 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1978 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1547 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1978 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1547/3527 variables, and 4 constraints, problems are : Problem set: 0 solved, 1978 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1548 constraints, PredecessorRefiner: 0/1978 constraints, Known Traps: 0/0 constraints]
After SMT, in 60880ms problems are : Problem set: 0 solved, 1978 unsolved
Search for dead transitions found 0 dead transitions in 60917ms
Starting structural reductions in LTL mode, iteration 1 : 1548/2585 places, 1979/3095 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64163 ms. Remains : 1548/2585 places, 1979/3095 transitions.
Support contains 30 out of 1548 places after structural reductions.
[2024-05-21 06:11:14] [INFO ] Flatten gal took : 163 ms
[2024-05-21 06:11:14] [INFO ] Flatten gal took : 89 ms
[2024-05-21 06:11:14] [INFO ] Input system was already deterministic with 1979 transitions.
Support contains 28 out of 1548 places (down from 30) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 28 to 27
RANDOM walk for 40000 steps (299 resets) in 1496 ms. (26 steps per ms) remains 23/27 properties
BEST_FIRST walk for 4002 steps (9 resets) in 48 ms. (81 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (10 resets) in 50 ms. (78 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (10 resets) in 32 ms. (121 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (9 resets) in 39 ms. (100 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (11 resets) in 27 ms. (143 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (10 resets) in 22 ms. (174 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (9 resets) in 37 ms. (105 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (9 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (10 resets) in 12 ms. (308 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (11 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (11 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (9 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (10 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (10 resets) in 23 ms. (166 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (11 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (10 resets) in 43 ms. (90 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (9 resets) in 25 ms. (154 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (11 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (9 resets) in 12 ms. (307 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (12 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (10 resets) in 24 ms. (160 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (10 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
[2024-05-21 06:11:15] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 1513/1537 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1537 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 1969/3506 variables, 1537/1541 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3506 variables, 0/1541 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 2/3508 variables, 1/1542 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3508 variables, 0/1542 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 2/3510 variables, 1/1543 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3510 variables, 0/1543 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (OVERLAPS) 2/3512 variables, 1/1544 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3512 variables, 0/1544 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 11 (OVERLAPS) 2/3514 variables, 1/1545 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3514/3527 variables, and 1545 constraints, problems are : Problem set: 0 solved, 23 unsolved in 5011 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1541/1548 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 1513/1537 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1537 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 1969/3506 variables, 1537/1541 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3506 variables, 23/1564 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3506 variables, 0/1564 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 2/3508 variables, 1/1565 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3508 variables, 0/1565 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 2/3510 variables, 1/1566 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3510 variables, 0/1566 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (OVERLAPS) 2/3512 variables, 1/1567 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3512/3527 variables, and 1567 constraints, problems are : Problem set: 0 solved, 23 unsolved in 5010 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1540/1548 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
After SMT, in 10041ms problems are : Problem set: 0 solved, 23 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 24 out of 1548 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1548/1548 places, 1979/1979 transitions.
Graph (trivial) has 1833 edges and 1548 vertex of which 628 / 1548 are part of one of the 59 SCC in 10 ms
Free SCC test removed 569 places
Drop transitions (Empty/Sink Transition effects.) removed 717 transitions
Reduce isomorphic transitions removed 717 transitions.
Graph (complete) has 1440 edges and 979 vertex of which 970 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 517 transitions
Trivial Post-agglo rules discarded 517 transitions
Performed 517 trivial Post agglomeration. Transition count delta: 517
Iterating post reduction 0 with 523 rules applied. Total rules applied 525 place count 970 transition count 735
Reduce places removed 517 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 1 with 569 rules applied. Total rules applied 1094 place count 453 transition count 683
Reduce places removed 33 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 2 with 35 rules applied. Total rules applied 1129 place count 420 transition count 681
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 3 with 3 rules applied. Total rules applied 1132 place count 419 transition count 679
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 1136 place count 418 transition count 676
Reduce places removed 2 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 5 with 12 rules applied. Total rules applied 1148 place count 416 transition count 666
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 1160 place count 406 transition count 664
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 52 Pre rules applied. Total rules applied 1160 place count 406 transition count 612
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 7 with 104 rules applied. Total rules applied 1264 place count 354 transition count 612
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 1275 place count 343 transition count 598
Iterating global reduction 7 with 11 rules applied. Total rules applied 1286 place count 343 transition count 598
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 7 with 3 rules applied. Total rules applied 1289 place count 343 transition count 595
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1291 place count 341 transition count 595
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 1291 place count 341 transition count 594
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1293 place count 340 transition count 594
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 1300 place count 333 transition count 586
Iterating global reduction 9 with 7 rules applied. Total rules applied 1307 place count 333 transition count 586
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 1313 place count 333 transition count 580
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1314 place count 332 transition count 574
Iterating global reduction 10 with 1 rules applied. Total rules applied 1315 place count 332 transition count 574
Performed 163 Post agglomeration using F-continuation condition with reduction of 96 identical transitions.
Deduced a syphon composed of 163 places in 0 ms
Reduce places removed 163 places and 0 transitions.
Iterating global reduction 10 with 326 rules applied. Total rules applied 1641 place count 169 transition count 315
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 10 with 21 rules applied. Total rules applied 1662 place count 169 transition count 294
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 1665 place count 166 transition count 291
Iterating global reduction 11 with 3 rules applied. Total rules applied 1668 place count 166 transition count 291
Performed 9 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 11 with 18 rules applied. Total rules applied 1686 place count 157 transition count 281
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 11 with 10 rules applied. Total rules applied 1696 place count 157 transition count 271
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 12 with 2 rules applied. Total rules applied 1698 place count 156 transition count 270
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 1700 place count 156 transition count 268
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 13 with 2 rules applied. Total rules applied 1702 place count 155 transition count 267
Performed 35 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 13 with 70 rules applied. Total rules applied 1772 place count 120 transition count 306
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 13 with 33 rules applied. Total rules applied 1805 place count 120 transition count 273
Discarding 19 places :
Symmetric choice reduction at 14 with 19 rule applications. Total rules 1824 place count 101 transition count 235
Iterating global reduction 14 with 19 rules applied. Total rules applied 1843 place count 101 transition count 235
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 14 with 9 rules applied. Total rules applied 1852 place count 101 transition count 226
Discarding 3 places :
Symmetric choice reduction at 15 with 3 rule applications. Total rules 1855 place count 98 transition count 220
Iterating global reduction 15 with 3 rules applied. Total rules applied 1858 place count 98 transition count 220
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 15 with 3 rules applied. Total rules applied 1861 place count 98 transition count 217
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 1863 place count 97 transition count 236
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 1864 place count 97 transition count 235
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 17 with 10 rules applied. Total rules applied 1874 place count 97 transition count 225
Free-agglomeration rule applied 4 times.
Iterating global reduction 17 with 4 rules applied. Total rules applied 1878 place count 97 transition count 221
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 1882 place count 93 transition count 221
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 1883 place count 93 transition count 220
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 18 with 5 rules applied. Total rules applied 1888 place count 93 transition count 220
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 18 with 1 rules applied. Total rules applied 1889 place count 92 transition count 219
Applied a total of 1889 rules in 208 ms. Remains 92 /1548 variables (removed 1456) and now considering 219/1979 (removed 1760) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 208 ms. Remains : 92/1548 places, 219/1979 transitions.
RANDOM walk for 40000 steps (4404 resets) in 843 ms. (47 steps per ms) remains 4/23 properties
BEST_FIRST walk for 40004 steps (908 resets) in 70 ms. (563 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (898 resets) in 72 ms. (547 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (900 resets) in 114 ms. (347 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (936 resets) in 61 ms. (645 steps per ms) remains 4/4 properties
[2024-05-21 06:11:26] [INFO ] Flow matrix only has 209 transitions (discarded 10 similar events)
// Phase 1: matrix 209 rows 92 cols
[2024-05-21 06:11:26] [INFO ] Computed 3 invariants in 7 ms
[2024-05-21 06:11:26] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 31/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 84/118 variables, 34/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 95/213 variables, 7/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 06:11:26] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 68/281 variables, 38/82 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/281 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/281 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 7/288 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/288 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/288 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp16 is UNSAT
At refinement iteration 15 (OVERLAPS) 12/300 variables, 10/100 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/300 variables, 0/100 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/301 variables, 1/101 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/301 variables, 0/101 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/301 variables, 0/101 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 301/301 variables, and 101 constraints, problems are : Problem set: 2 solved, 2 unsolved in 354 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 92/92 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 32/34 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 84/118 variables, 34/35 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 1/36 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/36 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 95/213 variables, 7/43 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 1/44 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 1/45 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 1/46 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 0/46 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 68/281 variables, 38/84 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/281 variables, 4/88 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/281 variables, 0/88 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 7/288 variables, 2/90 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/288 variables, 2/92 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/288 variables, 0/92 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Problem AtomicPropp6 is UNSAT
At refinement iteration 17 (OVERLAPS) 12/300 variables, 10/102 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/300 variables, 0/102 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/301 variables, 1/103 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/301 variables, 0/103 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/301 variables, 0/103 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 301/301 variables, and 103 constraints, problems are : Problem set: 3 solved, 1 unsolved in 167 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 92/92 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 537ms problems are : Problem set: 3 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 219/219 transitions.
Graph (trivial) has 85 edges and 92 vertex of which 18 / 92 are part of one of the 8 SCC in 0 ms
Free SCC test removed 10 places
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 82 transition count 190
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 75 transition count 190
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 15 place count 75 transition count 185
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 25 place count 70 transition count 185
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 69 transition count 184
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 69 transition count 184
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 28 place count 69 transition count 183
Performed 11 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 50 place count 58 transition count 170
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 58 place count 58 transition count 162
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 61 place count 55 transition count 157
Iterating global reduction 4 with 3 rules applied. Total rules applied 64 place count 55 transition count 157
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 67 place count 55 transition count 154
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 75 place count 51 transition count 161
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 5 with 31 rules applied. Total rules applied 106 place count 51 transition count 130
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 109 place count 48 transition count 127
Iterating global reduction 6 with 3 rules applied. Total rules applied 112 place count 48 transition count 127
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 115 place count 48 transition count 124
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 117 place count 47 transition count 123
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 121 place count 47 transition count 119
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 122 place count 46 transition count 118
Iterating global reduction 8 with 1 rules applied. Total rules applied 123 place count 46 transition count 118
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 125 place count 46 transition count 116
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 9 with 30 rules applied. Total rules applied 155 place count 46 transition count 86
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 158 place count 43 transition count 77
Iterating global reduction 9 with 3 rules applied. Total rules applied 161 place count 43 transition count 77
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 164 place count 43 transition count 74
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 167 place count 40 transition count 71
Iterating global reduction 10 with 3 rules applied. Total rules applied 170 place count 40 transition count 71
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 173 place count 40 transition count 68
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 175 place count 39 transition count 67
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 11 with 5 rules applied. Total rules applied 180 place count 39 transition count 62
Free-agglomeration rule applied 3 times.
Iterating global reduction 11 with 3 rules applied. Total rules applied 183 place count 39 transition count 59
Reduce places removed 4 places and 0 transitions.
Graph (trivial) has 37 edges and 35 vertex of which 26 / 35 are part of one of the 9 SCC in 0 ms
Free SCC test removed 17 places
Iterating post reduction 11 with 5 rules applied. Total rules applied 188 place count 18 transition count 59
Drop transitions (Empty/Sink Transition effects.) removed 28 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 12 with 34 rules applied. Total rules applied 222 place count 18 transition count 25
Discarding 3 places :
Symmetric choice reduction at 13 with 3 rule applications. Total rules 225 place count 15 transition count 22
Iterating global reduction 13 with 3 rules applied. Total rules applied 228 place count 15 transition count 22
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 13 with 6 rules applied. Total rules applied 234 place count 12 transition count 19
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 13 with 7 rules applied. Total rules applied 241 place count 12 transition count 12
Applied a total of 241 rules in 62 ms. Remains 12 /92 variables (removed 80) and now considering 12/219 (removed 207) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 12/92 places, 12/219 transitions.
RANDOM walk for 70 steps (6 resets) in 4 ms. (14 steps per ms) remains 0/1 properties
FORMULA CloudReconfiguration-PT-316-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
FORMULA CloudReconfiguration-PT-316-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-316-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 28 stabilizing places and 30 stable transitions
Graph (complete) has 2162 edges and 1548 vertex of which 1539 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.25 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((F(p0) U (X(p2)&&p1)))))'
Support contains 4 out of 1548 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1548/1548 places, 1979/1979 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1534 transition count 1965
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1534 transition count 1965
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 1534 transition count 1963
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 35 place count 1529 transition count 1958
Iterating global reduction 1 with 5 rules applied. Total rules applied 40 place count 1529 transition count 1958
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 44 place count 1525 transition count 1952
Iterating global reduction 1 with 4 rules applied. Total rules applied 48 place count 1525 transition count 1952
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 50 place count 1523 transition count 1949
Iterating global reduction 1 with 2 rules applied. Total rules applied 52 place count 1523 transition count 1949
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 54 place count 1521 transition count 1946
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 1521 transition count 1946
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 58 place count 1519 transition count 1944
Iterating global reduction 1 with 2 rules applied. Total rules applied 60 place count 1519 transition count 1944
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 61 place count 1518 transition count 1943
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 1518 transition count 1943
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 63 place count 1517 transition count 1941
Iterating global reduction 1 with 1 rules applied. Total rules applied 64 place count 1517 transition count 1941
Applied a total of 64 rules in 713 ms. Remains 1517 /1548 variables (removed 31) and now considering 1941/1979 (removed 38) transitions.
// Phase 1: matrix 1941 rows 1517 cols
[2024-05-21 06:11:27] [INFO ] Computed 4 invariants in 17 ms
[2024-05-21 06:11:28] [INFO ] Implicit Places using invariants in 245 ms returned []
[2024-05-21 06:11:28] [INFO ] Invariant cache hit.
[2024-05-21 06:11:28] [INFO ] Implicit Places using invariants and state equation in 956 ms returned []
Implicit Place search using SMT with State Equation took 1208 ms to find 0 implicit places.
Running 1940 sub problems to find dead transitions.
[2024-05-21 06:11:29] [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/1516 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1940 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1516/3458 variables, and 4 constraints, problems are : Problem set: 0 solved, 1940 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1517 constraints, PredecessorRefiner: 1940/1940 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1940 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1516 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1940 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1516/3458 variables, and 4 constraints, problems are : Problem set: 0 solved, 1940 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1517 constraints, PredecessorRefiner: 0/1940 constraints, Known Traps: 0/0 constraints]
After SMT, in 60641ms problems are : Problem set: 0 solved, 1940 unsolved
Search for dead transitions found 0 dead transitions in 60658ms
Starting structural reductions in LTL mode, iteration 1 : 1517/1548 places, 1941/1979 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62586 ms. Remains : 1517/1548 places, 1941/1979 transitions.
Stuttering acceptance computed with spot in 323 ms :[(OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : CloudReconfiguration-PT-316-LTLFireability-01
Stuttering criterion allowed to conclude after 126 steps with 0 reset in 14 ms.
FORMULA CloudReconfiguration-PT-316-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-316-LTLFireability-01 finished in 62998 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(p0))))'
Support contains 1 out of 1548 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1548/1548 places, 1979/1979 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1534 transition count 1965
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1534 transition count 1965
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 1534 transition count 1963
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 35 place count 1529 transition count 1958
Iterating global reduction 1 with 5 rules applied. Total rules applied 40 place count 1529 transition count 1958
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 44 place count 1525 transition count 1953
Iterating global reduction 1 with 4 rules applied. Total rules applied 48 place count 1525 transition count 1953
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 51 place count 1522 transition count 1949
Iterating global reduction 1 with 3 rules applied. Total rules applied 54 place count 1522 transition count 1949
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 1519 transition count 1945
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 1519 transition count 1945
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 63 place count 1516 transition count 1942
Iterating global reduction 1 with 3 rules applied. Total rules applied 66 place count 1516 transition count 1942
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 68 place count 1514 transition count 1940
Iterating global reduction 1 with 2 rules applied. Total rules applied 70 place count 1514 transition count 1940
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 72 place count 1512 transition count 1937
Iterating global reduction 1 with 2 rules applied. Total rules applied 74 place count 1512 transition count 1937
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 75 place count 1511 transition count 1935
Iterating global reduction 1 with 1 rules applied. Total rules applied 76 place count 1511 transition count 1935
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 77 place count 1510 transition count 1933
Iterating global reduction 1 with 1 rules applied. Total rules applied 78 place count 1510 transition count 1933
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 79 place count 1509 transition count 1932
Iterating global reduction 1 with 1 rules applied. Total rules applied 80 place count 1509 transition count 1932
Applied a total of 80 rules in 659 ms. Remains 1509 /1548 variables (removed 39) and now considering 1932/1979 (removed 47) transitions.
// Phase 1: matrix 1932 rows 1509 cols
[2024-05-21 06:12:30] [INFO ] Computed 4 invariants in 19 ms
[2024-05-21 06:12:30] [INFO ] Implicit Places using invariants in 272 ms returned []
[2024-05-21 06:12:30] [INFO ] Invariant cache hit.
[2024-05-21 06:12:31] [INFO ] Implicit Places using invariants and state equation in 924 ms returned []
Implicit Place search using SMT with State Equation took 1201 ms to find 0 implicit places.
Running 1931 sub problems to find dead transitions.
[2024-05-21 06:12:31] [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/1508 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1931 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1508/3441 variables, and 4 constraints, problems are : Problem set: 0 solved, 1931 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1509 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/1508 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1931 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(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 0)
(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 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(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 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(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 0)
(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 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 1)
(s199 1)
(s200 1)
(s201 0)
(s202 1)
(s203 0)
(s204 0)
(s205 0)
(s206 1)
(s207 0)
(s208 0)
(s209 0)
(s210 1)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 1)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 1)
(s228 0)
(s229 0)
(s230 0)
(s231 1)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 1)
(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 1)
(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 1)
(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 1)
(s289 1)
(s290 0)
(s291 0)
(s292 1)
(s293 1)
(s294 1)
(s295 0)
(s296 0)
(s297 0)
(s298 1)
(s299 1)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 1)
(s306 1)
(s307 0)
(s308 0)
(s309 1)
(s310 1)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1508/3441 variables, and 4 constraints, problems are : Problem set: 0 solved, 1931 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1509 constraints, PredecessorRefiner: 0/1931 constraints, Known Traps: 0/0 constraints]
After SMT, in 60517ms problems are : Problem set: 0 solved, 1931 unsolved
Search for dead transitions found 0 dead transitions in 60536ms
Starting structural reductions in LTL mode, iteration 1 : 1509/1548 places, 1932/1979 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62403 ms. Remains : 1509/1548 places, 1932/1979 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-316-LTLFireability-02
Product exploration explored 100000 steps with 33333 reset in 377 ms.
Product exploration explored 100000 steps with 33333 reset in 363 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2111 edges and 1509 vertex of which 1500 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.9 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 13 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudReconfiguration-PT-316-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-316-LTLFireability-02 finished in 63340 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 1548 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1548/1548 places, 1979/1979 transitions.
Graph (trivial) has 1886 edges and 1548 vertex of which 689 / 1548 are part of one of the 63 SCC in 3 ms
Free SCC test removed 626 places
Ensure Unique test removed 727 transitions
Reduce isomorphic transitions removed 727 transitions.
Graph (complete) has 1429 edges and 922 vertex of which 913 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 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 503 transitions
Trivial Post-agglo rules discarded 503 transitions
Performed 503 trivial Post agglomeration. Transition count delta: 503
Iterating post reduction 0 with 503 rules applied. Total rules applied 505 place count 912 transition count 743
Reduce places removed 503 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 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 527 rules applied. Total rules applied 1032 place count 409 transition count 719
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 1043 place count 398 transition count 719
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 1043 place count 398 transition count 674
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 1133 place count 353 transition count 674
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 1152 place count 334 transition count 647
Iterating global reduction 3 with 19 rules applied. Total rules applied 1171 place count 334 transition count 647
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 3 rules applied. Total rules applied 1174 place count 334 transition count 644
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1176 place count 332 transition count 644
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1176 place count 332 transition count 643
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1178 place count 331 transition count 643
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 1191 place count 318 transition count 625
Iterating global reduction 5 with 13 rules applied. Total rules applied 1204 place count 318 transition count 625
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1210 place count 318 transition count 619
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 1215 place count 313 transition count 609
Iterating global reduction 6 with 5 rules applied. Total rules applied 1220 place count 313 transition count 609
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1224 place count 309 transition count 601
Iterating global reduction 6 with 4 rules applied. Total rules applied 1228 place count 309 transition count 601
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 2 rules applied. Total rules applied 1230 place count 309 transition count 599
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1232 place count 307 transition count 599
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1234 place count 305 transition count 595
Iterating global reduction 8 with 2 rules applied. Total rules applied 1236 place count 305 transition count 595
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1238 place count 303 transition count 591
Iterating global reduction 8 with 2 rules applied. Total rules applied 1240 place count 303 transition count 591
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1242 place count 301 transition count 587
Iterating global reduction 8 with 2 rules applied. Total rules applied 1244 place count 301 transition count 587
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1246 place count 299 transition count 573
Iterating global reduction 8 with 2 rules applied. Total rules applied 1248 place count 299 transition count 573
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 8 with 1 rules applied. Total rules applied 1249 place count 299 transition count 572
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1250 place count 298 transition count 572
Performed 141 Post agglomeration using F-continuation condition with reduction of 84 identical transitions.
Deduced a syphon composed of 141 places in 0 ms
Reduce places removed 141 places and 0 transitions.
Iterating global reduction 10 with 282 rules applied. Total rules applied 1532 place count 157 transition count 347
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 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 10 with 11 rules applied. Total rules applied 1543 place count 157 transition count 336
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 1545 place count 156 transition count 335
Discarding 4 places :
Symmetric choice reduction at 12 with 4 rule applications. Total rules 1549 place count 152 transition count 330
Iterating global reduction 12 with 4 rules applied. Total rules applied 1553 place count 152 transition count 330
Performed 11 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 12 with 22 rules applied. Total rules applied 1575 place count 141 transition count 316
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 12 with 10 rules applied. Total rules applied 1585 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 13 with 34 rules applied. Total rules applied 1619 place count 124 transition count 340
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 13 with 17 rules applied. Total rules applied 1636 place count 124 transition count 323
Discarding 9 places :
Symmetric choice reduction at 14 with 9 rule applications. Total rules 1645 place count 115 transition count 305
Iterating global reduction 14 with 9 rules applied. Total rules applied 1654 place count 115 transition count 305
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 1660 place count 115 transition count 299
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 15 with 36 rules applied. Total rules applied 1696 place count 115 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 1697 place count 114 transition count 262
Applied a total of 1697 rules in 177 ms. Remains 114 /1548 variables (removed 1434) and now considering 262/1979 (removed 1717) transitions.
[2024-05-21 06:13:33] [INFO ] Flow matrix only has 205 transitions (discarded 57 similar events)
// Phase 1: matrix 205 rows 114 cols
[2024-05-21 06:13:33] [INFO ] Computed 0 invariants in 0 ms
[2024-05-21 06:13:33] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-21 06:13:33] [INFO ] Flow matrix only has 205 transitions (discarded 57 similar events)
[2024-05-21 06:13:33] [INFO ] Invariant cache hit.
[2024-05-21 06:13:33] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 06:13:33] [INFO ] Implicit Places using invariants and state equation in 162 ms returned [8, 41]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 290 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 112/1548 places, 262/1979 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 110 transition count 260
Applied a total of 2 rules in 6 ms. Remains 110 /112 variables (removed 2) and now considering 260/262 (removed 2) transitions.
[2024-05-21 06:13:33] [INFO ] Flow matrix only has 203 transitions (discarded 57 similar events)
// Phase 1: matrix 203 rows 110 cols
[2024-05-21 06:13:33] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 06:13:33] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-21 06:13:33] [INFO ] Flow matrix only has 203 transitions (discarded 57 similar events)
[2024-05-21 06:13:33] [INFO ] Invariant cache hit.
[2024-05-21 06:13:33] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 06:13:33] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 110/1548 places, 260/1979 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 644 ms. Remains : 110/1548 places, 260/1979 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-316-LTLFireability-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-316-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-316-LTLFireability-03 finished in 717 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))'
Support contains 1 out of 1548 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1548/1548 places, 1979/1979 transitions.
Graph (trivial) has 1885 edges and 1548 vertex of which 694 / 1548 are part of one of the 63 SCC in 3 ms
Free SCC test removed 631 places
Ensure Unique test removed 733 transitions
Reduce isomorphic transitions removed 733 transitions.
Graph (complete) has 1423 edges and 917 vertex of which 908 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 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 500 transitions
Trivial Post-agglo rules discarded 500 transitions
Performed 500 trivial Post agglomeration. Transition count delta: 500
Iterating post reduction 0 with 500 rules applied. Total rules applied 502 place count 907 transition count 740
Reduce places removed 500 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 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 524 rules applied. Total rules applied 1026 place count 407 transition count 716
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 1037 place count 396 transition count 716
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 1037 place count 396 transition count 671
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 1127 place count 351 transition count 671
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 1146 place count 332 transition count 644
Iterating global reduction 3 with 19 rules applied. Total rules applied 1165 place count 332 transition count 644
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 3 rules applied. Total rules applied 1168 place count 332 transition count 641
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1170 place count 330 transition count 641
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1170 place count 330 transition count 640
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1172 place count 329 transition count 640
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 1185 place count 316 transition count 622
Iterating global reduction 5 with 13 rules applied. Total rules applied 1198 place count 316 transition count 622
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1204 place count 316 transition count 616
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 1209 place count 311 transition count 606
Iterating global reduction 6 with 5 rules applied. Total rules applied 1214 place count 311 transition count 606
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1218 place count 307 transition count 598
Iterating global reduction 6 with 4 rules applied. Total rules applied 1222 place count 307 transition count 598
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 2 rules applied. Total rules applied 1224 place count 307 transition count 596
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1226 place count 305 transition count 596
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1228 place count 303 transition count 592
Iterating global reduction 8 with 2 rules applied. Total rules applied 1230 place count 303 transition count 592
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1232 place count 301 transition count 588
Iterating global reduction 8 with 2 rules applied. Total rules applied 1234 place count 301 transition count 588
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1236 place count 299 transition count 584
Iterating global reduction 8 with 2 rules applied. Total rules applied 1238 place count 299 transition count 584
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1240 place count 297 transition count 570
Iterating global reduction 8 with 2 rules applied. Total rules applied 1242 place count 297 transition count 570
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 8 with 1 rules applied. Total rules applied 1243 place count 297 transition count 569
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1244 place count 296 transition count 569
Performed 139 Post agglomeration using F-continuation condition with reduction of 81 identical transitions.
Deduced a syphon composed of 139 places in 0 ms
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 10 with 278 rules applied. Total rules applied 1522 place count 157 transition count 349
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 10 with 12 rules applied. Total rules applied 1534 place count 157 transition count 337
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 1536 place count 156 transition count 336
Discarding 4 places :
Symmetric choice reduction at 12 with 4 rule applications. Total rules 1540 place count 152 transition count 331
Iterating global reduction 12 with 4 rules applied. Total rules applied 1544 place count 152 transition count 331
Performed 11 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 12 with 22 rules applied. Total rules applied 1566 place count 141 transition count 317
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 12 with 10 rules applied. Total rules applied 1576 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 13 with 34 rules applied. Total rules applied 1610 place count 124 transition count 341
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 13 with 17 rules applied. Total rules applied 1627 place count 124 transition count 324
Discarding 9 places :
Symmetric choice reduction at 14 with 9 rule applications. Total rules 1636 place count 115 transition count 306
Iterating global reduction 14 with 9 rules applied. Total rules applied 1645 place count 115 transition count 306
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 1651 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 15 with 36 rules applied. Total rules applied 1687 place count 115 transition count 264
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 1688 place count 114 transition count 263
Applied a total of 1688 rules in 87 ms. Remains 114 /1548 variables (removed 1434) and now considering 263/1979 (removed 1716) transitions.
[2024-05-21 06:13:34] [INFO ] Flow matrix only has 206 transitions (discarded 57 similar events)
// Phase 1: matrix 206 rows 114 cols
[2024-05-21 06:13:34] [INFO ] Computed 0 invariants in 0 ms
[2024-05-21 06:13:34] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-21 06:13:34] [INFO ] Flow matrix only has 206 transitions (discarded 57 similar events)
[2024-05-21 06:13:34] [INFO ] Invariant cache hit.
[2024-05-21 06:13:34] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 06:13:34] [INFO ] Implicit Places using invariants and state equation in 111 ms returned [8, 41]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 214 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 112/1548 places, 263/1979 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 110 transition count 261
Applied a total of 2 rules in 5 ms. Remains 110 /112 variables (removed 2) and now considering 261/263 (removed 2) transitions.
[2024-05-21 06:13:34] [INFO ] Flow matrix only has 204 transitions (discarded 57 similar events)
// Phase 1: matrix 204 rows 110 cols
[2024-05-21 06:13:34] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 06:13:34] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-21 06:13:34] [INFO ] Flow matrix only has 204 transitions (discarded 57 similar events)
[2024-05-21 06:13:34] [INFO ] Invariant cache hit.
[2024-05-21 06:13:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 06:13:34] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 110/1548 places, 261/1979 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 458 ms. Remains : 110/1548 places, 261/1979 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-316-LTLFireability-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-316-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-316-LTLFireability-04 finished in 503 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||F((p1||X(p2))))))'
Support contains 3 out of 1548 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1548/1548 places, 1979/1979 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1535 transition count 1966
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1535 transition count 1966
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 1535 transition count 1965
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 33 place count 1529 transition count 1959
Iterating global reduction 1 with 6 rules applied. Total rules applied 39 place count 1529 transition count 1959
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 44 place count 1524 transition count 1952
Iterating global reduction 1 with 5 rules applied. Total rules applied 49 place count 1524 transition count 1952
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 52 place count 1521 transition count 1948
Iterating global reduction 1 with 3 rules applied. Total rules applied 55 place count 1521 transition count 1948
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 58 place count 1518 transition count 1944
Iterating global reduction 1 with 3 rules applied. Total rules applied 61 place count 1518 transition count 1944
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 64 place count 1515 transition count 1941
Iterating global reduction 1 with 3 rules applied. Total rules applied 67 place count 1515 transition count 1941
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 69 place count 1513 transition count 1939
Iterating global reduction 1 with 2 rules applied. Total rules applied 71 place count 1513 transition count 1939
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 73 place count 1511 transition count 1936
Iterating global reduction 1 with 2 rules applied. Total rules applied 75 place count 1511 transition count 1936
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 76 place count 1510 transition count 1934
Iterating global reduction 1 with 1 rules applied. Total rules applied 77 place count 1510 transition count 1934
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 78 place count 1509 transition count 1932
Iterating global reduction 1 with 1 rules applied. Total rules applied 79 place count 1509 transition count 1932
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 80 place count 1508 transition count 1931
Iterating global reduction 1 with 1 rules applied. Total rules applied 81 place count 1508 transition count 1931
Applied a total of 81 rules in 553 ms. Remains 1508 /1548 variables (removed 40) and now considering 1931/1979 (removed 48) transitions.
// Phase 1: matrix 1931 rows 1508 cols
[2024-05-21 06:13:35] [INFO ] Computed 4 invariants in 13 ms
[2024-05-21 06:13:35] [INFO ] Implicit Places using invariants in 277 ms returned []
[2024-05-21 06:13:35] [INFO ] Invariant cache hit.
[2024-05-21 06:13:36] [INFO ] Implicit Places using invariants and state equation in 903 ms returned []
Implicit Place search using SMT with State Equation took 1180 ms to find 0 implicit places.
Running 1930 sub problems to find dead transitions.
[2024-05-21 06:13:36] [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/1507 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1930 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1507/3439 variables, and 4 constraints, problems are : Problem set: 0 solved, 1930 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 1930/1930 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1930 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1507 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1930 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1507/3439 variables, and 4 constraints, problems are : Problem set: 0 solved, 1930 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 0/1930 constraints, Known Traps: 0/0 constraints]
After SMT, in 60514ms problems are : Problem set: 0 solved, 1930 unsolved
Search for dead transitions found 0 dead transitions in 60531ms
Starting structural reductions in LTL mode, iteration 1 : 1508/1548 places, 1931/1979 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62271 ms. Remains : 1508/1548 places, 1931/1979 transitions.
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CloudReconfiguration-PT-316-LTLFireability-06
Stuttering criterion allowed to conclude after 113 steps with 0 reset in 2 ms.
FORMULA CloudReconfiguration-PT-316-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-316-LTLFireability-06 finished in 62421 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((G(p0)||(p0&&F(p1))))))'
Support contains 2 out of 1548 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1548/1548 places, 1979/1979 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1535 transition count 1966
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1535 transition count 1966
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 1535 transition count 1964
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 32 place count 1531 transition count 1960
Iterating global reduction 1 with 4 rules applied. Total rules applied 36 place count 1531 transition count 1960
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 1528 transition count 1956
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 1528 transition count 1956
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 44 place count 1526 transition count 1954
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 1526 transition count 1954
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 48 place count 1524 transition count 1952
Iterating global reduction 1 with 2 rules applied. Total rules applied 50 place count 1524 transition count 1952
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 52 place count 1522 transition count 1950
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 1522 transition count 1950
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 56 place count 1520 transition count 1948
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 1520 transition count 1948
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 60 place count 1518 transition count 1945
Iterating global reduction 1 with 2 rules applied. Total rules applied 62 place count 1518 transition count 1945
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 63 place count 1517 transition count 1943
Iterating global reduction 1 with 1 rules applied. Total rules applied 64 place count 1517 transition count 1943
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 65 place count 1516 transition count 1941
Iterating global reduction 1 with 1 rules applied. Total rules applied 66 place count 1516 transition count 1941
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 67 place count 1515 transition count 1940
Iterating global reduction 1 with 1 rules applied. Total rules applied 68 place count 1515 transition count 1940
Applied a total of 68 rules in 547 ms. Remains 1515 /1548 variables (removed 33) and now considering 1940/1979 (removed 39) transitions.
// Phase 1: matrix 1940 rows 1515 cols
[2024-05-21 06:14:37] [INFO ] Computed 4 invariants in 22 ms
[2024-05-21 06:14:37] [INFO ] Implicit Places using invariants in 236 ms returned []
[2024-05-21 06:14:37] [INFO ] Invariant cache hit.
[2024-05-21 06:14:38] [INFO ] Implicit Places using invariants and state equation in 892 ms returned []
Implicit Place search using SMT with State Equation took 1129 ms to find 0 implicit places.
Running 1939 sub problems to find dead transitions.
[2024-05-21 06:14:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1514 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1939 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1514/3455 variables, and 4 constraints, problems are : Problem set: 0 solved, 1939 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1515 constraints, PredecessorRefiner: 1939/1939 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1939 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1514 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1939 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 1514/3455 variables, and 4 constraints, problems are : Problem set: 0 solved, 1939 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1515 constraints, PredecessorRefiner: 0/1939 constraints, Known Traps: 0/0 constraints]
After SMT, in 60500ms problems are : Problem set: 0 solved, 1939 unsolved
Search for dead transitions found 0 dead transitions in 60518ms
Starting structural reductions in LTL mode, iteration 1 : 1515/1548 places, 1940/1979 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62199 ms. Remains : 1515/1548 places, 1940/1979 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-316-LTLFireability-07
Product exploration explored 100000 steps with 768 reset in 217 ms.
Product exploration explored 100000 steps with 776 reset in 184 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2119 edges and 1515 vertex of which 1506 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.11 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 94 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (305 resets) in 235 ms. (169 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (93 resets) in 125 ms. (317 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (81 resets) in 101 ms. (392 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (95 resets) in 79 ms. (500 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (95 resets) in 87 ms. (454 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 290096 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :0 out of 4
Probabilistic random walk after 290096 steps, saw 80157 distinct states, run finished after 3004 ms. (steps per millisecond=96 ) properties seen :0
[2024-05-21 06:15:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 825/827 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/827 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 677/1504 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1504 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1930/3434 variables, 1504/1508 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3434 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2/3436 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3436 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/3438 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3438 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 2/3440 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3440 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 2/3442 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3442 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 2/3444 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3444 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 2/3446 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3446 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 2/3448 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3448 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 2/3450 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3450 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 2/3452 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3452 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 2/3454 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3454 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 1/3455 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3455 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 0/3455 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3455/3455 variables, and 1519 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4072 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1515/1515 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 825/827 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/827 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 677/1504 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1504 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1930/3434 variables, 1504/1508 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3434 variables, 4/1512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3434 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 2/3436 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3436 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/3438 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3438 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 2/3440 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3440 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 2/3442 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3442 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 2/3444 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3444 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 2/3446 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3446 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 2/3448 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3448 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 2/3450 variables, 1/1520 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3450 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 2/3452 variables, 1/1521 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3452 variables, 0/1521 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 2/3454 variables, 1/1522 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3454 variables, 0/1522 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (OVERLAPS) 1/3455 variables, 1/1523 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3455 variables, 0/1523 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (OVERLAPS) 0/3455 variables, 0/1523 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3455/3455 variables, and 1523 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3249 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1515/1515 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 7332ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 3853 steps, including 46 resets, run visited all 4 properties in 52 ms. (steps per millisecond=74 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 62 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p1 p0))), (F (NOT p0)), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 8 factoid took 204 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 1515 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1515/1515 places, 1940/1940 transitions.
Applied a total of 0 rules in 48 ms. Remains 1515 /1515 variables (removed 0) and now considering 1940/1940 (removed 0) transitions.
[2024-05-21 06:15:51] [INFO ] Invariant cache hit.
[2024-05-21 06:15:51] [INFO ] Implicit Places using invariants in 207 ms returned []
[2024-05-21 06:15:51] [INFO ] Invariant cache hit.
[2024-05-21 06:15:52] [INFO ] Implicit Places using invariants and state equation in 870 ms returned []
Implicit Place search using SMT with State Equation took 1080 ms to find 0 implicit places.
Running 1939 sub problems to find dead transitions.
[2024-05-21 06:15:52] [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/1514 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1939 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1514/3455 variables, and 4 constraints, problems are : Problem set: 0 solved, 1939 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1515 constraints, PredecessorRefiner: 1939/1939 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1939 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1514 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1939 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 1514/3455 variables, and 4 constraints, problems are : Problem set: 0 solved, 1939 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1515 constraints, PredecessorRefiner: 0/1939 constraints, Known Traps: 0/0 constraints]
After SMT, in 60536ms problems are : Problem set: 0 solved, 1939 unsolved
Search for dead transitions found 0 dead transitions in 60552ms
Finished structural reductions in LTL mode , in 1 iterations and 61684 ms. Remains : 1515/1515 places, 1940/1940 transitions.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2119 edges and 1515 vertex of which 1506 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 99 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (314 resets) in 194 ms. (205 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (94 resets) in 50 ms. (784 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (91 resets) in 49 ms. (800 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (98 resets) in 45 ms. (869 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (90 resets) in 51 ms. (769 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 228346 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :0 out of 4
Probabilistic random walk after 228346 steps, saw 64244 distinct states, run finished after 3001 ms. (steps per millisecond=76 ) properties seen :0
[2024-05-21 06:16:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 825/827 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/827 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 677/1504 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1504 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1930/3434 variables, 1504/1508 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3434 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2/3436 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3436 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/3438 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3438 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 2/3440 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3440 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 2/3442 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3442 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 2/3444 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3444 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 2/3446 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3446 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 2/3448 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3448 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 2/3450 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3450 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 2/3452 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3452 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 2/3454 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3454 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 1/3455 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3455 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 0/3455 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3455/3455 variables, and 1519 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4512 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1515/1515 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 825/827 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/827 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 677/1504 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1504 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1930/3434 variables, 1504/1508 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3434 variables, 4/1512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3434 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 2/3436 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3436 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/3438 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3438 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 2/3440 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3440 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 2/3442 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3442 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 2/3444 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3444 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 2/3446 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3446 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 2/3448 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3448 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 2/3450 variables, 1/1520 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3450 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 2/3452 variables, 1/1521 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3452 variables, 0/1521 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 2/3454 variables, 1/1522 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3454 variables, 0/1522 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (OVERLAPS) 1/3455 variables, 1/1523 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3455 variables, 0/1523 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (OVERLAPS) 0/3455 variables, 0/1523 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3455/3455 variables, and 1523 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3530 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1515/1515 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 8054ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 208 steps, including 1 resets, run visited all 4 properties in 8 ms. (steps per millisecond=26 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 9 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 175 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 773 reset in 148 ms.
Product exploration explored 100000 steps with 774 reset in 151 ms.
Applying partial POR strategy [false, true, false]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 1515 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1515/1515 places, 1940/1940 transitions.
Graph (trivial) has 1849 edges and 1515 vertex of which 693 / 1515 are part of one of the 63 SCC in 2 ms
Free SCC test removed 630 places
Ensure Unique test removed 732 transitions
Reduce isomorphic transitions removed 732 transitions.
Graph (complete) has 1381 edges and 885 vertex of which 876 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 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 876 transition count 1203
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 876 transition count 1191
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 490 place count 876 transition count 1203
Deduced a syphon composed of 496 places in 1 ms
Iterating global reduction 2 with 20 rules applied. Total rules applied 510 place count 876 transition count 1203
Discarding 280 places :
Symmetric choice reduction at 2 with 280 rule applications. Total rules 790 place count 596 transition count 914
Deduced a syphon composed of 231 places in 0 ms
Iterating global reduction 2 with 280 rules applied. Total rules applied 1070 place count 596 transition count 914
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1082 place count 584 transition count 898
Deduced a syphon composed of 229 places in 0 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 1094 place count 584 transition count 898
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1100 place count 584 transition count 892
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1112 place count 572 transition count 880
Deduced a syphon composed of 219 places in 0 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 1124 place count 572 transition count 880
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1126 place count 570 transition count 876
Deduced a syphon composed of 219 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1128 place count 570 transition count 876
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1130 place count 568 transition count 872
Deduced a syphon composed of 219 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1132 place count 568 transition count 872
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1136 place count 564 transition count 868
Deduced a syphon composed of 217 places in 1 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1140 place count 564 transition count 868
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1142 place count 562 transition count 864
Deduced a syphon composed of 217 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1144 place count 562 transition count 864
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1146 place count 560 transition count 860
Deduced a syphon composed of 217 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1148 place count 560 transition count 860
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1152 place count 556 transition count 854
Deduced a syphon composed of 215 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1156 place count 556 transition count 854
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1160 place count 552 transition count 838
Deduced a syphon composed of 213 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1164 place count 552 transition count 838
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 3 with 1 rules applied. Total rules applied 1165 place count 552 transition count 838
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1169 place count 548 transition count 834
Deduced a syphon composed of 212 places in 0 ms
Iterating global reduction 4 with 4 rules applied. Total rules applied 1173 place count 548 transition count 834
Performed 111 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 323 places in 0 ms
Iterating global reduction 4 with 111 rules applied. Total rules applied 1284 place count 548 transition count 915
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 4 with 42 rules applied. Total rules applied 1326 place count 548 transition count 873
Discarding 104 places :
Symmetric choice reduction at 5 with 104 rule applications. Total rules 1430 place count 444 transition count 757
Deduced a syphon composed of 229 places in 0 ms
Iterating global reduction 5 with 104 rules applied. Total rules applied 1534 place count 444 transition count 757
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1536 place count 444 transition count 755
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 1542 place count 438 transition count 747
Deduced a syphon composed of 223 places in 0 ms
Iterating global reduction 6 with 6 rules applied. Total rules applied 1548 place count 438 transition count 747
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 230 places in 0 ms
Iterating global reduction 6 with 7 rules applied. Total rules applied 1555 place count 438 transition count 747
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1561 place count 438 transition count 741
Discarding 16 places :
Symmetric choice reduction at 7 with 16 rule applications. Total rules 1577 place count 422 transition count 721
Deduced a syphon composed of 218 places in 1 ms
Iterating global reduction 7 with 16 rules applied. Total rules applied 1593 place count 422 transition count 721
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 1600 place count 422 transition count 714
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1604 place count 418 transition count 710
Deduced a syphon composed of 214 places in 1 ms
Iterating global reduction 8 with 4 rules applied. Total rules applied 1608 place count 418 transition count 710
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 216 places in 0 ms
Iterating global reduction 8 with 2 rules applied. Total rules applied 1610 place count 418 transition count 710
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 1614 place count 418 transition count 706
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1616 place count 416 transition count 704
Deduced a syphon composed of 214 places in 1 ms
Iterating global reduction 9 with 2 rules applied. Total rules applied 1618 place count 416 transition count 704
Performed 70 Post agglomeration using F-continuation condition with reduction of 115 identical transitions.
Deduced a syphon composed of 284 places in 0 ms
Iterating global reduction 9 with 70 rules applied. Total rules applied 1688 place count 416 transition count 1026
Ensure Unique test removed 115 transitions
Reduce isomorphic transitions removed 115 transitions.
Iterating post reduction 9 with 115 rules applied. Total rules applied 1803 place count 416 transition count 911
Discarding 125 places :
Symmetric choice reduction at 10 with 125 rule applications. Total rules 1928 place count 291 transition count 576
Deduced a syphon composed of 168 places in 0 ms
Iterating global reduction 10 with 125 rules applied. Total rules applied 2053 place count 291 transition count 576
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 10 with 15 rules applied. Total rules applied 2068 place count 291 transition count 561
Discarding 24 places :
Symmetric choice reduction at 11 with 24 rule applications. Total rules 2092 place count 267 transition count 514
Deduced a syphon composed of 144 places in 0 ms
Iterating global reduction 11 with 24 rules applied. Total rules applied 2116 place count 267 transition count 514
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -52
Deduced a syphon composed of 147 places in 0 ms
Iterating global reduction 11 with 3 rules applied. Total rules applied 2119 place count 267 transition count 566
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 2122 place count 264 transition count 537
Deduced a syphon composed of 144 places in 1 ms
Iterating global reduction 11 with 3 rules applied. Total rules applied 2125 place count 264 transition count 537
Deduced a syphon composed of 144 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 45 transitions
Redundant transition composition rules discarded 45 transitions
Iterating global reduction 11 with 45 rules applied. Total rules applied 2170 place count 264 transition count 492
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 2174 place count 260 transition count 488
Deduced a syphon composed of 140 places in 1 ms
Iterating global reduction 11 with 4 rules applied. Total rules applied 2178 place count 260 transition count 488
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 143 places in 0 ms
Iterating global reduction 11 with 3 rules applied. Total rules applied 2181 place count 260 transition count 548
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 2184 place count 257 transition count 533
Deduced a syphon composed of 140 places in 0 ms
Iterating global reduction 11 with 3 rules applied. Total rules applied 2187 place count 257 transition count 533
Deduced a syphon composed of 140 places in 0 ms
Applied a total of 2187 rules in 342 ms. Remains 257 /1515 variables (removed 1258) and now considering 533/1940 (removed 1407) transitions.
[2024-05-21 06:17:05] [INFO ] Redundant transitions in 43 ms returned []
Running 532 sub problems to find dead transitions.
[2024-05-21 06:17:05] [INFO ] Flow matrix only has 476 transitions (discarded 57 similar events)
// Phase 1: matrix 476 rows 257 cols
[2024-05-21 06:17:05] [INFO ] Computed 0 invariants in 2 ms
[2024-05-21 06:17:05] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 532 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 TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD133 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 TDEAD193 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD201 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 TDEAD224 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 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 TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 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 TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 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 TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
At refinement iteration 1 (OVERLAPS) 475/731 variables, 256/256 constraints. Problems are: Problem set: 265 solved, 267 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/731 variables, 2/258 constraints. Problems are: Problem set: 265 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/731 variables, 0/258 constraints. Problems are: Problem set: 265 solved, 267 unsolved
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/732 variables, 1/259 constraints. Problems are: Problem set: 270 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/732 variables, 0/259 constraints. Problems are: Problem set: 270 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 1/733 variables, 1/260 constraints. Problems are: Problem set: 270 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/733 variables, 0/260 constraints. Problems are: Problem set: 270 solved, 262 unsolved
At refinement iteration 8 (OVERLAPS) 0/733 variables, 0/260 constraints. Problems are: Problem set: 270 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 733/733 variables, and 260 constraints, problems are : Problem set: 270 solved, 262 unsolved in 20353 ms.
Refiners :[State Equation: 257/257 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 532/532 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 270 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 270 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 472/588 variables, 116/116 constraints. Problems are: Problem set: 270 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/588 variables, 2/118 constraints. Problems are: Problem set: 270 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/588 variables, 262/380 constraints. Problems are: Problem set: 270 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/588 variables, 0/380 constraints. Problems are: Problem set: 270 solved, 262 unsolved
At refinement iteration 5 (OVERLAPS) 144/732 variables, 141/521 constraints. Problems are: Problem set: 270 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/732 variables, 0/521 constraints. Problems are: Problem set: 270 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 1/733 variables, 1/522 constraints. Problems are: Problem set: 270 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/733 variables, 0/522 constraints. Problems are: Problem set: 270 solved, 262 unsolved
At refinement iteration 9 (OVERLAPS) 0/733 variables, 0/522 constraints. Problems are: Problem set: 270 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Int declared 733/733 variables, and 522 constraints, problems are : Problem set: 270 solved, 262 unsolved in 27761 ms.
Refiners :[State Equation: 257/257 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 262/532 constraints, Known Traps: 0/0 constraints]
After SMT, in 48408ms problems are : Problem set: 270 solved, 262 unsolved
Search for dead transitions found 270 dead transitions in 48414ms
Found 270 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 270 transitions
Dead transitions reduction (with SMT) removed 270 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 257/1515 places, 263/1940 transitions.
Graph (complete) has 410 edges and 257 vertex of which 117 are kept as prefixes of interest. Removing 140 places using SCC suffix rule.1 ms
Discarding 140 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 110 transition count 245
Applied a total of 8 rules in 13 ms. Remains 110 /257 variables (removed 147) and now considering 245/263 (removed 18) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 110/1515 places, 245/1940 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 48840 ms. Remains : 110/1515 places, 245/1940 transitions.
Support contains 2 out of 1515 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1515/1515 places, 1940/1940 transitions.
Applied a total of 0 rules in 38 ms. Remains 1515 /1515 variables (removed 0) and now considering 1940/1940 (removed 0) transitions.
// Phase 1: matrix 1940 rows 1515 cols
[2024-05-21 06:17:54] [INFO ] Computed 4 invariants in 14 ms
[2024-05-21 06:17:54] [INFO ] Implicit Places using invariants in 220 ms returned []
[2024-05-21 06:17:54] [INFO ] Invariant cache hit.
[2024-05-21 06:17:55] [INFO ] Implicit Places using invariants and state equation in 876 ms returned []
Implicit Place search using SMT with State Equation took 1110 ms to find 0 implicit places.
Running 1939 sub problems to find dead transitions.
[2024-05-21 06:17:55] [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 0.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 0.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 1.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1514 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1939 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1514/3455 variables, and 4 constraints, problems are : Problem set: 0 solved, 1939 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1515 constraints, PredecessorRefiner: 1939/1939 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1939 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1514 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1939 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 1514/3455 variables, and 4 constraints, problems are : Problem set: 0 solved, 1939 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1515 constraints, PredecessorRefiner: 0/1939 constraints, Known Traps: 0/0 constraints]
After SMT, in 60552ms problems are : Problem set: 0 solved, 1939 unsolved
Search for dead transitions found 0 dead transitions in 60569ms
Finished structural reductions in LTL mode , in 1 iterations and 61722 ms. Remains : 1515/1515 places, 1940/1940 transitions.
Treatment of property CloudReconfiguration-PT-316-LTLFireability-07 finished in 259089 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||X(F(p1))||G(p2))))'
Support contains 3 out of 1548 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1548/1548 places, 1979/1979 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1536 transition count 1967
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1536 transition count 1967
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 1536 transition count 1965
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 32 place count 1530 transition count 1959
Iterating global reduction 1 with 6 rules applied. Total rules applied 38 place count 1530 transition count 1959
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 43 place count 1525 transition count 1952
Iterating global reduction 1 with 5 rules applied. Total rules applied 48 place count 1525 transition count 1952
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 51 place count 1522 transition count 1948
Iterating global reduction 1 with 3 rules applied. Total rules applied 54 place count 1522 transition count 1948
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 1519 transition count 1944
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 1519 transition count 1944
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 63 place count 1516 transition count 1941
Iterating global reduction 1 with 3 rules applied. Total rules applied 66 place count 1516 transition count 1941
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 68 place count 1514 transition count 1939
Iterating global reduction 1 with 2 rules applied. Total rules applied 70 place count 1514 transition count 1939
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 72 place count 1512 transition count 1936
Iterating global reduction 1 with 2 rules applied. Total rules applied 74 place count 1512 transition count 1936
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 75 place count 1511 transition count 1934
Iterating global reduction 1 with 1 rules applied. Total rules applied 76 place count 1511 transition count 1934
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 77 place count 1510 transition count 1932
Iterating global reduction 1 with 1 rules applied. Total rules applied 78 place count 1510 transition count 1932
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 79 place count 1509 transition count 1931
Iterating global reduction 1 with 1 rules applied. Total rules applied 80 place count 1509 transition count 1931
Applied a total of 80 rules in 519 ms. Remains 1509 /1548 variables (removed 39) and now considering 1931/1979 (removed 48) transitions.
// Phase 1: matrix 1931 rows 1509 cols
[2024-05-21 06:18:56] [INFO ] Computed 4 invariants in 12 ms
[2024-05-21 06:18:56] [INFO ] Implicit Places using invariants in 206 ms returned []
[2024-05-21 06:18:56] [INFO ] Invariant cache hit.
[2024-05-21 06:18:57] [INFO ] Implicit Places using invariants and state equation in 878 ms returned []
Implicit Place search using SMT with State Equation took 1085 ms to find 0 implicit places.
Running 1930 sub problems to find dead transitions.
[2024-05-21 06:18:57] [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/1508 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1930 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1508/3440 variables, and 4 constraints, problems are : Problem set: 0 solved, 1930 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1509 constraints, PredecessorRefiner: 1930/1930 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1930 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1508 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1930 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1508/3440 variables, and 4 constraints, problems are : Problem set: 0 solved, 1930 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1509 constraints, PredecessorRefiner: 0/1930 constraints, Known Traps: 0/0 constraints]
After SMT, in 60485ms problems are : Problem set: 0 solved, 1930 unsolved
Search for dead transitions found 0 dead transitions in 60508ms
Starting structural reductions in LTL mode, iteration 1 : 1509/1548 places, 1931/1979 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62117 ms. Remains : 1509/1548 places, 1931/1979 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CloudReconfiguration-PT-316-LTLFireability-08
Product exploration explored 100000 steps with 33333 reset in 288 ms.
Product exploration explored 100000 steps with 33333 reset in 296 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2108 edges and 1509 vertex of which 1500 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p2), (X p2), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 15 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudReconfiguration-PT-316-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-316-LTLFireability-08 finished in 62899 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||G(F(p1))||(F(p1)&&X(G(p2)))))))'
Support contains 2 out of 1548 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1548/1548 places, 1979/1979 transitions.
Graph (trivial) has 1882 edges and 1548 vertex of which 694 / 1548 are part of one of the 63 SCC in 2 ms
Free SCC test removed 631 places
Ensure Unique test removed 733 transitions
Reduce isomorphic transitions removed 733 transitions.
Graph (complete) has 1423 edges and 917 vertex of which 908 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 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 907 transition count 744
Reduce places removed 496 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 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 520 rules applied. Total rules applied 1018 place count 411 transition count 720
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 1030 place count 400 transition count 719
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1031 place count 399 transition count 719
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 45 Pre rules applied. Total rules applied 1031 place count 399 transition count 674
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 1121 place count 354 transition count 674
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 1139 place count 336 transition count 648
Iterating global reduction 4 with 18 rules applied. Total rules applied 1157 place count 336 transition count 648
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 3 rules applied. Total rules applied 1160 place count 336 transition count 645
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1162 place count 334 transition count 645
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 1175 place count 321 transition count 627
Iterating global reduction 6 with 13 rules applied. Total rules applied 1188 place count 321 transition count 627
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1194 place count 321 transition count 621
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 1199 place count 316 transition count 611
Iterating global reduction 7 with 5 rules applied. Total rules applied 1204 place count 316 transition count 611
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1208 place count 312 transition count 603
Iterating global reduction 7 with 4 rules applied. Total rules applied 1212 place count 312 transition count 603
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 7 with 2 rules applied. Total rules applied 1214 place count 312 transition count 601
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1216 place count 310 transition count 601
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1218 place count 308 transition count 597
Iterating global reduction 9 with 2 rules applied. Total rules applied 1220 place count 308 transition count 597
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1222 place count 306 transition count 593
Iterating global reduction 9 with 2 rules applied. Total rules applied 1224 place count 306 transition count 593
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1226 place count 304 transition count 589
Iterating global reduction 9 with 2 rules applied. Total rules applied 1228 place count 304 transition count 589
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1230 place count 302 transition count 575
Iterating global reduction 9 with 2 rules applied. Total rules applied 1232 place count 302 transition count 575
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 1 rules applied. Total rules applied 1233 place count 302 transition count 574
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1234 place count 301 transition count 574
Performed 140 Post agglomeration using F-continuation condition with reduction of 75 identical transitions.
Deduced a syphon composed of 140 places in 0 ms
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 11 with 280 rules applied. Total rules applied 1514 place count 161 transition count 359
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 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 11 with 16 rules applied. Total rules applied 1530 place count 161 transition count 343
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 1532 place count 160 transition count 342
Discarding 4 places :
Symmetric choice reduction at 13 with 4 rule applications. Total rules 1536 place count 156 transition count 337
Iterating global reduction 13 with 4 rules applied. Total rules applied 1540 place count 156 transition count 337
Performed 11 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 13 with 22 rules applied. Total rules applied 1562 place count 145 transition count 323
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 13 with 11 rules applied. Total rules applied 1573 place count 145 transition count 312
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 14 with 34 rules applied. Total rules applied 1607 place count 128 transition count 338
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 14 with 16 rules applied. Total rules applied 1623 place count 128 transition count 322
Discarding 9 places :
Symmetric choice reduction at 15 with 9 rule applications. Total rules 1632 place count 119 transition count 304
Iterating global reduction 15 with 9 rules applied. Total rules applied 1641 place count 119 transition count 304
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 15 with 5 rules applied. Total rules applied 1646 place count 119 transition count 299
Drop transitions (Redundant composition of simpler transitions.) removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 16 with 34 rules applied. Total rules applied 1680 place count 119 transition count 265
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 16 with 3 rules applied. Total rules applied 1683 place count 119 transition count 265
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 1684 place count 119 transition count 264
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 1685 place count 118 transition count 263
Applied a total of 1685 rules in 82 ms. Remains 118 /1548 variables (removed 1430) and now considering 263/1979 (removed 1716) transitions.
[2024-05-21 06:19:59] [INFO ] Flow matrix only has 206 transitions (discarded 57 similar events)
// Phase 1: matrix 206 rows 118 cols
[2024-05-21 06:19:59] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 06:19:59] [INFO ] Implicit Places using invariants in 288 ms returned []
[2024-05-21 06:19:59] [INFO ] Flow matrix only has 206 transitions (discarded 57 similar events)
[2024-05-21 06:19:59] [INFO ] Invariant cache hit.
[2024-05-21 06:19:59] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 06:19:59] [INFO ] Implicit Places using invariants and state equation in 106 ms returned [8, 43]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 409 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 116/1548 places, 263/1979 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 114 transition count 261
Applied a total of 2 rules in 3 ms. Remains 114 /116 variables (removed 2) and now considering 261/263 (removed 2) transitions.
[2024-05-21 06:19:59] [INFO ] Flow matrix only has 204 transitions (discarded 57 similar events)
// Phase 1: matrix 204 rows 114 cols
[2024-05-21 06:19:59] [INFO ] Computed 0 invariants in 13 ms
[2024-05-21 06:19:59] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-21 06:19:59] [INFO ] Flow matrix only has 204 transitions (discarded 57 similar events)
[2024-05-21 06:19:59] [INFO ] Invariant cache hit.
[2024-05-21 06:19:59] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 06:19:59] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 114/1548 places, 261/1979 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 648 ms. Remains : 114/1548 places, 261/1979 transitions.
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CloudReconfiguration-PT-316-LTLFireability-10
Stuttering criterion allowed to conclude after 2778 steps with 260 reset in 19 ms.
FORMULA CloudReconfiguration-PT-316-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-316-LTLFireability-10 finished in 750 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)||F(G(p1))))'
Support contains 2 out of 1548 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1548/1548 places, 1979/1979 transitions.
Graph (trivial) has 1884 edges and 1548 vertex of which 694 / 1548 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 1423 edges and 917 vertex of which 908 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 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 741
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 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 522 rules applied. Total rules applied 1023 place count 408 transition count 718
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 1034 place count 397 transition count 718
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 1034 place count 397 transition count 673
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 1124 place count 352 transition count 673
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 1143 place count 333 transition count 646
Iterating global reduction 3 with 19 rules applied. Total rules applied 1162 place count 333 transition count 646
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 3 rules applied. Total rules applied 1165 place count 333 transition count 643
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1167 place count 331 transition count 643
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1167 place count 331 transition count 642
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1169 place count 330 transition count 642
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 1182 place count 317 transition count 624
Iterating global reduction 5 with 13 rules applied. Total rules applied 1195 place count 317 transition count 624
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1201 place count 317 transition count 618
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 1206 place count 312 transition count 608
Iterating global reduction 6 with 5 rules applied. Total rules applied 1211 place count 312 transition count 608
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1215 place count 308 transition count 600
Iterating global reduction 6 with 4 rules applied. Total rules applied 1219 place count 308 transition count 600
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 2 rules applied. Total rules applied 1221 place count 308 transition count 598
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1223 place count 306 transition count 598
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1225 place count 304 transition count 594
Iterating global reduction 8 with 2 rules applied. Total rules applied 1227 place count 304 transition count 594
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1229 place count 302 transition count 590
Iterating global reduction 8 with 2 rules applied. Total rules applied 1231 place count 302 transition count 590
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1233 place count 300 transition count 586
Iterating global reduction 8 with 2 rules applied. Total rules applied 1235 place count 300 transition count 586
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1237 place count 298 transition count 572
Iterating global reduction 8 with 2 rules applied. Total rules applied 1239 place count 298 transition count 572
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 8 with 1 rules applied. Total rules applied 1240 place count 298 transition count 571
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1241 place count 297 transition count 571
Performed 139 Post agglomeration using F-continuation condition with reduction of 84 identical transitions.
Deduced a syphon composed of 139 places in 0 ms
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 10 with 278 rules applied. Total rules applied 1519 place count 158 transition count 348
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 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 10 with 11 rules applied. Total rules applied 1530 place count 158 transition count 337
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 1532 place count 157 transition count 336
Discarding 4 places :
Symmetric choice reduction at 12 with 4 rule applications. Total rules 1536 place count 153 transition count 331
Iterating global reduction 12 with 4 rules applied. Total rules applied 1540 place count 153 transition count 331
Performed 11 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 12 with 22 rules applied. Total rules applied 1562 place count 142 transition count 317
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 12 with 10 rules applied. Total rules applied 1572 place count 142 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 13 with 34 rules applied. Total rules applied 1606 place count 125 transition count 341
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 13 with 16 rules applied. Total rules applied 1622 place count 125 transition count 325
Discarding 8 places :
Symmetric choice reduction at 14 with 8 rule applications. Total rules 1630 place count 117 transition count 309
Iterating global reduction 14 with 8 rules applied. Total rules applied 1638 place count 117 transition count 309
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 14 with 5 rules applied. Total rules applied 1643 place count 117 transition count 304
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 15 with 36 rules applied. Total rules applied 1679 place count 117 transition count 268
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 1680 place count 116 transition count 267
Applied a total of 1680 rules in 74 ms. Remains 116 /1548 variables (removed 1432) and now considering 267/1979 (removed 1712) transitions.
[2024-05-21 06:19:59] [INFO ] Flow matrix only has 210 transitions (discarded 57 similar events)
// Phase 1: matrix 210 rows 116 cols
[2024-05-21 06:19:59] [INFO ] Computed 0 invariants in 2 ms
[2024-05-21 06:19:59] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-21 06:19:59] [INFO ] Flow matrix only has 210 transitions (discarded 57 similar events)
[2024-05-21 06:19:59] [INFO ] Invariant cache hit.
[2024-05-21 06:19:59] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 06:19:59] [INFO ] Implicit Places using invariants and state equation in 104 ms returned [8, 41]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 200 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 114/1548 places, 267/1979 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 112 transition count 265
Applied a total of 2 rules in 3 ms. Remains 112 /114 variables (removed 2) and now considering 265/267 (removed 2) transitions.
[2024-05-21 06:20:00] [INFO ] Flow matrix only has 208 transitions (discarded 57 similar events)
// Phase 1: matrix 208 rows 112 cols
[2024-05-21 06:20:00] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 06:20:00] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-21 06:20:00] [INFO ] Flow matrix only has 208 transitions (discarded 57 similar events)
[2024-05-21 06:20:00] [INFO ] Invariant cache hit.
[2024-05-21 06:20:00] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 06:20:00] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 112/1548 places, 265/1979 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 501 ms. Remains : 112/1548 places, 265/1979 transitions.
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CloudReconfiguration-PT-316-LTLFireability-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-316-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-316-LTLFireability-11 finished in 583 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(F(((X(p0)&&F(p1))||G(p0))))||(p2&&X(F(((X(p0)&&F(p1))||G(p0))))))))'
Support contains 3 out of 1548 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1548/1548 places, 1979/1979 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1533 transition count 1964
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1533 transition count 1964
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 1533 transition count 1962
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 38 place count 1527 transition count 1956
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 1527 transition count 1956
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 49 place count 1522 transition count 1949
Iterating global reduction 1 with 5 rules applied. Total rules applied 54 place count 1522 transition count 1949
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 1519 transition count 1945
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 1519 transition count 1945
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 63 place count 1516 transition count 1941
Iterating global reduction 1 with 3 rules applied. Total rules applied 66 place count 1516 transition count 1941
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 69 place count 1513 transition count 1938
Iterating global reduction 1 with 3 rules applied. Total rules applied 72 place count 1513 transition count 1938
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 74 place count 1511 transition count 1936
Iterating global reduction 1 with 2 rules applied. Total rules applied 76 place count 1511 transition count 1936
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 78 place count 1509 transition count 1933
Iterating global reduction 1 with 2 rules applied. Total rules applied 80 place count 1509 transition count 1933
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 81 place count 1508 transition count 1931
Iterating global reduction 1 with 1 rules applied. Total rules applied 82 place count 1508 transition count 1931
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 1507 transition count 1929
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 1507 transition count 1929
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 85 place count 1506 transition count 1928
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 1506 transition count 1928
Applied a total of 86 rules in 512 ms. Remains 1506 /1548 variables (removed 42) and now considering 1928/1979 (removed 51) transitions.
// Phase 1: matrix 1928 rows 1506 cols
[2024-05-21 06:20:00] [INFO ] Computed 4 invariants in 18 ms
[2024-05-21 06:20:01] [INFO ] Implicit Places using invariants in 219 ms returned []
[2024-05-21 06:20:01] [INFO ] Invariant cache hit.
[2024-05-21 06:20:01] [INFO ] Implicit Places using invariants and state equation in 853 ms returned []
Implicit Place search using SMT with State Equation took 1086 ms to find 0 implicit places.
Running 1927 sub problems to find dead transitions.
[2024-05-21 06:20:01] [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/1505 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1505/3434 variables, and 4 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1506 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/1505 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1927 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 1505/3434 variables, and 4 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 0/1927 constraints, Known Traps: 0/0 constraints]
After SMT, in 60488ms problems are : Problem set: 0 solved, 1927 unsolved
Search for dead transitions found 0 dead transitions in 60505ms
Starting structural reductions in LTL mode, iteration 1 : 1506/1548 places, 1928/1979 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62110 ms. Remains : 1506/1548 places, 1928/1979 transitions.
Stuttering acceptance computed with spot in 246 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-316-LTLFireability-13
Product exploration explored 100000 steps with 782 reset in 172 ms.
Product exploration explored 100000 steps with 774 reset in 183 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2105 edges and 1506 vertex of which 1497 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 117 ms. Reduced automaton from 6 states, 17 edges and 3 AP (stutter sensitive) to 6 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (310 resets) in 343 ms. (116 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (91 resets) in 124 ms. (320 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (99 resets) in 120 ms. (330 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (98 resets) in 106 ms. (373 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (95 resets) in 125 ms. (317 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (86 resets) in 193 ms. (206 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (101 resets) in 198 ms. (201 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (91 resets) in 106 ms. (373 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (95 resets) in 122 ms. (325 steps per ms) remains 3/8 properties
[2024-05-21 06:21:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 287/290 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/290 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1205/1495 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1495 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1918/3413 variables, 1495/1499 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/3413 variables, 0/1499 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/3415 variables, 1/1500 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3415 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 2/3417 variables, 1/1501 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3417 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/3419 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3419 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 2/3421 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3421 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 2/3423 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3423 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 2/3425 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3425 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 2/3427 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3427 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 2/3429 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3429 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 2/3431 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3431 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 2/3433 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3433 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf1 is UNSAT
Problem apf2 is UNSAT
Problem apf3 is UNSAT
After SMT solving in domain Real declared 3434/3434 variables, and 1510 constraints, problems are : Problem set: 3 solved, 0 unsolved in 2229 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1506/1506 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 2235ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1)), (G (OR p0 p1)), (G (OR p2 p0 p1)), (G (OR (NOT p2) p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT p0)), (F (NOT (OR p2 (NOT p0) p1))), (F p2), (F (NOT p1))]
Knowledge based reduction with 20 factoid took 404 ms. Reduced automaton from 6 states, 17 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1506 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1506/1506 places, 1928/1928 transitions.
Applied a total of 0 rules in 43 ms. Remains 1506 /1506 variables (removed 0) and now considering 1928/1928 (removed 0) transitions.
[2024-05-21 06:21:07] [INFO ] Invariant cache hit.
[2024-05-21 06:21:07] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-05-21 06:21:07] [INFO ] Invariant cache hit.
[2024-05-21 06:21:08] [INFO ] Implicit Places using invariants and state equation in 843 ms returned []
Implicit Place search using SMT with State Equation took 1046 ms to find 0 implicit places.
Running 1927 sub problems to find dead transitions.
[2024-05-21 06:21:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1505/3434 variables, and 4 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30040 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1506 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/1505 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1505/3434 variables, and 4 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 0/1927 constraints, Known Traps: 0/0 constraints]
After SMT, in 60496ms problems are : Problem set: 0 solved, 1927 unsolved
Search for dead transitions found 0 dead transitions in 60513ms
Finished structural reductions in LTL mode , in 1 iterations and 61606 ms. Remains : 1506/1506 places, 1928/1928 transitions.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2105 edges and 1506 vertex of which 1497 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.7 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND (NOT p2) p0), (X (NOT p2)), (X p0), (X (X (NOT p2))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 85 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (317 resets) in 437 ms. (91 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (85 resets) in 175 ms. (227 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (99 resets) in 80 ms. (493 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 309491 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :0 out of 2
Probabilistic random walk after 309491 steps, saw 83296 distinct states, run finished after 3001 ms. (steps per millisecond=103 ) properties seen :0
[2024-05-21 06:22:12] [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) 288/290 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/290 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1205/1495 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1495 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1918/3413 variables, 1495/1499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3413 variables, 0/1499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/3415 variables, 1/1500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3415 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/3417 variables, 1/1501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3417 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/3419 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3419 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/3421 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3421 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/3423 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3423 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/3425 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3425 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/3427 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3427 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 2/3429 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3429 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 2/3431 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3431 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 2/3433 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3433 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 1/3434 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3434 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/3434 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3434/3434 variables, and 1510 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2534 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1506/1506 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) 288/290 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/290 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1205/1495 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1495 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1918/3413 variables, 1495/1499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3413 variables, 2/1501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3413 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/3415 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3415 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/3417 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3417 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/3419 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3419 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/3421 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3421 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/3423 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3423 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/3425 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3425 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/3427 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3427 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 2/3429 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3429 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 2/3431 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3431 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 2/3433 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3433 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 1/3434 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3434 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 0/3434 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3434/3434 variables, and 1512 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1946 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1506/1506 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 4488ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 507 ms.
Support contains 2 out of 1506 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1506/1506 places, 1928/1928 transitions.
Graph (trivial) has 1835 edges and 1506 vertex of which 665 / 1506 are part of one of the 61 SCC in 13 ms
Free SCC test removed 604 places
Drop transitions (Empty/Sink Transition effects.) removed 760 transitions
Reduce isomorphic transitions removed 760 transitions.
Graph (complete) has 1340 edges and 902 vertex of which 893 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 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 497 transitions
Trivial Post-agglo rules discarded 497 transitions
Performed 497 trivial Post agglomeration. Transition count delta: 497
Iterating post reduction 0 with 504 rules applied. Total rules applied 506 place count 893 transition count 660
Reduce places removed 497 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 1 with 555 rules applied. Total rules applied 1061 place count 396 transition count 602
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 41 rules applied. Total rules applied 1102 place count 359 transition count 598
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 6 rules applied. Total rules applied 1108 place count 357 transition count 594
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 5 rules applied. Total rules applied 1113 place count 355 transition count 591
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 4 rules applied. Total rules applied 1117 place count 353 transition count 589
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 4 rules applied. Total rules applied 1121 place count 351 transition count 587
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1122 place count 350 transition count 587
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 53 Pre rules applied. Total rules applied 1122 place count 350 transition count 534
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 8 with 106 rules applied. Total rules applied 1228 place count 297 transition count 534
Discarding 11 places :
Symmetric choice reduction at 8 with 11 rule applications. Total rules 1239 place count 286 transition count 518
Iterating global reduction 8 with 11 rules applied. Total rules applied 1250 place count 286 transition count 518
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 8 with 3 rules applied. Total rules applied 1253 place count 286 transition count 515
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 1256 place count 283 transition count 515
Discarding 7 places :
Symmetric choice reduction at 10 with 7 rule applications. Total rules 1263 place count 276 transition count 507
Iterating global reduction 10 with 7 rules applied. Total rules applied 1270 place count 276 transition count 507
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 1276 place count 276 transition count 501
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1277 place count 275 transition count 495
Iterating global reduction 11 with 1 rules applied. Total rules applied 1278 place count 275 transition count 495
Performed 144 Post agglomeration using F-continuation condition with reduction of 96 identical transitions.
Deduced a syphon composed of 144 places in 0 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 11 with 288 rules applied. Total rules applied 1566 place count 131 transition count 255
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 11 with 14 rules applied. Total rules applied 1580 place count 131 transition count 241
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 1583 place count 128 transition count 238
Iterating global reduction 12 with 3 rules applied. Total rules applied 1586 place count 128 transition count 238
Performed 13 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 12 with 26 rules applied. Total rules applied 1612 place count 115 transition count 222
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 12 with 15 rules applied. Total rules applied 1627 place count 115 transition count 207
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 13 with 2 rules applied. Total rules applied 1629 place count 114 transition count 206
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 1631 place count 114 transition count 204
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 14 with 2 rules applied. Total rules applied 1633 place count 113 transition count 203
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 1635 place count 113 transition count 201
Performed 35 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 15 with 70 rules applied. Total rules applied 1705 place count 78 transition count 233
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 15 with 50 rules applied. Total rules applied 1755 place count 78 transition count 183
Discarding 23 places :
Symmetric choice reduction at 16 with 23 rule applications. Total rules 1778 place count 55 transition count 153
Iterating global reduction 16 with 23 rules applied. Total rules applied 1801 place count 55 transition count 153
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 16 with 14 rules applied. Total rules applied 1815 place count 55 transition count 139
Discarding 6 places :
Symmetric choice reduction at 17 with 6 rule applications. Total rules 1821 place count 49 transition count 127
Iterating global reduction 17 with 6 rules applied. Total rules applied 1827 place count 49 transition count 127
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 17 with 6 rules applied. Total rules applied 1833 place count 49 transition count 121
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 18 with 20 rules applied. Total rules applied 1853 place count 49 transition count 101
Discarding 2 places :
Symmetric choice reduction at 18 with 2 rule applications. Total rules 1855 place count 47 transition count 95
Iterating global reduction 18 with 2 rules applied. Total rules applied 1857 place count 47 transition count 95
Discarding 2 places :
Symmetric choice reduction at 18 with 2 rule applications. Total rules 1859 place count 45 transition count 93
Iterating global reduction 18 with 2 rules applied. Total rules applied 1861 place count 45 transition count 93
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 1863 place count 45 transition count 91
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 19 with 2 rules applied. Total rules applied 1865 place count 45 transition count 89
Free-agglomeration rule applied 3 times.
Iterating global reduction 19 with 3 rules applied. Total rules applied 1868 place count 45 transition count 86
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 4 rules applied. Total rules applied 1872 place count 42 transition count 85
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 20 with 3 rules applied. Total rules applied 1875 place count 42 transition count 85
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 20 with 1 rules applied. Total rules applied 1876 place count 42 transition count 84
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 20 with 1 rules applied. Total rules applied 1877 place count 41 transition count 83
Applied a total of 1877 rules in 72 ms. Remains 41 /1506 variables (removed 1465) and now considering 83/1928 (removed 1845) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 41/1506 places, 83/1928 transitions.
RANDOM walk for 240 steps (6 resets) in 5 ms. (40 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p2) p0), (X (NOT p2)), (X p0), (X (X (NOT p2))), (X (X p0))]
False Knowledge obtained : [(F p2), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 114 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 792 reset in 183 ms.
Product exploration explored 100000 steps with 789 reset in 190 ms.
Applying partial POR strategy [false, true, false]
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1506 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1506/1506 places, 1928/1928 transitions.
Graph (trivial) has 1835 edges and 1506 vertex of which 665 / 1506 are part of one of the 61 SCC in 2 ms
Free SCC test removed 604 places
Ensure Unique test removed 698 transitions
Reduce isomorphic transitions removed 698 transitions.
Graph (complete) has 1401 edges and 902 vertex of which 893 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 485 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 485 rules applied. Total rules applied 487 place count 893 transition count 1225
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 16 rules applied. Total rules applied 503 place count 893 transition count 1211
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 2 with 4 rules applied. Total rules applied 507 place count 893 transition count 1209
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 509 place count 893 transition count 1207
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 23 Pre rules applied. Total rules applied 509 place count 893 transition count 1221
Deduced a syphon composed of 512 places in 0 ms
Iterating global reduction 4 with 23 rules applied. Total rules applied 532 place count 893 transition count 1221
Discarding 291 places :
Symmetric choice reduction at 4 with 291 rule applications. Total rules 823 place count 602 transition count 920
Deduced a syphon composed of 237 places in 1 ms
Iterating global reduction 4 with 291 rules applied. Total rules applied 1114 place count 602 transition count 920
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 1126 place count 590 transition count 904
Deduced a syphon composed of 235 places in 0 ms
Iterating global reduction 4 with 12 rules applied. Total rules applied 1138 place count 590 transition count 904
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 1144 place count 590 transition count 898
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 1156 place count 578 transition count 886
Deduced a syphon composed of 225 places in 0 ms
Iterating global reduction 5 with 12 rules applied. Total rules applied 1168 place count 578 transition count 886
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1169 place count 577 transition count 884
Deduced a syphon composed of 225 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 1170 place count 577 transition count 884
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1171 place count 576 transition count 882
Deduced a syphon composed of 225 places in 1 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 1172 place count 576 transition count 882
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1174 place count 574 transition count 880
Deduced a syphon composed of 224 places in 0 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 1176 place count 574 transition count 880
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1177 place count 573 transition count 878
Deduced a syphon composed of 224 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 1178 place count 573 transition count 878
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1179 place count 572 transition count 876
Deduced a syphon composed of 224 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 1180 place count 572 transition count 876
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1182 place count 570 transition count 873
Deduced a syphon composed of 223 places in 1 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 1184 place count 570 transition count 873
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1186 place count 568 transition count 865
Deduced a syphon composed of 222 places in 0 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 1188 place count 568 transition count 865
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1190 place count 566 transition count 863
Deduced a syphon composed of 221 places in 0 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 1192 place count 566 transition count 863
Performed 113 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 334 places in 1 ms
Iterating global reduction 5 with 113 rules applied. Total rules applied 1305 place count 566 transition count 938
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 5 with 43 rules applied. Total rules applied 1348 place count 566 transition count 895
Discarding 110 places :
Symmetric choice reduction at 6 with 110 rule applications. Total rules 1458 place count 456 transition count 775
Deduced a syphon composed of 234 places in 0 ms
Iterating global reduction 6 with 110 rules applied. Total rules applied 1568 place count 456 transition count 775
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 1574 place count 450 transition count 766
Deduced a syphon composed of 228 places in 0 ms
Iterating global reduction 6 with 6 rules applied. Total rules applied 1580 place count 450 transition count 766
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 236 places in 0 ms
Iterating global reduction 6 with 8 rules applied. Total rules applied 1588 place count 450 transition count 766
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1593 place count 450 transition count 761
Discarding 17 places :
Symmetric choice reduction at 7 with 17 rule applications. Total rules 1610 place count 433 transition count 740
Deduced a syphon composed of 223 places in 0 ms
Iterating global reduction 7 with 17 rules applied. Total rules applied 1627 place count 433 transition count 740
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1633 place count 433 transition count 734
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1637 place count 429 transition count 730
Deduced a syphon composed of 219 places in 0 ms
Iterating global reduction 8 with 4 rules applied. Total rules applied 1641 place count 429 transition count 730
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 222 places in 0 ms
Iterating global reduction 8 with 3 rules applied. Total rules applied 1644 place count 429 transition count 730
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 1650 place count 429 transition count 724
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 1653 place count 426 transition count 721
Deduced a syphon composed of 219 places in 0 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 1656 place count 426 transition count 721
Performed 74 Post agglomeration using F-continuation condition with reduction of 131 identical transitions.
Deduced a syphon composed of 293 places in 0 ms
Iterating global reduction 9 with 74 rules applied. Total rules applied 1730 place count 426 transition count 1066
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 9 with 128 rules applied. Total rules applied 1858 place count 426 transition count 938
Discarding 132 places :
Symmetric choice reduction at 10 with 132 rule applications. Total rules 1990 place count 294 transition count 582
Deduced a syphon composed of 170 places in 0 ms
Iterating global reduction 10 with 132 rules applied. Total rules applied 2122 place count 294 transition count 582
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 10 with 15 rules applied. Total rules applied 2137 place count 294 transition count 567
Discarding 27 places :
Symmetric choice reduction at 11 with 27 rule applications. Total rules 2164 place count 267 transition count 510
Deduced a syphon composed of 143 places in 0 ms
Iterating global reduction 11 with 27 rules applied. Total rules applied 2191 place count 267 transition count 510
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 11 with 3 rules applied. Total rules applied 2194 place count 267 transition count 558
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 2197 place count 264 transition count 531
Deduced a syphon composed of 143 places in 0 ms
Iterating global reduction 11 with 3 rules applied. Total rules applied 2200 place count 264 transition count 531
Deduced a syphon composed of 143 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 50 transitions
Redundant transition composition rules discarded 50 transitions
Iterating global reduction 11 with 50 rules applied. Total rules applied 2250 place count 264 transition count 481
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 2254 place count 260 transition count 477
Deduced a syphon composed of 139 places in 0 ms
Iterating global reduction 11 with 4 rules applied. Total rules applied 2258 place count 260 transition count 477
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 11 with 3 rules applied. Total rules applied 2261 place count 260 transition count 537
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 2264 place count 257 transition count 522
Deduced a syphon composed of 139 places in 1 ms
Iterating global reduction 11 with 3 rules applied. Total rules applied 2267 place count 257 transition count 522
Deduced a syphon composed of 139 places in 0 ms
Applied a total of 2267 rules in 199 ms. Remains 257 /1506 variables (removed 1249) and now considering 522/1928 (removed 1406) transitions.
[2024-05-21 06:22:18] [INFO ] Redundant transitions in 9 ms returned []
Running 521 sub problems to find dead transitions.
[2024-05-21 06:22:18] [INFO ] Flow matrix only has 466 transitions (discarded 56 similar events)
// Phase 1: matrix 466 rows 257 cols
[2024-05-21 06:22:18] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 06:22:18] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 521 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 TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 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 TDEAD137 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 TDEAD147 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 TDEAD166 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 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 TDEAD226 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 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 TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 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 TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 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 TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
At refinement iteration 1 (OVERLAPS) 465/721 variables, 256/256 constraints. Problems are: Problem set: 249 solved, 272 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/721 variables, 3/259 constraints. Problems are: Problem set: 249 solved, 272 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/721 variables, 0/259 constraints. Problems are: Problem set: 249 solved, 272 unsolved
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/722 variables, 1/260 constraints. Problems are: Problem set: 254 solved, 267 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/722 variables, 0/260 constraints. Problems are: Problem set: 254 solved, 267 unsolved
At refinement iteration 6 (OVERLAPS) 1/723 variables, 1/261 constraints. Problems are: Problem set: 254 solved, 267 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/723 variables, 0/261 constraints. Problems are: Problem set: 254 solved, 267 unsolved
At refinement iteration 8 (OVERLAPS) 0/723 variables, 0/261 constraints. Problems are: Problem set: 254 solved, 267 unsolved
No progress, stopping.
After SMT solving in domain Real declared 723/723 variables, and 261 constraints, problems are : Problem set: 254 solved, 267 unsolved in 19004 ms.
Refiners :[State Equation: 257/257 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 521/521 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 254 solved, 267 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 254 solved, 267 unsolved
At refinement iteration 1 (OVERLAPS) 462/579 variables, 117/117 constraints. Problems are: Problem set: 254 solved, 267 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/579 variables, 3/120 constraints. Problems are: Problem set: 254 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/579 variables, 267/387 constraints. Problems are: Problem set: 254 solved, 267 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/579 variables, 0/387 constraints. Problems are: Problem set: 254 solved, 267 unsolved
At refinement iteration 5 (OVERLAPS) 143/722 variables, 140/527 constraints. Problems are: Problem set: 254 solved, 267 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/722 variables, 0/527 constraints. Problems are: Problem set: 254 solved, 267 unsolved
At refinement iteration 7 (OVERLAPS) 1/723 variables, 1/528 constraints. Problems are: Problem set: 254 solved, 267 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/723 variables, 0/528 constraints. Problems are: Problem set: 254 solved, 267 unsolved
At refinement iteration 9 (OVERLAPS) 0/723 variables, 0/528 constraints. Problems are: Problem set: 254 solved, 267 unsolved
No progress, stopping.
After SMT solving in domain Int declared 723/723 variables, and 528 constraints, problems are : Problem set: 254 solved, 267 unsolved in 25802 ms.
Refiners :[State Equation: 257/257 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 267/521 constraints, Known Traps: 0/0 constraints]
After SMT, in 45041ms problems are : Problem set: 254 solved, 267 unsolved
Search for dead transitions found 254 dead transitions in 45046ms
Found 254 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 254 transitions
Dead transitions reduction (with SMT) removed 254 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 257/1506 places, 268/1928 transitions.
Graph (complete) has 411 edges and 257 vertex of which 118 are kept as prefixes of interest. Removing 139 places using SCC suffix rule.2 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 111 transition count 250
Applied a total of 8 rules in 10 ms. Remains 111 /257 variables (removed 146) and now considering 250/268 (removed 18) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 111/1506 places, 250/1928 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 45296 ms. Remains : 111/1506 places, 250/1928 transitions.
Support contains 2 out of 1506 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1506/1506 places, 1928/1928 transitions.
Applied a total of 0 rules in 43 ms. Remains 1506 /1506 variables (removed 0) and now considering 1928/1928 (removed 0) transitions.
// Phase 1: matrix 1928 rows 1506 cols
[2024-05-21 06:23:03] [INFO ] Computed 4 invariants in 13 ms
[2024-05-21 06:23:03] [INFO ] Implicit Places using invariants in 233 ms returned []
[2024-05-21 06:23:03] [INFO ] Invariant cache hit.
[2024-05-21 06:23:04] [INFO ] Implicit Places using invariants and state equation in 864 ms returned []
Implicit Place search using SMT with State Equation took 1109 ms to find 0 implicit places.
Running 1927 sub problems to find dead transitions.
[2024-05-21 06:23:04] [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 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 0.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 1.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 1.0)
(s289 1.0)
(s290 0.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 1.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 1.0)
(s299 1.0)
(s300 0.0)
(s301 0.0)
(s302 1.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 1.0)
(s307 0.0)
(s308 0.0)
(s309 1.0)
(s310 1.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 1.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 1.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 1.0)
(s701 0.0)
(s702 1.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 1.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 1.0)
(s711 1.0)
(s712 0.0)
(s713 1.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 1.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1505/3434 variables, and 4 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1506 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/1505 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1505/3434 variables, and 4 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 0/1927 constraints, Known Traps: 0/0 constraints]
After SMT, in 60486ms problems are : Problem set: 0 solved, 1927 unsolved
Search for dead transitions found 0 dead transitions in 60503ms
Finished structural reductions in LTL mode , in 1 iterations and 61660 ms. Remains : 1506/1506 places, 1928/1928 transitions.
Treatment of property CloudReconfiguration-PT-316-LTLFireability-13 finished in 245066 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(G(((p0&&F(p1)) U X(X(p1))))))'
Support contains 2 out of 1548 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1548/1548 places, 1979/1979 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1533 transition count 1964
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1533 transition count 1964
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 1533 transition count 1962
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 38 place count 1527 transition count 1956
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 1527 transition count 1956
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 49 place count 1522 transition count 1949
Iterating global reduction 1 with 5 rules applied. Total rules applied 54 place count 1522 transition count 1949
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 1519 transition count 1945
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 1519 transition count 1945
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 63 place count 1516 transition count 1941
Iterating global reduction 1 with 3 rules applied. Total rules applied 66 place count 1516 transition count 1941
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 69 place count 1513 transition count 1938
Iterating global reduction 1 with 3 rules applied. Total rules applied 72 place count 1513 transition count 1938
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 74 place count 1511 transition count 1936
Iterating global reduction 1 with 2 rules applied. Total rules applied 76 place count 1511 transition count 1936
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 78 place count 1509 transition count 1933
Iterating global reduction 1 with 2 rules applied. Total rules applied 80 place count 1509 transition count 1933
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 81 place count 1508 transition count 1931
Iterating global reduction 1 with 1 rules applied. Total rules applied 82 place count 1508 transition count 1931
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 1507 transition count 1929
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 1507 transition count 1929
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 85 place count 1506 transition count 1928
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 1506 transition count 1928
Applied a total of 86 rules in 499 ms. Remains 1506 /1548 variables (removed 42) and now considering 1928/1979 (removed 51) transitions.
[2024-05-21 06:24:05] [INFO ] Invariant cache hit.
[2024-05-21 06:24:06] [INFO ] Implicit Places using invariants in 203 ms returned []
[2024-05-21 06:24:06] [INFO ] Invariant cache hit.
[2024-05-21 06:24:07] [INFO ] Implicit Places using invariants and state equation in 918 ms returned []
Implicit Place search using SMT with State Equation took 1141 ms to find 0 implicit places.
Running 1927 sub problems to find dead transitions.
[2024-05-21 06:24:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1505/3434 variables, and 4 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1506 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/1505 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1505/3434 variables, and 4 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 0/1927 constraints, Known Traps: 0/0 constraints]
After SMT, in 60496ms problems are : Problem set: 0 solved, 1927 unsolved
Search for dead transitions found 0 dead transitions in 60511ms
Starting structural reductions in LTL mode, iteration 1 : 1506/1548 places, 1928/1979 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62163 ms. Remains : 1506/1548 places, 1928/1979 transitions.
Stuttering acceptance computed with spot in 322 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : CloudReconfiguration-PT-316-LTLFireability-14
Product exploration explored 100000 steps with 20041 reset in 206 ms.
Product exploration explored 100000 steps with 19994 reset in 217 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2105 edges and 1506 vertex of which 1497 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 105 ms. Reduced automaton from 9 states, 15 edges and 2 AP (stutter sensitive) to 9 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 276 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (304 resets) in 86 ms. (459 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40002 steps (86 resets) in 76 ms. (519 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (87 resets) in 102 ms. (388 steps per ms) remains 2/2 properties
[2024-05-21 06:25:08] [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) 816/818 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/818 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 677/1495 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1495 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1918/3413 variables, 1495/1499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3413 variables, 0/1499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/3415 variables, 1/1500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3415 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/3417 variables, 1/1501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3417 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/3419 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3419 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/3421 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3421 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/3423 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3423 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/3425 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3425 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/3427 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3427 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 2/3429 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3429 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 2/3431 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3431 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 2/3433 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3433 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 1/3434 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3434 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/3434 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3434/3434 variables, and 1510 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2465 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1506/1506 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) 816/818 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/818 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 677/1495 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1495 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1918/3413 variables, 1495/1499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3413 variables, 2/1501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3413 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/3415 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3415 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/3417 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3417 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/3419 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3419 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/3421 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3421 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/3423 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3423 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/3425 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3425 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/3427 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3427 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 2/3429 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3429 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 2/3431 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3431 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 2/3433 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3433 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 1/3434 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3434 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 0/3434 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3434/3434 variables, and 1512 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1929 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1506/1506 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 4404ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 103 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=34 )
Parikh walk visited 2 properties in 2 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 7 factoid took 246 ms. Reduced automaton from 9 states, 15 edges and 2 AP (stutter sensitive) to 9 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 315 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 328 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1)]
Support contains 2 out of 1506 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1506/1506 places, 1928/1928 transitions.
Applied a total of 0 rules in 44 ms. Remains 1506 /1506 variables (removed 0) and now considering 1928/1928 (removed 0) transitions.
[2024-05-21 06:25:14] [INFO ] Invariant cache hit.
[2024-05-21 06:25:14] [INFO ] Implicit Places using invariants in 203 ms returned []
[2024-05-21 06:25:14] [INFO ] Invariant cache hit.
[2024-05-21 06:25:15] [INFO ] Implicit Places using invariants and state equation in 858 ms returned []
Implicit Place search using SMT with State Equation took 1062 ms to find 0 implicit places.
Running 1927 sub problems to find dead transitions.
[2024-05-21 06:25:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1505/3434 variables, and 4 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1506 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/1505 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1505/3434 variables, and 4 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 0/1927 constraints, Known Traps: 0/0 constraints]
After SMT, in 60496ms problems are : Problem set: 0 solved, 1927 unsolved
Search for dead transitions found 0 dead transitions in 60513ms
Finished structural reductions in LTL mode , in 1 iterations and 61625 ms. Remains : 1506/1506 places, 1928/1928 transitions.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2105 edges and 1506 vertex of which 1497 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 115 ms. Reduced automaton from 9 states, 15 edges and 2 AP (stutter sensitive) to 9 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 327 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (314 resets) in 268 ms. (148 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (91 resets) in 90 ms. (439 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (90 resets) in 149 ms. (266 steps per ms) remains 2/2 properties
[2024-05-21 06:26:16] [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) 816/818 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/818 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 677/1495 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1495 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1918/3413 variables, 1495/1499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3413 variables, 0/1499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/3415 variables, 1/1500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3415 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/3417 variables, 1/1501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3417 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/3419 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3419 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/3421 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3421 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/3423 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3423 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/3425 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3425 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/3427 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3427 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 2/3429 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3429 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 2/3431 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3431 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 2/3433 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3433 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 1/3434 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3434 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/3434 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3434/3434 variables, and 1510 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2585 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1506/1506 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) 816/818 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/818 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 677/1495 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1495 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1918/3413 variables, 1495/1499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3413 variables, 2/1501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3413 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/3415 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3415 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/3417 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3417 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/3419 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3419 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/3421 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3421 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/3423 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3423 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/3425 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3425 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/3427 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3427 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 2/3429 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3429 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 2/3431 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3431 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 2/3433 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3433 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 1/3434 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3434 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 0/3434 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3434/3434 variables, and 1512 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1953 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1506/1506 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 4546ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 103 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=51 )
Parikh walk visited 2 properties in 2 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 7 factoid took 199 ms. Reduced automaton from 9 states, 15 edges and 2 AP (stutter sensitive) to 9 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 275 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 264 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 316 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 19973 reset in 209 ms.
Product exploration explored 100000 steps with 20040 reset in 224 ms.
Applying partial POR strategy [false, false, false, true, false, true, true, false, false]
Stuttering acceptance computed with spot in 306 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1)]
Support contains 2 out of 1506 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1506/1506 places, 1928/1928 transitions.
Graph (trivial) has 1835 edges and 1506 vertex of which 693 / 1506 are part of one of the 63 SCC in 2 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 876 vertex of which 867 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 473 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 473 rules applied. Total rules applied 475 place count 867 transition count 1191
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 487 place count 867 transition count 1179
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 487 place count 867 transition count 1192
Deduced a syphon composed of 495 places in 1 ms
Iterating global reduction 2 with 22 rules applied. Total rules applied 509 place count 867 transition count 1192
Discarding 283 places :
Symmetric choice reduction at 2 with 283 rule applications. Total rules 792 place count 584 transition count 899
Deduced a syphon composed of 228 places in 0 ms
Iterating global reduction 2 with 283 rules applied. Total rules applied 1075 place count 584 transition count 899
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1087 place count 572 transition count 883
Deduced a syphon composed of 226 places in 1 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 1099 place count 572 transition count 883
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 572 transition count 877
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1117 place count 560 transition count 865
Deduced a syphon composed of 216 places in 1 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 1129 place count 560 transition count 865
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1131 place count 558 transition count 861
Deduced a syphon composed of 216 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1133 place count 558 transition count 861
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1135 place count 556 transition count 857
Deduced a syphon composed of 216 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1137 place count 556 transition count 857
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1141 place count 552 transition count 853
Deduced a syphon composed of 214 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1145 place count 552 transition count 853
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1147 place count 550 transition count 849
Deduced a syphon composed of 214 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1149 place count 550 transition count 849
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1151 place count 548 transition count 845
Deduced a syphon composed of 214 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1153 place count 548 transition count 845
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1157 place count 544 transition count 839
Deduced a syphon composed of 212 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1161 place count 544 transition count 839
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1165 place count 540 transition count 823
Deduced a syphon composed of 210 places in 1 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1169 place count 540 transition count 823
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 540 transition count 823
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1174 place count 536 transition count 819
Deduced a syphon composed of 209 places in 0 ms
Iterating global reduction 4 with 4 rules applied. Total rules applied 1178 place count 536 transition count 819
Performed 103 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 312 places in 0 ms
Iterating global reduction 4 with 103 rules applied. Total rules applied 1281 place count 536 transition count 893
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 4 with 39 rules applied. Total rules applied 1320 place count 536 transition count 854
Discarding 98 places :
Symmetric choice reduction at 5 with 98 rule applications. Total rules 1418 place count 438 transition count 746
Deduced a syphon composed of 224 places in 0 ms
Iterating global reduction 5 with 98 rules applied. Total rules applied 1516 place count 438 transition count 746
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 1522 place count 432 transition count 737
Deduced a syphon composed of 218 places in 0 ms
Iterating global reduction 5 with 6 rules applied. Total rules applied 1528 place count 432 transition count 737
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 225 places in 0 ms
Iterating global reduction 5 with 7 rules applied. Total rules applied 1535 place count 432 transition count 737
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1539 place count 432 transition count 733
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 1554 place count 417 transition count 714
Deduced a syphon composed of 214 places in 0 ms
Iterating global reduction 6 with 15 rules applied. Total rules applied 1569 place count 417 transition count 714
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1575 place count 417 transition count 708
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1579 place count 413 transition count 704
Deduced a syphon composed of 210 places in 0 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 1583 place count 413 transition count 704
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 213 places in 0 ms
Iterating global reduction 7 with 3 rules applied. Total rules applied 1586 place count 413 transition count 704
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1592 place count 413 transition count 698
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1595 place count 410 transition count 695
Deduced a syphon composed of 210 places in 0 ms
Iterating global reduction 8 with 3 rules applied. Total rules applied 1598 place count 410 transition count 695
Performed 69 Post agglomeration using F-continuation condition with reduction of 119 identical transitions.
Deduced a syphon composed of 279 places in 0 ms
Iterating global reduction 8 with 69 rules applied. Total rules applied 1667 place count 410 transition count 1006
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Iterating post reduction 8 with 120 rules applied. Total rules applied 1787 place count 410 transition count 886
Discarding 122 places :
Symmetric choice reduction at 9 with 122 rule applications. Total rules 1909 place count 288 transition count 565
Deduced a syphon composed of 165 places in 0 ms
Iterating global reduction 9 with 122 rules applied. Total rules applied 2031 place count 288 transition count 565
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 9 with 12 rules applied. Total rules applied 2043 place count 288 transition count 553
Discarding 22 places :
Symmetric choice reduction at 10 with 22 rule applications. Total rules 2065 place count 266 transition count 509
Deduced a syphon composed of 143 places in 1 ms
Iterating global reduction 10 with 22 rules applied. Total rules applied 2087 place count 266 transition count 509
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -50
Deduced a syphon composed of 146 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2090 place count 266 transition count 559
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 2093 place count 263 transition count 531
Deduced a syphon composed of 143 places in 0 ms
Iterating global reduction 10 with 3 rules applied. Total rules applied 2096 place count 263 transition count 531
Deduced a syphon composed of 143 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 46 transitions
Redundant transition composition rules discarded 46 transitions
Iterating global reduction 10 with 46 rules applied. Total rules applied 2142 place count 263 transition count 485
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 2146 place count 259 transition count 480
Deduced a syphon composed of 139 places in 0 ms
Iterating global reduction 10 with 4 rules applied. Total rules applied 2150 place count 259 transition count 480
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 141 places in 0 ms
Iterating global reduction 10 with 2 rules applied. Total rules applied 2152 place count 259 transition count 520
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 2154 place count 257 transition count 510
Deduced a syphon composed of 139 places in 0 ms
Iterating global reduction 10 with 2 rules applied. Total rules applied 2156 place count 257 transition count 510
Deduced a syphon composed of 139 places in 0 ms
Applied a total of 2156 rules in 177 ms. Remains 257 /1506 variables (removed 1249) and now considering 510/1928 (removed 1418) transitions.
[2024-05-21 06:26:23] [INFO ] Redundant transitions in 3 ms returned []
Running 509 sub problems to find dead transitions.
[2024-05-21 06:26:23] [INFO ] Flow matrix only has 454 transitions (discarded 56 similar events)
// Phase 1: matrix 454 rows 257 cols
[2024-05-21 06:26:23] [INFO ] Computed 0 invariants in 2 ms
[2024-05-21 06:26:23] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 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 TDEAD108 is UNSAT
Problem TDEAD109 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 TDEAD137 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 TDEAD147 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 TDEAD166 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 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 TDEAD227 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD249 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 TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD310 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 TDEAD323 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD354 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 TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD385 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 TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD416 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 TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
At refinement iteration 1 (OVERLAPS) 453/709 variables, 256/256 constraints. Problems are: Problem set: 247 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/709 variables, 2/258 constraints. Problems are: Problem set: 247 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/709 variables, 0/258 constraints. Problems are: Problem set: 247 solved, 262 unsolved
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/710 variables, 1/259 constraints. Problems are: Problem set: 252 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/710 variables, 0/259 constraints. Problems are: Problem set: 252 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 1/711 variables, 1/260 constraints. Problems are: Problem set: 252 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/711 variables, 0/260 constraints. Problems are: Problem set: 252 solved, 257 unsolved
At refinement iteration 8 (OVERLAPS) 0/711 variables, 0/260 constraints. Problems are: Problem set: 252 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Real declared 711/711 variables, and 260 constraints, problems are : Problem set: 252 solved, 257 unsolved in 17970 ms.
Refiners :[State Equation: 257/257 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 252 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 252 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 450/567 variables, 117/117 constraints. Problems are: Problem set: 252 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/567 variables, 2/119 constraints. Problems are: Problem set: 252 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/567 variables, 257/376 constraints. Problems are: Problem set: 252 solved, 257 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/567 variables, 0/376 constraints. Problems are: Problem set: 252 solved, 257 unsolved
At refinement iteration 5 (OVERLAPS) 143/710 variables, 140/516 constraints. Problems are: Problem set: 252 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/710 variables, 0/516 constraints. Problems are: Problem set: 252 solved, 257 unsolved
At refinement iteration 7 (OVERLAPS) 1/711 variables, 1/517 constraints. Problems are: Problem set: 252 solved, 257 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/711 variables, 0/517 constraints. Problems are: Problem set: 252 solved, 257 unsolved
At refinement iteration 9 (OVERLAPS) 0/711 variables, 0/517 constraints. Problems are: Problem set: 252 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Int declared 711/711 variables, and 517 constraints, problems are : Problem set: 252 solved, 257 unsolved in 28883 ms.
Refiners :[State Equation: 257/257 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 257/509 constraints, Known Traps: 0/0 constraints]
After SMT, in 47031ms problems are : Problem set: 252 solved, 257 unsolved
Search for dead transitions found 252 dead transitions in 47037ms
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 : 257/1506 places, 258/1928 transitions.
Graph (complete) has 400 edges and 257 vertex of which 118 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 111 transition count 240
Applied a total of 8 rules in 10 ms. Remains 111 /257 variables (removed 146) and now considering 240/258 (removed 18) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 111/1506 places, 240/1928 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 47236 ms. Remains : 111/1506 places, 240/1928 transitions.
Support contains 2 out of 1506 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1506/1506 places, 1928/1928 transitions.
Applied a total of 0 rules in 46 ms. Remains 1506 /1506 variables (removed 0) and now considering 1928/1928 (removed 0) transitions.
// Phase 1: matrix 1928 rows 1506 cols
[2024-05-21 06:27:10] [INFO ] Computed 4 invariants in 12 ms
[2024-05-21 06:27:10] [INFO ] Implicit Places using invariants in 213 ms returned []
[2024-05-21 06:27:10] [INFO ] Invariant cache hit.
[2024-05-21 06:27:11] [INFO ] Implicit Places using invariants and state equation in 889 ms returned []
Implicit Place search using SMT with State Equation took 1103 ms to find 0 implicit places.
Running 1927 sub problems to find dead transitions.
[2024-05-21 06:27:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1505/3434 variables, and 4 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1506 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/1505 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1505/3434 variables, and 4 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 0/1927 constraints, Known Traps: 0/0 constraints]
After SMT, in 60502ms problems are : Problem set: 0 solved, 1927 unsolved
Search for dead transitions found 0 dead transitions in 60521ms
Finished structural reductions in LTL mode , in 1 iterations and 61679 ms. Remains : 1506/1506 places, 1928/1928 transitions.
Treatment of property CloudReconfiguration-PT-316-LTLFireability-14 finished in 246491 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((G(p0)||(p0&&F(p1))))))'
Found a Shortening insensitive property : CloudReconfiguration-PT-316-LTLFireability-07
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 2 out of 1548 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1548/1548 places, 1979/1979 transitions.
Graph (trivial) has 1885 edges and 1548 vertex of which 694 / 1548 are part of one of the 63 SCC in 2 ms
Free SCC test removed 631 places
Ensure Unique test removed 733 transitions
Reduce isomorphic transitions removed 733 transitions.
Graph (complete) has 1423 edges and 917 vertex of which 908 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 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 741
Reduce places removed 499 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 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 523 rules applied. Total rules applied 1024 place count 408 transition count 717
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 1035 place count 397 transition count 717
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 1035 place count 397 transition count 672
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 1125 place count 352 transition count 672
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 1143 place count 334 transition count 646
Iterating global reduction 3 with 18 rules applied. Total rules applied 1161 place count 334 transition count 646
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 3 rules applied. Total rules applied 1164 place count 334 transition count 643
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1166 place count 332 transition count 643
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1166 place count 332 transition count 642
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1168 place count 331 transition count 642
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 1180 place count 319 transition count 625
Iterating global reduction 5 with 12 rules applied. Total rules applied 1192 place count 319 transition count 625
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1198 place count 319 transition count 619
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1202 place count 315 transition count 611
Iterating global reduction 6 with 4 rules applied. Total rules applied 1206 place count 315 transition count 611
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1209 place count 312 transition count 605
Iterating global reduction 6 with 3 rules applied. Total rules applied 1212 place count 312 transition count 605
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 1 rules applied. Total rules applied 1213 place count 312 transition count 604
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1214 place count 311 transition count 604
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1216 place count 309 transition count 600
Iterating global reduction 8 with 2 rules applied. Total rules applied 1218 place count 309 transition count 600
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1220 place count 307 transition count 596
Iterating global reduction 8 with 2 rules applied. Total rules applied 1222 place count 307 transition count 596
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1224 place count 305 transition count 592
Iterating global reduction 8 with 2 rules applied. Total rules applied 1226 place count 305 transition count 592
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1228 place count 303 transition count 578
Iterating global reduction 8 with 2 rules applied. Total rules applied 1230 place count 303 transition count 578
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 8 with 1 rules applied. Total rules applied 1231 place count 303 transition count 577
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1232 place count 302 transition count 577
Performed 144 Post agglomeration using F-continuation condition with reduction of 86 identical transitions.
Deduced a syphon composed of 144 places in 0 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 10 with 288 rules applied. Total rules applied 1520 place count 158 transition count 347
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 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 10 with 11 rules applied. Total rules applied 1531 place count 158 transition count 336
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 1533 place count 157 transition count 335
Discarding 4 places :
Symmetric choice reduction at 12 with 4 rule applications. Total rules 1537 place count 153 transition count 330
Iterating global reduction 12 with 4 rules applied. Total rules applied 1541 place count 153 transition count 330
Performed 10 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 12 with 20 rules applied. Total rules applied 1561 place count 143 transition count 318
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 1570 place count 143 transition count 309
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 13 with 34 rules applied. Total rules applied 1604 place count 126 transition count 343
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 13 with 17 rules applied. Total rules applied 1621 place count 126 transition count 326
Discarding 9 places :
Symmetric choice reduction at 14 with 9 rule applications. Total rules 1630 place count 117 transition count 308
Iterating global reduction 14 with 9 rules applied. Total rules applied 1639 place count 117 transition count 308
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 1645 place count 117 transition count 302
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 1646 place count 116 transition count 301
Applied a total of 1646 rules in 85 ms. Remains 116 /1548 variables (removed 1432) and now considering 301/1979 (removed 1678) transitions.
[2024-05-21 06:28:12] [INFO ] Flow matrix only has 244 transitions (discarded 57 similar events)
// Phase 1: matrix 244 rows 116 cols
[2024-05-21 06:28:12] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 06:28:12] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-21 06:28:12] [INFO ] Flow matrix only has 244 transitions (discarded 57 similar events)
[2024-05-21 06:28:12] [INFO ] Invariant cache hit.
[2024-05-21 06:28:12] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 06:28:12] [INFO ] Implicit Places using invariants and state equation in 118 ms returned [8, 43]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 168 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 114/1548 places, 301/1979 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 112 transition count 299
Applied a total of 2 rules in 4 ms. Remains 112 /114 variables (removed 2) and now considering 299/301 (removed 2) transitions.
[2024-05-21 06:28:12] [INFO ] Flow matrix only has 242 transitions (discarded 57 similar events)
// Phase 1: matrix 242 rows 112 cols
[2024-05-21 06:28:12] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 06:28:12] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-21 06:28:12] [INFO ] Flow matrix only has 242 transitions (discarded 57 similar events)
[2024-05-21 06:28:12] [INFO ] Invariant cache hit.
[2024-05-21 06:28:12] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 06:28:12] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 112/1548 places, 299/1979 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 397 ms. Remains : 112/1548 places, 299/1979 transitions.
Running random walk in product with property : CloudReconfiguration-PT-316-LTLFireability-07
Stuttering criterion allowed to conclude after 1240 steps with 125 reset in 2 ms.
Treatment of property CloudReconfiguration-PT-316-LTLFireability-07 finished in 630 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
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(F(((X(p0)&&F(p1))||G(p0))))||(p2&&X(F(((X(p0)&&F(p1))||G(p0))))))))'
Found a Shortening insensitive property : CloudReconfiguration-PT-316-LTLFireability-13
Stuttering acceptance computed with spot in 272 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 3 out of 1548 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1548/1548 places, 1979/1979 transitions.
Graph (trivial) has 1879 edges and 1548 vertex of which 666 / 1548 are part of one of the 61 SCC in 1 ms
Free SCC test removed 605 places
Ensure Unique test removed 699 transitions
Reduce isomorphic transitions removed 699 transitions.
Graph (complete) has 1457 edges and 943 vertex of which 934 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 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 510 transitions
Trivial Post-agglo rules discarded 510 transitions
Performed 510 trivial Post agglomeration. Transition count delta: 510
Iterating post reduction 0 with 510 rules applied. Total rules applied 512 place count 933 transition count 764
Reduce places removed 510 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 538 rules applied. Total rules applied 1050 place count 423 transition count 736
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 17 rules applied. Total rules applied 1067 place count 410 transition count 732
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 6 rules applied. Total rules applied 1073 place count 408 transition count 728
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 5 rules applied. Total rules applied 1078 place count 406 transition count 725
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 4 rules applied. Total rules applied 1082 place count 404 transition count 723
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 4 rules applied. Total rules applied 1086 place count 402 transition count 721
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1087 place count 401 transition count 721
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 47 Pre rules applied. Total rules applied 1087 place count 401 transition count 674
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 8 with 94 rules applied. Total rules applied 1181 place count 354 transition count 674
Discarding 19 places :
Symmetric choice reduction at 8 with 19 rule applications. Total rules 1200 place count 335 transition count 647
Iterating global reduction 8 with 19 rules applied. Total rules applied 1219 place count 335 transition count 647
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 8 with 3 rules applied. Total rules applied 1222 place count 335 transition count 644
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1224 place count 333 transition count 644
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 1224 place count 333 transition count 643
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 1226 place count 332 transition count 643
Discarding 12 places :
Symmetric choice reduction at 10 with 12 rule applications. Total rules 1238 place count 320 transition count 627
Iterating global reduction 10 with 12 rules applied. Total rules applied 1250 place count 320 transition count 627
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 1256 place count 320 transition count 621
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 1260 place count 316 transition count 613
Iterating global reduction 11 with 4 rules applied. Total rules applied 1264 place count 316 transition count 613
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 1267 place count 313 transition count 607
Iterating global reduction 11 with 3 rules applied. Total rules applied 1270 place count 313 transition count 607
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 11 with 2 rules applied. Total rules applied 1272 place count 313 transition count 605
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 1274 place count 311 transition count 605
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 1275 place count 310 transition count 603
Iterating global reduction 13 with 1 rules applied. Total rules applied 1276 place count 310 transition count 603
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 1277 place count 309 transition count 601
Iterating global reduction 13 with 1 rules applied. Total rules applied 1278 place count 309 transition count 601
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 1279 place count 308 transition count 599
Iterating global reduction 13 with 1 rules applied. Total rules applied 1280 place count 308 transition count 599
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 1281 place count 307 transition count 592
Iterating global reduction 13 with 1 rules applied. Total rules applied 1282 place count 307 transition count 592
Performed 142 Post agglomeration using F-continuation condition with reduction of 84 identical transitions.
Deduced a syphon composed of 142 places in 0 ms
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 13 with 284 rules applied. Total rules applied 1566 place count 165 transition count 366
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 13 with 10 rules applied. Total rules applied 1576 place count 165 transition count 356
Discarding 4 places :
Symmetric choice reduction at 14 with 4 rule applications. Total rules 1580 place count 161 transition count 351
Iterating global reduction 14 with 4 rules applied. Total rules applied 1584 place count 161 transition count 351
Performed 12 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 14 with 24 rules applied. Total rules applied 1608 place count 149 transition count 336
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 14 with 12 rules applied. Total rules applied 1620 place count 149 transition count 324
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 1621 place count 148 transition count 322
Iterating global reduction 15 with 1 rules applied. Total rules applied 1622 place count 148 transition count 322
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 15 with 38 rules applied. Total rules applied 1660 place count 129 transition count 359
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 15 with 23 rules applied. Total rules applied 1683 place count 129 transition count 336
Discarding 9 places :
Symmetric choice reduction at 16 with 9 rule applications. Total rules 1692 place count 120 transition count 318
Iterating global reduction 16 with 9 rules applied. Total rules applied 1701 place count 120 transition count 318
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 16 with 6 rules applied. Total rules applied 1707 place count 120 transition count 312
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 17 with 1 rules applied. Total rules applied 1708 place count 119 transition count 311
Applied a total of 1708 rules in 79 ms. Remains 119 /1548 variables (removed 1429) and now considering 311/1979 (removed 1668) transitions.
[2024-05-21 06:28:12] [INFO ] Flow matrix only has 255 transitions (discarded 56 similar events)
// Phase 1: matrix 255 rows 119 cols
[2024-05-21 06:28:12] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 06:28:13] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-21 06:28:13] [INFO ] Flow matrix only has 255 transitions (discarded 56 similar events)
[2024-05-21 06:28:13] [INFO ] Invariant cache hit.
[2024-05-21 06:28:13] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-21 06:28:13] [INFO ] Implicit Places using invariants and state equation in 124 ms returned [15, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 193 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 117/1548 places, 311/1979 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 115 transition count 309
Applied a total of 2 rules in 4 ms. Remains 115 /117 variables (removed 2) and now considering 309/311 (removed 2) transitions.
[2024-05-21 06:28:13] [INFO ] Flow matrix only has 253 transitions (discarded 56 similar events)
// Phase 1: matrix 253 rows 115 cols
[2024-05-21 06:28:13] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 06:28:13] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-21 06:28:13] [INFO ] Flow matrix only has 253 transitions (discarded 56 similar events)
[2024-05-21 06:28:13] [INFO ] Invariant cache hit.
[2024-05-21 06:28:13] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 06:28:13] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 115/1548 places, 309/1979 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 499 ms. Remains : 115/1548 places, 309/1979 transitions.
Running random walk in product with property : CloudReconfiguration-PT-316-LTLFireability-13
Stuttering criterion allowed to conclude after 12407 steps with 1213 reset in 21 ms.
Treatment of property CloudReconfiguration-PT-316-LTLFireability-13 finished in 913 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
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(G(((p0&&F(p1)) U X(X(p1))))))'
[2024-05-21 06:28:13] [INFO ] Flatten gal took : 136 ms
[2024-05-21 06:28:13] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 16 ms.
[2024-05-21 06:28:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1548 places, 1979 transitions and 4137 arcs took 12 ms.
Total runtime 1084463 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CloudReconfiguration-PT-316

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1548
TRANSITIONS: 1979
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.025s, Sys 0.003s]


SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.006s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1825
MODEL NAME: /home/mcc/execution/413/model
1548 places, 1979 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA CloudReconfiguration-PT-316-LTLFireability-07 CANNOT_COMPUTE
FORMULA CloudReconfiguration-PT-316-LTLFireability-13 CANNOT_COMPUTE
FORMULA CloudReconfiguration-PT-316-LTLFireability-14 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716273576529

--------------------
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
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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-316"
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-316, 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-171624187300236"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CloudReconfiguration-PT-316.tgz
mv CloudReconfiguration-PT-316 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 ;