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.r399-tall-171690529600116.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 StigmergyCommit-PT-03b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690529600116
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 764K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Apr 11 17:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 11 17:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 17:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Apr 11 17:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 359K May 18 16:43 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 StigmergyCommit-PT-03b-LTLFireability-00
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-01
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-02
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-03
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-04
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-05
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-06
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-07
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-08
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-09
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-10
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-11
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-12
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-13
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-14
FORMULA_NAME StigmergyCommit-PT-03b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716986996078

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-03b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 12:49:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-29 12:49:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 12:49:57] [INFO ] Load time of PNML (sax parser for PT used): 122 ms
[2024-05-29 12:49:57] [INFO ] Transformed 1231 places.
[2024-05-29 12:49:57] [INFO ] Transformed 1476 transitions.
[2024-05-29 12:49:57] [INFO ] Found NUPN structural information;
[2024-05-29 12:49:57] [INFO ] Parsed PT model containing 1231 places and 1476 transitions and 4168 arcs in 239 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA StigmergyCommit-PT-03b-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-03b-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-03b-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-03b-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-03b-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 1231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1231/1231 places, 1476/1476 transitions.
Discarding 97 places :
Symmetric choice reduction at 0 with 97 rule applications. Total rules 97 place count 1134 transition count 1379
Iterating global reduction 0 with 97 rules applied. Total rules applied 194 place count 1134 transition count 1379
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 254 place count 1074 transition count 1319
Iterating global reduction 0 with 60 rules applied. Total rules applied 314 place count 1074 transition count 1319
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 347 place count 1041 transition count 1286
Iterating global reduction 0 with 33 rules applied. Total rules applied 380 place count 1041 transition count 1286
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 407 place count 1014 transition count 1259
Iterating global reduction 0 with 27 rules applied. Total rules applied 434 place count 1014 transition count 1259
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 456 place count 992 transition count 1237
Iterating global reduction 0 with 22 rules applied. Total rules applied 478 place count 992 transition count 1237
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 500 place count 970 transition count 1215
Iterating global reduction 0 with 22 rules applied. Total rules applied 522 place count 970 transition count 1215
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 544 place count 948 transition count 1193
Iterating global reduction 0 with 22 rules applied. Total rules applied 566 place count 948 transition count 1193
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 588 place count 926 transition count 1171
Iterating global reduction 0 with 22 rules applied. Total rules applied 610 place count 926 transition count 1171
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 629 place count 907 transition count 1152
Iterating global reduction 0 with 19 rules applied. Total rules applied 648 place count 907 transition count 1152
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 663 place count 892 transition count 1137
Iterating global reduction 0 with 15 rules applied. Total rules applied 678 place count 892 transition count 1137
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 680 place count 892 transition count 1135
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 687 place count 885 transition count 1128
Iterating global reduction 1 with 7 rules applied. Total rules applied 694 place count 885 transition count 1128
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 700 place count 879 transition count 1122
Iterating global reduction 1 with 6 rules applied. Total rules applied 706 place count 879 transition count 1122
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 709 place count 876 transition count 1119
Iterating global reduction 1 with 3 rules applied. Total rules applied 712 place count 876 transition count 1119
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 714 place count 874 transition count 1117
Iterating global reduction 1 with 2 rules applied. Total rules applied 716 place count 874 transition count 1117
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 718 place count 872 transition count 1115
Iterating global reduction 1 with 2 rules applied. Total rules applied 720 place count 872 transition count 1115
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 722 place count 870 transition count 1113
Iterating global reduction 1 with 2 rules applied. Total rules applied 724 place count 870 transition count 1113
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 726 place count 868 transition count 1111
Iterating global reduction 1 with 2 rules applied. Total rules applied 728 place count 868 transition count 1111
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 730 place count 866 transition count 1109
Iterating global reduction 1 with 2 rules applied. Total rules applied 732 place count 866 transition count 1109
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 734 place count 864 transition count 1107
Iterating global reduction 1 with 2 rules applied. Total rules applied 736 place count 864 transition count 1107
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 738 place count 862 transition count 1105
Iterating global reduction 1 with 2 rules applied. Total rules applied 740 place count 862 transition count 1105
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 742 place count 860 transition count 1103
Iterating global reduction 1 with 2 rules applied. Total rules applied 744 place count 860 transition count 1103
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 746 place count 858 transition count 1101
Iterating global reduction 1 with 2 rules applied. Total rules applied 748 place count 858 transition count 1101
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 750 place count 858 transition count 1099
Applied a total of 750 rules in 1326 ms. Remains 858 /1231 variables (removed 373) and now considering 1099/1476 (removed 377) transitions.
// Phase 1: matrix 1099 rows 858 cols
[2024-05-29 12:49:59] [INFO ] Computed 5 invariants in 31 ms
[2024-05-29 12:49:59] [INFO ] Implicit Places using invariants in 537 ms returned []
[2024-05-29 12:49:59] [INFO ] Invariant cache hit.
[2024-05-29 12:50:00] [INFO ] Implicit Places using invariants and state equation in 753 ms returned []
Implicit Place search using SMT with State Equation took 1321 ms to find 0 implicit places.
Running 1098 sub problems to find dead transitions.
[2024-05-29 12:50:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/857 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 1 (OVERLAPS) 1/858 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-05-29 12:50:28] [INFO ] Deduced a trap composed of 329 places in 436 ms of which 53 ms to minimize.
[2024-05-29 12:50:28] [INFO ] Deduced a trap composed of 292 places in 340 ms of which 5 ms to minimize.
[2024-05-29 12:50:29] [INFO ] Deduced a trap composed of 307 places in 443 ms of which 17 ms to minimize.
[2024-05-29 12:50:30] [INFO ] Deduced a trap composed of 315 places in 366 ms of which 5 ms to minimize.
[2024-05-29 12:50:30] [INFO ] Deduced a trap composed of 318 places in 287 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 858/1957 variables, and 10 constraints, problems are : Problem set: 0 solved, 1098 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/858 constraints, PredecessorRefiner: 1098/1098 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1098 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/857 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 1 (OVERLAPS) 1/858 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/858 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-05-29 12:50:45] [INFO ] Deduced a trap composed of 315 places in 232 ms of which 4 ms to minimize.
[2024-05-29 12:50:45] [INFO ] Deduced a trap composed of 314 places in 182 ms of which 3 ms to minimize.
[2024-05-29 12:50:45] [INFO ] Deduced a trap composed of 292 places in 185 ms of which 4 ms to minimize.
[2024-05-29 12:50:49] [INFO ] Deduced a trap composed of 410 places in 259 ms of which 5 ms to minimize.
[2024-05-29 12:50:51] [INFO ] Deduced a trap composed of 297 places in 309 ms of which 5 ms to minimize.
[2024-05-29 12:50:52] [INFO ] Deduced a trap composed of 307 places in 202 ms of which 3 ms to minimize.
[2024-05-29 12:50:55] [INFO ] Deduced a trap composed of 291 places in 184 ms of which 3 ms to minimize.
[2024-05-29 12:50:56] [INFO ] Deduced a trap composed of 333 places in 281 ms of which 5 ms to minimize.
[2024-05-29 12:50:56] [INFO ] Deduced a trap composed of 332 places in 264 ms of which 5 ms to minimize.
[2024-05-29 12:50:59] [INFO ] Deduced a trap composed of 329 places in 205 ms of which 4 ms to minimize.
[2024-05-29 12:50:59] [INFO ] Deduced a trap composed of 329 places in 198 ms of which 4 ms to minimize.
[2024-05-29 12:51:00] [INFO ] Deduced a trap composed of 329 places in 192 ms of which 3 ms to minimize.
[2024-05-29 12:51:00] [INFO ] Deduced a trap composed of 328 places in 182 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 858/1957 variables, and 23 constraints, problems are : Problem set: 0 solved, 1098 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/858 constraints, PredecessorRefiner: 0/1098 constraints, Known Traps: 18/18 constraints]
After SMT, in 60662ms problems are : Problem set: 0 solved, 1098 unsolved
Search for dead transitions found 0 dead transitions in 60701ms
Starting structural reductions in LTL mode, iteration 1 : 858/1231 places, 1099/1476 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63380 ms. Remains : 858/1231 places, 1099/1476 transitions.
Support contains 33 out of 858 places after structural reductions.
[2024-05-29 12:51:01] [INFO ] Flatten gal took : 107 ms
[2024-05-29 12:51:01] [INFO ] Flatten gal took : 69 ms
[2024-05-29 12:51:01] [INFO ] Input system was already deterministic with 1099 transitions.
Reduction of identical properties reduced properties to check from 26 to 25
RANDOM walk for 40000 steps (507 resets) in 1581 ms. (25 steps per ms) remains 17/25 properties
BEST_FIRST walk for 4003 steps (9 resets) in 79 ms. (50 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (11 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (11 resets) in 24 ms. (160 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (11 resets) in 21 ms. (182 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (9 resets) in 24 ms. (160 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (10 resets) in 24 ms. (160 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (10 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (9 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (11 resets) in 7 ms. (500 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (9 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (10 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (9 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (10 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (9 resets) in 10 ms. (364 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (10 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (9 resets) in 10 ms. (364 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (10 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
[2024-05-29 12:51:02] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 817/844 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-29 12:51:03] [INFO ] Deduced a trap composed of 292 places in 348 ms of which 20 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/844 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/844 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 14/858 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/858 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 1099/1957 variables, 858/864 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1957 variables, 0/864 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/1957 variables, 0/864 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1957/1957 variables, and 864 constraints, problems are : Problem set: 0 solved, 17 unsolved in 3601 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 858/858 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 817/844 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/844 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-29 12:51:06] [INFO ] Deduced a trap composed of 292 places in 209 ms of which 3 ms to minimize.
[2024-05-29 12:51:06] [INFO ] Deduced a trap composed of 329 places in 188 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/844 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/844 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 14/858 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/858 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 1099/1957 variables, 858/866 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1957 variables, 17/883 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1957 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-29 12:51:09] [INFO ] Deduced a trap composed of 315 places in 196 ms of which 5 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/1957 variables, 1/884 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1957 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-29 12:51:11] [INFO ] Deduced a trap composed of 297 places in 178 ms of which 3 ms to minimize.
SMT process timed out in 8794ms, After SMT, problems are : Problem set: 0 solved, 17 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 27 out of 858 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 858/858 places, 1099/1099 transitions.
Graph (trivial) has 788 edges and 858 vertex of which 47 / 858 are part of one of the 9 SCC in 14 ms
Free SCC test removed 38 places
Drop transitions (Empty/Sink Transition effects.) removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Graph (complete) has 1284 edges and 820 vertex of which 816 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.10 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 565 transitions
Trivial Post-agglo rules discarded 565 transitions
Performed 565 trivial Post agglomeration. Transition count delta: 565
Iterating post reduction 0 with 569 rules applied. Total rules applied 571 place count 816 transition count 478
Reduce places removed 565 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 579 rules applied. Total rules applied 1150 place count 251 transition count 464
Reduce places removed 6 places and 0 transitions.
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Iterating post reduction 2 with 34 rules applied. Total rules applied 1184 place count 245 transition count 436
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 31 rules applied. Total rules applied 1215 place count 217 transition count 433
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1216 place count 216 transition count 433
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 45 Pre rules applied. Total rules applied 1216 place count 216 transition count 388
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 5 with 90 rules applied. Total rules applied 1306 place count 171 transition count 388
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 5 with 62 rules applied. Total rules applied 1368 place count 140 transition count 357
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 1373 place count 140 transition count 352
Discarding 18 places :
Symmetric choice reduction at 6 with 18 rule applications. Total rules 1391 place count 122 transition count 266
Iterating global reduction 6 with 18 rules applied. Total rules applied 1409 place count 122 transition count 266
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 1416 place count 122 transition count 259
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 1426 place count 112 transition count 249
Iterating global reduction 7 with 10 rules applied. Total rules applied 1436 place count 112 transition count 249
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1444 place count 104 transition count 241
Iterating global reduction 7 with 8 rules applied. Total rules applied 1452 place count 104 transition count 241
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1456 place count 104 transition count 237
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 8 with 12 rules applied. Total rules applied 1468 place count 98 transition count 231
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1476 place count 94 transition count 252
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1477 place count 94 transition count 251
Free-agglomeration rule applied 12 times.
Iterating global reduction 8 with 12 rules applied. Total rules applied 1489 place count 94 transition count 239
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 1501 place count 82 transition count 239
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 1504 place count 79 transition count 236
Iterating global reduction 9 with 3 rules applied. Total rules applied 1507 place count 79 transition count 236
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 1511 place count 79 transition count 236
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1512 place count 79 transition count 235
Applied a total of 1512 rules in 167 ms. Remains 79 /858 variables (removed 779) and now considering 235/1099 (removed 864) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 79/858 places, 235/1099 transitions.
RANDOM walk for 40000 steps (2313 resets) in 969 ms. (41 steps per ms) remains 5/17 properties
BEST_FIRST walk for 40004 steps (403 resets) in 51 ms. (769 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (405 resets) in 86 ms. (459 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40003 steps (405 resets) in 56 ms. (701 steps per ms) remains 2/2 properties
// Phase 1: matrix 235 rows 79 cols
[2024-05-29 12:51:11] [INFO ] Computed 5 invariants in 5 ms
[2024-05-29 12:51:11] [INFO ] State equation strengthened by 48 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 42/45 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 34/79 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 235/314 variables, 79/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 48/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/314 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 132 constraints, problems are : Problem set: 0 solved, 2 unsolved in 114 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 79/79 constraints, ReadFeed: 48/48 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 42/45 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 34/79 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 235/314 variables, 79/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 48/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/314 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/314 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 134 constraints, problems are : Problem set: 0 solved, 2 unsolved in 139 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 79/79 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 267ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 18 ms.
Support contains 2 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 235/235 transitions.
Graph (trivial) has 62 edges and 79 vertex of which 6 / 79 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 76 transition count 215
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 31 place count 62 transition count 213
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 31 place count 62 transition count 211
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 35 place count 60 transition count 211
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 41 place count 54 transition count 144
Iterating global reduction 2 with 6 rules applied. Total rules applied 47 place count 54 transition count 144
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 52 place count 54 transition count 139
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 52 place count 54 transition count 138
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 54 place count 53 transition count 138
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 55 place count 52 transition count 137
Iterating global reduction 3 with 1 rules applied. Total rules applied 56 place count 52 transition count 137
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 68 place count 46 transition count 131
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 71 place count 46 transition count 128
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 75 place count 42 transition count 124
Iterating global reduction 4 with 4 rules applied. Total rules applied 79 place count 42 transition count 124
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 81 place count 42 transition count 122
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 83 place count 42 transition count 120
Free-agglomeration rule applied 18 times with reduction of 4 identical transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 101 place count 42 transition count 98
Reduce places removed 18 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 32 rules applied. Total rules applied 133 place count 24 transition count 84
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 6 with 27 rules applied. Total rules applied 160 place count 24 transition count 57
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 162 place count 23 transition count 66
Applied a total of 162 rules in 30 ms. Remains 23 /79 variables (removed 56) and now considering 66/235 (removed 169) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 23/79 places, 66/235 transitions.
RANDOM walk for 470 steps (0 resets) in 7 ms. (58 steps per ms) remains 0/1 properties
FORMULA StigmergyCommit-PT-03b-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 165 stabilizing places and 173 stable transitions
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(p1)&&p0) U X(p2)))'
Support contains 3 out of 858 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 858/858 places, 1099/1099 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 852 transition count 1093
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 852 transition count 1093
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 846 transition count 1087
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 846 transition count 1087
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 840 transition count 1081
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 840 transition count 1081
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 834 transition count 1075
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 834 transition count 1075
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 53 place count 829 transition count 1070
Iterating global reduction 0 with 5 rules applied. Total rules applied 58 place count 829 transition count 1070
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 63 place count 824 transition count 1065
Iterating global reduction 0 with 5 rules applied. Total rules applied 68 place count 824 transition count 1065
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 73 place count 819 transition count 1060
Iterating global reduction 0 with 5 rules applied. Total rules applied 78 place count 819 transition count 1060
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 79 place count 819 transition count 1059
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 82 place count 816 transition count 1056
Iterating global reduction 1 with 3 rules applied. Total rules applied 85 place count 816 transition count 1056
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 87 place count 814 transition count 1054
Iterating global reduction 1 with 2 rules applied. Total rules applied 89 place count 814 transition count 1054
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 90 place count 814 transition count 1053
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 91 place count 813 transition count 1052
Iterating global reduction 2 with 1 rules applied. Total rules applied 92 place count 813 transition count 1052
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 93 place count 812 transition count 1051
Iterating global reduction 2 with 1 rules applied. Total rules applied 94 place count 812 transition count 1051
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 95 place count 811 transition count 1050
Iterating global reduction 2 with 1 rules applied. Total rules applied 96 place count 811 transition count 1050
Applied a total of 96 rules in 269 ms. Remains 811 /858 variables (removed 47) and now considering 1050/1099 (removed 49) transitions.
// Phase 1: matrix 1050 rows 811 cols
[2024-05-29 12:51:12] [INFO ] Computed 5 invariants in 7 ms
[2024-05-29 12:51:13] [INFO ] Implicit Places using invariants in 196 ms returned []
[2024-05-29 12:51:13] [INFO ] Invariant cache hit.
[2024-05-29 12:51:13] [INFO ] Implicit Places using invariants and state equation in 558 ms returned []
Implicit Place search using SMT with State Equation took 760 ms to find 0 implicit places.
Running 1049 sub problems to find dead transitions.
[2024-05-29 12:51:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1049 unsolved
At refinement iteration 1 (OVERLAPS) 1/811 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1049 unsolved
[2024-05-29 12:51:37] [INFO ] Deduced a trap composed of 291 places in 236 ms of which 4 ms to minimize.
[2024-05-29 12:51:38] [INFO ] Deduced a trap composed of 292 places in 234 ms of which 4 ms to minimize.
[2024-05-29 12:51:38] [INFO ] Deduced a trap composed of 299 places in 193 ms of which 3 ms to minimize.
[2024-05-29 12:51:38] [INFO ] Deduced a trap composed of 299 places in 233 ms of which 4 ms to minimize.
[2024-05-29 12:51:41] [INFO ] Deduced a trap composed of 291 places in 191 ms of which 3 ms to minimize.
[2024-05-29 12:51:41] [INFO ] Deduced a trap composed of 298 places in 234 ms of which 4 ms to minimize.
[2024-05-29 12:51:41] [INFO ] Deduced a trap composed of 318 places in 195 ms of which 4 ms to minimize.
[2024-05-29 12:51:43] [INFO ] Deduced a trap composed of 313 places in 237 ms of which 4 ms to minimize.
[2024-05-29 12:51:44] [INFO ] Deduced a trap composed of 297 places in 230 ms of which 4 ms to minimize.
SMT process timed out in 30480ms, After SMT, problems are : Problem set: 0 solved, 1049 unsolved
Search for dead transitions found 0 dead transitions in 30492ms
Starting structural reductions in LTL mode, iteration 1 : 811/858 places, 1050/1099 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31526 ms. Remains : 811/858 places, 1050/1099 transitions.
Stuttering acceptance computed with spot in 358 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA StigmergyCommit-PT-03b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03b-LTLFireability-00 finished in 31962 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(X(X((p0&&X(G((G((p2||X(p3)))||p1)))))))))'
Support contains 6 out of 858 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 858/858 places, 1099/1099 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 850 transition count 1091
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 850 transition count 1091
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 842 transition count 1083
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 842 transition count 1083
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 834 transition count 1075
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 834 transition count 1075
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 56 place count 826 transition count 1067
Iterating global reduction 0 with 8 rules applied. Total rules applied 64 place count 826 transition count 1067
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 71 place count 819 transition count 1060
Iterating global reduction 0 with 7 rules applied. Total rules applied 78 place count 819 transition count 1060
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 85 place count 812 transition count 1053
Iterating global reduction 0 with 7 rules applied. Total rules applied 92 place count 812 transition count 1053
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 99 place count 805 transition count 1046
Iterating global reduction 0 with 7 rules applied. Total rules applied 106 place count 805 transition count 1046
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 107 place count 805 transition count 1045
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 112 place count 800 transition count 1040
Iterating global reduction 1 with 5 rules applied. Total rules applied 117 place count 800 transition count 1040
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 121 place count 796 transition count 1036
Iterating global reduction 1 with 4 rules applied. Total rules applied 125 place count 796 transition count 1036
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 126 place count 796 transition count 1035
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 129 place count 793 transition count 1032
Iterating global reduction 2 with 3 rules applied. Total rules applied 132 place count 793 transition count 1032
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 133 place count 793 transition count 1031
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 135 place count 791 transition count 1029
Iterating global reduction 3 with 2 rules applied. Total rules applied 137 place count 791 transition count 1029
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 138 place count 791 transition count 1028
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 139 place count 790 transition count 1027
Iterating global reduction 4 with 1 rules applied. Total rules applied 140 place count 790 transition count 1027
Applied a total of 140 rules in 281 ms. Remains 790 /858 variables (removed 68) and now considering 1027/1099 (removed 72) transitions.
// Phase 1: matrix 1027 rows 790 cols
[2024-05-29 12:51:44] [INFO ] Computed 5 invariants in 9 ms
[2024-05-29 12:51:44] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-29 12:51:44] [INFO ] Invariant cache hit.
[2024-05-29 12:51:45] [INFO ] Implicit Places using invariants and state equation in 537 ms returned []
Implicit Place search using SMT with State Equation took 717 ms to find 0 implicit places.
Running 1026 sub problems to find dead transitions.
[2024-05-29 12:51:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/789 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
At refinement iteration 1 (OVERLAPS) 1/790 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
[2024-05-29 12:52:12] [INFO ] Deduced a trap composed of 297 places in 276 ms of which 5 ms to minimize.
[2024-05-29 12:52:12] [INFO ] Deduced a trap composed of 290 places in 221 ms of which 4 ms to minimize.
[2024-05-29 12:52:13] [INFO ] Deduced a trap composed of 297 places in 192 ms of which 3 ms to minimize.
[2024-05-29 12:52:13] [INFO ] Deduced a trap composed of 298 places in 199 ms of which 4 ms to minimize.
[2024-05-29 12:52:15] [INFO ] Deduced a trap composed of 297 places in 186 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 790/1817 variables, and 10 constraints, problems are : Problem set: 0 solved, 1026 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/790 constraints, PredecessorRefiner: 1026/1026 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1026 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/789 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
At refinement iteration 1 (OVERLAPS) 1/790 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/790 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
[2024-05-29 12:52:28] [INFO ] Deduced a trap composed of 292 places in 180 ms of which 4 ms to minimize.
[2024-05-29 12:52:35] [INFO ] Deduced a trap composed of 291 places in 237 ms of which 4 ms to minimize.
[2024-05-29 12:52:36] [INFO ] Deduced a trap composed of 299 places in 187 ms of which 4 ms to minimize.
[2024-05-29 12:52:38] [INFO ] Deduced a trap composed of 293 places in 174 ms of which 4 ms to minimize.
[2024-05-29 12:52:39] [INFO ] Deduced a trap composed of 299 places in 187 ms of which 4 ms to minimize.
[2024-05-29 12:52:40] [INFO ] Deduced a trap composed of 293 places in 198 ms of which 4 ms to minimize.
[2024-05-29 12:52:41] [INFO ] Deduced a trap composed of 299 places in 182 ms of which 4 ms to minimize.
[2024-05-29 12:52:41] [INFO ] Deduced a trap composed of 293 places in 173 ms of which 4 ms to minimize.
[2024-05-29 12:52:42] [INFO ] Deduced a trap composed of 293 places in 191 ms of which 3 ms to minimize.
[2024-05-29 12:52:43] [INFO ] Deduced a trap composed of 292 places in 223 ms of which 4 ms to minimize.
[2024-05-29 12:52:43] [INFO ] Deduced a trap composed of 292 places in 201 ms of which 4 ms to minimize.
[2024-05-29 12:52:43] [INFO ] Deduced a trap composed of 299 places in 198 ms of which 4 ms to minimize.
[2024-05-29 12:52:44] [INFO ] Deduced a trap composed of 291 places in 184 ms of which 5 ms to minimize.
[2024-05-29 12:52:44] [INFO ] Deduced a trap composed of 299 places in 193 ms of which 4 ms to minimize.
[2024-05-29 12:52:44] [INFO ] Deduced a trap composed of 297 places in 192 ms of which 3 ms to minimize.
[2024-05-29 12:52:45] [INFO ] Deduced a trap composed of 293 places in 198 ms of which 4 ms to minimize.
[2024-05-29 12:52:45] [INFO ] Deduced a trap composed of 299 places in 225 ms of which 4 ms to minimize.
[2024-05-29 12:52:45] [INFO ] Deduced a trap composed of 299 places in 218 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 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 1)
(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 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 1)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 timeout
0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 790/1817 variables, and 28 constraints, problems are : Problem set: 0 solved, 1026 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/790 constraints, PredecessorRefiner: 0/1026 constraints, Known Traps: 23/23 constraints]
After SMT, in 60447ms problems are : Problem set: 0 solved, 1026 unsolved
Search for dead transitions found 0 dead transitions in 60459ms
Starting structural reductions in LTL mode, iteration 1 : 790/858 places, 1027/1099 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61460 ms. Remains : 790/858 places, 1027/1099 transitions.
Stuttering acceptance computed with spot in 397 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p3), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3)))]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-02
Product exploration explored 100000 steps with 1285 reset in 235 ms.
Product exploration explored 100000 steps with 1285 reset in 177 ms.
Computed a total of 164 stabilizing places and 172 stable transitions
Computed a total of 164 stabilizing places and 172 stable transitions
Knowledge obtained : [(AND p0 p3 p2 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 98 ms. Reduced automaton from 9 states, 15 edges and 4 AP (stutter sensitive) to 9 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 391 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p3), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3)))]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 40000 steps (514 resets) in 505 ms. (79 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40002 steps (108 resets) in 96 ms. (412 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (109 resets) in 123 ms. (322 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (106 resets) in 81 ms. (487 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (105 resets) in 37 ms. (1052 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (107 resets) in 47 ms. (833 steps per ms) remains 5/5 properties
[2024-05-29 12:52:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem apf5 is UNSAT
At refinement iteration 1 (OVERLAPS) 770/776 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/776 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 14/790 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/790 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1027/1817 variables, 790/795 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1817 variables, 0/795 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/1817 variables, 0/795 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1817/1817 variables, and 795 constraints, problems are : Problem set: 1 solved, 4 unsolved in 1266 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 790/790 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 770/776 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/776 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 14/790 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/790 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1027/1817 variables, 790/795 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1817 variables, 4/799 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1817 variables, 0/799 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/1817 variables, 0/799 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1817/1817 variables, and 799 constraints, problems are : Problem set: 1 solved, 4 unsolved in 1006 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 790/790 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 2284ms problems are : Problem set: 1 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 2 properties in 1752 ms.
Support contains 2 out of 790 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 790/790 places, 1027/1027 transitions.
Graph (trivial) has 784 edges and 790 vertex of which 61 / 790 are part of one of the 11 SCC in 1 ms
Free SCC test removed 50 places
Drop transitions (Empty/Sink Transition effects.) removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Graph (complete) has 1188 edges and 740 vertex of which 736 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 551 transitions
Trivial Post-agglo rules discarded 551 transitions
Performed 551 trivial Post agglomeration. Transition count delta: 551
Iterating post reduction 0 with 555 rules applied. Total rules applied 557 place count 736 transition count 404
Reduce places removed 551 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 565 rules applied. Total rules applied 1122 place count 185 transition count 390
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 7 rules applied. Total rules applied 1129 place count 180 transition count 388
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1131 place count 178 transition count 388
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 1131 place count 178 transition count 342
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 1223 place count 132 transition count 342
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1224 place count 132 transition count 341
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 1282 place count 103 transition count 312
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 1289 place count 103 transition count 305
Discarding 24 places :
Symmetric choice reduction at 6 with 24 rule applications. Total rules 1313 place count 79 transition count 152
Iterating global reduction 6 with 24 rules applied. Total rules applied 1337 place count 79 transition count 152
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 1350 place count 79 transition count 139
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 1361 place count 68 transition count 128
Iterating global reduction 7 with 11 rules applied. Total rules applied 1372 place count 68 transition count 128
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1380 place count 60 transition count 120
Iterating global reduction 7 with 8 rules applied. Total rules applied 1388 place count 60 transition count 120
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1392 place count 60 transition count 116
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 1402 place count 55 transition count 111
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1410 place count 51 transition count 132
Free-agglomeration rule applied 21 times with reduction of 7 identical transitions.
Iterating global reduction 8 with 21 rules applied. Total rules applied 1431 place count 51 transition count 104
Reduce places removed 21 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 27 rules applied. Total rules applied 1458 place count 30 transition count 98
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 1462 place count 26 transition count 94
Iterating global reduction 9 with 4 rules applied. Total rules applied 1466 place count 26 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1467 place count 26 transition count 93
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 10 with 26 rules applied. Total rules applied 1493 place count 26 transition count 67
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 1497 place count 24 transition count 85
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 1501 place count 24 transition count 81
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1503 place count 24 transition count 81
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 1504 place count 24 transition count 80
Applied a total of 1504 rules in 61 ms. Remains 24 /790 variables (removed 766) and now considering 80/1027 (removed 947) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 24/790 places, 80/1027 transitions.
RANDOM walk for 343 steps (0 resets) in 4 ms. (68 steps per ms) remains 0/2 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p3 p2 p1), (G (OR p1 p2))]
False Knowledge obtained : [(F (NOT p3)), (F (NOT p0)), (F (NOT (OR p1 (NOT p2)))), (F (NOT p2)), (F (NOT (AND p2 p3))), (F (NOT (OR p2 (NOT p3)))), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 281 ms. Reduced automaton from 9 states, 15 edges and 4 AP (stutter sensitive) to 9 states, 14 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 411 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p3), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3)))]
Stuttering acceptance computed with spot in 362 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p3), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3)))]
Support contains 6 out of 790 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 790/790 places, 1027/1027 transitions.
Applied a total of 0 rules in 22 ms. Remains 790 /790 variables (removed 0) and now considering 1027/1027 (removed 0) transitions.
[2024-05-29 12:52:52] [INFO ] Invariant cache hit.
[2024-05-29 12:52:53] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-05-29 12:52:53] [INFO ] Invariant cache hit.
[2024-05-29 12:52:53] [INFO ] Implicit Places using invariants and state equation in 514 ms returned []
Implicit Place search using SMT with State Equation took 678 ms to find 0 implicit places.
Running 1026 sub problems to find dead transitions.
[2024-05-29 12:52:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/789 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
At refinement iteration 1 (OVERLAPS) 1/790 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
[2024-05-29 12:53:20] [INFO ] Deduced a trap composed of 297 places in 262 ms of which 6 ms to minimize.
[2024-05-29 12:53:21] [INFO ] Deduced a trap composed of 290 places in 195 ms of which 8 ms to minimize.
[2024-05-29 12:53:21] [INFO ] Deduced a trap composed of 297 places in 190 ms of which 4 ms to minimize.
[2024-05-29 12:53:22] [INFO ] Deduced a trap composed of 298 places in 195 ms of which 6 ms to minimize.
[2024-05-29 12:53:23] [INFO ] Deduced a trap composed of 297 places in 192 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 790/1817 variables, and 10 constraints, problems are : Problem set: 0 solved, 1026 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/790 constraints, PredecessorRefiner: 1026/1026 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1026 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/789 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
At refinement iteration 1 (OVERLAPS) 1/790 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/790 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
[2024-05-29 12:53:36] [INFO ] Deduced a trap composed of 292 places in 190 ms of which 3 ms to minimize.
[2024-05-29 12:53:43] [INFO ] Deduced a trap composed of 291 places in 231 ms of which 4 ms to minimize.
[2024-05-29 12:53:44] [INFO ] Deduced a trap composed of 299 places in 196 ms of which 4 ms to minimize.
[2024-05-29 12:53:45] [INFO ] Deduced a trap composed of 293 places in 178 ms of which 3 ms to minimize.
[2024-05-29 12:53:47] [INFO ] Deduced a trap composed of 299 places in 197 ms of which 4 ms to minimize.
[2024-05-29 12:53:47] [INFO ] Deduced a trap composed of 293 places in 197 ms of which 3 ms to minimize.
[2024-05-29 12:53:49] [INFO ] Deduced a trap composed of 299 places in 196 ms of which 3 ms to minimize.
[2024-05-29 12:53:49] [INFO ] Deduced a trap composed of 293 places in 185 ms of which 3 ms to minimize.
[2024-05-29 12:53:50] [INFO ] Deduced a trap composed of 293 places in 197 ms of which 3 ms to minimize.
[2024-05-29 12:53:51] [INFO ] Deduced a trap composed of 292 places in 236 ms of which 4 ms to minimize.
[2024-05-29 12:53:51] [INFO ] Deduced a trap composed of 292 places in 213 ms of which 3 ms to minimize.
[2024-05-29 12:53:51] [INFO ] Deduced a trap composed of 299 places in 208 ms of which 3 ms to minimize.
[2024-05-29 12:53:51] [INFO ] Deduced a trap composed of 291 places in 199 ms of which 4 ms to minimize.
[2024-05-29 12:53:52] [INFO ] Deduced a trap composed of 299 places in 202 ms of which 3 ms to minimize.
[2024-05-29 12:53:52] [INFO ] Deduced a trap composed of 297 places in 206 ms of which 3 ms to minimize.
[2024-05-29 12:53:52] [INFO ] Deduced a trap composed of 293 places in 225 ms of which 4 ms to minimize.
[2024-05-29 12:53:53] [INFO ] Deduced a trap composed of 299 places in 233 ms of which 5 ms to minimize.
[2024-05-29 12:53:53] [INFO ] Deduced a trap composed of 299 places in 222 ms of which 4 ms to minimize.
[2024-05-29 12:53:54] [INFO ] Deduced a trap composed of 298 places in 247 ms of which 5 ms to minimize.
SMT process timed out in 60518ms, After SMT, problems are : Problem set: 0 solved, 1026 unsolved
Search for dead transitions found 0 dead transitions in 60529ms
Finished structural reductions in LTL mode , in 1 iterations and 61233 ms. Remains : 790/790 places, 1027/1027 transitions.
Computed a total of 164 stabilizing places and 172 stable transitions
Computed a total of 164 stabilizing places and 172 stable transitions
Knowledge obtained : [(AND p0 p3 p2 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 77 ms. Reduced automaton from 9 states, 14 edges and 4 AP (stutter sensitive) to 9 states, 14 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 378 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p3), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3)))]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (517 resets) in 168 ms. (236 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40003 steps (107 resets) in 25 ms. (1538 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (107 resets) in 29 ms. (1333 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (109 resets) in 27 ms. (1428 steps per ms) remains 3/3 properties
[2024-05-29 12:53:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 770/776 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/776 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 14/790 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/790 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1027/1817 variables, 790/795 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1817 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/1817 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1817/1817 variables, and 795 constraints, problems are : Problem set: 0 solved, 3 unsolved in 887 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 790/790 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 770/776 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/776 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 14/790 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/790 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1027/1817 variables, 790/795 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1817 variables, 3/798 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1817 variables, 0/798 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/1817 variables, 0/798 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1817/1817 variables, and 798 constraints, problems are : Problem set: 0 solved, 3 unsolved in 850 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 790/790 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1746ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 1 properties in 827 ms.
Support contains 2 out of 790 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 790/790 places, 1027/1027 transitions.
Graph (trivial) has 784 edges and 790 vertex of which 61 / 790 are part of one of the 11 SCC in 2 ms
Free SCC test removed 50 places
Drop transitions (Empty/Sink Transition effects.) removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Graph (complete) has 1188 edges and 740 vertex of which 736 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 551 transitions
Trivial Post-agglo rules discarded 551 transitions
Performed 551 trivial Post agglomeration. Transition count delta: 551
Iterating post reduction 0 with 555 rules applied. Total rules applied 557 place count 736 transition count 404
Reduce places removed 551 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 565 rules applied. Total rules applied 1122 place count 185 transition count 390
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 7 rules applied. Total rules applied 1129 place count 180 transition count 388
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1131 place count 178 transition count 388
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 1131 place count 178 transition count 342
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 1223 place count 132 transition count 342
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1224 place count 132 transition count 341
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 1282 place count 103 transition count 312
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 1289 place count 103 transition count 305
Discarding 24 places :
Symmetric choice reduction at 6 with 24 rule applications. Total rules 1313 place count 79 transition count 152
Iterating global reduction 6 with 24 rules applied. Total rules applied 1337 place count 79 transition count 152
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 1350 place count 79 transition count 139
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 1361 place count 68 transition count 128
Iterating global reduction 7 with 11 rules applied. Total rules applied 1372 place count 68 transition count 128
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1380 place count 60 transition count 120
Iterating global reduction 7 with 8 rules applied. Total rules applied 1388 place count 60 transition count 120
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1392 place count 60 transition count 116
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 1402 place count 55 transition count 111
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1410 place count 51 transition count 132
Free-agglomeration rule applied 21 times with reduction of 7 identical transitions.
Iterating global reduction 8 with 21 rules applied. Total rules applied 1431 place count 51 transition count 104
Reduce places removed 21 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 27 rules applied. Total rules applied 1458 place count 30 transition count 98
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 1462 place count 26 transition count 94
Iterating global reduction 9 with 4 rules applied. Total rules applied 1466 place count 26 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1467 place count 26 transition count 93
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 10 with 26 rules applied. Total rules applied 1493 place count 26 transition count 67
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 1497 place count 24 transition count 85
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 1501 place count 24 transition count 81
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1503 place count 24 transition count 81
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 1504 place count 24 transition count 80
Applied a total of 1504 rules in 39 ms. Remains 24 /790 variables (removed 766) and now considering 80/1027 (removed 947) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 24/790 places, 80/1027 transitions.
RANDOM walk for 322 steps (0 resets) in 4 ms. (64 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p3 p2 p1)]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p2 p3))), (F (NOT p3)), (F (NOT p2)), (F (NOT (OR p2 (NOT p3)))), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 272 ms. Reduced automaton from 9 states, 14 edges and 4 AP (stutter sensitive) to 9 states, 14 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 412 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p3), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3)))]
Stuttering acceptance computed with spot in 398 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p3), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3)))]
Stuttering acceptance computed with spot in 402 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p3), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3)))]
Product exploration explored 100000 steps with 1281 reset in 127 ms.
Product exploration explored 100000 steps with 1272 reset in 148 ms.
Support contains 6 out of 790 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 790/790 places, 1027/1027 transitions.
Applied a total of 0 rules in 21 ms. Remains 790 /790 variables (removed 0) and now considering 1027/1027 (removed 0) transitions.
[2024-05-29 12:53:59] [INFO ] Invariant cache hit.
[2024-05-29 12:53:59] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-29 12:53:59] [INFO ] Invariant cache hit.
[2024-05-29 12:54:00] [INFO ] Implicit Places using invariants and state equation in 521 ms returned []
Implicit Place search using SMT with State Equation took 692 ms to find 0 implicit places.
Running 1026 sub problems to find dead transitions.
[2024-05-29 12:54:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/789 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
At refinement iteration 1 (OVERLAPS) 1/790 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
[2024-05-29 12:54:27] [INFO ] Deduced a trap composed of 297 places in 286 ms of which 5 ms to minimize.
[2024-05-29 12:54:27] [INFO ] Deduced a trap composed of 290 places in 191 ms of which 4 ms to minimize.
[2024-05-29 12:54:27] [INFO ] Deduced a trap composed of 297 places in 185 ms of which 4 ms to minimize.
[2024-05-29 12:54:28] [INFO ] Deduced a trap composed of 298 places in 203 ms of which 4 ms to minimize.
[2024-05-29 12:54:30] [INFO ] Deduced a trap composed of 297 places in 203 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 790/1817 variables, and 10 constraints, problems are : Problem set: 0 solved, 1026 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/790 constraints, PredecessorRefiner: 1026/1026 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1026 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/789 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
At refinement iteration 1 (OVERLAPS) 1/790 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/790 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
[2024-05-29 12:54:43] [INFO ] Deduced a trap composed of 292 places in 196 ms of which 4 ms to minimize.
[2024-05-29 12:54:50] [INFO ] Deduced a trap composed of 291 places in 241 ms of which 5 ms to minimize.
[2024-05-29 12:54:51] [INFO ] Deduced a trap composed of 299 places in 191 ms of which 3 ms to minimize.
[2024-05-29 12:54:52] [INFO ] Deduced a trap composed of 293 places in 180 ms of which 4 ms to minimize.
[2024-05-29 12:54:54] [INFO ] Deduced a trap composed of 299 places in 194 ms of which 4 ms to minimize.
[2024-05-29 12:54:55] [INFO ] Deduced a trap composed of 293 places in 203 ms of which 3 ms to minimize.
[2024-05-29 12:54:56] [INFO ] Deduced a trap composed of 299 places in 191 ms of which 3 ms to minimize.
[2024-05-29 12:54:56] [INFO ] Deduced a trap composed of 293 places in 183 ms of which 4 ms to minimize.
[2024-05-29 12:54:57] [INFO ] Deduced a trap composed of 293 places in 202 ms of which 4 ms to minimize.
[2024-05-29 12:54:58] [INFO ] Deduced a trap composed of 292 places in 237 ms of which 4 ms to minimize.
[2024-05-29 12:54:58] [INFO ] Deduced a trap composed of 292 places in 215 ms of which 4 ms to minimize.
[2024-05-29 12:54:59] [INFO ] Deduced a trap composed of 299 places in 196 ms of which 4 ms to minimize.
[2024-05-29 12:54:59] [INFO ] Deduced a trap composed of 291 places in 208 ms of which 4 ms to minimize.
[2024-05-29 12:54:59] [INFO ] Deduced a trap composed of 299 places in 195 ms of which 3 ms to minimize.
[2024-05-29 12:55:00] [INFO ] Deduced a trap composed of 297 places in 205 ms of which 4 ms to minimize.
[2024-05-29 12:55:00] [INFO ] Deduced a trap composed of 293 places in 235 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 790/1817 variables, and 26 constraints, problems are : Problem set: 0 solved, 1026 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/790 constraints, PredecessorRefiner: 0/1026 constraints, Known Traps: 21/21 constraints]
After SMT, in 60427ms problems are : Problem set: 0 solved, 1026 unsolved
Search for dead transitions found 0 dead transitions in 60437ms
Finished structural reductions in LTL mode , in 1 iterations and 61158 ms. Remains : 790/790 places, 1027/1027 transitions.
Treatment of property StigmergyCommit-PT-03b-LTLFireability-02 finished in 196102 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!X(p0) U p1))'
Support contains 2 out of 858 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 858/858 places, 1099/1099 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 851 transition count 1092
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 851 transition count 1092
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 844 transition count 1085
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 844 transition count 1085
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 837 transition count 1078
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 837 transition count 1078
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 49 place count 830 transition count 1071
Iterating global reduction 0 with 7 rules applied. Total rules applied 56 place count 830 transition count 1071
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 62 place count 824 transition count 1065
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 824 transition count 1065
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 74 place count 818 transition count 1059
Iterating global reduction 0 with 6 rules applied. Total rules applied 80 place count 818 transition count 1059
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 86 place count 812 transition count 1053
Iterating global reduction 0 with 6 rules applied. Total rules applied 92 place count 812 transition count 1053
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 93 place count 812 transition count 1052
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 97 place count 808 transition count 1048
Iterating global reduction 1 with 4 rules applied. Total rules applied 101 place count 808 transition count 1048
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 104 place count 805 transition count 1045
Iterating global reduction 1 with 3 rules applied. Total rules applied 107 place count 805 transition count 1045
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 110 place count 802 transition count 1042
Iterating global reduction 1 with 3 rules applied. Total rules applied 113 place count 802 transition count 1042
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 114 place count 802 transition count 1041
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 116 place count 800 transition count 1039
Iterating global reduction 2 with 2 rules applied. Total rules applied 118 place count 800 transition count 1039
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 119 place count 800 transition count 1038
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 120 place count 799 transition count 1037
Iterating global reduction 3 with 1 rules applied. Total rules applied 121 place count 799 transition count 1037
Applied a total of 121 rules in 244 ms. Remains 799 /858 variables (removed 59) and now considering 1037/1099 (removed 62) transitions.
// Phase 1: matrix 1037 rows 799 cols
[2024-05-29 12:55:00] [INFO ] Computed 5 invariants in 11 ms
[2024-05-29 12:55:01] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-29 12:55:01] [INFO ] Invariant cache hit.
[2024-05-29 12:55:01] [INFO ] Implicit Places using invariants and state equation in 533 ms returned []
Implicit Place search using SMT with State Equation took 713 ms to find 0 implicit places.
Running 1036 sub problems to find dead transitions.
[2024-05-29 12:55:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/798 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
At refinement iteration 1 (OVERLAPS) 1/799 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
[2024-05-29 12:55:28] [INFO ] Deduced a trap composed of 297 places in 274 ms of which 5 ms to minimize.
[2024-05-29 12:55:29] [INFO ] Deduced a trap composed of 299 places in 195 ms of which 3 ms to minimize.
[2024-05-29 12:55:29] [INFO ] Deduced a trap composed of 297 places in 189 ms of which 3 ms to minimize.
[2024-05-29 12:55:30] [INFO ] Deduced a trap composed of 307 places in 194 ms of which 4 ms to minimize.
[2024-05-29 12:55:31] [INFO ] Deduced a trap composed of 297 places in 259 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 799/1836 variables, and 10 constraints, problems are : Problem set: 0 solved, 1036 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/799 constraints, PredecessorRefiner: 1036/1036 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1036 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/798 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
At refinement iteration 1 (OVERLAPS) 1/799 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/799 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
[2024-05-29 12:55:45] [INFO ] Deduced a trap composed of 292 places in 202 ms of which 3 ms to minimize.
[2024-05-29 12:55:51] [INFO ] Deduced a trap composed of 291 places in 207 ms of which 3 ms to minimize.
[2024-05-29 12:55:52] [INFO ] Deduced a trap composed of 291 places in 244 ms of which 4 ms to minimize.
[2024-05-29 12:55:54] [INFO ] Deduced a trap composed of 293 places in 184 ms of which 3 ms to minimize.
[2024-05-29 12:55:55] [INFO ] Deduced a trap composed of 292 places in 193 ms of which 3 ms to minimize.
[2024-05-29 12:55:56] [INFO ] Deduced a trap composed of 299 places in 186 ms of which 3 ms to minimize.
[2024-05-29 12:55:57] [INFO ] Deduced a trap composed of 293 places in 215 ms of which 4 ms to minimize.
[2024-05-29 12:55:58] [INFO ] Deduced a trap composed of 293 places in 215 ms of which 3 ms to minimize.
[2024-05-29 12:56:00] [INFO ] Deduced a trap composed of 292 places in 180 ms of which 3 ms to minimize.
[2024-05-29 12:56:01] [INFO ] Deduced a trap composed of 308 places in 234 ms of which 4 ms to minimize.
[2024-05-29 12:56:01] [INFO ] Deduced a trap composed of 299 places in 237 ms of which 4 ms to minimize.
[2024-05-29 12:56:02] [INFO ] Deduced a trap composed of 299 places in 293 ms of which 6 ms to minimize.
SMT process timed out in 60549ms, After SMT, problems are : Problem set: 0 solved, 1036 unsolved
Search for dead transitions found 0 dead transitions in 60566ms
Starting structural reductions in LTL mode, iteration 1 : 799/858 places, 1037/1099 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61525 ms. Remains : 799/858 places, 1037/1099 transitions.
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p1), (OR (NOT p1) p0)]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-03
Stuttering criterion allowed to conclude after 63 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-03b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03b-LTLFireability-03 finished in 61644 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)))))'
Support contains 2 out of 858 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 858/858 places, 1099/1099 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 852 transition count 1093
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 852 transition count 1093
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 846 transition count 1087
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 846 transition count 1087
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 840 transition count 1081
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 840 transition count 1081
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 834 transition count 1075
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 834 transition count 1075
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 54 place count 828 transition count 1069
Iterating global reduction 0 with 6 rules applied. Total rules applied 60 place count 828 transition count 1069
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 66 place count 822 transition count 1063
Iterating global reduction 0 with 6 rules applied. Total rules applied 72 place count 822 transition count 1063
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 78 place count 816 transition count 1057
Iterating global reduction 0 with 6 rules applied. Total rules applied 84 place count 816 transition count 1057
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 85 place count 816 transition count 1056
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 89 place count 812 transition count 1052
Iterating global reduction 1 with 4 rules applied. Total rules applied 93 place count 812 transition count 1052
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 97 place count 808 transition count 1048
Iterating global reduction 1 with 4 rules applied. Total rules applied 101 place count 808 transition count 1048
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 102 place count 808 transition count 1047
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 105 place count 805 transition count 1044
Iterating global reduction 2 with 3 rules applied. Total rules applied 108 place count 805 transition count 1044
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 109 place count 805 transition count 1043
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 111 place count 803 transition count 1041
Iterating global reduction 3 with 2 rules applied. Total rules applied 113 place count 803 transition count 1041
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 114 place count 803 transition count 1040
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 115 place count 802 transition count 1039
Iterating global reduction 4 with 1 rules applied. Total rules applied 116 place count 802 transition count 1039
Applied a total of 116 rules in 228 ms. Remains 802 /858 variables (removed 56) and now considering 1039/1099 (removed 60) transitions.
// Phase 1: matrix 1039 rows 802 cols
[2024-05-29 12:56:02] [INFO ] Computed 5 invariants in 5 ms
[2024-05-29 12:56:02] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-05-29 12:56:02] [INFO ] Invariant cache hit.
[2024-05-29 12:56:03] [INFO ] Implicit Places using invariants and state equation in 523 ms returned []
Implicit Place search using SMT with State Equation took 750 ms to find 0 implicit places.
Running 1038 sub problems to find dead transitions.
[2024-05-29 12:56:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/801 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1038 unsolved
At refinement iteration 1 (OVERLAPS) 1/802 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1038 unsolved
[2024-05-29 12:56:30] [INFO ] Deduced a trap composed of 290 places in 257 ms of which 5 ms to minimize.
[2024-05-29 12:56:30] [INFO ] Deduced a trap composed of 290 places in 197 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 802/1841 variables, and 7 constraints, problems are : Problem set: 0 solved, 1038 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/802 constraints, PredecessorRefiner: 1038/1038 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1038 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/801 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1038 unsolved
At refinement iteration 1 (OVERLAPS) 1/802 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1038 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/802 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1038 unsolved
[2024-05-29 12:56:52] [INFO ] Deduced a trap composed of 292 places in 242 ms of which 4 ms to minimize.
[2024-05-29 12:56:56] [INFO ] Deduced a trap composed of 303 places in 201 ms of which 3 ms to minimize.
[2024-05-29 12:56:57] [INFO ] Deduced a trap composed of 307 places in 183 ms of which 4 ms to minimize.
[2024-05-29 12:57:00] [INFO ] Deduced a trap composed of 301 places in 204 ms of which 4 ms to minimize.
[2024-05-29 12:57:00] [INFO ] Deduced a trap composed of 299 places in 226 ms of which 4 ms to minimize.
[2024-05-29 12:57:00] [INFO ] Deduced a trap composed of 296 places in 228 ms of which 4 ms to minimize.
[2024-05-29 12:57:01] [INFO ] Deduced a trap composed of 298 places in 262 ms of which 5 ms to minimize.
[2024-05-29 12:57:01] [INFO ] Deduced a trap composed of 299 places in 244 ms of which 5 ms to minimize.
[2024-05-29 12:57:01] [INFO ] Deduced a trap composed of 299 places in 225 ms of which 4 ms to minimize.
[2024-05-29 12:57:02] [INFO ] Deduced a trap composed of 297 places in 266 ms of which 5 ms to minimize.
[2024-05-29 12:57:02] [INFO ] Deduced a trap composed of 301 places in 273 ms of which 5 ms to minimize.
[2024-05-29 12:57:02] [INFO ] Deduced a trap composed of 299 places in 289 ms of which 4 ms to minimize.
[2024-05-29 12:57:02] [INFO ] Deduced a trap composed of 296 places in 195 ms of which 4 ms to minimize.
[2024-05-29 12:57:03] [INFO ] Deduced a trap composed of 299 places in 213 ms of which 4 ms to minimize.
[2024-05-29 12:57:03] [INFO ] Deduced a trap composed of 291 places in 214 ms of which 4 ms to minimize.
SMT process timed out in 60525ms, After SMT, problems are : Problem set: 0 solved, 1038 unsolved
Search for dead transitions found 0 dead transitions in 60539ms
Starting structural reductions in LTL mode, iteration 1 : 802/858 places, 1039/1099 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61523 ms. Remains : 802/858 places, 1039/1099 transitions.
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-03b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03b-LTLFireability-05 finished in 61681 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(X(G(p0)))))'
Support contains 4 out of 858 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 858/858 places, 1099/1099 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 850 transition count 1091
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 850 transition count 1091
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 842 transition count 1083
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 842 transition count 1083
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 834 transition count 1075
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 834 transition count 1075
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 56 place count 826 transition count 1067
Iterating global reduction 0 with 8 rules applied. Total rules applied 64 place count 826 transition count 1067
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 71 place count 819 transition count 1060
Iterating global reduction 0 with 7 rules applied. Total rules applied 78 place count 819 transition count 1060
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 85 place count 812 transition count 1053
Iterating global reduction 0 with 7 rules applied. Total rules applied 92 place count 812 transition count 1053
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 99 place count 805 transition count 1046
Iterating global reduction 0 with 7 rules applied. Total rules applied 106 place count 805 transition count 1046
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 107 place count 805 transition count 1045
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 112 place count 800 transition count 1040
Iterating global reduction 1 with 5 rules applied. Total rules applied 117 place count 800 transition count 1040
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 121 place count 796 transition count 1036
Iterating global reduction 1 with 4 rules applied. Total rules applied 125 place count 796 transition count 1036
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 126 place count 796 transition count 1035
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 129 place count 793 transition count 1032
Iterating global reduction 2 with 3 rules applied. Total rules applied 132 place count 793 transition count 1032
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 133 place count 793 transition count 1031
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 135 place count 791 transition count 1029
Iterating global reduction 3 with 2 rules applied. Total rules applied 137 place count 791 transition count 1029
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 138 place count 791 transition count 1028
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 139 place count 790 transition count 1027
Iterating global reduction 4 with 1 rules applied. Total rules applied 140 place count 790 transition count 1027
Applied a total of 140 rules in 229 ms. Remains 790 /858 variables (removed 68) and now considering 1027/1099 (removed 72) transitions.
// Phase 1: matrix 1027 rows 790 cols
[2024-05-29 12:57:04] [INFO ] Computed 5 invariants in 11 ms
[2024-05-29 12:57:04] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-05-29 12:57:04] [INFO ] Invariant cache hit.
[2024-05-29 12:57:04] [INFO ] Implicit Places using invariants and state equation in 542 ms returned []
Implicit Place search using SMT with State Equation took 706 ms to find 0 implicit places.
Running 1026 sub problems to find dead transitions.
[2024-05-29 12:57:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/789 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
At refinement iteration 1 (OVERLAPS) 1/790 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
[2024-05-29 12:57:32] [INFO ] Deduced a trap composed of 297 places in 277 ms of which 5 ms to minimize.
[2024-05-29 12:57:32] [INFO ] Deduced a trap composed of 290 places in 199 ms of which 4 ms to minimize.
[2024-05-29 12:57:32] [INFO ] Deduced a trap composed of 297 places in 197 ms of which 3 ms to minimize.
[2024-05-29 12:57:33] [INFO ] Deduced a trap composed of 298 places in 188 ms of which 4 ms to minimize.
[2024-05-29 12:57:35] [INFO ] Deduced a trap composed of 297 places in 204 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 790/1817 variables, and 10 constraints, problems are : Problem set: 0 solved, 1026 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/790 constraints, PredecessorRefiner: 1026/1026 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1026 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/789 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
At refinement iteration 1 (OVERLAPS) 1/790 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/790 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
[2024-05-29 12:57:47] [INFO ] Deduced a trap composed of 292 places in 200 ms of which 3 ms to minimize.
[2024-05-29 12:57:54] [INFO ] Deduced a trap composed of 291 places in 230 ms of which 5 ms to minimize.
[2024-05-29 12:57:55] [INFO ] Deduced a trap composed of 299 places in 193 ms of which 4 ms to minimize.
[2024-05-29 12:57:56] [INFO ] Deduced a trap composed of 293 places in 182 ms of which 5 ms to minimize.
[2024-05-29 12:57:58] [INFO ] Deduced a trap composed of 299 places in 196 ms of which 3 ms to minimize.
[2024-05-29 12:57:59] [INFO ] Deduced a trap composed of 293 places in 191 ms of which 4 ms to minimize.
[2024-05-29 12:58:00] [INFO ] Deduced a trap composed of 299 places in 186 ms of which 4 ms to minimize.
[2024-05-29 12:58:00] [INFO ] Deduced a trap composed of 293 places in 178 ms of which 4 ms to minimize.
[2024-05-29 12:58:01] [INFO ] Deduced a trap composed of 293 places in 179 ms of which 4 ms to minimize.
[2024-05-29 12:58:02] [INFO ] Deduced a trap composed of 292 places in 232 ms of which 4 ms to minimize.
[2024-05-29 12:58:02] [INFO ] Deduced a trap composed of 292 places in 194 ms of which 4 ms to minimize.
[2024-05-29 12:58:02] [INFO ] Deduced a trap composed of 299 places in 200 ms of which 4 ms to minimize.
[2024-05-29 12:58:02] [INFO ] Deduced a trap composed of 291 places in 188 ms of which 3 ms to minimize.
[2024-05-29 12:58:03] [INFO ] Deduced a trap composed of 299 places in 194 ms of which 4 ms to minimize.
[2024-05-29 12:58:03] [INFO ] Deduced a trap composed of 297 places in 197 ms of which 4 ms to minimize.
[2024-05-29 12:58:03] [INFO ] Deduced a trap composed of 293 places in 205 ms of which 4 ms to minimize.
[2024-05-29 12:58:04] [INFO ] Deduced a trap composed of 299 places in 219 ms of which 5 ms to minimize.
[2024-05-29 12:58:04] [INFO ] Deduced a trap composed of 299 places in 211 ms of which 4 ms to minimize.
[2024-05-29 12:58:05] [INFO ] Deduced a trap composed of 298 places in 234 ms of which 5 ms to minimize.
SMT process timed out in 60380ms, After SMT, problems are : Problem set: 0 solved, 1026 unsolved
Search for dead transitions found 0 dead transitions in 60390ms
Starting structural reductions in LTL mode, iteration 1 : 790/858 places, 1027/1099 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61328 ms. Remains : 790/858 places, 1027/1099 transitions.
Stuttering acceptance computed with spot in 185 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-07
Product exploration explored 100000 steps with 1289 reset in 166 ms.
Product exploration explored 100000 steps with 1279 reset in 194 ms.
Computed a total of 164 stabilizing places and 172 stable transitions
Computed a total of 164 stabilizing places and 172 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 71 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (510 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (109 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 861877 steps, run timeout after 3001 ms. (steps per millisecond=287 ) properties seen :0 out of 1
Probabilistic random walk after 861877 steps, saw 162821 distinct states, run finished after 3005 ms. (steps per millisecond=286 ) properties seen :0
[2024-05-29 12:58:09] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 772/776 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/776 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/790 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/790 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1027/1817 variables, 790/795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1817 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/1817 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1817/1817 variables, and 795 constraints, problems are : Problem set: 0 solved, 1 unsolved in 356 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 790/790 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 772/776 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/776 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/790 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/790 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1027/1817 variables, 790/795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1817 variables, 1/796 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1817 variables, 0/796 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1817 variables, 0/796 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1817/1817 variables, and 796 constraints, problems are : Problem set: 0 solved, 1 unsolved in 519 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 790/790 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 904ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 10376 steps, including 124 resets, run visited all 1 properties in 17 ms. (steps per millisecond=610 )
Parikh walk visited 1 properties in 21 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 94 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 279 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 178 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 790 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 790/790 places, 1027/1027 transitions.
Applied a total of 0 rules in 23 ms. Remains 790 /790 variables (removed 0) and now considering 1027/1027 (removed 0) transitions.
[2024-05-29 12:58:10] [INFO ] Invariant cache hit.
[2024-05-29 12:58:10] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-05-29 12:58:10] [INFO ] Invariant cache hit.
[2024-05-29 12:58:11] [INFO ] Implicit Places using invariants and state equation in 523 ms returned []
Implicit Place search using SMT with State Equation took 687 ms to find 0 implicit places.
Running 1026 sub problems to find dead transitions.
[2024-05-29 12:58:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/789 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
At refinement iteration 1 (OVERLAPS) 1/790 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
[2024-05-29 12:58:38] [INFO ] Deduced a trap composed of 297 places in 269 ms of which 5 ms to minimize.
[2024-05-29 12:58:38] [INFO ] Deduced a trap composed of 290 places in 195 ms of which 3 ms to minimize.
[2024-05-29 12:58:38] [INFO ] Deduced a trap composed of 297 places in 192 ms of which 4 ms to minimize.
[2024-05-29 12:58:39] [INFO ] Deduced a trap composed of 298 places in 198 ms of which 4 ms to minimize.
[2024-05-29 12:58:41] [INFO ] Deduced a trap composed of 297 places in 192 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 790/1817 variables, and 10 constraints, problems are : Problem set: 0 solved, 1026 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/790 constraints, PredecessorRefiner: 1026/1026 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1026 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/789 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
At refinement iteration 1 (OVERLAPS) 1/790 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/790 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
[2024-05-29 12:58:54] [INFO ] Deduced a trap composed of 292 places in 190 ms of which 4 ms to minimize.
[2024-05-29 12:59:01] [INFO ] Deduced a trap composed of 291 places in 230 ms of which 4 ms to minimize.
[2024-05-29 12:59:02] [INFO ] Deduced a trap composed of 299 places in 192 ms of which 3 ms to minimize.
[2024-05-29 12:59:03] [INFO ] Deduced a trap composed of 293 places in 171 ms of which 4 ms to minimize.
[2024-05-29 12:59:04] [INFO ] Deduced a trap composed of 299 places in 200 ms of which 4 ms to minimize.
[2024-05-29 12:59:05] [INFO ] Deduced a trap composed of 293 places in 185 ms of which 4 ms to minimize.
[2024-05-29 12:59:06] [INFO ] Deduced a trap composed of 299 places in 187 ms of which 4 ms to minimize.
[2024-05-29 12:59:07] [INFO ] Deduced a trap composed of 293 places in 182 ms of which 3 ms to minimize.
[2024-05-29 12:59:08] [INFO ] Deduced a trap composed of 293 places in 196 ms of which 4 ms to minimize.
[2024-05-29 12:59:08] [INFO ] Deduced a trap composed of 292 places in 229 ms of which 4 ms to minimize.
[2024-05-29 12:59:09] [INFO ] Deduced a trap composed of 292 places in 203 ms of which 4 ms to minimize.
[2024-05-29 12:59:09] [INFO ] Deduced a trap composed of 299 places in 203 ms of which 4 ms to minimize.
[2024-05-29 12:59:09] [INFO ] Deduced a trap composed of 291 places in 181 ms of which 3 ms to minimize.
[2024-05-29 12:59:09] [INFO ] Deduced a trap composed of 299 places in 189 ms of which 4 ms to minimize.
[2024-05-29 12:59:10] [INFO ] Deduced a trap composed of 297 places in 206 ms of which 3 ms to minimize.
[2024-05-29 12:59:10] [INFO ] Deduced a trap composed of 293 places in 198 ms of which 4 ms to minimize.
[2024-05-29 12:59:10] [INFO ] Deduced a trap composed of 299 places in 223 ms of which 4 ms to minimize.
[2024-05-29 12:59:11] [INFO ] Deduced a trap composed of 299 places in 218 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 790/1817 variables, and 28 constraints, problems are : Problem set: 0 solved, 1026 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/790 constraints, PredecessorRefiner: 0/1026 constraints, Known Traps: 23/23 constraints]
After SMT, in 60374ms problems are : Problem set: 0 solved, 1026 unsolved
Search for dead transitions found 0 dead transitions in 60385ms
Finished structural reductions in LTL mode , in 1 iterations and 61101 ms. Remains : 790/790 places, 1027/1027 transitions.
Computed a total of 164 stabilizing places and 172 stable transitions
Computed a total of 164 stabilizing places and 172 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 70 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (506 resets) in 75 ms. (526 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (108 resets) in 23 ms. (1666 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 882906 steps, run timeout after 3001 ms. (steps per millisecond=294 ) properties seen :0 out of 1
Probabilistic random walk after 882906 steps, saw 166612 distinct states, run finished after 3002 ms. (steps per millisecond=294 ) properties seen :0
[2024-05-29 12:59:14] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 772/776 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/776 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/790 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/790 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1027/1817 variables, 790/795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1817 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/1817 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1817/1817 variables, and 795 constraints, problems are : Problem set: 0 solved, 1 unsolved in 335 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 790/790 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 772/776 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/776 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/790 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/790 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1027/1817 variables, 790/795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1817 variables, 1/796 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1817 variables, 0/796 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1817 variables, 0/796 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1817/1817 variables, and 796 constraints, problems are : Problem set: 0 solved, 1 unsolved in 538 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 790/790 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 884ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 38 ms.
Support contains 4 out of 790 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 790/790 places, 1027/1027 transitions.
Graph (trivial) has 785 edges and 790 vertex of which 68 / 790 are part of one of the 12 SCC in 1 ms
Free SCC test removed 56 places
Drop transitions (Empty/Sink Transition effects.) removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Graph (complete) has 1180 edges and 734 vertex of which 730 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 549 transitions
Trivial Post-agglo rules discarded 549 transitions
Performed 549 trivial Post agglomeration. Transition count delta: 549
Iterating post reduction 0 with 553 rules applied. Total rules applied 555 place count 730 transition count 398
Reduce places removed 549 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 561 rules applied. Total rules applied 1116 place count 181 transition count 386
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1120 place count 177 transition count 386
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 1120 place count 177 transition count 341
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 1210 place count 132 transition count 341
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1211 place count 132 transition count 340
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 1269 place count 103 transition count 311
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 1277 place count 103 transition count 303
Discarding 22 places :
Symmetric choice reduction at 5 with 22 rule applications. Total rules 1299 place count 81 transition count 187
Iterating global reduction 5 with 22 rules applied. Total rules applied 1321 place count 81 transition count 187
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 1331 place count 81 transition count 177
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 1343 place count 69 transition count 165
Iterating global reduction 6 with 12 rules applied. Total rules applied 1355 place count 69 transition count 165
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1363 place count 61 transition count 157
Iterating global reduction 6 with 8 rules applied. Total rules applied 1371 place count 61 transition count 157
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1375 place count 61 transition count 153
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 1383 place count 57 transition count 149
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 1391 place count 53 transition count 170
Free-agglomeration rule applied 24 times with reduction of 7 identical transitions.
Iterating global reduction 7 with 24 rules applied. Total rules applied 1415 place count 53 transition count 139
Reduce places removed 24 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 34 rules applied. Total rules applied 1449 place count 29 transition count 129
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1453 place count 25 transition count 125
Iterating global reduction 8 with 4 rules applied. Total rules applied 1457 place count 25 transition count 125
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1458 place count 25 transition count 124
Drop transitions (Redundant composition of simpler transitions.) removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 9 with 31 rules applied. Total rules applied 1489 place count 25 transition count 93
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 1493 place count 23 transition count 111
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 9 with 8 rules applied. Total rules applied 1501 place count 23 transition count 103
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 1503 place count 23 transition count 103
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1504 place count 23 transition count 102
Applied a total of 1504 rules in 38 ms. Remains 23 /790 variables (removed 767) and now considering 102/1027 (removed 925) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 23/790 places, 102/1027 transitions.
RANDOM walk for 100 steps (0 resets) in 5 ms. (16 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 109 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 207 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 174 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1287 reset in 116 ms.
Product exploration explored 100000 steps with 1283 reset in 207 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 169 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 790 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 790/790 places, 1027/1027 transitions.
Graph (trivial) has 785 edges and 790 vertex of which 68 / 790 are part of one of the 12 SCC in 2 ms
Free SCC test removed 56 places
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Performed 541 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 541 rules applied. Total rules applied 542 place count 734 transition count 963
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 550 place count 734 transition count 955
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 550 place count 734 transition count 959
Deduced a syphon composed of 573 places in 1 ms
Iterating global reduction 2 with 32 rules applied. Total rules applied 582 place count 734 transition count 959
Discarding 486 places :
Symmetric choice reduction at 2 with 486 rule applications. Total rules 1068 place count 248 transition count 473
Deduced a syphon composed of 90 places in 0 ms
Iterating global reduction 2 with 486 rules applied. Total rules applied 1554 place count 248 transition count 473
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 135 places in 1 ms
Iterating global reduction 2 with 45 rules applied. Total rules applied 1599 place count 248 transition count 485
Discarding 71 places :
Symmetric choice reduction at 2 with 71 rule applications. Total rules 1670 place count 177 transition count 316
Deduced a syphon composed of 86 places in 0 ms
Iterating global reduction 2 with 71 rules applied. Total rules applied 1741 place count 177 transition count 316
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 1755 place count 177 transition count 302
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 1785 place count 147 transition count 268
Deduced a syphon composed of 68 places in 0 ms
Iterating global reduction 3 with 30 rules applied. Total rules applied 1815 place count 147 transition count 268
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1827 place count 135 transition count 256
Deduced a syphon composed of 68 places in 0 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 1839 place count 135 transition count 256
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1843 place count 135 transition count 252
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1851 place count 127 transition count 244
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 4 with 8 rules applied. Total rules applied 1859 place count 127 transition count 244
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 67 places in 0 ms
Iterating global reduction 4 with 7 rules applied. Total rules applied 1866 place count 127 transition count 279
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1877 place count 116 transition count 257
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 4 with 11 rules applied. Total rules applied 1888 place count 116 transition count 257
Deduced a syphon composed of 56 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 1896 place count 116 transition count 249
Deduced a syphon composed of 56 places in 0 ms
Applied a total of 1896 rules in 99 ms. Remains 116 /790 variables (removed 674) and now considering 249/1027 (removed 778) transitions.
[2024-05-29 12:59:17] [INFO ] Redundant transitions in 12 ms returned []
Running 241 sub problems to find dead transitions.
[2024-05-29 12:59:17] [INFO ] Flow matrix only has 244 transitions (discarded 5 similar events)
// Phase 1: matrix 244 rows 116 cols
[2024-05-29 12:59:17] [INFO ] Computed 2 invariants in 6 ms
[2024-05-29 12:59:17] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 12:59:18] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 2 ms to minimize.
[2024-05-29 12:59:18] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-29 12:59:18] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-29 12:59:18] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-29 12:59:18] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-29 12:59:18] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 0 ms to minimize.
[2024-05-29 12:59:18] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-29 12:59:18] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
Problem TDEAD186 is UNSAT
[2024-05-29 12:59:19] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 9/11 constraints. Problems are: Problem set: 10 solved, 231 unsolved
[2024-05-29 12:59:20] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 1/12 constraints. Problems are: Problem set: 10 solved, 231 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/12 constraints. Problems are: Problem set: 10 solved, 231 unsolved
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD247 is UNSAT
At refinement iteration 5 (OVERLAPS) 243/359 variables, 116/128 constraints. Problems are: Problem set: 84 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 34/162 constraints. Problems are: Problem set: 84 solved, 157 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/359 variables, 0/162 constraints. Problems are: Problem set: 84 solved, 157 unsolved
At refinement iteration 8 (OVERLAPS) 1/360 variables, 1/163 constraints. Problems are: Problem set: 84 solved, 157 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 0/163 constraints. Problems are: Problem set: 84 solved, 157 unsolved
[2024-05-29 12:59:26] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/360 variables, 1/164 constraints. Problems are: Problem set: 84 solved, 157 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/360 variables, 0/164 constraints. Problems are: Problem set: 84 solved, 157 unsolved
At refinement iteration 12 (OVERLAPS) 0/360 variables, 0/164 constraints. Problems are: Problem set: 84 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Real declared 360/360 variables, and 164 constraints, problems are : Problem set: 84 solved, 157 unsolved in 12453 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 116/116 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 84 solved, 157 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 84 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 57/116 variables, 2/2 constraints. Problems are: Problem set: 84 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 11/13 constraints. Problems are: Problem set: 84 solved, 157 unsolved
[2024-05-29 12:59:30] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-29 12:59:30] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 2/15 constraints. Problems are: Problem set: 84 solved, 157 unsolved
[2024-05-29 12:59:30] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 1 ms to minimize.
[2024-05-29 12:59:30] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2024-05-29 12:59:30] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 3/18 constraints. Problems are: Problem set: 84 solved, 157 unsolved
[2024-05-29 12:59:31] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 1/19 constraints. Problems are: Problem set: 84 solved, 157 unsolved
[2024-05-29 12:59:31] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 1/20 constraints. Problems are: Problem set: 84 solved, 157 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 0/20 constraints. Problems are: Problem set: 84 solved, 157 unsolved
At refinement iteration 8 (OVERLAPS) 243/359 variables, 116/136 constraints. Problems are: Problem set: 84 solved, 157 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/359 variables, 34/170 constraints. Problems are: Problem set: 84 solved, 157 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/359 variables, 157/327 constraints. Problems are: Problem set: 84 solved, 157 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/359 variables, 0/327 constraints. Problems are: Problem set: 84 solved, 157 unsolved
At refinement iteration 12 (OVERLAPS) 1/360 variables, 1/328 constraints. Problems are: Problem set: 84 solved, 157 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/360 variables, 0/328 constraints. Problems are: Problem set: 84 solved, 157 unsolved
At refinement iteration 14 (OVERLAPS) 0/360 variables, 0/328 constraints. Problems are: Problem set: 84 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Int declared 360/360 variables, and 328 constraints, problems are : Problem set: 84 solved, 157 unsolved in 14001 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 116/116 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 157/241 constraints, Known Traps: 18/18 constraints]
After SMT, in 26601ms problems are : Problem set: 84 solved, 157 unsolved
Search for dead transitions found 84 dead transitions in 26604ms
Found 84 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 84 transitions
Dead transitions reduction (with SMT) removed 84 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 116/790 places, 165/1027 transitions.
Graph (complete) has 302 edges and 116 vertex of which 60 are kept as prefixes of interest. Removing 56 places using SCC suffix rule.1 ms
Discarding 56 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 60 transition count 173
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 8 ms. Remains 60 /116 variables (removed 56) and now considering 173/165 (removed -8) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 60/790 places, 173/1027 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 26748 ms. Remains : 60/790 places, 173/1027 transitions.
Support contains 4 out of 790 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 790/790 places, 1027/1027 transitions.
Applied a total of 0 rules in 18 ms. Remains 790 /790 variables (removed 0) and now considering 1027/1027 (removed 0) transitions.
// Phase 1: matrix 1027 rows 790 cols
[2024-05-29 12:59:44] [INFO ] Computed 5 invariants in 7 ms
[2024-05-29 12:59:44] [INFO ] Implicit Places using invariants in 417 ms returned []
[2024-05-29 12:59:44] [INFO ] Invariant cache hit.
[2024-05-29 12:59:44] [INFO ] Implicit Places using invariants and state equation in 472 ms returned []
Implicit Place search using SMT with State Equation took 903 ms to find 0 implicit places.
Running 1026 sub problems to find dead transitions.
[2024-05-29 12:59:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/789 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
At refinement iteration 1 (OVERLAPS) 1/790 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
[2024-05-29 13:00:11] [INFO ] Deduced a trap composed of 297 places in 269 ms of which 5 ms to minimize.
[2024-05-29 13:00:11] [INFO ] Deduced a trap composed of 290 places in 185 ms of which 3 ms to minimize.
[2024-05-29 13:00:12] [INFO ] Deduced a trap composed of 297 places in 194 ms of which 4 ms to minimize.
[2024-05-29 13:00:13] [INFO ] Deduced a trap composed of 298 places in 191 ms of which 3 ms to minimize.
[2024-05-29 13:00:14] [INFO ] Deduced a trap composed of 297 places in 199 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 790/1817 variables, and 10 constraints, problems are : Problem set: 0 solved, 1026 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/790 constraints, PredecessorRefiner: 1026/1026 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1026 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/789 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
At refinement iteration 1 (OVERLAPS) 1/790 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/790 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
[2024-05-29 13:00:28] [INFO ] Deduced a trap composed of 292 places in 197 ms of which 4 ms to minimize.
[2024-05-29 13:00:35] [INFO ] Deduced a trap composed of 291 places in 233 ms of which 4 ms to minimize.
[2024-05-29 13:00:35] [INFO ] Deduced a trap composed of 299 places in 196 ms of which 3 ms to minimize.
[2024-05-29 13:00:37] [INFO ] Deduced a trap composed of 293 places in 187 ms of which 3 ms to minimize.
[2024-05-29 13:00:38] [INFO ] Deduced a trap composed of 299 places in 196 ms of which 4 ms to minimize.
[2024-05-29 13:00:39] [INFO ] Deduced a trap composed of 293 places in 199 ms of which 4 ms to minimize.
[2024-05-29 13:00:41] [INFO ] Deduced a trap composed of 299 places in 187 ms of which 3 ms to minimize.
[2024-05-29 13:00:41] [INFO ] Deduced a trap composed of 293 places in 175 ms of which 4 ms to minimize.
[2024-05-29 13:00:42] [INFO ] Deduced a trap composed of 293 places in 185 ms of which 4 ms to minimize.
[2024-05-29 13:00:42] [INFO ] Deduced a trap composed of 292 places in 233 ms of which 4 ms to minimize.
[2024-05-29 13:00:43] [INFO ] Deduced a trap composed of 292 places in 216 ms of which 4 ms to minimize.
[2024-05-29 13:00:43] [INFO ] Deduced a trap composed of 299 places in 192 ms of which 4 ms to minimize.
[2024-05-29 13:00:43] [INFO ] Deduced a trap composed of 291 places in 202 ms of which 4 ms to minimize.
[2024-05-29 13:00:43] [INFO ] Deduced a trap composed of 299 places in 191 ms of which 4 ms to minimize.
[2024-05-29 13:00:44] [INFO ] Deduced a trap composed of 297 places in 198 ms of which 4 ms to minimize.
[2024-05-29 13:00:44] [INFO ] Deduced a trap composed of 293 places in 205 ms of which 3 ms to minimize.
[2024-05-29 13:00:45] [INFO ] Deduced a trap composed of 299 places in 230 ms of which 5 ms to minimize.
[2024-05-29 13:00:45] [INFO ] Deduced a trap composed of 299 places in 223 ms of which 4 ms to minimize.
SMT process timed out in 60584ms, After SMT, problems are : Problem set: 0 solved, 1026 unsolved
Search for dead transitions found 0 dead transitions in 60592ms
Finished structural reductions in LTL mode , in 1 iterations and 61528 ms. Remains : 790/790 places, 1027/1027 transitions.
Treatment of property StigmergyCommit-PT-03b-LTLFireability-07 finished in 221631 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||G(p1))))))'
Support contains 5 out of 858 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 858/858 places, 1099/1099 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 851 transition count 1092
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 851 transition count 1092
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 844 transition count 1085
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 844 transition count 1085
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 837 transition count 1078
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 837 transition count 1078
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 49 place count 830 transition count 1071
Iterating global reduction 0 with 7 rules applied. Total rules applied 56 place count 830 transition count 1071
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 62 place count 824 transition count 1065
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 824 transition count 1065
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 74 place count 818 transition count 1059
Iterating global reduction 0 with 6 rules applied. Total rules applied 80 place count 818 transition count 1059
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 86 place count 812 transition count 1053
Iterating global reduction 0 with 6 rules applied. Total rules applied 92 place count 812 transition count 1053
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 93 place count 812 transition count 1052
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 98 place count 807 transition count 1047
Iterating global reduction 1 with 5 rules applied. Total rules applied 103 place count 807 transition count 1047
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 107 place count 803 transition count 1043
Iterating global reduction 1 with 4 rules applied. Total rules applied 111 place count 803 transition count 1043
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 112 place count 803 transition count 1042
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 115 place count 800 transition count 1039
Iterating global reduction 2 with 3 rules applied. Total rules applied 118 place count 800 transition count 1039
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 120 place count 798 transition count 1037
Iterating global reduction 2 with 2 rules applied. Total rules applied 122 place count 798 transition count 1037
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 123 place count 798 transition count 1036
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 124 place count 797 transition count 1035
Iterating global reduction 3 with 1 rules applied. Total rules applied 125 place count 797 transition count 1035
Applied a total of 125 rules in 213 ms. Remains 797 /858 variables (removed 61) and now considering 1035/1099 (removed 64) transitions.
// Phase 1: matrix 1035 rows 797 cols
[2024-05-29 13:00:45] [INFO ] Computed 5 invariants in 14 ms
[2024-05-29 13:00:45] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-29 13:00:45] [INFO ] Invariant cache hit.
[2024-05-29 13:00:46] [INFO ] Implicit Places using invariants and state equation in 484 ms returned []
Implicit Place search using SMT with State Equation took 663 ms to find 0 implicit places.
Running 1034 sub problems to find dead transitions.
[2024-05-29 13:00:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/796 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1034 unsolved
At refinement iteration 1 (OVERLAPS) 1/797 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1034 unsolved
[2024-05-29 13:01:14] [INFO ] Deduced a trap composed of 291 places in 298 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 797/1832 variables, and 6 constraints, problems are : Problem set: 0 solved, 1034 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/797 constraints, PredecessorRefiner: 1034/1034 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1034 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/796 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1034 unsolved
At refinement iteration 1 (OVERLAPS) 1/797 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1034 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/797 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1034 unsolved
[2024-05-29 13:01:33] [INFO ] Deduced a trap composed of 304 places in 274 ms of which 5 ms to minimize.
[2024-05-29 13:01:33] [INFO ] Deduced a trap composed of 297 places in 227 ms of which 3 ms to minimize.
[2024-05-29 13:01:35] [INFO ] Deduced a trap composed of 297 places in 210 ms of which 4 ms to minimize.
[2024-05-29 13:01:36] [INFO ] Deduced a trap composed of 297 places in 196 ms of which 3 ms to minimize.
[2024-05-29 13:01:36] [INFO ] Deduced a trap composed of 298 places in 203 ms of which 3 ms to minimize.
[2024-05-29 13:01:37] [INFO ] Deduced a trap composed of 292 places in 253 ms of which 5 ms to minimize.
[2024-05-29 13:01:37] [INFO ] Deduced a trap composed of 290 places in 218 ms of which 4 ms to minimize.
[2024-05-29 13:01:37] [INFO ] Deduced a trap composed of 305 places in 229 ms of which 4 ms to minimize.
[2024-05-29 13:01:38] [INFO ] Deduced a trap composed of 291 places in 204 ms of which 5 ms to minimize.
[2024-05-29 13:01:39] [INFO ] Deduced a trap composed of 291 places in 202 ms of which 3 ms to minimize.
[2024-05-29 13:01:40] [INFO ] Deduced a trap composed of 300 places in 205 ms of which 4 ms to minimize.
[2024-05-29 13:01:42] [INFO ] Deduced a trap composed of 302 places in 252 ms of which 4 ms to minimize.
[2024-05-29 13:01:42] [INFO ] Deduced a trap composed of 299 places in 198 ms of which 3 ms to minimize.
[2024-05-29 13:01:42] [INFO ] Deduced a trap composed of 292 places in 233 ms of which 3 ms to minimize.
[2024-05-29 13:01:43] [INFO ] Deduced a trap composed of 299 places in 199 ms of which 3 ms to minimize.
[2024-05-29 13:01:43] [INFO ] Deduced a trap composed of 298 places in 221 ms of which 4 ms to minimize.
[2024-05-29 13:01:43] [INFO ] Deduced a trap composed of 297 places in 216 ms of which 3 ms to minimize.
[2024-05-29 13:01:44] [INFO ] Deduced a trap composed of 306 places in 199 ms of which 3 ms to minimize.
[2024-05-29 13:01:44] [INFO ] Deduced a trap composed of 292 places in 218 ms of which 4 ms to minimize.
[2024-05-29 13:01:44] [INFO ] Deduced a trap composed of 299 places in 252 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/797 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 1034 unsolved
[2024-05-29 13:01:45] [INFO ] Deduced a trap composed of 293 places in 226 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 797/1832 variables, and 27 constraints, problems are : Problem set: 0 solved, 1034 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/797 constraints, PredecessorRefiner: 0/1034 constraints, Known Traps: 22/22 constraints]
After SMT, in 60403ms problems are : Problem set: 0 solved, 1034 unsolved
Search for dead transitions found 0 dead transitions in 60415ms
Starting structural reductions in LTL mode, iteration 1 : 797/858 places, 1035/1099 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61295 ms. Remains : 797/858 places, 1035/1099 transitions.
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-08
Product exploration explored 100000 steps with 1297 reset in 120 ms.
Product exploration explored 100000 steps with 1279 reset in 128 ms.
Computed a total of 164 stabilizing places and 172 stable transitions
Computed a total of 164 stabilizing places and 172 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 75 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 95 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (507 resets) in 120 ms. (330 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (108 resets) in 308 ms. (129 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (109 resets) in 343 ms. (116 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (107 resets) in 224 ms. (177 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (109 resets) in 86 ms. (459 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 327112 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :0 out of 4
Probabilistic random walk after 327112 steps, saw 66905 distinct states, run finished after 3001 ms. (steps per millisecond=109 ) properties seen :0
[2024-05-29 13:01:50] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 778/783 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/783 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 14/797 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/797 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1035/1832 variables, 797/802 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1832 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/1832 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1832/1832 variables, and 802 constraints, problems are : Problem set: 0 solved, 4 unsolved in 742 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 797/797 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 778/783 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 13:01:51] [INFO ] Deduced a trap composed of 299 places in 181 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/783 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/783 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 14/797 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/797 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 1035/1832 variables, 797/803 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1832 variables, 4/807 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 13:01:52] [INFO ] Deduced a trap composed of 299 places in 181 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1832 variables, 1/808 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1832 variables, 0/808 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/1832 variables, 0/808 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1832/1832 variables, and 808 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1747 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 797/797 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
After SMT, in 2498ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 18190 steps, including 191 resets, run visited all 4 properties in 233 ms. (steps per millisecond=78 )
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 669 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 5 factoid took 227 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 131 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 797 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 797/797 places, 1035/1035 transitions.
Applied a total of 0 rules in 21 ms. Remains 797 /797 variables (removed 0) and now considering 1035/1035 (removed 0) transitions.
[2024-05-29 13:01:54] [INFO ] Invariant cache hit.
[2024-05-29 13:01:54] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-29 13:01:54] [INFO ] Invariant cache hit.
[2024-05-29 13:01:55] [INFO ] Implicit Places using invariants and state equation in 535 ms returned []
Implicit Place search using SMT with State Equation took 704 ms to find 0 implicit places.
Running 1034 sub problems to find dead transitions.
[2024-05-29 13:01:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/796 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1034 unsolved
At refinement iteration 1 (OVERLAPS) 1/797 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1034 unsolved
[2024-05-29 13:02:22] [INFO ] Deduced a trap composed of 291 places in 274 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 797/1832 variables, and 6 constraints, problems are : Problem set: 0 solved, 1034 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/797 constraints, PredecessorRefiner: 1034/1034 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1034 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/796 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1034 unsolved
At refinement iteration 1 (OVERLAPS) 1/797 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1034 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/797 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1034 unsolved
[2024-05-29 13:02:42] [INFO ] Deduced a trap composed of 304 places in 262 ms of which 5 ms to minimize.
[2024-05-29 13:02:42] [INFO ] Deduced a trap composed of 297 places in 186 ms of which 5 ms to minimize.
[2024-05-29 13:02:44] [INFO ] Deduced a trap composed of 297 places in 208 ms of which 4 ms to minimize.
[2024-05-29 13:02:45] [INFO ] Deduced a trap composed of 297 places in 238 ms of which 3 ms to minimize.
[2024-05-29 13:02:46] [INFO ] Deduced a trap composed of 298 places in 228 ms of which 3 ms to minimize.
[2024-05-29 13:02:46] [INFO ] Deduced a trap composed of 292 places in 269 ms of which 5 ms to minimize.
[2024-05-29 13:02:47] [INFO ] Deduced a trap composed of 290 places in 226 ms of which 4 ms to minimize.
[2024-05-29 13:02:47] [INFO ] Deduced a trap composed of 305 places in 217 ms of which 4 ms to minimize.
[2024-05-29 13:02:47] [INFO ] Deduced a trap composed of 291 places in 185 ms of which 3 ms to minimize.
[2024-05-29 13:02:49] [INFO ] Deduced a trap composed of 291 places in 181 ms of which 3 ms to minimize.
[2024-05-29 13:02:50] [INFO ] Deduced a trap composed of 300 places in 200 ms of which 4 ms to minimize.
[2024-05-29 13:02:51] [INFO ] Deduced a trap composed of 302 places in 205 ms of which 3 ms to minimize.
[2024-05-29 13:02:51] [INFO ] Deduced a trap composed of 299 places in 169 ms of which 3 ms to minimize.
[2024-05-29 13:02:52] [INFO ] Deduced a trap composed of 292 places in 213 ms of which 4 ms to minimize.
[2024-05-29 13:02:52] [INFO ] Deduced a trap composed of 299 places in 197 ms of which 3 ms to minimize.
[2024-05-29 13:02:52] [INFO ] Deduced a trap composed of 298 places in 221 ms of which 4 ms to minimize.
[2024-05-29 13:02:53] [INFO ] Deduced a trap composed of 297 places in 260 ms of which 4 ms to minimize.
[2024-05-29 13:02:53] [INFO ] Deduced a trap composed of 306 places in 202 ms of which 4 ms to minimize.
[2024-05-29 13:02:54] [INFO ] Deduced a trap composed of 292 places in 227 ms of which 3 ms to minimize.
[2024-05-29 13:02:54] [INFO ] Deduced a trap composed of 299 places in 262 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/797 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 1034 unsolved
[2024-05-29 13:02:55] [INFO ] Deduced a trap composed of 293 places in 212 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 797/1832 variables, and 27 constraints, problems are : Problem set: 0 solved, 1034 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/797 constraints, PredecessorRefiner: 0/1034 constraints, Known Traps: 22/22 constraints]
After SMT, in 60418ms problems are : Problem set: 0 solved, 1034 unsolved
Search for dead transitions found 0 dead transitions in 60431ms
Finished structural reductions in LTL mode , in 1 iterations and 61160 ms. Remains : 797/797 places, 1035/1035 transitions.
Computed a total of 164 stabilizing places and 172 stable transitions
Computed a total of 164 stabilizing places and 172 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 140 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 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (513 resets) in 931 ms. (42 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (106 resets) in 165 ms. (240 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (108 resets) in 202 ms. (197 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (105 resets) in 235 ms. (169 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (107 resets) in 52 ms. (754 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 367416 steps, run timeout after 3001 ms. (steps per millisecond=122 ) properties seen :0 out of 4
Probabilistic random walk after 367416 steps, saw 73995 distinct states, run finished after 3001 ms. (steps per millisecond=122 ) properties seen :0
[2024-05-29 13:02:59] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 778/783 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/783 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 14/797 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/797 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1035/1832 variables, 797/802 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1832 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/1832 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1832/1832 variables, and 802 constraints, problems are : Problem set: 0 solved, 4 unsolved in 732 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 797/797 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 778/783 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 13:03:00] [INFO ] Deduced a trap composed of 299 places in 194 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/783 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/783 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 14/797 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/797 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 1035/1832 variables, 797/803 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1832 variables, 4/807 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 13:03:01] [INFO ] Deduced a trap composed of 299 places in 196 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1832 variables, 1/808 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1832 variables, 0/808 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/1832 variables, 0/808 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1832/1832 variables, and 808 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1791 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 797/797 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
After SMT, in 2540ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 2 properties in 1008 ms.
Support contains 5 out of 797 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 797/797 places, 1035/1035 transitions.
Graph (trivial) has 791 edges and 797 vertex of which 68 / 797 are part of one of the 12 SCC in 1 ms
Free SCC test removed 56 places
Drop transitions (Empty/Sink Transition effects.) removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Graph (complete) has 1188 edges and 741 vertex of which 737 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 554 transitions
Trivial Post-agglo rules discarded 554 transitions
Performed 554 trivial Post agglomeration. Transition count delta: 554
Iterating post reduction 0 with 558 rules applied. Total rules applied 560 place count 737 transition count 401
Reduce places removed 554 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 566 rules applied. Total rules applied 1126 place count 183 transition count 389
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1130 place count 179 transition count 389
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 1130 place count 179 transition count 344
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 1220 place count 134 transition count 344
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1221 place count 134 transition count 343
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 1279 place count 105 transition count 314
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 1287 place count 105 transition count 306
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 1308 place count 84 transition count 217
Iterating global reduction 5 with 21 rules applied. Total rules applied 1329 place count 84 transition count 217
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 1338 place count 84 transition count 208
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 1350 place count 72 transition count 196
Iterating global reduction 6 with 12 rules applied. Total rules applied 1362 place count 72 transition count 196
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1370 place count 64 transition count 188
Iterating global reduction 6 with 8 rules applied. Total rules applied 1378 place count 64 transition count 188
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1382 place count 64 transition count 184
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 1390 place count 60 transition count 180
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 1398 place count 56 transition count 201
Free-agglomeration rule applied 26 times with reduction of 7 identical transitions.
Iterating global reduction 7 with 26 rules applied. Total rules applied 1424 place count 56 transition count 168
Reduce places removed 26 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 7 with 44 rules applied. Total rules applied 1468 place count 30 transition count 150
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1472 place count 26 transition count 146
Iterating global reduction 8 with 4 rules applied. Total rules applied 1476 place count 26 transition count 146
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1477 place count 26 transition count 145
Drop transitions (Redundant composition of simpler transitions.) removed 61 transitions
Redundant transition composition rules discarded 61 transitions
Iterating global reduction 9 with 61 rules applied. Total rules applied 1538 place count 26 transition count 84
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 1542 place count 24 transition count 102
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 1548 place count 24 transition count 96
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 1550 place count 24 transition count 96
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1551 place count 24 transition count 95
Applied a total of 1551 rules in 53 ms. Remains 24 /797 variables (removed 773) and now considering 95/1035 (removed 940) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 24/797 places, 95/1035 transitions.
RANDOM walk for 173 steps (0 resets) in 5 ms. (28 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 5 factoid took 209 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 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1287 reset in 128 ms.
Product exploration explored 100000 steps with 1286 reset in 136 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 797 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 797/797 places, 1035/1035 transitions.
Graph (trivial) has 791 edges and 797 vertex of which 68 / 797 are part of one of the 12 SCC in 1 ms
Free SCC test removed 56 places
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Performed 546 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 546 rules applied. Total rules applied 547 place count 741 transition count 971
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 555 place count 741 transition count 963
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 555 place count 741 transition count 967
Deduced a syphon composed of 578 places in 1 ms
Iterating global reduction 2 with 32 rules applied. Total rules applied 587 place count 741 transition count 967
Discarding 490 places :
Symmetric choice reduction at 2 with 490 rule applications. Total rules 1077 place count 251 transition count 477
Deduced a syphon composed of 91 places in 0 ms
Iterating global reduction 2 with 490 rules applied. Total rules applied 1567 place count 251 transition count 477
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 136 places in 0 ms
Iterating global reduction 2 with 45 rules applied. Total rules applied 1612 place count 251 transition count 490
Discarding 70 places :
Symmetric choice reduction at 2 with 70 rule applications. Total rules 1682 place count 181 transition count 348
Deduced a syphon composed of 87 places in 0 ms
Iterating global reduction 2 with 70 rules applied. Total rules applied 1752 place count 181 transition count 348
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 1765 place count 181 transition count 335
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 1794 place count 152 transition count 302
Deduced a syphon composed of 70 places in 0 ms
Iterating global reduction 3 with 29 rules applied. Total rules applied 1823 place count 152 transition count 302
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1835 place count 140 transition count 290
Deduced a syphon composed of 70 places in 0 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 1847 place count 140 transition count 290
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1851 place count 140 transition count 286
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1859 place count 132 transition count 278
Deduced a syphon composed of 62 places in 0 ms
Iterating global reduction 4 with 8 rules applied. Total rules applied 1867 place count 132 transition count 278
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 69 places in 0 ms
Iterating global reduction 4 with 7 rules applied. Total rules applied 1874 place count 132 transition count 313
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1885 place count 121 transition count 291
Deduced a syphon composed of 58 places in 0 ms
Iterating global reduction 4 with 11 rules applied. Total rules applied 1896 place count 121 transition count 291
Deduced a syphon composed of 58 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 1904 place count 121 transition count 283
Deduced a syphon composed of 58 places in 0 ms
Applied a total of 1904 rules in 65 ms. Remains 121 /797 variables (removed 676) and now considering 283/1035 (removed 752) transitions.
[2024-05-29 13:03:04] [INFO ] Redundant transitions in 3 ms returned []
Running 275 sub problems to find dead transitions.
[2024-05-29 13:03:04] [INFO ] Flow matrix only has 278 transitions (discarded 5 similar events)
// Phase 1: matrix 278 rows 121 cols
[2024-05-29 13:03:04] [INFO ] Computed 2 invariants in 5 ms
[2024-05-29 13:03:04] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 275 unsolved
[2024-05-29 13:03:05] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
[2024-05-29 13:03:05] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-29 13:03:05] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-29 13:03:05] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 0 ms to minimize.
[2024-05-29 13:03:06] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
Problem TDEAD220 is UNSAT
[2024-05-29 13:03:06] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-05-29 13:03:06] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 0 ms to minimize.
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 7/9 constraints. Problems are: Problem set: 10 solved, 265 unsolved
[2024-05-29 13:03:07] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 1/10 constraints. Problems are: Problem set: 10 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/10 constraints. Problems are: Problem set: 10 solved, 265 unsolved
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD281 is UNSAT
At refinement iteration 5 (OVERLAPS) 277/398 variables, 121/131 constraints. Problems are: Problem set: 87 solved, 188 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 34/165 constraints. Problems are: Problem set: 87 solved, 188 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 0/165 constraints. Problems are: Problem set: 87 solved, 188 unsolved
At refinement iteration 8 (OVERLAPS) 1/399 variables, 1/166 constraints. Problems are: Problem set: 87 solved, 188 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 0/166 constraints. Problems are: Problem set: 87 solved, 188 unsolved
[2024-05-29 13:03:15] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/399 variables, 1/167 constraints. Problems are: Problem set: 87 solved, 188 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 0/167 constraints. Problems are: Problem set: 87 solved, 188 unsolved
At refinement iteration 12 (OVERLAPS) 0/399 variables, 0/167 constraints. Problems are: Problem set: 87 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Real declared 399/399 variables, and 167 constraints, problems are : Problem set: 87 solved, 188 unsolved in 15138 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 121/121 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 87 solved, 188 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 87 solved, 188 unsolved
At refinement iteration 1 (OVERLAPS) 59/121 variables, 2/2 constraints. Problems are: Problem set: 87 solved, 188 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 9/11 constraints. Problems are: Problem set: 87 solved, 188 unsolved
[2024-05-29 13:03:20] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2024-05-29 13:03:20] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 2/13 constraints. Problems are: Problem set: 87 solved, 188 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/13 constraints. Problems are: Problem set: 87 solved, 188 unsolved
At refinement iteration 5 (OVERLAPS) 277/398 variables, 121/134 constraints. Problems are: Problem set: 87 solved, 188 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 34/168 constraints. Problems are: Problem set: 87 solved, 188 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 188/356 constraints. Problems are: Problem set: 87 solved, 188 unsolved
[2024-05-29 13:03:24] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 1/357 constraints. Problems are: Problem set: 87 solved, 188 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 0/357 constraints. Problems are: Problem set: 87 solved, 188 unsolved
At refinement iteration 10 (OVERLAPS) 1/399 variables, 1/358 constraints. Problems are: Problem set: 87 solved, 188 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 0/358 constraints. Problems are: Problem set: 87 solved, 188 unsolved
At refinement iteration 12 (OVERLAPS) 0/399 variables, 0/358 constraints. Problems are: Problem set: 87 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Int declared 399/399 variables, and 358 constraints, problems are : Problem set: 87 solved, 188 unsolved in 20652 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 121/121 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 188/275 constraints, Known Traps: 12/12 constraints]
After SMT, in 35987ms problems are : Problem set: 87 solved, 188 unsolved
Search for dead transitions found 87 dead transitions in 35995ms
Found 87 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 87 transitions
Dead transitions reduction (with SMT) removed 87 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 121/797 places, 196/1035 transitions.
Graph (complete) has 313 edges and 121 vertex of which 63 are kept as prefixes of interest. Removing 58 places using SCC suffix rule.1 ms
Discarding 58 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 63 transition count 204
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 9 ms. Remains 63 /121 variables (removed 58) and now considering 204/196 (removed -8) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 63/797 places, 204/1035 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 36082 ms. Remains : 63/797 places, 204/1035 transitions.
Support contains 5 out of 797 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 797/797 places, 1035/1035 transitions.
Applied a total of 0 rules in 18 ms. Remains 797 /797 variables (removed 0) and now considering 1035/1035 (removed 0) transitions.
// Phase 1: matrix 1035 rows 797 cols
[2024-05-29 13:03:40] [INFO ] Computed 5 invariants in 5 ms
[2024-05-29 13:03:40] [INFO ] Implicit Places using invariants in 206 ms returned []
[2024-05-29 13:03:40] [INFO ] Invariant cache hit.
[2024-05-29 13:03:41] [INFO ] Implicit Places using invariants and state equation in 493 ms returned []
Implicit Place search using SMT with State Equation took 732 ms to find 0 implicit places.
Running 1034 sub problems to find dead transitions.
[2024-05-29 13:03:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/796 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1034 unsolved
At refinement iteration 1 (OVERLAPS) 1/797 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1034 unsolved
[2024-05-29 13:04:08] [INFO ] Deduced a trap composed of 291 places in 275 ms of which 5 ms to minimize.
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 Real declared 797/1832 variables, and 6 constraints, problems are : Problem set: 0 solved, 1034 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/797 constraints, PredecessorRefiner: 1034/1034 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1034 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/796 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1034 unsolved
At refinement iteration 1 (OVERLAPS) 1/797 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1034 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/797 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1034 unsolved
[2024-05-29 13:04:27] [INFO ] Deduced a trap composed of 304 places in 300 ms of which 5 ms to minimize.
[2024-05-29 13:04:28] [INFO ] Deduced a trap composed of 297 places in 239 ms of which 3 ms to minimize.
[2024-05-29 13:04:30] [INFO ] Deduced a trap composed of 297 places in 222 ms of which 3 ms to minimize.
[2024-05-29 13:04:31] [INFO ] Deduced a trap composed of 297 places in 184 ms of which 3 ms to minimize.
[2024-05-29 13:04:31] [INFO ] Deduced a trap composed of 298 places in 183 ms of which 4 ms to minimize.
[2024-05-29 13:04:32] [INFO ] Deduced a trap composed of 292 places in 254 ms of which 5 ms to minimize.
[2024-05-29 13:04:32] [INFO ] Deduced a trap composed of 290 places in 218 ms of which 4 ms to minimize.
[2024-05-29 13:04:32] [INFO ] Deduced a trap composed of 305 places in 213 ms of which 4 ms to minimize.
[2024-05-29 13:04:33] [INFO ] Deduced a trap composed of 291 places in 187 ms of which 4 ms to minimize.
[2024-05-29 13:04:34] [INFO ] Deduced a trap composed of 291 places in 184 ms of which 3 ms to minimize.
[2024-05-29 13:04:35] [INFO ] Deduced a trap composed of 300 places in 198 ms of which 3 ms to minimize.
[2024-05-29 13:04:37] [INFO ] Deduced a trap composed of 302 places in 205 ms of which 4 ms to minimize.
[2024-05-29 13:04:37] [INFO ] Deduced a trap composed of 299 places in 167 ms of which 3 ms to minimize.
[2024-05-29 13:04:38] [INFO ] Deduced a trap composed of 292 places in 185 ms of which 4 ms to minimize.
[2024-05-29 13:04:38] [INFO ] Deduced a trap composed of 299 places in 190 ms of which 3 ms to minimize.
[2024-05-29 13:04:38] [INFO ] Deduced a trap composed of 298 places in 209 ms of which 4 ms to minimize.
[2024-05-29 13:04:38] [INFO ] Deduced a trap composed of 297 places in 215 ms of which 4 ms to minimize.
[2024-05-29 13:04:39] [INFO ] Deduced a trap composed of 306 places in 200 ms of which 3 ms to minimize.
[2024-05-29 13:04:39] [INFO ] Deduced a trap composed of 292 places in 209 ms of which 4 ms to minimize.
[2024-05-29 13:04:40] [INFO ] Deduced a trap composed of 299 places in 262 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/797 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 1034 unsolved
[2024-05-29 13:04:40] [INFO ] Deduced a trap composed of 293 places in 223 ms of which 4 ms to minimize.
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 797/1832 variables, and 27 constraints, problems are : Problem set: 0 solved, 1034 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/797 constraints, PredecessorRefiner: 0/1034 constraints, Known Traps: 22/22 constraints]
After SMT, in 60417ms problems are : Problem set: 0 solved, 1034 unsolved
Search for dead transitions found 0 dead transitions in 60429ms
Finished structural reductions in LTL mode , in 1 iterations and 61181 ms. Remains : 797/797 places, 1035/1035 transitions.
Treatment of property StigmergyCommit-PT-03b-LTLFireability-08 finished in 235966 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(F((p0||G(p1)))) U p2)))'
Support contains 6 out of 858 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 858/858 places, 1099/1099 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 851 transition count 1092
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 851 transition count 1092
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 844 transition count 1085
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 844 transition count 1085
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 837 transition count 1078
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 837 transition count 1078
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 49 place count 830 transition count 1071
Iterating global reduction 0 with 7 rules applied. Total rules applied 56 place count 830 transition count 1071
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 62 place count 824 transition count 1065
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 824 transition count 1065
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 74 place count 818 transition count 1059
Iterating global reduction 0 with 6 rules applied. Total rules applied 80 place count 818 transition count 1059
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 86 place count 812 transition count 1053
Iterating global reduction 0 with 6 rules applied. Total rules applied 92 place count 812 transition count 1053
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 97 place count 807 transition count 1048
Iterating global reduction 0 with 5 rules applied. Total rules applied 102 place count 807 transition count 1048
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 106 place count 803 transition count 1044
Iterating global reduction 0 with 4 rules applied. Total rules applied 110 place count 803 transition count 1044
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 111 place count 803 transition count 1043
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 114 place count 800 transition count 1040
Iterating global reduction 1 with 3 rules applied. Total rules applied 117 place count 800 transition count 1040
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 118 place count 800 transition count 1039
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 120 place count 798 transition count 1037
Iterating global reduction 2 with 2 rules applied. Total rules applied 122 place count 798 transition count 1037
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 123 place count 798 transition count 1036
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 124 place count 797 transition count 1035
Iterating global reduction 3 with 1 rules applied. Total rules applied 125 place count 797 transition count 1035
Applied a total of 125 rules in 250 ms. Remains 797 /858 variables (removed 61) and now considering 1035/1099 (removed 64) transitions.
// Phase 1: matrix 1035 rows 797 cols
[2024-05-29 13:04:41] [INFO ] Computed 5 invariants in 14 ms
[2024-05-29 13:04:41] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-05-29 13:04:41] [INFO ] Invariant cache hit.
[2024-05-29 13:04:42] [INFO ] Implicit Places using invariants and state equation in 602 ms returned []
Implicit Place search using SMT with State Equation took 803 ms to find 0 implicit places.
Running 1034 sub problems to find dead transitions.
[2024-05-29 13:04:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/796 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1034 unsolved
At refinement iteration 1 (OVERLAPS) 1/797 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1034 unsolved
[2024-05-29 13:05:11] [INFO ] Deduced a trap composed of 297 places in 267 ms of which 5 ms to minimize.
[2024-05-29 13:05:11] [INFO ] Deduced a trap composed of 297 places in 197 ms of which 3 ms to minimize.
[2024-05-29 13:05:11] [INFO ] Deduced a trap composed of 297 places in 199 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.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 0.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 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 797/1832 variables, and 8 constraints, problems are : Problem set: 0 solved, 1034 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/797 constraints, PredecessorRefiner: 1034/1034 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1034 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/796 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1034 unsolved
At refinement iteration 1 (OVERLAPS) 1/797 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1034 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/797 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1034 unsolved
[2024-05-29 13:05:32] [INFO ] Deduced a trap composed of 297 places in 198 ms of which 4 ms to minimize.
[2024-05-29 13:05:34] [INFO ] Deduced a trap composed of 298 places in 231 ms of which 4 ms to minimize.
[2024-05-29 13:05:34] [INFO ] Deduced a trap composed of 298 places in 231 ms of which 5 ms to minimize.
[2024-05-29 13:05:34] [INFO ] Deduced a trap composed of 298 places in 205 ms of which 3 ms to minimize.
[2024-05-29 13:05:35] [INFO ] Deduced a trap composed of 297 places in 208 ms of which 4 ms to minimize.
[2024-05-29 13:05:35] [INFO ] Deduced a trap composed of 292 places in 186 ms of which 3 ms to minimize.
[2024-05-29 13:05:39] [INFO ] Deduced a trap composed of 299 places in 225 ms of which 4 ms to minimize.
[2024-05-29 13:05:40] [INFO ] Deduced a trap composed of 306 places in 276 ms of which 4 ms to minimize.
[2024-05-29 13:05:40] [INFO ] Deduced a trap composed of 298 places in 229 ms of which 4 ms to minimize.
[2024-05-29 13:05:42] [INFO ] Deduced a trap composed of 299 places in 250 ms of which 5 ms to minimize.
[2024-05-29 13:05:42] [INFO ] Deduced a trap composed of 293 places in 257 ms of which 5 ms to minimize.
[2024-05-29 13:05:42] [INFO ] Deduced a trap composed of 297 places in 220 ms of which 4 ms to minimize.
[2024-05-29 13:05:43] [INFO ] Deduced a trap composed of 293 places in 229 ms of which 4 ms to minimize.
SMT process timed out in 60585ms, After SMT, problems are : Problem set: 0 solved, 1034 unsolved
Search for dead transitions found 0 dead transitions in 60598ms
Starting structural reductions in LTL mode, iteration 1 : 797/858 places, 1035/1099 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61658 ms. Remains : 797/858 places, 1035/1099 transitions.
Stuttering acceptance computed with spot in 187 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-09
Product exploration explored 100000 steps with 1288 reset in 136 ms.
Product exploration explored 100000 steps with 1278 reset in 174 ms.
Computed a total of 164 stabilizing places and 172 stable transitions
Computed a total of 164 stabilizing places and 172 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT p2)), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 129 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 8 states, 22 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 309 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false, false]
RANDOM walk for 40000 steps (514 resets) in 1379 ms. (28 steps per ms) remains 8/10 properties
BEST_FIRST walk for 40004 steps (84 resets) in 174 ms. (228 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40004 steps (107 resets) in 123 ms. (322 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (106 resets) in 211 ms. (188 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (81 resets) in 189 ms. (210 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (110 resets) in 224 ms. (177 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (105 resets) in 114 ms. (347 steps per ms) remains 6/6 properties
[2024-05-29 13:05:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf1 is UNSAT
Problem apf4 is UNSAT
At refinement iteration 1 (OVERLAPS) 777/783 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/783 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 14/797 variables, 1/5 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/797 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1035/1832 variables, 797/802 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1832 variables, 0/802 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/1832 variables, 0/802 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1832/1832 variables, and 802 constraints, problems are : Problem set: 2 solved, 4 unsolved in 590 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 797/797 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 777/783 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-29 13:05:46] [INFO ] Deduced a trap composed of 292 places in 244 ms of which 4 ms to minimize.
[2024-05-29 13:05:46] [INFO ] Deduced a trap composed of 297 places in 247 ms of which 5 ms to minimize.
[2024-05-29 13:05:46] [INFO ] Deduced a trap composed of 297 places in 214 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/783 variables, 3/7 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/783 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 14/797 variables, 1/8 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/797 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 1035/1832 variables, 797/805 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1832 variables, 4/809 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1832 variables, 0/809 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/1832 variables, 0/809 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1832/1832 variables, and 809 constraints, problems are : Problem set: 2 solved, 4 unsolved in 1847 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 797/797 constraints, PredecessorRefiner: 4/6 constraints, Known Traps: 3/3 constraints]
After SMT, in 2457ms problems are : Problem set: 2 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 3 properties in 623 ms.
Support contains 6 out of 797 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 797/797 places, 1035/1035 transitions.
Graph (trivial) has 768 edges and 797 vertex of which 68 / 797 are part of one of the 12 SCC in 0 ms
Free SCC test removed 56 places
Drop transitions (Empty/Sink Transition effects.) removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Graph (complete) has 1188 edges and 741 vertex of which 737 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 537 transitions
Trivial Post-agglo rules discarded 537 transitions
Performed 537 trivial Post agglomeration. Transition count delta: 537
Iterating post reduction 0 with 541 rules applied. Total rules applied 543 place count 737 transition count 418
Reduce places removed 537 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 549 rules applied. Total rules applied 1092 place count 200 transition count 406
Reduce places removed 4 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 2 with 23 rules applied. Total rules applied 1115 place count 196 transition count 387
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 3 with 19 rules applied. Total rules applied 1134 place count 177 transition count 387
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 42 Pre rules applied. Total rules applied 1134 place count 177 transition count 345
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 4 with 84 rules applied. Total rules applied 1218 place count 135 transition count 345
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 1276 place count 106 transition count 316
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 1284 place count 106 transition count 308
Discarding 25 places :
Symmetric choice reduction at 5 with 25 rule applications. Total rules 1309 place count 81 transition count 154
Iterating global reduction 5 with 25 rules applied. Total rules applied 1334 place count 81 transition count 154
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 1346 place count 81 transition count 142
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 1358 place count 69 transition count 130
Iterating global reduction 6 with 12 rules applied. Total rules applied 1370 place count 69 transition count 130
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1378 place count 61 transition count 122
Iterating global reduction 6 with 8 rules applied. Total rules applied 1386 place count 61 transition count 122
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1390 place count 61 transition count 118
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 1398 place count 57 transition count 114
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 1406 place count 53 transition count 135
Free-agglomeration rule applied 6 times.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1412 place count 53 transition count 129
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1418 place count 47 transition count 129
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1422 place count 43 transition count 125
Iterating global reduction 8 with 4 rules applied. Total rules applied 1426 place count 43 transition count 125
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 1428 place count 43 transition count 123
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 1436 place count 43 transition count 123
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1437 place count 43 transition count 122
Applied a total of 1437 rules in 22 ms. Remains 43 /797 variables (removed 754) and now considering 122/1035 (removed 913) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 43/797 places, 122/1035 transitions.
RANDOM walk for 30615 steps (1908 resets) in 46 ms. (651 steps per ms) remains 0/1 properties
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT p2)), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1)), (G (OR (NOT p2) (NOT p0) p1)), (G (OR (NOT p2) (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p2 p0 p1))), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p2) p0 (NOT p1)))), (F p2), (F (NOT (OR (NOT p2) p0 p1))), (F p0), (F (NOT (AND (NOT p0) p1))), (F (NOT p1))]
Knowledge based reduction with 13 factoid took 619 ms. Reduced automaton from 8 states, 22 edges and 3 AP (stutter insensitive) to 8 states, 22 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 375 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false, false]
Stuttering acceptance computed with spot in 330 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false, false]
[2024-05-29 13:05:49] [INFO ] Invariant cache hit.
[2024-05-29 13:05:49] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-05-29 13:05:50] [INFO ] [Real]Absence check using state equation in 604 ms returned sat
[2024-05-29 13:05:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 13:05:50] [INFO ] [Nat]Absence check using 5 positive place invariants in 6 ms returned sat
[2024-05-29 13:05:51] [INFO ] [Nat]Absence check using state equation in 456 ms returned sat
[2024-05-29 13:05:51] [INFO ] Computed and/alt/rep : 1009/1712/1009 causal constraints (skipped 25 transitions) in 64 ms.
[2024-05-29 13:05:59] [INFO ] Added : 639 causal constraints over 129 iterations in 7715 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 6 out of 797 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 797/797 places, 1035/1035 transitions.
Graph (trivial) has 768 edges and 797 vertex of which 68 / 797 are part of one of the 12 SCC in 1 ms
Free SCC test removed 56 places
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 529 transitions
Trivial Post-agglo rules discarded 529 transitions
Performed 529 trivial Post agglomeration. Transition count delta: 529
Iterating post reduction 0 with 529 rules applied. Total rules applied 530 place count 740 transition count 441
Reduce places removed 529 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 541 rules applied. Total rules applied 1071 place count 211 transition count 429
Reduce places removed 4 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 2 with 23 rules applied. Total rules applied 1094 place count 207 transition count 410
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 3 with 19 rules applied. Total rules applied 1113 place count 188 transition count 410
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 38 Pre rules applied. Total rules applied 1113 place count 188 transition count 372
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 1189 place count 150 transition count 372
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1192 place count 147 transition count 369
Iterating global reduction 4 with 3 rules applied. Total rules applied 1195 place count 147 transition count 369
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 1257 place count 116 transition count 338
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 1281 place count 92 transition count 188
Iterating global reduction 4 with 24 rules applied. Total rules applied 1305 place count 92 transition count 188
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 1316 place count 92 transition count 177
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 1328 place count 80 transition count 161
Iterating global reduction 5 with 12 rules applied. Total rules applied 1340 place count 80 transition count 161
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 1352 place count 68 transition count 145
Iterating global reduction 5 with 12 rules applied. Total rules applied 1364 place count 68 transition count 145
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1368 place count 68 transition count 141
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 1384 place count 60 transition count 148
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1385 place count 59 transition count 140
Iterating global reduction 6 with 1 rules applied. Total rules applied 1386 place count 59 transition count 140
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1387 place count 59 transition count 139
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 1391 place count 59 transition count 135
Applied a total of 1391 rules in 32 ms. Remains 59 /797 variables (removed 738) and now considering 135/1035 (removed 900) transitions.
[2024-05-29 13:05:59] [INFO ] Flow matrix only has 131 transitions (discarded 4 similar events)
// Phase 1: matrix 131 rows 59 cols
[2024-05-29 13:05:59] [INFO ] Computed 2 invariants in 2 ms
[2024-05-29 13:05:59] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-29 13:05:59] [INFO ] Flow matrix only has 131 transitions (discarded 4 similar events)
[2024-05-29 13:05:59] [INFO ] Invariant cache hit.
[2024-05-29 13:05:59] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-29 13:05:59] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2024-05-29 13:05:59] [INFO ] Redundant transitions in 1 ms returned []
Running 118 sub problems to find dead transitions.
[2024-05-29 13:05:59] [INFO ] Flow matrix only has 131 transitions (discarded 4 similar events)
[2024-05-29 13:05:59] [INFO ] Invariant cache hit.
[2024-05-29 13:05:59] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-29 13:05:59] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-29 13:05:59] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-05-29 13:05:59] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2024-05-29 13:05:59] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-29 13:05:59] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-29 13:05:59] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2024-05-29 13:05:59] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-05-29 13:06:00] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-29 13:06:00] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-05-29 13:06:00] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-29 13:06:00] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-29 13:06:00] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-29 13:06:01] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (OVERLAPS) 130/189 variables, 59/74 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 8/82 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 11 (OVERLAPS) 1/190 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/190 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 13 (OVERLAPS) 0/190 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 83 constraints, problems are : Problem set: 0 solved, 118 unsolved in 4329 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 59/59 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-29 13:06:03] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 0 ms to minimize.
[2024-05-29 13:06:04] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (OVERLAPS) 130/189 variables, 59/76 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 8/84 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 118/202 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 10 (OVERLAPS) 1/190 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/190 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-29 13:06:07] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-29 13:06:07] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-29 13:06:07] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/190 variables, 3/206 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/190 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 14 (OVERLAPS) 0/190 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 206 constraints, problems are : Problem set: 0 solved, 118 unsolved in 7676 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 59/59 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 18/18 constraints]
After SMT, in 12051ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 12052ms
Starting structural reductions in SI_LTL mode, iteration 1 : 59/797 places, 135/1035 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12208 ms. Remains : 59/797 places, 135/1035 transitions.
Computed a total of 1 stabilizing places and 16 stable transitions
Computed a total of 1 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND p2 p0 p1))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT p2)), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 130 ms. Reduced automaton from 8 states, 22 edges and 3 AP (stutter insensitive) to 8 states, 22 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 382 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false, false]
RANDOM walk for 40000 steps (4481 resets) in 1340 ms. (29 steps per ms) remains 6/10 properties
BEST_FIRST walk for 40004 steps (468 resets) in 147 ms. (270 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (640 resets) in 199 ms. (200 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (450 resets) in 181 ms. (219 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (641 resets) in 38 ms. (1025 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (626 resets) in 155 ms. (256 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (638 resets) in 171 ms. (232 steps per ms) remains 6/6 properties
[2024-05-29 13:06:12] [INFO ] Flow matrix only has 131 transitions (discarded 4 similar events)
[2024-05-29 13:06:12] [INFO ] Invariant cache hit.
[2024-05-29 13:06:12] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf1 is UNSAT
Problem apf3 is UNSAT
At refinement iteration 1 (OVERLAPS) 51/57 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 129/186 variables, 57/58 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 8/66 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 0/66 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 3/189 variables, 2/68 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 1/69 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/69 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/190 variables, 1/70 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/70 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/190 variables, 0/70 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 70 constraints, problems are : Problem set: 2 solved, 4 unsolved in 145 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 59/59 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 51/57 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-29 13:06:12] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-29 13:06:12] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-05-29 13:06:12] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 3/4 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 129/186 variables, 57/61 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 8/69 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 4/73 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 0/73 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 3/189 variables, 2/75 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 1/76 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 0/76 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/190 variables, 1/77 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/190 variables, 0/77 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/190 variables, 0/77 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 77 constraints, problems are : Problem set: 2 solved, 4 unsolved in 360 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 59/59 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 4/6 constraints, Known Traps: 3/3 constraints]
After SMT, in 512ms problems are : Problem set: 2 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 442 steps, including 30 resets, run visited all 1 properties in 2 ms. (steps per millisecond=221 )
Parikh walk visited 4 properties in 7 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND p2 p0 p1))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT p2)), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1)), (G (OR (NOT p0) (NOT p2) p1)), (G (OR (NOT p0) (NOT p2) (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F p0), (F (NOT (AND (NOT p0) p1))), (F p2), (F (NOT (OR p0 p2 p1))), (F (NOT p1)), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F (NOT (OR p0 (NOT p2) p1)))]
Knowledge based reduction with 23 factoid took 418 ms. Reduced automaton from 8 states, 22 edges and 3 AP (stutter insensitive) to 8 states, 22 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 332 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false, false]
Stuttering acceptance computed with spot in 353 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false, false]
[2024-05-29 13:06:14] [INFO ] Flow matrix only has 131 transitions (discarded 4 similar events)
[2024-05-29 13:06:14] [INFO ] Invariant cache hit.
[2024-05-29 13:06:14] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-29 13:06:14] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2024-05-29 13:06:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 13:06:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-29 13:06:14] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-29 13:06:14] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-29 13:06:14] [INFO ] [Nat]Added 9 Read/Feed constraints in 2 ms returned sat
[2024-05-29 13:06:14] [INFO ] Computed and/alt/rep : 97/383/93 causal constraints (skipped 21 transitions) in 11 ms.
[2024-05-29 13:06:14] [INFO ] Added : 35 causal constraints over 8 iterations in 78 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 358 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false, false]
Stuttering criterion allowed to conclude after 214 steps with 22 reset in 2 ms.
FORMULA StigmergyCommit-PT-03b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03b-LTLFireability-09 finished in 93237 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&F(p1)&&G(p2)))))'
Support contains 2 out of 858 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 858/858 places, 1099/1099 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 851 transition count 1092
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 851 transition count 1092
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 844 transition count 1085
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 844 transition count 1085
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 837 transition count 1078
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 837 transition count 1078
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 49 place count 830 transition count 1071
Iterating global reduction 0 with 7 rules applied. Total rules applied 56 place count 830 transition count 1071
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 62 place count 824 transition count 1065
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 824 transition count 1065
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 74 place count 818 transition count 1059
Iterating global reduction 0 with 6 rules applied. Total rules applied 80 place count 818 transition count 1059
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 86 place count 812 transition count 1053
Iterating global reduction 0 with 6 rules applied. Total rules applied 92 place count 812 transition count 1053
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 93 place count 812 transition count 1052
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 97 place count 808 transition count 1048
Iterating global reduction 1 with 4 rules applied. Total rules applied 101 place count 808 transition count 1048
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 104 place count 805 transition count 1045
Iterating global reduction 1 with 3 rules applied. Total rules applied 107 place count 805 transition count 1045
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 108 place count 805 transition count 1044
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 110 place count 803 transition count 1042
Iterating global reduction 2 with 2 rules applied. Total rules applied 112 place count 803 transition count 1042
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 113 place count 803 transition count 1041
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 114 place count 802 transition count 1040
Iterating global reduction 3 with 1 rules applied. Total rules applied 115 place count 802 transition count 1040
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 116 place count 802 transition count 1039
Applied a total of 116 rules in 223 ms. Remains 802 /858 variables (removed 56) and now considering 1039/1099 (removed 60) transitions.
// Phase 1: matrix 1039 rows 802 cols
[2024-05-29 13:06:14] [INFO ] Computed 5 invariants in 8 ms
[2024-05-29 13:06:15] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-05-29 13:06:15] [INFO ] Invariant cache hit.
[2024-05-29 13:06:15] [INFO ] Implicit Places using invariants and state equation in 568 ms returned []
Implicit Place search using SMT with State Equation took 759 ms to find 0 implicit places.
Running 1038 sub problems to find dead transitions.
[2024-05-29 13:06:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/801 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1038 unsolved
At refinement iteration 1 (OVERLAPS) 1/802 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1038 unsolved
[2024-05-29 13:06:39] [INFO ] Deduced a trap composed of 299 places in 249 ms of which 5 ms to minimize.
[2024-05-29 13:06:39] [INFO ] Deduced a trap composed of 292 places in 212 ms of which 3 ms to minimize.
[2024-05-29 13:06:39] [INFO ] Deduced a trap composed of 297 places in 220 ms of which 4 ms to minimize.
[2024-05-29 13:06:39] [INFO ] Deduced a trap composed of 299 places in 191 ms of which 3 ms to minimize.
[2024-05-29 13:06:40] [INFO ] Deduced a trap composed of 299 places in 188 ms of which 3 ms to minimize.
[2024-05-29 13:06:41] [INFO ] Deduced a trap composed of 297 places in 226 ms of which 4 ms to minimize.
[2024-05-29 13:06:41] [INFO ] Deduced a trap composed of 309 places in 227 ms of which 4 ms to minimize.
[2024-05-29 13:06:42] [INFO ] Deduced a trap composed of 297 places in 211 ms of which 3 ms to minimize.
[2024-05-29 13:06:42] [INFO ] Deduced a trap composed of 292 places in 266 ms of which 4 ms to minimize.
[2024-05-29 13:06:44] [INFO ] Deduced a trap composed of 292 places in 275 ms of which 5 ms to minimize.
[2024-05-29 13:06:45] [INFO ] Deduced a trap composed of 290 places in 247 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 802/1841 variables, and 16 constraints, problems are : Problem set: 0 solved, 1038 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/802 constraints, PredecessorRefiner: 1038/1038 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1038 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/801 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1038 unsolved
At refinement iteration 1 (OVERLAPS) 1/802 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1038 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/802 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 1038 unsolved
[2024-05-29 13:06:58] [INFO ] Deduced a trap composed of 298 places in 189 ms of which 3 ms to minimize.
[2024-05-29 13:06:58] [INFO ] Deduced a trap composed of 299 places in 177 ms of which 4 ms to minimize.
[2024-05-29 13:07:01] [INFO ] Deduced a trap composed of 292 places in 257 ms of which 5 ms to minimize.
[2024-05-29 13:07:04] [INFO ] Deduced a trap composed of 293 places in 237 ms of which 5 ms to minimize.
[2024-05-29 13:07:04] [INFO ] Deduced a trap composed of 293 places in 219 ms of which 4 ms to minimize.
[2024-05-29 13:07:04] [INFO ] Deduced a trap composed of 299 places in 236 ms of which 4 ms to minimize.
[2024-05-29 13:07:04] [INFO ] Deduced a trap composed of 298 places in 192 ms of which 3 ms to minimize.
[2024-05-29 13:07:05] [INFO ] Deduced a trap composed of 298 places in 237 ms of which 4 ms to minimize.
[2024-05-29 13:07:05] [INFO ] Deduced a trap composed of 293 places in 203 ms of which 4 ms to minimize.
[2024-05-29 13:07:12] [INFO ] Deduced a trap composed of 311 places in 208 ms of which 4 ms to minimize.
[2024-05-29 13:07:15] [INFO ] Deduced a trap composed of 305 places in 180 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 1)
(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)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 802/1841 variables, and 27 constraints, problems are : Problem set: 0 solved, 1038 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/802 constraints, PredecessorRefiner: 0/1038 constraints, Known Traps: 22/22 constraints]
After SMT, in 60396ms problems are : Problem set: 0 solved, 1038 unsolved
Search for dead transitions found 0 dead transitions in 60406ms
Starting structural reductions in LTL mode, iteration 1 : 802/858 places, 1039/1099 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61390 ms. Remains : 802/858 places, 1039/1099 transitions.
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-10
Product exploration explored 100000 steps with 1275 reset in 117 ms.
Product exploration explored 100000 steps with 1277 reset in 137 ms.
Computed a total of 164 stabilizing places and 172 stable transitions
Computed a total of 164 stabilizing places and 172 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (OR (NOT p0) (NOT p2)))), (X (AND p0 p2)), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (OR (NOT p0) (NOT p2))))), (X (X (AND p0 p2))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 126 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (514 resets) in 1099 ms. (36 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40004 steps (106 resets) in 164 ms. (242 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (108 resets) in 119 ms. (333 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (108 resets) in 103 ms. (384 steps per ms) remains 3/3 properties
[2024-05-29 13:07:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 208/209 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 593/802 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 13:07:17] [INFO ] Deduced a trap composed of 299 places in 198 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/802 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/802 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1039/1841 variables, 802/808 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 13:07:18] [INFO ] Deduced a trap composed of 297 places in 229 ms of which 4 ms to minimize.
[2024-05-29 13:07:18] [INFO ] Deduced a trap composed of 299 places in 202 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1841 variables, 2/810 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1841 variables, 0/810 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/1841 variables, 0/810 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1841/1841 variables, and 810 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1656 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 802/802 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 208/209 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 593/802 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/802 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 13:07:19] [INFO ] Deduced a trap composed of 291 places in 198 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/802 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/802 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1039/1841 variables, 802/811 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1841 variables, 3/814 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1841 variables, 0/814 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1841 variables, 0/814 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1841/1841 variables, and 814 constraints, problems are : Problem set: 0 solved, 3 unsolved in 966 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 802/802 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints]
After SMT, in 2628ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 343 ms.
Support contains 1 out of 802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 802/802 places, 1039/1039 transitions.
Graph (trivial) has 798 edges and 802 vertex of which 68 / 802 are part of one of the 12 SCC in 1 ms
Free SCC test removed 56 places
Drop transitions (Empty/Sink Transition effects.) removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Graph (complete) has 1194 edges and 746 vertex of which 742 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 561 transitions
Trivial Post-agglo rules discarded 561 transitions
Performed 561 trivial Post agglomeration. Transition count delta: 561
Iterating post reduction 0 with 565 rules applied. Total rules applied 567 place count 742 transition count 398
Reduce places removed 561 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 573 rules applied. Total rules applied 1140 place count 181 transition count 386
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1144 place count 177 transition count 386
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 1144 place count 177 transition count 341
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 1234 place count 132 transition count 341
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 1294 place count 102 transition count 311
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 1303 place count 102 transition count 302
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 1328 place count 77 transition count 148
Iterating global reduction 4 with 25 rules applied. Total rules applied 1353 place count 77 transition count 148
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 1365 place count 77 transition count 136
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 1377 place count 65 transition count 124
Iterating global reduction 5 with 12 rules applied. Total rules applied 1389 place count 65 transition count 124
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 1397 place count 57 transition count 116
Iterating global reduction 5 with 8 rules applied. Total rules applied 1405 place count 57 transition count 116
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1409 place count 57 transition count 112
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 1417 place count 53 transition count 108
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 1425 place count 49 transition count 129
Free-agglomeration rule applied 22 times with reduction of 6 identical transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 1447 place count 49 transition count 101
Reduce places removed 22 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 41 rules applied. Total rules applied 1488 place count 27 transition count 82
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1492 place count 23 transition count 78
Iterating global reduction 7 with 4 rules applied. Total rules applied 1496 place count 23 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1497 place count 23 transition count 77
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 8 with 26 rules applied. Total rules applied 1523 place count 23 transition count 51
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 1527 place count 21 transition count 69
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 1535 place count 21 transition count 61
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 1537 place count 21 transition count 61
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1538 place count 21 transition count 60
Applied a total of 1538 rules in 27 ms. Remains 21 /802 variables (removed 781) and now considering 60/1039 (removed 979) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 21/802 places, 60/1039 transitions.
RANDOM walk for 204 steps (0 resets) in 7 ms. (25 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (OR (NOT p0) (NOT p2)))), (X (AND p0 p2)), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (OR (NOT p0) (NOT p2))))), (X (X (AND p0 p2))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p2))), (F (NOT p1)), (F (NOT p2)), (F (NOT (AND p0 p2))), (F (NOT (OR (NOT p0) (NOT p2) p1)))]
Knowledge based reduction with 13 factoid took 377 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Support contains 2 out of 802 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 802/802 places, 1039/1039 transitions.
Applied a total of 0 rules in 23 ms. Remains 802 /802 variables (removed 0) and now considering 1039/1039 (removed 0) transitions.
[2024-05-29 13:07:21] [INFO ] Invariant cache hit.
[2024-05-29 13:07:21] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-05-29 13:07:21] [INFO ] Invariant cache hit.
[2024-05-29 13:07:21] [INFO ] Implicit Places using invariants and state equation in 610 ms returned []
Implicit Place search using SMT with State Equation took 775 ms to find 0 implicit places.
Running 1038 sub problems to find dead transitions.
[2024-05-29 13:07:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/801 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1038 unsolved
At refinement iteration 1 (OVERLAPS) 1/802 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1038 unsolved
[2024-05-29 13:07:45] [INFO ] Deduced a trap composed of 299 places in 264 ms of which 5 ms to minimize.
[2024-05-29 13:07:46] [INFO ] Deduced a trap composed of 292 places in 227 ms of which 5 ms to minimize.
[2024-05-29 13:07:46] [INFO ] Deduced a trap composed of 297 places in 227 ms of which 4 ms to minimize.
[2024-05-29 13:07:46] [INFO ] Deduced a trap composed of 299 places in 196 ms of which 3 ms to minimize.
[2024-05-29 13:07:46] [INFO ] Deduced a trap composed of 299 places in 203 ms of which 4 ms to minimize.
[2024-05-29 13:07:48] [INFO ] Deduced a trap composed of 297 places in 220 ms of which 4 ms to minimize.
[2024-05-29 13:07:48] [INFO ] Deduced a trap composed of 309 places in 231 ms of which 5 ms to minimize.
[2024-05-29 13:07:48] [INFO ] Deduced a trap composed of 297 places in 213 ms of which 4 ms to minimize.
[2024-05-29 13:07:49] [INFO ] Deduced a trap composed of 292 places in 256 ms of which 4 ms to minimize.
[2024-05-29 13:07:50] [INFO ] Deduced a trap composed of 292 places in 283 ms of which 5 ms to minimize.
[2024-05-29 13:07:52] [INFO ] Deduced a trap composed of 290 places in 244 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.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 0.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 1.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 0.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 1.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 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.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 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.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 1.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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 802/1841 variables, and 16 constraints, problems are : Problem set: 0 solved, 1038 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/802 constraints, PredecessorRefiner: 1038/1038 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1038 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/801 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1038 unsolved
At refinement iteration 1 (OVERLAPS) 1/802 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1038 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/802 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 1038 unsolved
[2024-05-29 13:08:04] [INFO ] Deduced a trap composed of 298 places in 187 ms of which 4 ms to minimize.
[2024-05-29 13:08:04] [INFO ] Deduced a trap composed of 299 places in 184 ms of which 4 ms to minimize.
[2024-05-29 13:08:08] [INFO ] Deduced a trap composed of 292 places in 264 ms of which 5 ms to minimize.
[2024-05-29 13:08:10] [INFO ] Deduced a trap composed of 293 places in 218 ms of which 4 ms to minimize.
[2024-05-29 13:08:11] [INFO ] Deduced a trap composed of 293 places in 221 ms of which 4 ms to minimize.
[2024-05-29 13:08:11] [INFO ] Deduced a trap composed of 299 places in 235 ms of which 4 ms to minimize.
[2024-05-29 13:08:11] [INFO ] Deduced a trap composed of 298 places in 196 ms of which 3 ms to minimize.
[2024-05-29 13:08:11] [INFO ] Deduced a trap composed of 298 places in 251 ms of which 5 ms to minimize.
[2024-05-29 13:08:12] [INFO ] Deduced a trap composed of 293 places in 197 ms of which 4 ms to minimize.
[2024-05-29 13:08:19] [INFO ] Deduced a trap composed of 311 places in 193 ms of which 4 ms to minimize.
[2024-05-29 13:08:22] [INFO ] Deduced a trap composed of 305 places in 173 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 802/1841 variables, and 27 constraints, problems are : Problem set: 0 solved, 1038 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/802 constraints, PredecessorRefiner: 0/1038 constraints, Known Traps: 22/22 constraints]
After SMT, in 60399ms problems are : Problem set: 0 solved, 1038 unsolved
Search for dead transitions found 0 dead transitions in 60409ms
Finished structural reductions in LTL mode , in 1 iterations and 61210 ms. Remains : 802/802 places, 1039/1039 transitions.
Computed a total of 164 stabilizing places and 172 stable transitions
Computed a total of 164 stabilizing places and 172 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (OR (NOT p0) (NOT p2)))), (X (AND p0 p2)), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (OR (NOT p0) (NOT p2))))), (X (X (AND p0 p2))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 130 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (519 resets) in 720 ms. (55 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40002 steps (109 resets) in 163 ms. (243 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (110 resets) in 141 ms. (281 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (108 resets) in 140 ms. (283 steps per ms) remains 3/3 properties
[2024-05-29 13:08:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 208/209 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 593/802 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 13:08:23] [INFO ] Deduced a trap composed of 299 places in 189 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/802 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/802 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1039/1841 variables, 802/808 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 13:08:24] [INFO ] Deduced a trap composed of 297 places in 221 ms of which 4 ms to minimize.
[2024-05-29 13:08:24] [INFO ] Deduced a trap composed of 299 places in 190 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1841 variables, 2/810 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1841 variables, 0/810 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/1841 variables, 0/810 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1841/1841 variables, and 810 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1645 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 802/802 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 208/209 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 593/802 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/802 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 13:08:25] [INFO ] Deduced a trap composed of 291 places in 195 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/802 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/802 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1039/1841 variables, 802/811 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1841 variables, 3/814 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1841 variables, 0/814 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1841 variables, 0/814 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1841/1841 variables, and 814 constraints, problems are : Problem set: 0 solved, 3 unsolved in 991 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 802/802 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints]
After SMT, in 2643ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 349 ms.
Support contains 1 out of 802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 802/802 places, 1039/1039 transitions.
Graph (trivial) has 798 edges and 802 vertex of which 68 / 802 are part of one of the 12 SCC in 1 ms
Free SCC test removed 56 places
Drop transitions (Empty/Sink Transition effects.) removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Graph (complete) has 1194 edges and 746 vertex of which 742 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 561 transitions
Trivial Post-agglo rules discarded 561 transitions
Performed 561 trivial Post agglomeration. Transition count delta: 561
Iterating post reduction 0 with 565 rules applied. Total rules applied 567 place count 742 transition count 398
Reduce places removed 561 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 573 rules applied. Total rules applied 1140 place count 181 transition count 386
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1144 place count 177 transition count 386
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 1144 place count 177 transition count 341
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 1234 place count 132 transition count 341
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 1294 place count 102 transition count 311
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 1303 place count 102 transition count 302
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 1328 place count 77 transition count 148
Iterating global reduction 4 with 25 rules applied. Total rules applied 1353 place count 77 transition count 148
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 1365 place count 77 transition count 136
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 1377 place count 65 transition count 124
Iterating global reduction 5 with 12 rules applied. Total rules applied 1389 place count 65 transition count 124
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 1397 place count 57 transition count 116
Iterating global reduction 5 with 8 rules applied. Total rules applied 1405 place count 57 transition count 116
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1409 place count 57 transition count 112
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 1417 place count 53 transition count 108
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 1425 place count 49 transition count 129
Free-agglomeration rule applied 22 times with reduction of 6 identical transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 1447 place count 49 transition count 101
Reduce places removed 22 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 41 rules applied. Total rules applied 1488 place count 27 transition count 82
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1492 place count 23 transition count 78
Iterating global reduction 7 with 4 rules applied. Total rules applied 1496 place count 23 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1497 place count 23 transition count 77
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 8 with 26 rules applied. Total rules applied 1523 place count 23 transition count 51
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 1527 place count 21 transition count 69
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 1535 place count 21 transition count 61
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 1537 place count 21 transition count 61
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1538 place count 21 transition count 60
Applied a total of 1538 rules in 33 ms. Remains 21 /802 variables (removed 781) and now considering 60/1039 (removed 979) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 21/802 places, 60/1039 transitions.
RANDOM walk for 101 steps (0 resets) in 7 ms. (12 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (OR (NOT p0) (NOT p2)))), (X (AND p0 p2)), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (OR (NOT p0) (NOT p2))))), (X (X (AND p0 p2))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p2))), (F (NOT p1)), (F (NOT p2)), (F (NOT (AND p0 p2))), (F (NOT (OR (NOT p0) (NOT p2) p1)))]
Knowledge based reduction with 13 factoid took 363 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Product exploration explored 100000 steps with 1284 reset in 117 ms.
Product exploration explored 100000 steps with 1290 reset in 135 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Support contains 2 out of 802 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 802/802 places, 1039/1039 transitions.
Graph (trivial) has 796 edges and 802 vertex of which 68 / 802 are part of one of the 12 SCC in 1 ms
Free SCC test removed 56 places
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Performed 551 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 551 rules applied. Total rules applied 552 place count 746 transition count 975
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 560 place count 746 transition count 967
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 560 place count 746 transition count 971
Deduced a syphon composed of 584 places in 1 ms
Iterating global reduction 2 with 33 rules applied. Total rules applied 593 place count 746 transition count 971
Discarding 497 places :
Symmetric choice reduction at 2 with 497 rule applications. Total rules 1090 place count 249 transition count 474
Deduced a syphon composed of 90 places in 1 ms
Iterating global reduction 2 with 497 rules applied. Total rules applied 1587 place count 249 transition count 474
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 135 places in 0 ms
Iterating global reduction 2 with 45 rules applied. Total rules applied 1632 place count 249 transition count 486
Discarding 74 places :
Symmetric choice reduction at 2 with 74 rule applications. Total rules 1706 place count 175 transition count 279
Deduced a syphon composed of 86 places in 0 ms
Iterating global reduction 2 with 74 rules applied. Total rules applied 1780 place count 175 transition count 279
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 1794 place count 175 transition count 265
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 1825 place count 144 transition count 230
Deduced a syphon composed of 67 places in 0 ms
Iterating global reduction 3 with 31 rules applied. Total rules applied 1856 place count 144 transition count 230
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1868 place count 132 transition count 218
Deduced a syphon composed of 67 places in 0 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 1880 place count 132 transition count 218
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1884 place count 132 transition count 214
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1892 place count 124 transition count 206
Deduced a syphon composed of 59 places in 0 ms
Iterating global reduction 4 with 8 rules applied. Total rules applied 1900 place count 124 transition count 206
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 66 places in 0 ms
Iterating global reduction 4 with 7 rules applied. Total rules applied 1907 place count 124 transition count 241
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1918 place count 113 transition count 219
Deduced a syphon composed of 55 places in 0 ms
Iterating global reduction 4 with 11 rules applied. Total rules applied 1929 place count 113 transition count 219
Deduced a syphon composed of 55 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 1937 place count 113 transition count 211
Deduced a syphon composed of 55 places in 0 ms
Applied a total of 1937 rules in 54 ms. Remains 113 /802 variables (removed 689) and now considering 211/1039 (removed 828) transitions.
[2024-05-29 13:08:27] [INFO ] Redundant transitions in 1 ms returned []
Running 203 sub problems to find dead transitions.
[2024-05-29 13:08:27] [INFO ] Flow matrix only has 206 transitions (discarded 5 similar events)
// Phase 1: matrix 206 rows 113 cols
[2024-05-29 13:08:27] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 13:08:27] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-05-29 13:08:28] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-29 13:08:28] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-05-29 13:08:28] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-29 13:08:28] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-29 13:08:28] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-29 13:08:28] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 0 ms to minimize.
Problem TDEAD147 is UNSAT
[2024-05-29 13:08:29] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 0 ms to minimize.
[2024-05-29 13:08:29] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 0 ms to minimize.
[2024-05-29 13:08:29] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-29 13:08:29] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD1 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 10/12 constraints. Problems are: Problem set: 10 solved, 193 unsolved
[2024-05-29 13:08:29] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 0 ms to minimize.
[2024-05-29 13:08:29] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-29 13:08:29] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 3/15 constraints. Problems are: Problem set: 10 solved, 193 unsolved
[2024-05-29 13:08:30] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 1/16 constraints. Problems are: Problem set: 10 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/16 constraints. Problems are: Problem set: 10 solved, 193 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD209 is UNSAT
At refinement iteration 6 (OVERLAPS) 205/318 variables, 113/129 constraints. Problems are: Problem set: 84 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 35/164 constraints. Problems are: Problem set: 84 solved, 119 unsolved
[2024-05-29 13:08:32] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/318 variables, 1/165 constraints. Problems are: Problem set: 84 solved, 119 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/318 variables, 0/165 constraints. Problems are: Problem set: 84 solved, 119 unsolved
At refinement iteration 10 (OVERLAPS) 1/319 variables, 1/166 constraints. Problems are: Problem set: 84 solved, 119 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/319 variables, 0/166 constraints. Problems are: Problem set: 84 solved, 119 unsolved
At refinement iteration 12 (OVERLAPS) 0/319 variables, 0/166 constraints. Problems are: Problem set: 84 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 319/319 variables, and 166 constraints, problems are : Problem set: 84 solved, 119 unsolved in 9256 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 84 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 84 solved, 119 unsolved
At refinement iteration 1 (OVERLAPS) 56/113 variables, 2/2 constraints. Problems are: Problem set: 84 solved, 119 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 15/17 constraints. Problems are: Problem set: 84 solved, 119 unsolved
[2024-05-29 13:08:37] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 1/18 constraints. Problems are: Problem set: 84 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/18 constraints. Problems are: Problem set: 84 solved, 119 unsolved
At refinement iteration 5 (OVERLAPS) 205/318 variables, 113/131 constraints. Problems are: Problem set: 84 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 35/166 constraints. Problems are: Problem set: 84 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 119/285 constraints. Problems are: Problem set: 84 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/318 variables, 0/285 constraints. Problems are: Problem set: 84 solved, 119 unsolved
At refinement iteration 9 (OVERLAPS) 1/319 variables, 1/286 constraints. Problems are: Problem set: 84 solved, 119 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/319 variables, 0/286 constraints. Problems are: Problem set: 84 solved, 119 unsolved
[2024-05-29 13:08:42] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/319 variables, 1/287 constraints. Problems are: Problem set: 84 solved, 119 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/319 variables, 0/287 constraints. Problems are: Problem set: 84 solved, 119 unsolved
At refinement iteration 13 (OVERLAPS) 0/319 variables, 0/287 constraints. Problems are: Problem set: 84 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 319/319 variables, and 287 constraints, problems are : Problem set: 84 solved, 119 unsolved in 9249 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 119/203 constraints, Known Traps: 17/17 constraints]
After SMT, in 18581ms problems are : Problem set: 84 solved, 119 unsolved
Search for dead transitions found 84 dead transitions in 18584ms
Found 84 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 84 transitions
Dead transitions reduction (with SMT) removed 84 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 113/802 places, 127/1039 transitions.
Graph (complete) has 283 edges and 113 vertex of which 58 are kept as prefixes of interest. Removing 55 places using SCC suffix rule.1 ms
Discarding 55 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 58 transition count 135
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 9 ms. Remains 58 /113 variables (removed 55) and now considering 135/127 (removed -8) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 58/802 places, 135/1039 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 18656 ms. Remains : 58/802 places, 135/1039 transitions.
Support contains 2 out of 802 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 802/802 places, 1039/1039 transitions.
Applied a total of 0 rules in 17 ms. Remains 802 /802 variables (removed 0) and now considering 1039/1039 (removed 0) transitions.
// Phase 1: matrix 1039 rows 802 cols
[2024-05-29 13:08:46] [INFO ] Computed 5 invariants in 9 ms
[2024-05-29 13:08:46] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-05-29 13:08:46] [INFO ] Invariant cache hit.
[2024-05-29 13:08:46] [INFO ] Implicit Places using invariants and state equation in 562 ms returned []
Implicit Place search using SMT with State Equation took 748 ms to find 0 implicit places.
Running 1038 sub problems to find dead transitions.
[2024-05-29 13:08:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/801 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1038 unsolved
At refinement iteration 1 (OVERLAPS) 1/802 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1038 unsolved
[2024-05-29 13:09:11] [INFO ] Deduced a trap composed of 299 places in 265 ms of which 5 ms to minimize.
[2024-05-29 13:09:11] [INFO ] Deduced a trap composed of 292 places in 220 ms of which 4 ms to minimize.
[2024-05-29 13:09:11] [INFO ] Deduced a trap composed of 297 places in 217 ms of which 4 ms to minimize.
[2024-05-29 13:09:11] [INFO ] Deduced a trap composed of 299 places in 181 ms of which 4 ms to minimize.
[2024-05-29 13:09:12] [INFO ] Deduced a trap composed of 299 places in 177 ms of which 4 ms to minimize.
[2024-05-29 13:09:13] [INFO ] Deduced a trap composed of 297 places in 234 ms of which 4 ms to minimize.
[2024-05-29 13:09:13] [INFO ] Deduced a trap composed of 309 places in 253 ms of which 4 ms to minimize.
[2024-05-29 13:09:14] [INFO ] Deduced a trap composed of 297 places in 225 ms of which 4 ms to minimize.
[2024-05-29 13:09:14] [INFO ] Deduced a trap composed of 292 places in 258 ms of which 5 ms to minimize.
[2024-05-29 13:09:16] [INFO ] Deduced a trap composed of 292 places in 271 ms of which 5 ms to minimize.
[2024-05-29 13:09:17] [INFO ] Deduced a trap composed of 290 places in 238 ms of which 5 ms to minimize.
SMT process timed out in 30542ms, After SMT, problems are : Problem set: 0 solved, 1038 unsolved
Search for dead transitions found 0 dead transitions in 30553ms
Finished structural reductions in LTL mode , in 1 iterations and 31320 ms. Remains : 802/802 places, 1039/1039 transitions.
Treatment of property StigmergyCommit-PT-03b-LTLFireability-10 finished in 182821 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((X(F(p0))&&(p0||G(p1)))))'
Support contains 2 out of 858 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 858/858 places, 1099/1099 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 850 transition count 1091
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 850 transition count 1091
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 842 transition count 1083
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 842 transition count 1083
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 834 transition count 1075
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 834 transition count 1075
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 56 place count 826 transition count 1067
Iterating global reduction 0 with 8 rules applied. Total rules applied 64 place count 826 transition count 1067
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 71 place count 819 transition count 1060
Iterating global reduction 0 with 7 rules applied. Total rules applied 78 place count 819 transition count 1060
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 85 place count 812 transition count 1053
Iterating global reduction 0 with 7 rules applied. Total rules applied 92 place count 812 transition count 1053
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 99 place count 805 transition count 1046
Iterating global reduction 0 with 7 rules applied. Total rules applied 106 place count 805 transition count 1046
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 107 place count 805 transition count 1045
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 112 place count 800 transition count 1040
Iterating global reduction 1 with 5 rules applied. Total rules applied 117 place count 800 transition count 1040
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 121 place count 796 transition count 1036
Iterating global reduction 1 with 4 rules applied. Total rules applied 125 place count 796 transition count 1036
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 126 place count 796 transition count 1035
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 129 place count 793 transition count 1032
Iterating global reduction 2 with 3 rules applied. Total rules applied 132 place count 793 transition count 1032
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 133 place count 793 transition count 1031
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 135 place count 791 transition count 1029
Iterating global reduction 3 with 2 rules applied. Total rules applied 137 place count 791 transition count 1029
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 138 place count 791 transition count 1028
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 139 place count 790 transition count 1027
Iterating global reduction 4 with 1 rules applied. Total rules applied 140 place count 790 transition count 1027
Applied a total of 140 rules in 226 ms. Remains 790 /858 variables (removed 68) and now considering 1027/1099 (removed 72) transitions.
// Phase 1: matrix 1027 rows 790 cols
[2024-05-29 13:09:17] [INFO ] Computed 5 invariants in 13 ms
[2024-05-29 13:09:17] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-05-29 13:09:17] [INFO ] Invariant cache hit.
[2024-05-29 13:09:18] [INFO ] Implicit Places using invariants and state equation in 545 ms returned []
Implicit Place search using SMT with State Equation took 718 ms to find 0 implicit places.
Running 1026 sub problems to find dead transitions.
[2024-05-29 13:09:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/789 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
At refinement iteration 1 (OVERLAPS) 1/790 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
[2024-05-29 13:09:45] [INFO ] Deduced a trap composed of 297 places in 253 ms of which 5 ms to minimize.
[2024-05-29 13:09:45] [INFO ] Deduced a trap composed of 290 places in 179 ms of which 3 ms to minimize.
[2024-05-29 13:09:45] [INFO ] Deduced a trap composed of 297 places in 180 ms of which 3 ms to minimize.
[2024-05-29 13:09:46] [INFO ] Deduced a trap composed of 298 places in 198 ms of which 3 ms to minimize.
[2024-05-29 13:09:48] [INFO ] Deduced a trap composed of 297 places in 194 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 790/1817 variables, and 10 constraints, problems are : Problem set: 0 solved, 1026 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/790 constraints, PredecessorRefiner: 1026/1026 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1026 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/789 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
At refinement iteration 1 (OVERLAPS) 1/790 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/790 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
[2024-05-29 13:10:01] [INFO ] Deduced a trap composed of 292 places in 197 ms of which 3 ms to minimize.
[2024-05-29 13:10:09] [INFO ] Deduced a trap composed of 291 places in 245 ms of which 4 ms to minimize.
[2024-05-29 13:10:10] [INFO ] Deduced a trap composed of 299 places in 191 ms of which 4 ms to minimize.
[2024-05-29 13:10:11] [INFO ] Deduced a trap composed of 293 places in 182 ms of which 3 ms to minimize.
[2024-05-29 13:10:13] [INFO ] Deduced a trap composed of 299 places in 201 ms of which 3 ms to minimize.
[2024-05-29 13:10:13] [INFO ] Deduced a trap composed of 293 places in 194 ms of which 4 ms to minimize.
[2024-05-29 13:10:15] [INFO ] Deduced a trap composed of 299 places in 191 ms of which 3 ms to minimize.
[2024-05-29 13:10:15] [INFO ] Deduced a trap composed of 293 places in 185 ms of which 3 ms to minimize.
[2024-05-29 13:10:16] [INFO ] Deduced a trap composed of 293 places in 192 ms of which 4 ms to minimize.
[2024-05-29 13:10:17] [INFO ] Deduced a trap composed of 292 places in 228 ms of which 4 ms to minimize.
[2024-05-29 13:10:17] [INFO ] Deduced a trap composed of 292 places in 216 ms of which 4 ms to minimize.
[2024-05-29 13:10:17] [INFO ] Deduced a trap composed of 299 places in 196 ms of which 4 ms to minimize.
[2024-05-29 13:10:17] [INFO ] Deduced a trap composed of 291 places in 189 ms of which 3 ms to minimize.
[2024-05-29 13:10:18] [INFO ] Deduced a trap composed of 299 places in 206 ms of which 4 ms to minimize.
[2024-05-29 13:10:18] [INFO ] Deduced a trap composed of 297 places in 212 ms of which 3 ms to minimize.
[2024-05-29 13:10:18] [INFO ] Deduced a trap composed of 293 places in 215 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 790/1817 variables, and 26 constraints, problems are : Problem set: 0 solved, 1026 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/790 constraints, PredecessorRefiner: 0/1026 constraints, Known Traps: 21/21 constraints]
After SMT, in 60371ms problems are : Problem set: 0 solved, 1026 unsolved
Search for dead transitions found 0 dead transitions in 60380ms
Starting structural reductions in LTL mode, iteration 1 : 790/858 places, 1027/1099 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61326 ms. Remains : 790/858 places, 1027/1099 transitions.
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-11
Stuttering criterion allowed to conclude after 99 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-03b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03b-LTLFireability-11 finished in 61520 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(p1)))))'
Support contains 2 out of 858 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 858/858 places, 1099/1099 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 850 transition count 1091
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 850 transition count 1091
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 842 transition count 1083
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 842 transition count 1083
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 834 transition count 1075
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 834 transition count 1075
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 56 place count 826 transition count 1067
Iterating global reduction 0 with 8 rules applied. Total rules applied 64 place count 826 transition count 1067
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 71 place count 819 transition count 1060
Iterating global reduction 0 with 7 rules applied. Total rules applied 78 place count 819 transition count 1060
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 85 place count 812 transition count 1053
Iterating global reduction 0 with 7 rules applied. Total rules applied 92 place count 812 transition count 1053
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 99 place count 805 transition count 1046
Iterating global reduction 0 with 7 rules applied. Total rules applied 106 place count 805 transition count 1046
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 107 place count 805 transition count 1045
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 112 place count 800 transition count 1040
Iterating global reduction 1 with 5 rules applied. Total rules applied 117 place count 800 transition count 1040
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 121 place count 796 transition count 1036
Iterating global reduction 1 with 4 rules applied. Total rules applied 125 place count 796 transition count 1036
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 126 place count 796 transition count 1035
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 129 place count 793 transition count 1032
Iterating global reduction 2 with 3 rules applied. Total rules applied 132 place count 793 transition count 1032
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 133 place count 793 transition count 1031
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 135 place count 791 transition count 1029
Iterating global reduction 3 with 2 rules applied. Total rules applied 137 place count 791 transition count 1029
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 138 place count 791 transition count 1028
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 139 place count 790 transition count 1027
Iterating global reduction 4 with 1 rules applied. Total rules applied 140 place count 790 transition count 1027
Applied a total of 140 rules in 226 ms. Remains 790 /858 variables (removed 68) and now considering 1027/1099 (removed 72) transitions.
[2024-05-29 13:10:19] [INFO ] Invariant cache hit.
[2024-05-29 13:10:19] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-05-29 13:10:19] [INFO ] Invariant cache hit.
[2024-05-29 13:10:20] [INFO ] Implicit Places using invariants and state equation in 571 ms returned []
Implicit Place search using SMT with State Equation took 780 ms to find 0 implicit places.
Running 1026 sub problems to find dead transitions.
[2024-05-29 13:10:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/789 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
At refinement iteration 1 (OVERLAPS) 1/790 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1026 unsolved
[2024-05-29 13:10:47] [INFO ] Deduced a trap composed of 297 places in 272 ms of which 5 ms to minimize.
[2024-05-29 13:10:47] [INFO ] Deduced a trap composed of 290 places in 201 ms of which 4 ms to minimize.
[2024-05-29 13:10:48] [INFO ] Deduced a trap composed of 297 places in 192 ms of which 4 ms to minimize.
[2024-05-29 13:10:49] [INFO ] Deduced a trap composed of 298 places in 198 ms of which 4 ms to minimize.
[2024-05-29 13:10:50] [INFO ] Deduced a trap composed of 297 places in 232 ms of which 4 ms to minimize.
SMT process timed out in 30550ms, After SMT, problems are : Problem set: 0 solved, 1026 unsolved
Search for dead transitions found 0 dead transitions in 30561ms
Starting structural reductions in LTL mode, iteration 1 : 790/858 places, 1027/1099 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31569 ms. Remains : 790/858 places, 1027/1099 transitions.
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-15
Stuttering criterion allowed to conclude after 136 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-03b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03b-LTLFireability-15 finished in 31717 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(X(X((p0&&X(G((G((p2||X(p3)))||p1)))))))))'
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(X(G(p0)))))'
Found a Lengthening insensitive property : StigmergyCommit-PT-03b-LTLFireability-07
Stuttering acceptance computed with spot in 175 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 858 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 858/858 places, 1099/1099 transitions.
Graph (trivial) has 853 edges and 858 vertex of which 68 / 858 are part of one of the 12 SCC in 0 ms
Free SCC test removed 56 places
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 600 transitions
Trivial Post-agglo rules discarded 600 transitions
Performed 600 trivial Post agglomeration. Transition count delta: 600
Iterating post reduction 0 with 600 rules applied. Total rules applied 601 place count 801 transition count 434
Reduce places removed 600 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 611 rules applied. Total rules applied 1212 place count 201 transition count 423
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1216 place count 197 transition count 423
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 1216 place count 197 transition count 382
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 1298 place count 156 transition count 382
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1305 place count 149 transition count 375
Iterating global reduction 3 with 7 rules applied. Total rules applied 1312 place count 149 transition count 375
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1312 place count 149 transition count 374
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1314 place count 148 transition count 374
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1317 place count 145 transition count 371
Iterating global reduction 3 with 3 rules applied. Total rules applied 1320 place count 145 transition count 371
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1321 place count 145 transition count 370
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1322 place count 144 transition count 369
Iterating global reduction 4 with 1 rules applied. Total rules applied 1323 place count 144 transition count 369
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1324 place count 144 transition count 368
Performed 31 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 5 with 62 rules applied. Total rules applied 1386 place count 113 transition count 334
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 1407 place count 92 transition count 222
Iterating global reduction 5 with 21 rules applied. Total rules applied 1428 place count 92 transition count 222
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 1437 place count 92 transition count 213
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 1449 place count 80 transition count 197
Iterating global reduction 6 with 12 rules applied. Total rules applied 1461 place count 80 transition count 197
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 1473 place count 68 transition count 181
Iterating global reduction 6 with 12 rules applied. Total rules applied 1485 place count 68 transition count 181
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1489 place count 68 transition count 177
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 1505 place count 60 transition count 184
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1506 place count 59 transition count 176
Iterating global reduction 7 with 1 rules applied. Total rules applied 1507 place count 59 transition count 176
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1508 place count 59 transition count 175
Applied a total of 1508 rules in 38 ms. Remains 59 /858 variables (removed 799) and now considering 175/1099 (removed 924) transitions.
[2024-05-29 13:10:51] [INFO ] Flow matrix only has 170 transitions (discarded 5 similar events)
// Phase 1: matrix 170 rows 59 cols
[2024-05-29 13:10:51] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 13:10:51] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-29 13:10:51] [INFO ] Flow matrix only has 170 transitions (discarded 5 similar events)
[2024-05-29 13:10:51] [INFO ] Invariant cache hit.
[2024-05-29 13:10:51] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-29 13:10:51] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
Running 158 sub problems to find dead transitions.
[2024-05-29 13:10:51] [INFO ] Flow matrix only has 170 transitions (discarded 5 similar events)
[2024-05-29 13:10:51] [INFO ] Invariant cache hit.
[2024-05-29 13:10:51] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-29 13:10:52] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-29 13:10:52] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 0 ms to minimize.
[2024-05-29 13:10:52] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 0 ms to minimize.
[2024-05-29 13:10:52] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-29 13:10:52] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-29 13:10:52] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-29 13:10:52] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
[2024-05-29 13:10:52] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-29 13:10:52] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-29 13:10:52] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-29 13:10:52] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 0 ms to minimize.
[2024-05-29 13:10:52] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 0 ms to minimize.
[2024-05-29 13:10:52] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 0 ms to minimize.
[2024-05-29 13:10:52] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 5 (OVERLAPS) 169/228 variables, 59/75 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 14/89 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-29 13:10:54] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-29 13:10:54] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-29 13:10:54] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 3/92 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/228 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 9 (OVERLAPS) 1/229 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/229 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 11 (OVERLAPS) 0/229 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Real declared 229/229 variables, and 93 constraints, problems are : Problem set: 0 solved, 158 unsolved in 5582 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 59/59 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 158 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 5 (OVERLAPS) 169/228 variables, 59/78 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 14/92 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 158/250 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/228 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 9 (OVERLAPS) 1/229 variables, 1/251 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-29 13:11:02] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/229 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/229 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 12 (OVERLAPS) 0/229 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Int declared 229/229 variables, and 252 constraints, problems are : Problem set: 0 solved, 158 unsolved in 12108 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 59/59 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 18/18 constraints]
After SMT, in 17809ms problems are : Problem set: 0 solved, 158 unsolved
Search for dead transitions found 0 dead transitions in 17810ms
Starting structural reductions in LI_LTL mode, iteration 1 : 59/858 places, 175/1099 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 17995 ms. Remains : 59/858 places, 175/1099 transitions.
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-07
Entered a terminal (fully accepting) state of product in 212 steps with 28 reset in 1 ms.
Treatment of property StigmergyCommit-PT-03b-LTLFireability-07 finished in 18279 ms.
FORMULA StigmergyCommit-PT-03b-LTLFireability-07 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||G(p1))))))'
Found a Shortening insensitive property : StigmergyCommit-PT-03b-LTLFireability-08
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 5 out of 858 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 858/858 places, 1099/1099 transitions.
Graph (trivial) has 851 edges and 858 vertex of which 68 / 858 are part of one of the 12 SCC in 1 ms
Free SCC test removed 56 places
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 598 transitions
Trivial Post-agglo rules discarded 598 transitions
Performed 598 trivial Post agglomeration. Transition count delta: 598
Iterating post reduction 0 with 598 rules applied. Total rules applied 599 place count 801 transition count 436
Reduce places removed 598 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 609 rules applied. Total rules applied 1208 place count 203 transition count 425
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1212 place count 199 transition count 425
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 1212 place count 199 transition count 384
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 1294 place count 158 transition count 384
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1301 place count 151 transition count 377
Iterating global reduction 3 with 7 rules applied. Total rules applied 1308 place count 151 transition count 377
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1308 place count 151 transition count 376
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1310 place count 150 transition count 376
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1313 place count 147 transition count 373
Iterating global reduction 3 with 3 rules applied. Total rules applied 1316 place count 147 transition count 373
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1317 place count 147 transition count 372
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1318 place count 146 transition count 371
Iterating global reduction 4 with 1 rules applied. Total rules applied 1319 place count 146 transition count 371
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1320 place count 146 transition count 370
Performed 31 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 5 with 62 rules applied. Total rules applied 1382 place count 115 transition count 337
Discarding 20 places :
Symmetric choice reduction at 5 with 20 rule applications. Total rules 1402 place count 95 transition count 252
Iterating global reduction 5 with 20 rules applied. Total rules applied 1422 place count 95 transition count 252
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 1430 place count 95 transition count 244
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 1442 place count 83 transition count 228
Iterating global reduction 6 with 12 rules applied. Total rules applied 1454 place count 83 transition count 228
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 1466 place count 71 transition count 212
Iterating global reduction 6 with 12 rules applied. Total rules applied 1478 place count 71 transition count 212
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1482 place count 71 transition count 208
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 1498 place count 63 transition count 215
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1499 place count 62 transition count 207
Iterating global reduction 7 with 1 rules applied. Total rules applied 1500 place count 62 transition count 207
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1501 place count 62 transition count 206
Applied a total of 1501 rules in 32 ms. Remains 62 /858 variables (removed 796) and now considering 206/1099 (removed 893) transitions.
[2024-05-29 13:11:09] [INFO ] Flow matrix only has 201 transitions (discarded 5 similar events)
// Phase 1: matrix 201 rows 62 cols
[2024-05-29 13:11:09] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 13:11:09] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-29 13:11:09] [INFO ] Flow matrix only has 201 transitions (discarded 5 similar events)
[2024-05-29 13:11:09] [INFO ] Invariant cache hit.
[2024-05-29 13:11:09] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-29 13:11:09] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
Running 189 sub problems to find dead transitions.
[2024-05-29 13:11:09] [INFO ] Flow matrix only has 201 transitions (discarded 5 similar events)
[2024-05-29 13:11:09] [INFO ] Invariant cache hit.
[2024-05-29 13:11:09] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (OVERLAPS) 1/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-29 13:11:10] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-29 13:11:10] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 0 ms to minimize.
[2024-05-29 13:11:10] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-29 13:11:10] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-05-29 13:11:10] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-29 13:11:10] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-29 13:11:10] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
[2024-05-29 13:11:10] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-29 13:11:11] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-29 13:11:11] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-29 13:11:11] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (OVERLAPS) 200/262 variables, 62/75 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 14/89 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 9 (OVERLAPS) 1/263 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-29 13:11:14] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2024-05-29 13:11:15] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/263 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 12 (OVERLAPS) 0/263 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/263 variables, and 92 constraints, problems are : Problem set: 0 solved, 189 unsolved in 7759 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 62/62 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (OVERLAPS) 1/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (OVERLAPS) 200/262 variables, 62/77 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 14/91 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 189/280 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 9 (OVERLAPS) 1/263 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-29 13:11:22] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/263 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-29 13:11:28] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/263 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/263 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 14 (OVERLAPS) 0/263 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Int declared 263/263 variables, and 283 constraints, problems are : Problem set: 0 solved, 189 unsolved in 18156 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 62/62 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 15/15 constraints]
After SMT, in 26066ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 26069ms
Starting structural reductions in LI_LTL mode, iteration 1 : 62/858 places, 206/1099 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 26287 ms. Remains : 62/858 places, 206/1099 transitions.
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-08
Product exploration explored 100000 steps with 198 reset in 100 ms.
Product exploration explored 100000 steps with 3176 reset in 166 ms.
Computed a total of 1 stabilizing places and 16 stable transitions
Computed a total of 1 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 97 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 121 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (5468 resets) in 1514 ms. (26 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (603 resets) in 131 ms. (303 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (600 resets) in 116 ms. (341 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (582 resets) in 166 ms. (239 steps per ms) remains 2/4 properties
[2024-05-29 13:11:36] [INFO ] Flow matrix only has 201 transitions (discarded 5 similar events)
[2024-05-29 13:11:36] [INFO ] Invariant cache hit.
[2024-05-29 13:11:36] [INFO ] State equation strengthened by 15 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 55/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 199/259 variables, 60/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 14/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 3/262 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/263 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/263 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/263 variables, and 79 constraints, problems are : Problem set: 0 solved, 2 unsolved in 113 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 62/62 constraints, ReadFeed: 15/15 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 55/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 13:11:36] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2024-05-29 13:11:36] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2024-05-29 13:11:37] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 199/259 variables, 60/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 14/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 3/262 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/262 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/262 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/263 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/263 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/263 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 263/263 variables, and 84 constraints, problems are : Problem set: 0 solved, 2 unsolved in 320 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 62/62 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 440ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 1007 steps, including 54 resets, run visited all 2 properties in 12 ms. (steps per millisecond=83 )
Parikh walk visited 2 properties in 11 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 5 factoid took 282 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 122 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 206/206 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 206/206 (removed 0) transitions.
[2024-05-29 13:11:37] [INFO ] Flow matrix only has 201 transitions (discarded 5 similar events)
[2024-05-29 13:11:37] [INFO ] Invariant cache hit.
[2024-05-29 13:11:37] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-29 13:11:37] [INFO ] Flow matrix only has 201 transitions (discarded 5 similar events)
[2024-05-29 13:11:37] [INFO ] Invariant cache hit.
[2024-05-29 13:11:37] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-29 13:11:37] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Running 189 sub problems to find dead transitions.
[2024-05-29 13:11:37] [INFO ] Flow matrix only has 201 transitions (discarded 5 similar events)
[2024-05-29 13:11:37] [INFO ] Invariant cache hit.
[2024-05-29 13:11:37] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (OVERLAPS) 1/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-29 13:11:38] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-29 13:11:38] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-29 13:11:38] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-29 13:11:38] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-05-29 13:11:38] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 0 ms to minimize.
[2024-05-29 13:11:38] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 0 ms to minimize.
[2024-05-29 13:11:39] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 0 ms to minimize.
[2024-05-29 13:11:39] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-29 13:11:39] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-05-29 13:11:39] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-29 13:11:40] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (OVERLAPS) 200/262 variables, 62/75 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 14/89 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 9 (OVERLAPS) 1/263 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-29 13:11:43] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-05-29 13:11:43] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/263 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 12 (OVERLAPS) 0/263 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/263 variables, and 92 constraints, problems are : Problem set: 0 solved, 189 unsolved in 7660 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 62/62 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (OVERLAPS) 1/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (OVERLAPS) 200/262 variables, 62/77 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 14/91 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 189/280 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 9 (OVERLAPS) 1/263 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-29 13:11:50] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/263 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-29 13:11:56] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/263 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/263 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 14 (OVERLAPS) 0/263 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Int declared 263/263 variables, and 283 constraints, problems are : Problem set: 0 solved, 189 unsolved in 18504 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 62/62 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 15/15 constraints]
After SMT, in 26327ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 26329ms
Finished structural reductions in LTL mode , in 1 iterations and 26466 ms. Remains : 62/62 places, 206/206 transitions.
Computed a total of 1 stabilizing places and 16 stable transitions
Computed a total of 1 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 93 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 136 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (5404 resets) in 965 ms. (41 steps per ms) remains 2/4 properties
BEST_FIRST walk for 35075 steps (518 resets) in 54 ms. (637 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 5 factoid took 232 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1780 reset in 72 ms.
Product exploration explored 100000 steps with 4275 reset in 92 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 206/206 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 62 transition count 202
Applied a total of 4 rules in 11 ms. Remains 62 /62 variables (removed 0) and now considering 202/206 (removed 4) transitions.
[2024-05-29 13:12:05] [INFO ] Redundant transitions in 1 ms returned []
Running 185 sub problems to find dead transitions.
[2024-05-29 13:12:05] [INFO ] Flow matrix only has 197 transitions (discarded 5 similar events)
// Phase 1: matrix 197 rows 62 cols
[2024-05-29 13:12:05] [INFO ] Computed 2 invariants in 3 ms
[2024-05-29 13:12:05] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (OVERLAPS) 1/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-29 13:12:06] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-29 13:12:06] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 0 ms to minimize.
[2024-05-29 13:12:06] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-29 13:12:06] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 0 ms to minimize.
[2024-05-29 13:12:06] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-29 13:12:06] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-29 13:12:06] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-29 13:12:07] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-29 13:12:07] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-29 13:12:07] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-29 13:12:08] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (OVERLAPS) 196/258 variables, 62/75 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 14/89 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 10 (OVERLAPS) 1/259 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/259 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-29 13:12:12] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/259 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/259 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 14 (OVERLAPS) 0/259 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 259/259 variables, and 91 constraints, problems are : Problem set: 0 solved, 185 unsolved in 8759 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 62/62 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (OVERLAPS) 1/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (OVERLAPS) 196/258 variables, 62/76 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 14/90 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 185/275 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-29 13:12:18] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 10 (OVERLAPS) 1/259 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/259 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 12 (OVERLAPS) 0/259 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Int declared 259/259 variables, and 277 constraints, problems are : Problem set: 0 solved, 185 unsolved in 15964 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 62/62 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 13/13 constraints]
After SMT, in 24887ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 24889ms
Starting structural reductions in SI_LTL mode, iteration 1 : 62/62 places, 202/206 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 24908 ms. Remains : 62/62 places, 202/206 transitions.
Support contains 5 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 206/206 transitions.
Applied a total of 0 rules in 0 ms. Remains 62 /62 variables (removed 0) and now considering 206/206 (removed 0) transitions.
[2024-05-29 13:12:30] [INFO ] Flow matrix only has 201 transitions (discarded 5 similar events)
// Phase 1: matrix 201 rows 62 cols
[2024-05-29 13:12:30] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 13:12:30] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-29 13:12:30] [INFO ] Flow matrix only has 201 transitions (discarded 5 similar events)
[2024-05-29 13:12:30] [INFO ] Invariant cache hit.
[2024-05-29 13:12:30] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-29 13:12:30] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Running 189 sub problems to find dead transitions.
[2024-05-29 13:12:30] [INFO ] Flow matrix only has 201 transitions (discarded 5 similar events)
[2024-05-29 13:12:30] [INFO ] Invariant cache hit.
[2024-05-29 13:12:30] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (OVERLAPS) 1/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-29 13:12:31] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 0 ms to minimize.
[2024-05-29 13:12:31] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-29 13:12:31] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-29 13:12:31] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-05-29 13:12:31] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 0 ms to minimize.
[2024-05-29 13:12:32] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-29 13:12:32] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-29 13:12:32] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 0 ms to minimize.
[2024-05-29 13:12:32] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 0 ms to minimize.
[2024-05-29 13:12:32] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-29 13:12:33] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (OVERLAPS) 200/262 variables, 62/75 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 14/89 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 9 (OVERLAPS) 1/263 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-29 13:12:36] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-29 13:12:36] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/263 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 12 (OVERLAPS) 0/263 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/263 variables, and 92 constraints, problems are : Problem set: 0 solved, 189 unsolved in 7835 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 62/62 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (OVERLAPS) 1/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (OVERLAPS) 200/262 variables, 62/77 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 14/91 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 189/280 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 9 (OVERLAPS) 1/263 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-29 13:12:44] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/263 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-29 13:12:49] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/263 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/263 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 14 (OVERLAPS) 0/263 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Int declared 263/263 variables, and 283 constraints, problems are : Problem set: 0 solved, 189 unsolved in 18250 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 62/62 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 15/15 constraints]
After SMT, in 26263ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 26265ms
Finished structural reductions in LTL mode , in 1 iterations and 26433 ms. Remains : 62/62 places, 206/206 transitions.
Treatment of property StigmergyCommit-PT-03b-LTLFireability-08 finished in 108037 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&F(p1)&&G(p2)))))'
Found a Shortening insensitive property : StigmergyCommit-PT-03b-LTLFireability-10
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Support contains 2 out of 858 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 858/858 places, 1099/1099 transitions.
Graph (trivial) has 853 edges and 858 vertex of which 68 / 858 are part of one of the 12 SCC in 0 ms
Free SCC test removed 56 places
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 600 transitions
Trivial Post-agglo rules discarded 600 transitions
Performed 600 trivial Post agglomeration. Transition count delta: 600
Iterating post reduction 0 with 600 rules applied. Total rules applied 601 place count 801 transition count 434
Reduce places removed 600 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 611 rules applied. Total rules applied 1212 place count 201 transition count 423
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1216 place count 197 transition count 423
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 1216 place count 197 transition count 381
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 1300 place count 155 transition count 381
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1306 place count 149 transition count 375
Iterating global reduction 3 with 6 rules applied. Total rules applied 1312 place count 149 transition count 375
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1315 place count 146 transition count 372
Iterating global reduction 3 with 3 rules applied. Total rules applied 1318 place count 146 transition count 372
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1319 place count 146 transition count 371
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1320 place count 145 transition count 370
Iterating global reduction 4 with 1 rules applied. Total rules applied 1321 place count 145 transition count 370
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1322 place count 145 transition count 369
Performed 32 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 5 with 64 rules applied. Total rules applied 1386 place count 113 transition count 334
Discarding 23 places :
Symmetric choice reduction at 5 with 23 rule applications. Total rules 1409 place count 90 transition count 185
Iterating global reduction 5 with 23 rules applied. Total rules applied 1432 place count 90 transition count 185
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 1442 place count 90 transition count 175
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 1454 place count 78 transition count 159
Iterating global reduction 6 with 12 rules applied. Total rules applied 1466 place count 78 transition count 159
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 1478 place count 66 transition count 143
Iterating global reduction 6 with 12 rules applied. Total rules applied 1490 place count 66 transition count 143
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1494 place count 66 transition count 139
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 1510 place count 58 transition count 146
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1511 place count 57 transition count 138
Iterating global reduction 7 with 1 rules applied. Total rules applied 1512 place count 57 transition count 138
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1513 place count 57 transition count 137
Applied a total of 1513 rules in 26 ms. Remains 57 /858 variables (removed 801) and now considering 137/1099 (removed 962) transitions.
[2024-05-29 13:12:57] [INFO ] Flow matrix only has 132 transitions (discarded 5 similar events)
// Phase 1: matrix 132 rows 57 cols
[2024-05-29 13:12:57] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 13:12:57] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-29 13:12:57] [INFO ] Flow matrix only has 132 transitions (discarded 5 similar events)
[2024-05-29 13:12:57] [INFO ] Invariant cache hit.
[2024-05-29 13:12:57] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-29 13:12:57] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2024-05-29 13:12:57] [INFO ] Flow matrix only has 132 transitions (discarded 5 similar events)
[2024-05-29 13:12:57] [INFO ] Invariant cache hit.
[2024-05-29 13:12:57] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/57 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-29 13:12:58] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 0 ms to minimize.
[2024-05-29 13:12:58] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-05-29 13:12:58] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-29 13:12:58] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-29 13:12:58] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-29 13:12:58] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-29 13:12:58] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-29 13:12:58] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2024-05-29 13:12:58] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-29 13:12:58] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 0 ms to minimize.
[2024-05-29 13:12:58] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-05-29 13:12:58] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 0 ms to minimize.
[2024-05-29 13:12:58] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-29 13:12:58] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-29 13:12:59] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-29 13:12:59] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 131/188 variables, 57/75 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 14/89 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (OVERLAPS) 1/189 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 11 (OVERLAPS) 0/189 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 90 constraints, problems are : Problem set: 0 solved, 120 unsolved in 3800 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 57/57 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/57 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-29 13:13:01] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-05-29 13:13:02] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-29 13:13:02] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2024-05-29 13:13:02] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-29 13:13:02] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-29 13:13:02] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 0 ms to minimize.
[2024-05-29 13:13:02] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 131/188 variables, 57/82 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 14/96 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 120/216 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 12 (OVERLAPS) 1/189 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/189 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 14 (OVERLAPS) 0/189 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 217 constraints, problems are : Problem set: 0 solved, 120 unsolved in 6780 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 57/57 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 23/23 constraints]
After SMT, in 10625ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 10626ms
Starting structural reductions in LI_LTL mode, iteration 1 : 57/858 places, 137/1099 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 10819 ms. Remains : 57/858 places, 137/1099 transitions.
Running random walk in product with property : StigmergyCommit-PT-03b-LTLFireability-10
Product exploration explored 100000 steps with 3370 reset in 67 ms.
Product exploration explored 100000 steps with 19 reset in 46 ms.
Computed a total of 1 stabilizing places and 16 stable transitions
Computed a total of 1 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (OR (NOT p0) (NOT p2)))), (X (AND p0 p2)), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (OR (NOT p0) (NOT p2))))), (X (X (AND p0 p2))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 145 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (5593 resets) in 379 ms. (105 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40004 steps (635 resets) in 77 ms. (512 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (639 resets) in 110 ms. (360 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (631 resets) in 70 ms. (563 steps per ms) remains 3/3 properties
[2024-05-29 13:13:09] [INFO ] Flow matrix only has 132 transitions (discarded 5 similar events)
[2024-05-29 13:13:09] [INFO ] Invariant cache hit.
[2024-05-29 13:13:09] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 13:13:09] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-29 13:13:09] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-29 13:13:09] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-05-29 13:13:09] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-29 13:13:09] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 130/185 variables, 55/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 14/75 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 3/188 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/189 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/189 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/189 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 79 constraints, problems are : Problem set: 0 solved, 3 unsolved in 315 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 57/57 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 130/185 variables, 55/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 14/75 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 3/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 3/188 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/189 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/189 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/189 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 82 constraints, problems are : Problem set: 0 solved, 3 unsolved in 121 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 57/57 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 5/5 constraints]
After SMT, in 440ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 23 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=23 )
Parikh walk visited 3 properties in 1 ms.
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (OR (NOT p0) (NOT p2)))), (X (AND p0 p2)), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (OR (NOT p0) (NOT p2))))), (X (X (AND p0 p2))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p2))), (F (NOT p1)), (F (NOT p2)), (F (NOT (AND p0 p2))), (F (NOT (OR (NOT p0) (NOT p2) p1)))]
Knowledge based reduction with 13 factoid took 350 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Support contains 2 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 137/137 transitions.
Applied a total of 0 rules in 0 ms. Remains 57 /57 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2024-05-29 13:13:10] [INFO ] Flow matrix only has 132 transitions (discarded 5 similar events)
[2024-05-29 13:13:10] [INFO ] Invariant cache hit.
[2024-05-29 13:13:10] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-29 13:13:10] [INFO ] Flow matrix only has 132 transitions (discarded 5 similar events)
[2024-05-29 13:13:10] [INFO ] Invariant cache hit.
[2024-05-29 13:13:10] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-29 13:13:10] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2024-05-29 13:13:10] [INFO ] Flow matrix only has 132 transitions (discarded 5 similar events)
[2024-05-29 13:13:10] [INFO ] Invariant cache hit.
[2024-05-29 13:13:10] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/57 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-29 13:13:10] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 0 ms to minimize.
[2024-05-29 13:13:10] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-29 13:13:10] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2024-05-29 13:13:10] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-29 13:13:10] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-29 13:13:10] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-29 13:13:11] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-05-29 13:13:11] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-29 13:13:11] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-29 13:13:11] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-29 13:13:11] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-29 13:13:11] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-29 13:13:11] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-29 13:13:11] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-29 13:13:11] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-29 13:13:11] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 131/188 variables, 57/75 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 14/89 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (OVERLAPS) 1/189 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 11 (OVERLAPS) 0/189 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 90 constraints, problems are : Problem set: 0 solved, 120 unsolved in 3679 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 57/57 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/57 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-29 13:13:14] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 0 ms to minimize.
[2024-05-29 13:13:14] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 0 ms to minimize.
[2024-05-29 13:13:14] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 0 ms to minimize.
[2024-05-29 13:13:14] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-29 13:13:14] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-29 13:13:14] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2024-05-29 13:13:14] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 131/188 variables, 57/82 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 14/96 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 120/216 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 12 (OVERLAPS) 1/189 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/189 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 14 (OVERLAPS) 0/189 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 217 constraints, problems are : Problem set: 0 solved, 120 unsolved in 6646 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 57/57 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 23/23 constraints]
After SMT, in 10388ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 10389ms
Finished structural reductions in LTL mode , in 1 iterations and 10510 ms. Remains : 57/57 places, 137/137 transitions.
Computed a total of 1 stabilizing places and 16 stable transitions
Computed a total of 1 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (OR (NOT p0) (NOT p2)))), (X (AND p0 p2)), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (OR (NOT p0) (NOT p2))))), (X (X (AND p0 p2))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 120 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (5565 resets) in 779 ms. (51 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40003 steps (646 resets) in 104 ms. (380 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (647 resets) in 102 ms. (388 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (638 resets) in 72 ms. (548 steps per ms) remains 3/3 properties
[2024-05-29 13:13:21] [INFO ] Flow matrix only has 132 transitions (discarded 5 similar events)
[2024-05-29 13:13:21] [INFO ] Invariant cache hit.
[2024-05-29 13:13:21] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 13:13:21] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-29 13:13:21] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-29 13:13:21] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-29 13:13:21] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2024-05-29 13:13:21] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 130/185 variables, 55/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 14/75 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 3/188 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/189 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/189 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/189 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 79 constraints, problems are : Problem set: 0 solved, 3 unsolved in 310 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 57/57 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 130/185 variables, 55/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 14/75 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 3/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 3/188 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/189 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/189 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/189 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 82 constraints, problems are : Problem set: 0 solved, 3 unsolved in 123 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 57/57 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 5/5 constraints]
After SMT, in 452ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 109 steps, including 6 resets, run visited all 3 properties in 5 ms. (steps per millisecond=21 )
Parikh walk visited 3 properties in 4 ms.
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (OR (NOT p0) (NOT p2)))), (X (AND p0 p2)), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (OR (NOT p0) (NOT p2))))), (X (X (AND p0 p2))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p2))), (F (NOT p1)), (F (NOT p2)), (F (NOT (AND p0 p2))), (F (NOT (OR (NOT p0) (NOT p2) p1)))]
Knowledge based reduction with 13 factoid took 321 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Product exploration explored 100000 steps with 1521 reset in 56 ms.
Product exploration explored 100000 steps with 2144 reset in 55 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Support contains 2 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 137/137 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 57 transition count 133
Applied a total of 4 rules in 7 ms. Remains 57 /57 variables (removed 0) and now considering 133/137 (removed 4) transitions.
[2024-05-29 13:13:23] [INFO ] Redundant transitions in 0 ms returned []
Running 116 sub problems to find dead transitions.
[2024-05-29 13:13:23] [INFO ] Flow matrix only has 128 transitions (discarded 5 similar events)
// Phase 1: matrix 128 rows 57 cols
[2024-05-29 13:13:23] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 13:13:23] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (OVERLAPS) 1/57 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-29 13:13:23] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 0 ms to minimize.
[2024-05-29 13:13:23] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-29 13:13:23] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-05-29 13:13:23] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-29 13:13:23] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-29 13:13:23] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2024-05-29 13:13:23] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-29 13:13:23] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-29 13:13:23] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-29 13:13:23] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-29 13:13:24] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2024-05-29 13:13:24] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-05-29 13:13:24] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2024-05-29 13:13:24] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-05-29 13:13:24] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 0 ms to minimize.
[2024-05-29 13:13:24] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-29 13:13:24] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-29 13:13:24] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
[2024-05-29 13:13:24] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 0 ms to minimize.
[2024-05-29 13:13:24] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 127/184 variables, 57/79 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 14/93 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (OVERLAPS) 1/185 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-29 13:13:26] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/185 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 12 (OVERLAPS) 0/185 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 95 constraints, problems are : Problem set: 0 solved, 116 unsolved in 4521 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 57/57 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (OVERLAPS) 1/57 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-29 13:13:28] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-29 13:13:28] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (OVERLAPS) 127/184 variables, 57/82 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 14/96 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 116/212 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/184 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 11 (OVERLAPS) 1/185 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/185 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 13 (OVERLAPS) 0/185 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 213 constraints, problems are : Problem set: 0 solved, 116 unsolved in 6118 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 57/57 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 23/23 constraints]
After SMT, in 10694ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 10696ms
Starting structural reductions in SI_LTL mode, iteration 1 : 57/57 places, 133/137 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10712 ms. Remains : 57/57 places, 133/137 transitions.
Support contains 2 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 137/137 transitions.
Applied a total of 0 rules in 1 ms. Remains 57 /57 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2024-05-29 13:13:33] [INFO ] Flow matrix only has 132 transitions (discarded 5 similar events)
// Phase 1: matrix 132 rows 57 cols
[2024-05-29 13:13:33] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 13:13:33] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-29 13:13:33] [INFO ] Flow matrix only has 132 transitions (discarded 5 similar events)
[2024-05-29 13:13:33] [INFO ] Invariant cache hit.
[2024-05-29 13:13:33] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-29 13:13:33] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2024-05-29 13:13:33] [INFO ] Flow matrix only has 132 transitions (discarded 5 similar events)
[2024-05-29 13:13:33] [INFO ] Invariant cache hit.
[2024-05-29 13:13:33] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/57 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-29 13:13:34] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-29 13:13:34] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2024-05-29 13:13:34] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-05-29 13:13:34] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-05-29 13:13:34] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-29 13:13:34] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-05-29 13:13:34] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-29 13:13:34] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-05-29 13:13:34] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-29 13:13:34] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-29 13:13:34] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-05-29 13:13:34] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-29 13:13:34] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-05-29 13:13:35] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-29 13:13:35] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 0 ms to minimize.
[2024-05-29 13:13:35] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 131/188 variables, 57/75 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 14/89 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (OVERLAPS) 1/189 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 11 (OVERLAPS) 0/189 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 90 constraints, problems are : Problem set: 0 solved, 120 unsolved in 3658 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 57/57 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/57 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-29 13:13:38] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-29 13:13:38] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-29 13:13:38] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-29 13:13:38] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-29 13:13:38] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-29 13:13:38] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-29 13:13:38] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 131/188 variables, 57/82 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 14/96 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 120/216 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 12 (OVERLAPS) 1/189 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/189 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 14 (OVERLAPS) 0/189 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 217 constraints, problems are : Problem set: 0 solved, 120 unsolved in 6724 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 57/57 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 23/23 constraints]
After SMT, in 10425ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 10427ms
Finished structural reductions in LTL mode , in 1 iterations and 10544 ms. Remains : 57/57 places, 137/137 transitions.
Treatment of property StigmergyCommit-PT-03b-LTLFireability-10 finished in 47125 ms.
[2024-05-29 13:13:44] [INFO ] Flatten gal took : 48 ms
[2024-05-29 13:13:44] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-29 13:13:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 858 places, 1099 transitions and 3390 arcs took 9 ms.
Total runtime 1427181 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running StigmergyCommit-PT-03b

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/410/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 858
TRANSITIONS: 1099
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.014s, Sys 0.006s]


SAVING FILE /home/mcc/execution/410/model (.net / .def) ...
EXPORT TIME: [User 0.003s, 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: 4691
MODEL NAME: /home/mcc/execution/410/model
858 places, 1099 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 StigmergyCommit-PT-03b-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyCommit-PT-03b-LTLFireability-02 CANNOT_COMPUTE
FORMULA StigmergyCommit-PT-03b-LTLFireability-08 CANNOT_COMPUTE
FORMULA StigmergyCommit-PT-03b-LTLFireability-10 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716988921173

--------------------
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="StigmergyCommit-PT-03b"
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 StigmergyCommit-PT-03b, 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 r399-tall-171690529600116"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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