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.r575-smll-171734919600124.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 MedleyA-PT-16, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r575-smll-171734919600124
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 5.6K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 15K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 169K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 89K Jun 2 16:33 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 MedleyA-PT-16-LTLFireability-00
FORMULA_NAME MedleyA-PT-16-LTLFireability-01
FORMULA_NAME MedleyA-PT-16-LTLFireability-02
FORMULA_NAME MedleyA-PT-16-LTLFireability-03
FORMULA_NAME MedleyA-PT-16-LTLFireability-04
FORMULA_NAME MedleyA-PT-16-LTLFireability-05
FORMULA_NAME MedleyA-PT-16-LTLFireability-06
FORMULA_NAME MedleyA-PT-16-LTLFireability-07
FORMULA_NAME MedleyA-PT-16-LTLFireability-08
FORMULA_NAME MedleyA-PT-16-LTLFireability-09
FORMULA_NAME MedleyA-PT-16-LTLFireability-10
FORMULA_NAME MedleyA-PT-16-LTLFireability-11
FORMULA_NAME MedleyA-PT-16-LTLFireability-12
FORMULA_NAME MedleyA-PT-16-LTLFireability-13
FORMULA_NAME MedleyA-PT-16-LTLFireability-14
FORMULA_NAME MedleyA-PT-16-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717365750449

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-16
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 22:02:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 22:02:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:02:33] [INFO ] Load time of PNML (sax parser for PT used): 283 ms
[2024-06-02 22:02:33] [INFO ] Transformed 196 places.
[2024-06-02 22:02:33] [INFO ] Transformed 392 transitions.
[2024-06-02 22:02:33] [INFO ] Found NUPN structural information;
[2024-06-02 22:02:33] [INFO ] Parsed PT model containing 196 places and 392 transitions and 1186 arcs in 527 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 26 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
FORMULA MedleyA-PT-16-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-16-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-16-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-16-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 390/390 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 162 transition count 338
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 162 transition count 338
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 81 place count 162 transition count 325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 82 place count 161 transition count 324
Iterating global reduction 1 with 1 rules applied. Total rules applied 83 place count 161 transition count 324
Applied a total of 83 rules in 110 ms. Remains 161 /196 variables (removed 35) and now considering 324/390 (removed 66) transitions.
// Phase 1: matrix 324 rows 161 cols
[2024-06-02 22:02:34] [INFO ] Computed 7 invariants in 40 ms
[2024-06-02 22:02:34] [INFO ] Implicit Places using invariants in 461 ms returned []
[2024-06-02 22:02:34] [INFO ] Invariant cache hit.
[2024-06-02 22:02:35] [INFO ] Implicit Places using invariants and state equation in 466 ms returned []
Implicit Place search using SMT with State Equation took 1004 ms to find 0 implicit places.
Running 323 sub problems to find dead transitions.
[2024-06-02 22:02:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 1 (OVERLAPS) 1/161 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 323 unsolved
[2024-06-02 22:02:40] [INFO ] Deduced a trap composed of 25 places in 234 ms of which 37 ms to minimize.
[2024-06-02 22:02:40] [INFO ] Deduced a trap composed of 25 places in 181 ms of which 4 ms to minimize.
[2024-06-02 22:02:40] [INFO ] Deduced a trap composed of 28 places in 177 ms of which 4 ms to minimize.
[2024-06-02 22:02:40] [INFO ] Deduced a trap composed of 23 places in 192 ms of which 3 ms to minimize.
[2024-06-02 22:02:40] [INFO ] Deduced a trap composed of 22 places in 167 ms of which 3 ms to minimize.
[2024-06-02 22:02:41] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 3 ms to minimize.
[2024-06-02 22:02:41] [INFO ] Deduced a trap composed of 31 places in 135 ms of which 3 ms to minimize.
[2024-06-02 22:02:41] [INFO ] Deduced a trap composed of 89 places in 135 ms of which 3 ms to minimize.
[2024-06-02 22:02:41] [INFO ] Deduced a trap composed of 95 places in 110 ms of which 2 ms to minimize.
[2024-06-02 22:02:41] [INFO ] Deduced a trap composed of 89 places in 113 ms of which 11 ms to minimize.
[2024-06-02 22:02:42] [INFO ] Deduced a trap composed of 35 places in 123 ms of which 2 ms to minimize.
[2024-06-02 22:02:42] [INFO ] Deduced a trap composed of 105 places in 85 ms of which 6 ms to minimize.
[2024-06-02 22:02:42] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 2 ms to minimize.
[2024-06-02 22:02:43] [INFO ] Deduced a trap composed of 105 places in 86 ms of which 2 ms to minimize.
[2024-06-02 22:02:43] [INFO ] Deduced a trap composed of 35 places in 122 ms of which 2 ms to minimize.
[2024-06-02 22:02:43] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 2 ms to minimize.
[2024-06-02 22:02:43] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 2 ms to minimize.
[2024-06-02 22:02:43] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 1 ms to minimize.
[2024-06-02 22:02:43] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 2 ms to minimize.
[2024-06-02 22:02:43] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 323 unsolved
[2024-06-02 22:02:44] [INFO ] Deduced a trap composed of 111 places in 165 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 323 unsolved
[2024-06-02 22:02:49] [INFO ] Deduced a trap composed of 39 places in 148 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 6 (OVERLAPS) 324/485 variables, 161/190 constraints. Problems are: Problem set: 0 solved, 323 unsolved
[2024-06-02 22:02:58] [INFO ] Deduced a trap composed of 111 places in 181 ms of which 4 ms to minimize.
[2024-06-02 22:02:58] [INFO ] Deduced a trap composed of 117 places in 144 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 2/192 constraints. Problems are: Problem set: 0 solved, 323 unsolved
[2024-06-02 22:03:03] [INFO ] Deduced a trap composed of 26 places in 147 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/485 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 323 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 485/485 variables, and 193 constraints, problems are : Problem set: 0 solved, 323 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 323/323 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 323 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 1 (OVERLAPS) 1/161 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 25/32 constraints. Problems are: Problem set: 0 solved, 323 unsolved
[2024-06-02 22:03:09] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 323 unsolved
[2024-06-02 22:03:11] [INFO ] Deduced a trap composed of 26 places in 130 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 323 unsolved
[2024-06-02 22:03:14] [INFO ] Deduced a trap composed of 116 places in 176 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 7 (OVERLAPS) 324/485 variables, 161/196 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/485 variables, 323/519 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/485 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 323 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 485/485 variables, and 519 constraints, problems are : Problem set: 0 solved, 323 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 323/323 constraints, Known Traps: 28/28 constraints]
After SMT, in 60503ms problems are : Problem set: 0 solved, 323 unsolved
Search for dead transitions found 0 dead transitions in 60545ms
Starting structural reductions in LTL mode, iteration 1 : 161/196 places, 324/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61710 ms. Remains : 161/196 places, 324/390 transitions.
Support contains 31 out of 161 places after structural reductions.
[2024-06-02 22:03:36] [INFO ] Flatten gal took : 108 ms
[2024-06-02 22:03:36] [INFO ] Flatten gal took : 47 ms
[2024-06-02 22:03:36] [INFO ] Input system was already deterministic with 324 transitions.
RANDOM walk for 40000 steps (8 resets) in 2750 ms. (14 steps per ms) remains 17/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 64 ms. (61 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (8 resets) in 59 ms. (66 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (8 resets) in 64 ms. (61 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 73 ms. (54 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 61 ms. (64 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (8 resets) in 30 ms. (129 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (8 resets) in 25 ms. (153 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (8 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (8 resets) in 25 ms. (153 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4000 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (8 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4000 steps (8 resets) in 13 ms. (285 steps per ms) remains 17/17 properties
[2024-06-02 22:03:37] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 131/155 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-06-02 22:03:37] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-06-02 22:03:37] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 1 ms to minimize.
[2024-06-02 22:03:37] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 2 ms to minimize.
[2024-06-02 22:03:37] [INFO ] Deduced a trap composed of 35 places in 101 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-06-02 22:03:38] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 2 ms to minimize.
[2024-06-02 22:03:38] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-06-02 22:03:38] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 6/161 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 324/485 variables, 161/175 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/485 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 0/485 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 175 constraints, problems are : Problem set: 0 solved, 17 unsolved in 1816 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 131/155 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 6/161 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 324/485 variables, 161/175 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 17/192 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/485 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 0/485 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 192 constraints, problems are : Problem set: 0 solved, 17 unsolved in 2008 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 7/7 constraints]
After SMT, in 3841ms problems are : Problem set: 0 solved, 17 unsolved
Fused 17 Parikh solutions to 16 different solutions.
Parikh walk visited 14 properties in 12864 ms.
Support contains 3 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 324/324 transitions.
Graph (trivial) has 169 edges and 161 vertex of which 13 / 161 are part of one of the 3 SCC in 4 ms
Free SCC test removed 10 places
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 151 transition count 282
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 33 rules applied. Total rules applied 63 place count 122 transition count 278
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 65 place count 120 transition count 278
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 65 place count 120 transition count 269
Deduced a syphon composed of 9 places in 5 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 83 place count 111 transition count 269
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 84 place count 111 transition count 268
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 91 place count 104 transition count 254
Iterating global reduction 4 with 7 rules applied. Total rules applied 98 place count 104 transition count 254
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 100 place count 104 transition count 252
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 52 rules applied. Total rules applied 152 place count 78 transition count 226
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 158 place count 78 transition count 220
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 162 place count 74 transition count 209
Iterating global reduction 6 with 4 rules applied. Total rules applied 166 place count 74 transition count 209
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -115
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 6 with 36 rules applied. Total rules applied 202 place count 56 transition count 324
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 207 place count 56 transition count 319
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 209 place count 55 transition count 336
Drop transitions (Redundant composition of simpler transitions.) removed 59 transitions
Redundant transition composition rules discarded 59 transitions
Iterating global reduction 7 with 59 rules applied. Total rules applied 268 place count 55 transition count 277
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 270 place count 54 transition count 290
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 271 place count 54 transition count 289
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 272 place count 54 transition count 288
Free-agglomeration rule applied 13 times with reduction of 6 identical transitions.
Iterating global reduction 8 with 13 rules applied. Total rules applied 285 place count 54 transition count 269
Reduce places removed 13 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 8 with 34 rules applied. Total rules applied 319 place count 41 transition count 248
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 9 with 18 rules applied. Total rules applied 337 place count 41 transition count 230
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 338 place count 40 transition count 229
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 22 edges and 38 vertex of which 2 / 38 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 9 with 3 rules applied. Total rules applied 341 place count 37 transition count 229
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 10 with 11 rules applied. Total rules applied 352 place count 37 transition count 218
Drop transitions (Redundant composition of simpler transitions.) removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 11 with 56 rules applied. Total rules applied 408 place count 37 transition count 162
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 408 place count 37 transition count 161
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 410 place count 36 transition count 161
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 411 place count 35 transition count 160
Iterating global reduction 11 with 1 rules applied. Total rules applied 412 place count 35 transition count 160
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 413 place count 34 transition count 156
Iterating global reduction 11 with 1 rules applied. Total rules applied 414 place count 34 transition count 156
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 418 place count 32 transition count 154
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 420 place count 31 transition count 158
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 422 place count 31 transition count 156
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 423 place count 31 transition count 155
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 424 place count 30 transition count 155
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 12 with 5 rules applied. Total rules applied 429 place count 30 transition count 150
Applied a total of 429 rules in 217 ms. Remains 30 /161 variables (removed 131) and now considering 150/324 (removed 174) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 217 ms. Remains : 30/161 places, 150/324 transitions.
RANDOM walk for 30624 steps (188 resets) in 890 ms. (34 steps per ms) remains 0/3 properties
FORMULA MedleyA-PT-16-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 14 stabilizing places and 14 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' '!((!p0 U (G(!p0)||(!p0&&G(p1)))))'
Support contains 3 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 324/324 transitions.
Graph (trivial) has 155 edges and 161 vertex of which 13 / 161 are part of one of the 3 SCC in 0 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 150 transition count 285
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 32 rules applied. Total rules applied 61 place count 122 transition count 281
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 63 place count 120 transition count 281
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 63 place count 120 transition count 272
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 81 place count 111 transition count 272
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 89 place count 103 transition count 256
Iterating global reduction 3 with 8 rules applied. Total rules applied 97 place count 103 transition count 256
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 99 place count 103 transition count 254
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 145 place count 80 transition count 231
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 148 place count 80 transition count 228
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 153 place count 75 transition count 215
Iterating global reduction 5 with 5 rules applied. Total rules applied 158 place count 75 transition count 215
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -78
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 186 place count 61 transition count 293
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 187 place count 61 transition count 292
Drop transitions (Redundant composition of simpler transitions.) removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 6 with 29 rules applied. Total rules applied 216 place count 61 transition count 263
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 218 place count 60 transition count 262
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 222 place count 58 transition count 288
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 223 place count 57 transition count 287
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 51 edges and 55 vertex of which 20 / 55 are part of one of the 8 SCC in 0 ms
Free SCC test removed 12 places
Iterating post reduction 6 with 3 rules applied. Total rules applied 226 place count 43 transition count 287
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 7 with 43 rules applied. Total rules applied 269 place count 43 transition count 244
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 271 place count 41 transition count 223
Iterating global reduction 8 with 2 rules applied. Total rules applied 273 place count 41 transition count 223
Drop transitions (Redundant composition of simpler transitions.) removed 70 transitions
Redundant transition composition rules discarded 70 transitions
Iterating global reduction 8 with 70 rules applied. Total rules applied 343 place count 41 transition count 153
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 345 place count 39 transition count 149
Iterating global reduction 8 with 2 rules applied. Total rules applied 347 place count 39 transition count 149
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 351 place count 37 transition count 147
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 352 place count 37 transition count 146
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 354 place count 36 transition count 152
Applied a total of 354 rules in 108 ms. Remains 36 /161 variables (removed 125) and now considering 152/324 (removed 172) transitions.
[2024-06-02 22:03:55] [INFO ] Flow matrix only has 137 transitions (discarded 15 similar events)
// Phase 1: matrix 137 rows 36 cols
[2024-06-02 22:03:55] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 22:03:55] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-02 22:03:55] [INFO ] Flow matrix only has 137 transitions (discarded 15 similar events)
[2024-06-02 22:03:55] [INFO ] Invariant cache hit.
[2024-06-02 22:03:55] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-06-02 22:03:55] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
[2024-06-02 22:03:55] [INFO ] Redundant transitions in 46 ms returned [104, 133, 135]
Found 3 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 3 transitions
Redundant transitions reduction (with SMT) removed 3 transitions.
Running 145 sub problems to find dead transitions.
[2024-06-02 22:03:55] [INFO ] Flow matrix only has 134 transitions (discarded 15 similar events)
// Phase 1: matrix 134 rows 36 cols
[2024-06-02 22:03:55] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 22:03:55] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-06-02 22:03:56] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
[2024-06-02 22:03:56] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 0 ms to minimize.
[2024-06-02 22:03:56] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-06-02 22:03:56] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (OVERLAPS) 133/169 variables, 36/45 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 33/78 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-06-02 22:03:57] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (OVERLAPS) 0/169 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/170 variables, and 79 constraints, problems are : Problem set: 0 solved, 145 unsolved in 5245 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 36/36 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 145 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (OVERLAPS) 133/169 variables, 36/46 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 33/79 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 145/224 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (OVERLAPS) 0/169 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Int declared 169/170 variables, and 224 constraints, problems are : Problem set: 0 solved, 145 unsolved in 5958 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 36/36 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 5/5 constraints]
After SMT, in 11456ms problems are : Problem set: 0 solved, 145 unsolved
Search for dead transitions found 0 dead transitions in 11459ms
Starting structural reductions in SI_LTL mode, iteration 1 : 36/161 places, 149/324 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 34 transition count 147
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 8 place count 34 transition count 143
Applied a total of 8 rules in 28 ms. Remains 34 /36 variables (removed 2) and now considering 143/149 (removed 6) transitions.
[2024-06-02 22:04:06] [INFO ] Flow matrix only has 128 transitions (discarded 15 similar events)
// Phase 1: matrix 128 rows 34 cols
[2024-06-02 22:04:06] [INFO ] Computed 5 invariants in 3 ms
[2024-06-02 22:04:06] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-02 22:04:06] [INFO ] Flow matrix only has 128 transitions (discarded 15 similar events)
[2024-06-02 22:04:06] [INFO ] Invariant cache hit.
[2024-06-02 22:04:07] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-06-02 22:04:07] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 34/161 places, 143/324 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 12134 ms. Remains : 34/161 places, 143/324 transitions.
Stuttering acceptance computed with spot in 441 ms :[true, p0, (AND p0 (NOT p1)), (NOT p1)]
Running random walk in product with property : MedleyA-PT-16-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 436 ms.
Product exploration explored 100000 steps with 0 reset in 260 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 214 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 173 ms :[true, p0, (NOT p1), (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (9108 resets) in 251 ms. (158 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40002 steps (3097 resets) in 168 ms. (236 steps per ms) remains 1/1 properties
[2024-06-02 22:04:08] [INFO ] Flow matrix only has 128 transitions (discarded 15 similar events)
[2024-06-02 22:04:08] [INFO ] Invariant cache hit.
[2024-06-02 22:04:08] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 18/162 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 31 ms.
Refiners :[Positive P Invariants (semi-flows): 2/5 constraints, State Equation: 0/34 constraints, ReadFeed: 0/29 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 47ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X p1)), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F p0), (F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 14 factoid took 563 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 150 ms :[true, p0, (NOT p1), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 148 ms :[true, p0, (NOT p1), (AND p0 (NOT p1))]
Support contains 3 out of 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 143/143 transitions.
Applied a total of 0 rules in 4 ms. Remains 34 /34 variables (removed 0) and now considering 143/143 (removed 0) transitions.
[2024-06-02 22:04:09] [INFO ] Flow matrix only has 128 transitions (discarded 15 similar events)
[2024-06-02 22:04:09] [INFO ] Invariant cache hit.
[2024-06-02 22:04:09] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-02 22:04:09] [INFO ] Flow matrix only has 128 transitions (discarded 15 similar events)
[2024-06-02 22:04:09] [INFO ] Invariant cache hit.
[2024-06-02 22:04:09] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-06-02 22:04:09] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2024-06-02 22:04:09] [INFO ] Redundant transitions in 29 ms returned [96, 101]
Found 2 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 2 transitions
Redundant transitions reduction (with SMT) removed 2 transitions.
Running 137 sub problems to find dead transitions.
[2024-06-02 22:04:09] [INFO ] Flow matrix only has 126 transitions (discarded 15 similar events)
// Phase 1: matrix 126 rows 34 cols
[2024-06-02 22:04:09] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 22:04:09] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 137 unsolved
[2024-06-02 22:04:10] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-06-02 22:04:10] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-06-02 22:04:10] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-06-02 22:04:10] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-06-02 22:04:10] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (OVERLAPS) 125/159 variables, 34/44 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 29/73 constraints. Problems are: Problem set: 0 solved, 137 unsolved
[2024-06-02 22:04:11] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 7 (OVERLAPS) 0/159 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Real declared 159/160 variables, and 74 constraints, problems are : Problem set: 0 solved, 137 unsolved in 4250 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 34/34 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 137 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (OVERLAPS) 125/159 variables, 34/45 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 29/74 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 137/211 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 7 (OVERLAPS) 0/159 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Int declared 159/160 variables, and 211 constraints, problems are : Problem set: 0 solved, 137 unsolved in 5003 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 34/34 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 6/6 constraints]
After SMT, in 9375ms problems are : Problem set: 0 solved, 137 unsolved
Search for dead transitions found 0 dead transitions in 9378ms
Starting structural reductions in SI_LTL mode, iteration 1 : 34/34 places, 141/143 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 34 transition count 140
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 33 transition count 140
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 10 place count 33 transition count 132
Applied a total of 10 rules in 20 ms. Remains 33 /34 variables (removed 1) and now considering 132/141 (removed 9) transitions.
[2024-06-02 22:04:19] [INFO ] Flow matrix only has 120 transitions (discarded 12 similar events)
// Phase 1: matrix 120 rows 33 cols
[2024-06-02 22:04:19] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 22:04:19] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-02 22:04:19] [INFO ] Flow matrix only has 120 transitions (discarded 12 similar events)
[2024-06-02 22:04:19] [INFO ] Invariant cache hit.
[2024-06-02 22:04:19] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-06-02 22:04:19] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 33/34 places, 132/143 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9881 ms. Remains : 33/34 places, 132/143 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 154 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 131 ms :[true, p0, (NOT p1), (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (9017 resets) in 221 ms. (180 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (3175 resets) in 247 ms. (161 steps per ms) remains 1/1 properties
[2024-06-02 22:04:20] [INFO ] Flow matrix only has 120 transitions (discarded 12 similar events)
[2024-06-02 22:04:20] [INFO ] Invariant cache hit.
[2024-06-02 22:04:20] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 18/153 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 28 ms.
Refiners :[Positive P Invariants (semi-flows): 2/5 constraints, State Equation: 0/33 constraints, ReadFeed: 0/28 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 36ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F p0), (F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 14 factoid took 515 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 136 ms :[true, p0, (NOT p1), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 139 ms :[true, p0, (NOT p1), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 151 ms :[true, p0, (NOT p1), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 215 ms.
Product exploration explored 100000 steps with 0 reset in 277 ms.
Support contains 3 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 132/132 transitions.
Applied a total of 0 rules in 4 ms. Remains 33 /33 variables (removed 0) and now considering 132/132 (removed 0) transitions.
[2024-06-02 22:04:21] [INFO ] Flow matrix only has 120 transitions (discarded 12 similar events)
[2024-06-02 22:04:21] [INFO ] Invariant cache hit.
[2024-06-02 22:04:21] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-02 22:04:21] [INFO ] Flow matrix only has 120 transitions (discarded 12 similar events)
[2024-06-02 22:04:21] [INFO ] Invariant cache hit.
[2024-06-02 22:04:21] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-06-02 22:04:21] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
[2024-06-02 22:04:21] [INFO ] Redundant transitions in 28 ms returned [95, 97, 99]
Found 3 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 3 transitions
Redundant transitions reduction (with SMT) removed 3 transitions.
Running 125 sub problems to find dead transitions.
[2024-06-02 22:04:21] [INFO ] Flow matrix only has 117 transitions (discarded 12 similar events)
// Phase 1: matrix 117 rows 33 cols
[2024-06-02 22:04:21] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 22:04:21] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-06-02 22:04:22] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2024-06-02 22:04:22] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-06-02 22:04:22] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-06-02 22:04:22] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 2 ms to minimize.
[2024-06-02 22:04:22] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (OVERLAPS) 116/149 variables, 33/43 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 28/71 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-06-02 22:04:24] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (OVERLAPS) 0/149 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 149/150 variables, and 72 constraints, problems are : Problem set: 0 solved, 125 unsolved in 4731 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 33/33 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (OVERLAPS) 116/149 variables, 33/44 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 28/72 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 125/197 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (OVERLAPS) 0/149 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Int declared 149/150 variables, and 197 constraints, problems are : Problem set: 0 solved, 125 unsolved in 3753 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 33/33 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 6/6 constraints]
After SMT, in 8642ms problems are : Problem set: 0 solved, 125 unsolved
Search for dead transitions found 0 dead transitions in 8645ms
Starting structural reductions in SI_LTL mode, iteration 1 : 33/33 places, 129/132 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 33 transition count 128
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 32 transition count 128
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 30 transition count 126
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 14 place count 30 transition count 118
Applied a total of 14 rules in 11 ms. Remains 30 /33 variables (removed 3) and now considering 118/129 (removed 11) transitions.
[2024-06-02 22:04:30] [INFO ] Flow matrix only has 109 transitions (discarded 9 similar events)
// Phase 1: matrix 109 rows 30 cols
[2024-06-02 22:04:30] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 22:04:30] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-06-02 22:04:30] [INFO ] Flow matrix only has 109 transitions (discarded 9 similar events)
[2024-06-02 22:04:30] [INFO ] Invariant cache hit.
[2024-06-02 22:04:30] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-06-02 22:04:30] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 30/33 places, 118/132 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9087 ms. Remains : 30/33 places, 118/132 transitions.
Treatment of property MedleyA-PT-16-LTLFireability-01 finished in 35886 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)||X(F(p1)))))'
Support contains 2 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 324/324 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 155 transition count 313
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 155 transition count 313
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 154 transition count 312
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 154 transition count 312
Applied a total of 14 rules in 7 ms. Remains 154 /161 variables (removed 7) and now considering 312/324 (removed 12) transitions.
// Phase 1: matrix 312 rows 154 cols
[2024-06-02 22:04:30] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 22:04:30] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-06-02 22:04:30] [INFO ] Invariant cache hit.
[2024-06-02 22:04:31] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
Running 311 sub problems to find dead transitions.
[2024-06-02 22:04:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 311 unsolved
[2024-06-02 22:04:34] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 3 ms to minimize.
[2024-06-02 22:04:34] [INFO ] Deduced a trap composed of 32 places in 133 ms of which 2 ms to minimize.
[2024-06-02 22:04:34] [INFO ] Deduced a trap composed of 21 places in 136 ms of which 2 ms to minimize.
[2024-06-02 22:04:35] [INFO ] Deduced a trap composed of 19 places in 142 ms of which 3 ms to minimize.
[2024-06-02 22:04:35] [INFO ] Deduced a trap composed of 31 places in 139 ms of which 6 ms to minimize.
[2024-06-02 22:04:35] [INFO ] Deduced a trap composed of 15 places in 173 ms of which 3 ms to minimize.
[2024-06-02 22:04:35] [INFO ] Deduced a trap composed of 91 places in 144 ms of which 3 ms to minimize.
[2024-06-02 22:04:35] [INFO ] Deduced a trap composed of 101 places in 147 ms of which 3 ms to minimize.
[2024-06-02 22:04:36] [INFO ] Deduced a trap composed of 24 places in 173 ms of which 3 ms to minimize.
[2024-06-02 22:04:36] [INFO ] Deduced a trap composed of 33 places in 166 ms of which 3 ms to minimize.
[2024-06-02 22:04:36] [INFO ] Deduced a trap composed of 87 places in 133 ms of which 3 ms to minimize.
[2024-06-02 22:04:36] [INFO ] Deduced a trap composed of 24 places in 159 ms of which 3 ms to minimize.
[2024-06-02 22:04:37] [INFO ] Deduced a trap composed of 25 places in 169 ms of which 3 ms to minimize.
[2024-06-02 22:04:37] [INFO ] Deduced a trap composed of 36 places in 145 ms of which 2 ms to minimize.
[2024-06-02 22:04:37] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 2 ms to minimize.
[2024-06-02 22:04:38] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 311 unsolved
[2024-06-02 22:04:39] [INFO ] Deduced a trap composed of 33 places in 186 ms of which 3 ms to minimize.
[2024-06-02 22:04:39] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 311 unsolved
[2024-06-02 22:04:43] [INFO ] Deduced a trap composed of 31 places in 153 ms of which 3 ms to minimize.
[2024-06-02 22:04:43] [INFO ] Deduced a trap composed of 34 places in 114 ms of which 2 ms to minimize.
[2024-06-02 22:04:43] [INFO ] Deduced a trap composed of 85 places in 121 ms of which 3 ms to minimize.
[2024-06-02 22:04:44] [INFO ] Deduced a trap composed of 107 places in 128 ms of which 2 ms to minimize.
[2024-06-02 22:04:44] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 2 ms to minimize.
[2024-06-02 22:04:44] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 3 ms to minimize.
[2024-06-02 22:04:44] [INFO ] Deduced a trap composed of 23 places in 166 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 7/32 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 6 (OVERLAPS) 312/466 variables, 154/186 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/466 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 8 (OVERLAPS) 0/466 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 311 unsolved
No progress, stopping.
After SMT solving in domain Real declared 466/466 variables, and 186 constraints, problems are : Problem set: 0 solved, 311 unsolved in 27598 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 311 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 25/32 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 4 (OVERLAPS) 312/466 variables, 154/186 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 311/497 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 7 (OVERLAPS) 0/466 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 311 unsolved
No progress, stopping.
After SMT solving in domain Int declared 466/466 variables, and 497 constraints, problems are : Problem set: 0 solved, 311 unsolved in 27177 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 25/25 constraints]
After SMT, in 54873ms problems are : Problem set: 0 solved, 311 unsolved
Search for dead transitions found 0 dead transitions in 54877ms
Starting structural reductions in LTL mode, iteration 1 : 154/161 places, 312/324 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55299 ms. Remains : 154/161 places, 312/324 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-16-LTLFireability-04
Product exploration explored 100000 steps with 0 reset in 180 ms.
Stack based approach found an accepted trace after 24 steps with 0 reset with depth 25 and stack size 25 in 1 ms.
FORMULA MedleyA-PT-16-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-16-LTLFireability-04 finished in 55674 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 324/324 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 155 transition count 313
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 155 transition count 313
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 155 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 154 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 154 transition count 310
Applied a total of 16 rules in 7 ms. Remains 154 /161 variables (removed 7) and now considering 310/324 (removed 14) transitions.
// Phase 1: matrix 310 rows 154 cols
[2024-06-02 22:05:26] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 22:05:26] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-06-02 22:05:26] [INFO ] Invariant cache hit.
[2024-06-02 22:05:26] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
Running 309 sub problems to find dead transitions.
[2024-06-02 22:05:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 22:05:30] [INFO ] Deduced a trap composed of 25 places in 170 ms of which 2 ms to minimize.
[2024-06-02 22:05:30] [INFO ] Deduced a trap composed of 21 places in 164 ms of which 2 ms to minimize.
[2024-06-02 22:05:30] [INFO ] Deduced a trap composed of 29 places in 164 ms of which 3 ms to minimize.
[2024-06-02 22:05:30] [INFO ] Deduced a trap composed of 24 places in 155 ms of which 3 ms to minimize.
[2024-06-02 22:05:30] [INFO ] Deduced a trap composed of 22 places in 141 ms of which 2 ms to minimize.
[2024-06-02 22:05:31] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 2 ms to minimize.
[2024-06-02 22:05:31] [INFO ] Deduced a trap composed of 31 places in 154 ms of which 2 ms to minimize.
[2024-06-02 22:05:31] [INFO ] Deduced a trap composed of 15 places in 185 ms of which 3 ms to minimize.
[2024-06-02 22:05:31] [INFO ] Deduced a trap composed of 89 places in 135 ms of which 3 ms to minimize.
[2024-06-02 22:05:31] [INFO ] Deduced a trap composed of 15 places in 184 ms of which 3 ms to minimize.
[2024-06-02 22:05:32] [INFO ] Deduced a trap composed of 93 places in 140 ms of which 3 ms to minimize.
[2024-06-02 22:05:32] [INFO ] Deduced a trap composed of 31 places in 178 ms of which 3 ms to minimize.
[2024-06-02 22:05:32] [INFO ] Deduced a trap composed of 34 places in 157 ms of which 3 ms to minimize.
[2024-06-02 22:05:32] [INFO ] Deduced a trap composed of 85 places in 150 ms of which 3 ms to minimize.
[2024-06-02 22:05:32] [INFO ] Deduced a trap composed of 89 places in 146 ms of which 3 ms to minimize.
[2024-06-02 22:05:33] [INFO ] Deduced a trap composed of 33 places in 189 ms of which 2 ms to minimize.
[2024-06-02 22:05:33] [INFO ] Deduced a trap composed of 87 places in 141 ms of which 2 ms to minimize.
[2024-06-02 22:05:33] [INFO ] Deduced a trap composed of 100 places in 99 ms of which 2 ms to minimize.
[2024-06-02 22:05:33] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 2 ms to minimize.
[2024-06-02 22:05:34] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 22:05:34] [INFO ] Deduced a trap composed of 87 places in 102 ms of which 2 ms to minimize.
[2024-06-02 22:05:34] [INFO ] Deduced a trap composed of 100 places in 79 ms of which 2 ms to minimize.
[2024-06-02 22:05:35] [INFO ] Deduced a trap composed of 28 places in 150 ms of which 3 ms to minimize.
[2024-06-02 22:05:35] [INFO ] Deduced a trap composed of 26 places in 144 ms of which 3 ms to minimize.
[2024-06-02 22:05:35] [INFO ] Deduced a trap composed of 112 places in 142 ms of which 3 ms to minimize.
[2024-06-02 22:05:35] [INFO ] Deduced a trap composed of 113 places in 84 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 6/33 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 22:05:38] [INFO ] Deduced a trap composed of 34 places in 161 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (OVERLAPS) 310/464 variables, 154/188 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/464 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 8 (OVERLAPS) 0/464 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 309 unsolved
No progress, stopping.
After SMT solving in domain Real declared 464/464 variables, and 188 constraints, problems are : Problem set: 0 solved, 309 unsolved in 26317 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 309 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 27/34 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (OVERLAPS) 310/464 variables, 154/188 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 309/497 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 7 (OVERLAPS) 0/464 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 309 unsolved
No progress, stopping.
After SMT solving in domain Int declared 464/464 variables, and 497 constraints, problems are : Problem set: 0 solved, 309 unsolved in 27592 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 27/27 constraints]
After SMT, in 54052ms problems are : Problem set: 0 solved, 309 unsolved
Search for dead transitions found 0 dead transitions in 54058ms
Starting structural reductions in LTL mode, iteration 1 : 154/161 places, 310/324 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54443 ms. Remains : 154/161 places, 310/324 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-16-LTLFireability-05
Product exploration explored 100000 steps with 33333 reset in 762 ms.
Product exploration explored 100000 steps with 33333 reset in 291 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 71 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-16-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-16-LTLFireability-05 finished in 55756 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(p0&&F(p1))))))'
Support contains 2 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 324/324 transitions.
Graph (trivial) has 170 edges and 161 vertex of which 13 / 161 are part of one of the 3 SCC in 1 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 150 transition count 286
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 31 rules applied. Total rules applied 59 place count 123 transition count 282
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 63 place count 121 transition count 280
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 65 place count 119 transition count 280
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 65 place count 119 transition count 271
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 83 place count 110 transition count 271
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 92 place count 101 transition count 253
Iterating global reduction 4 with 9 rules applied. Total rules applied 101 place count 101 transition count 253
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 104 place count 101 transition count 250
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 105 place count 100 transition count 250
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 106 place count 99 transition count 248
Iterating global reduction 6 with 1 rules applied. Total rules applied 107 place count 99 transition count 248
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 6 with 46 rules applied. Total rules applied 153 place count 76 transition count 225
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 159 place count 76 transition count 219
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 162 place count 73 transition count 210
Iterating global reduction 7 with 3 rules applied. Total rules applied 165 place count 73 transition count 210
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -119
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 7 with 36 rules applied. Total rules applied 201 place count 55 transition count 329
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 202 place count 55 transition count 328
Drop transitions (Redundant composition of simpler transitions.) removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 8 with 31 rules applied. Total rules applied 233 place count 55 transition count 297
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -26
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 237 place count 53 transition count 323
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 238 place count 52 transition count 322
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 51 edges and 50 vertex of which 16 / 50 are part of one of the 7 SCC in 0 ms
Free SCC test removed 9 places
Iterating post reduction 8 with 3 rules applied. Total rules applied 241 place count 41 transition count 322
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 9 with 28 rules applied. Total rules applied 269 place count 41 transition count 294
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 270 place count 40 transition count 280
Iterating global reduction 10 with 1 rules applied. Total rules applied 271 place count 40 transition count 280
Drop transitions (Redundant composition of simpler transitions.) removed 94 transitions
Redundant transition composition rules discarded 94 transitions
Iterating global reduction 10 with 94 rules applied. Total rules applied 365 place count 40 transition count 186
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 365 place count 40 transition count 185
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 367 place count 39 transition count 185
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 368 place count 38 transition count 179
Iterating global reduction 10 with 1 rules applied. Total rules applied 369 place count 38 transition count 179
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 371 place count 37 transition count 178
Applied a total of 371 rules in 54 ms. Remains 37 /161 variables (removed 124) and now considering 178/324 (removed 146) transitions.
[2024-06-02 22:06:22] [INFO ] Flow matrix only has 158 transitions (discarded 20 similar events)
// Phase 1: matrix 158 rows 37 cols
[2024-06-02 22:06:22] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 22:06:22] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-06-02 22:06:22] [INFO ] Flow matrix only has 158 transitions (discarded 20 similar events)
[2024-06-02 22:06:22] [INFO ] Invariant cache hit.
[2024-06-02 22:06:22] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-02 22:06:22] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
[2024-06-02 22:06:22] [INFO ] Redundant transitions in 85 ms returned [97, 131, 135, 172, 173, 174, 176]
Found 7 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 7 transitions
Redundant transitions reduction (with SMT) removed 7 transitions.
Running 167 sub problems to find dead transitions.
[2024-06-02 22:06:22] [INFO ] Flow matrix only has 151 transitions (discarded 20 similar events)
// Phase 1: matrix 151 rows 37 cols
[2024-06-02 22:06:22] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 22:06:22] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-06-02 22:06:23] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 2 ms to minimize.
[2024-06-02 22:06:23] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:06:23] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-06-02 22:06:23] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (OVERLAPS) 150/187 variables, 37/46 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 36/82 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-06-02 22:06:25] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (OVERLAPS) 0/187 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/188 variables, and 83 constraints, problems are : Problem set: 0 solved, 167 unsolved in 6101 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 37/37 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 167 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (OVERLAPS) 150/187 variables, 37/47 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 36/83 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 167/250 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (OVERLAPS) 0/187 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/188 variables, and 250 constraints, problems are : Problem set: 0 solved, 167 unsolved in 7195 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 37/37 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 5/5 constraints]
After SMT, in 13504ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 13507ms
Starting structural reductions in SI_LTL mode, iteration 1 : 37/161 places, 171/324 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 36 transition count 170
Applied a total of 2 rules in 8 ms. Remains 36 /37 variables (removed 1) and now considering 170/171 (removed 1) transitions.
[2024-06-02 22:06:36] [INFO ] Flow matrix only has 150 transitions (discarded 20 similar events)
// Phase 1: matrix 150 rows 36 cols
[2024-06-02 22:06:36] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 22:06:36] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-02 22:06:36] [INFO ] Flow matrix only has 150 transitions (discarded 20 similar events)
[2024-06-02 22:06:36] [INFO ] Invariant cache hit.
[2024-06-02 22:06:36] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-02 22:06:36] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 36/161 places, 170/324 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 13995 ms. Remains : 36/161 places, 170/324 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : MedleyA-PT-16-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 48 ms.
Product exploration explored 100000 steps with 0 reset in 58 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 114 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 40000 steps (9022 resets) in 55 ms. (714 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (281 resets) in 20 ms. (1904 steps per ms) remains 1/1 properties
[2024-06-02 22:06:36] [INFO ] Flow matrix only has 150 transitions (discarded 20 similar events)
[2024-06-02 22:06:36] [INFO ] Invariant cache hit.
[2024-06-02 22:06:36] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Real declared 11/186 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 20 ms.
Refiners :[Positive P Invariants (semi-flows): 1/5 constraints, State Equation: 0/36 constraints, ReadFeed: 0/36 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 25ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT p0))]
Knowledge based reduction with 10 factoid took 201 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 36 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 36/36 places, 170/170 transitions.
Applied a total of 0 rules in 3 ms. Remains 36 /36 variables (removed 0) and now considering 170/170 (removed 0) transitions.
[2024-06-02 22:06:37] [INFO ] Flow matrix only has 150 transitions (discarded 20 similar events)
[2024-06-02 22:06:37] [INFO ] Invariant cache hit.
[2024-06-02 22:06:37] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-02 22:06:37] [INFO ] Flow matrix only has 150 transitions (discarded 20 similar events)
[2024-06-02 22:06:37] [INFO ] Invariant cache hit.
[2024-06-02 22:06:37] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-02 22:06:37] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
[2024-06-02 22:06:37] [INFO ] Redundant transitions in 36 ms returned []
Running 166 sub problems to find dead transitions.
[2024-06-02 22:06:37] [INFO ] Flow matrix only has 150 transitions (discarded 20 similar events)
[2024-06-02 22:06:37] [INFO ] Invariant cache hit.
[2024-06-02 22:06:37] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-02 22:06:38] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 2 ms to minimize.
[2024-06-02 22:06:38] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
[2024-06-02 22:06:38] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-06-02 22:06:38] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-06-02 22:06:38] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 149/185 variables, 36/46 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 36/82 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-02 22:06:40] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 7 (OVERLAPS) 0/185 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/186 variables, and 83 constraints, problems are : Problem set: 0 solved, 166 unsolved in 6153 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 36/36 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 149/185 variables, 36/47 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 36/83 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 166/249 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-02 22:06:46] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 8 (OVERLAPS) 0/185 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/186 variables, and 250 constraints, problems are : Problem set: 0 solved, 166 unsolved in 10204 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 36/36 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 7/7 constraints]
After SMT, in 16562ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 16568ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 16819 ms. Remains : 36/36 places, 170/170 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 1566 steps (331 resets) in 8 ms. (174 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 134 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 48 ms.
Product exploration explored 100000 steps with 0 reset in 50 ms.
Support contains 1 out of 36 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 36/36 places, 170/170 transitions.
Graph (trivial) has 16 edges and 36 vertex of which 2 / 36 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 35 transition count 166
Applied a total of 3 rules in 7 ms. Remains 35 /36 variables (removed 1) and now considering 166/170 (removed 4) transitions.
[2024-06-02 22:06:54] [INFO ] Flow matrix only has 146 transitions (discarded 20 similar events)
// Phase 1: matrix 146 rows 35 cols
[2024-06-02 22:06:54] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 22:06:54] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-02 22:06:54] [INFO ] Flow matrix only has 146 transitions (discarded 20 similar events)
[2024-06-02 22:06:54] [INFO ] Invariant cache hit.
[2024-06-02 22:06:54] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 22:06:54] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2024-06-02 22:06:54] [INFO ] Redundant transitions in 23 ms returned []
Running 162 sub problems to find dead transitions.
[2024-06-02 22:06:54] [INFO ] Flow matrix only has 146 transitions (discarded 20 similar events)
[2024-06-02 22:06:54] [INFO ] Invariant cache hit.
[2024-06-02 22:06:54] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-06-02 22:06:55] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2024-06-02 22:06:55] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2024-06-02 22:06:55] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-06-02 22:06:56] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (OVERLAPS) 145/180 variables, 35/44 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 37/81 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-06-02 22:06:58] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 7 (OVERLAPS) 0/180 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Real declared 180/181 variables, and 82 constraints, problems are : Problem set: 0 solved, 162 unsolved in 6063 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 35/35 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 162 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (OVERLAPS) 145/180 variables, 35/45 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 37/82 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 162/244 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-06-02 22:07:03] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 8 (OVERLAPS) 0/180 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Int declared 180/181 variables, and 245 constraints, problems are : Problem set: 0 solved, 162 unsolved in 7928 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 35/35 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 6/6 constraints]
After SMT, in 14181ms problems are : Problem set: 0 solved, 162 unsolved
Search for dead transitions found 0 dead transitions in 14185ms
Starting structural reductions in SI_LTL mode, iteration 1 : 35/36 places, 166/170 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14421 ms. Remains : 35/36 places, 166/170 transitions.
Treatment of property MedleyA-PT-16-LTLFireability-06 finished in 46926 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X((G(F(!p1))||G((p0||G(p1))))))))'
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 324/324 transitions.
Graph (trivial) has 165 edges and 161 vertex of which 13 / 161 are part of one of the 3 SCC in 1 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 150 transition count 284
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 33 rules applied. Total rules applied 63 place count 121 transition count 280
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 65 place count 119 transition count 280
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 65 place count 119 transition count 272
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 81 place count 111 transition count 272
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 89 place count 103 transition count 256
Iterating global reduction 3 with 8 rules applied. Total rules applied 97 place count 103 transition count 256
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 100 place count 103 transition count 253
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 101 place count 102 transition count 253
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 102 place count 101 transition count 251
Iterating global reduction 5 with 1 rules applied. Total rules applied 103 place count 101 transition count 251
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 145 place count 80 transition count 230
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 151 place count 80 transition count 224
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 155 place count 76 transition count 213
Iterating global reduction 6 with 4 rules applied. Total rules applied 159 place count 76 transition count 213
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -103
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 191 place count 60 transition count 316
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 192 place count 60 transition count 315
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 194 place count 59 transition count 332
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 7 with 26 rules applied. Total rules applied 220 place count 59 transition count 306
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 221 place count 58 transition count 305
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 55 edges and 56 vertex of which 19 / 56 are part of one of the 8 SCC in 0 ms
Free SCC test removed 11 places
Iterating post reduction 7 with 3 rules applied. Total rules applied 224 place count 45 transition count 305
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 8 with 43 rules applied. Total rules applied 267 place count 45 transition count 262
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 269 place count 43 transition count 240
Iterating global reduction 9 with 2 rules applied. Total rules applied 271 place count 43 transition count 240
Drop transitions (Redundant composition of simpler transitions.) removed 73 transitions
Redundant transition composition rules discarded 73 transitions
Iterating global reduction 9 with 73 rules applied. Total rules applied 344 place count 43 transition count 167
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 344 place count 43 transition count 166
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 346 place count 42 transition count 166
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 348 place count 40 transition count 158
Iterating global reduction 9 with 2 rules applied. Total rules applied 350 place count 40 transition count 158
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 354 place count 38 transition count 156
Applied a total of 354 rules in 64 ms. Remains 38 /161 variables (removed 123) and now considering 156/324 (removed 168) transitions.
[2024-06-02 22:07:09] [INFO ] Flow matrix only has 144 transitions (discarded 12 similar events)
// Phase 1: matrix 144 rows 38 cols
[2024-06-02 22:07:09] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 22:07:09] [INFO ] Implicit Places using invariants in 217 ms returned []
[2024-06-02 22:07:09] [INFO ] Flow matrix only has 144 transitions (discarded 12 similar events)
[2024-06-02 22:07:09] [INFO ] Invariant cache hit.
[2024-06-02 22:07:09] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-06-02 22:07:09] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
[2024-06-02 22:07:09] [INFO ] Redundant transitions in 25 ms returned [117, 155]
Found 2 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 2 transitions
Redundant transitions reduction (with SMT) removed 2 transitions.
Running 150 sub problems to find dead transitions.
[2024-06-02 22:07:09] [INFO ] Flow matrix only has 142 transitions (discarded 12 similar events)
// Phase 1: matrix 142 rows 38 cols
[2024-06-02 22:07:09] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 22:07:09] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (OVERLAPS) 3/38 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-06-02 22:07:10] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 2 ms to minimize.
[2024-06-02 22:07:10] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-06-02 22:07:10] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2024-06-02 22:07:11] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 2 ms to minimize.
[2024-06-02 22:07:11] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (OVERLAPS) 141/179 variables, 38/48 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 32/80 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (OVERLAPS) 0/179 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 179/180 variables, and 80 constraints, problems are : Problem set: 0 solved, 150 unsolved in 5055 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 38/38 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 3/38 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 141/179 variables, 38/48 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 32/80 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 150/230 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-06-02 22:07:17] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:07:18] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-06-02 22:07:18] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 3/233 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/179 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 11 (OVERLAPS) 0/179 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 179/180 variables, and 233 constraints, problems are : Problem set: 0 solved, 150 unsolved in 8909 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 38/38 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 8/8 constraints]
After SMT, in 14125ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 14128ms
Starting structural reductions in SI_LTL mode, iteration 1 : 38/161 places, 154/324 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 37 transition count 153
Applied a total of 2 rules in 8 ms. Remains 37 /38 variables (removed 1) and now considering 153/154 (removed 1) transitions.
[2024-06-02 22:07:23] [INFO ] Flow matrix only has 141 transitions (discarded 12 similar events)
// Phase 1: matrix 141 rows 37 cols
[2024-06-02 22:07:23] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 22:07:23] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-06-02 22:07:23] [INFO ] Flow matrix only has 141 transitions (discarded 12 similar events)
[2024-06-02 22:07:23] [INFO ] Invariant cache hit.
[2024-06-02 22:07:23] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-06-02 22:07:24] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 37/161 places, 153/324 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 14910 ms. Remains : 37/161 places, 153/324 transitions.
Stuttering acceptance computed with spot in 211 ms :[(NOT p0), false, (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : MedleyA-PT-16-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 87 ms.
Product exploration explored 100000 steps with 0 reset in 79 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (OR p0 p1)), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (OR p0 p1))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 187 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 154 ms :[false, (AND (NOT p0) p1), (AND (NOT p0) p1)]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (6051 resets) in 99 ms. (400 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (2356 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
[2024-06-02 22:07:24] [INFO ] Flow matrix only has 141 transitions (discarded 12 similar events)
[2024-06-02 22:07:24] [INFO ] Invariant cache hit.
[2024-06-02 22:07:24] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 25/178 variables, and 3 constraints, problems are : Problem set: 1 solved, 0 unsolved in 33 ms.
Refiners :[Positive P Invariants (semi-flows): 3/5 constraints, State Equation: 0/37 constraints, ReadFeed: 0/32 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 41ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (OR p0 p1)), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (OR p0 p1))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F p1), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 21 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-16-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-16-LTLFireability-07 finished in 15803 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 324/324 transitions.
Graph (trivial) has 166 edges and 161 vertex of which 9 / 161 are part of one of the 2 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 153 transition count 287
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 33 rules applied. Total rules applied 63 place count 124 transition count 283
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 65 place count 122 transition count 283
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 65 place count 122 transition count 275
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 81 place count 114 transition count 275
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 90 place count 105 transition count 257
Iterating global reduction 3 with 9 rules applied. Total rules applied 99 place count 105 transition count 257
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 102 place count 105 transition count 254
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 103 place count 104 transition count 254
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 104 place count 103 transition count 252
Iterating global reduction 5 with 1 rules applied. Total rules applied 105 place count 103 transition count 252
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 153 place count 79 transition count 228
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 159 place count 79 transition count 222
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 162 place count 76 transition count 214
Iterating global reduction 6 with 3 rules applied. Total rules applied 165 place count 76 transition count 214
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -103
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 197 place count 60 transition count 317
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 198 place count 60 transition count 316
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 7 with 16 rules applied. Total rules applied 214 place count 60 transition count 300
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 218 place count 58 transition count 326
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 219 place count 57 transition count 325
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 50 edges and 55 vertex of which 17 / 55 are part of one of the 7 SCC in 0 ms
Free SCC test removed 10 places
Iterating post reduction 7 with 3 rules applied. Total rules applied 222 place count 45 transition count 325
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 8 with 41 rules applied. Total rules applied 263 place count 45 transition count 284
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 265 place count 43 transition count 262
Iterating global reduction 9 with 2 rules applied. Total rules applied 267 place count 43 transition count 262
Drop transitions (Redundant composition of simpler transitions.) removed 70 transitions
Redundant transition composition rules discarded 70 transitions
Iterating global reduction 9 with 70 rules applied. Total rules applied 337 place count 43 transition count 192
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 337 place count 43 transition count 191
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 339 place count 42 transition count 191
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 341 place count 40 transition count 182
Iterating global reduction 9 with 2 rules applied. Total rules applied 343 place count 40 transition count 182
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 347 place count 38 transition count 180
Applied a total of 347 rules in 73 ms. Remains 38 /161 variables (removed 123) and now considering 180/324 (removed 144) transitions.
[2024-06-02 22:07:25] [INFO ] Flow matrix only has 160 transitions (discarded 20 similar events)
// Phase 1: matrix 160 rows 38 cols
[2024-06-02 22:07:25] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 22:07:25] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-02 22:07:25] [INFO ] Flow matrix only has 160 transitions (discarded 20 similar events)
[2024-06-02 22:07:25] [INFO ] Invariant cache hit.
[2024-06-02 22:07:25] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-02 22:07:25] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
[2024-06-02 22:07:25] [INFO ] Redundant transitions in 40 ms returned [135, 136, 176, 177, 178, 179]
Found 6 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 6 transitions
Redundant transitions reduction (with SMT) removed 6 transitions.
Running 171 sub problems to find dead transitions.
[2024-06-02 22:07:25] [INFO ] Flow matrix only has 154 transitions (discarded 20 similar events)
// Phase 1: matrix 154 rows 38 cols
[2024-06-02 22:07:25] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 22:07:25] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-06-02 22:07:26] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (OVERLAPS) 1/38 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-06-02 22:07:27] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-06-02 22:07:27] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 1 ms to minimize.
[2024-06-02 22:07:27] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-06-02 22:07:28] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (OVERLAPS) 153/191 variables, 38/48 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 36/84 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-06-02 22:07:30] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 10 (OVERLAPS) 0/191 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/192 variables, and 85 constraints, problems are : Problem set: 0 solved, 171 unsolved in 8265 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 38/38 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 171 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (OVERLAPS) 1/38 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (OVERLAPS) 153/191 variables, 38/49 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 36/85 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 171/256 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-06-02 22:07:39] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/191 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/191 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 12 (OVERLAPS) 0/191 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/192 variables, and 257 constraints, problems are : Problem set: 0 solved, 171 unsolved in 11689 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 38/38 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 7/7 constraints]
After SMT, in 20156ms problems are : Problem set: 0 solved, 171 unsolved
Search for dead transitions found 0 dead transitions in 20159ms
Starting structural reductions in SI_LTL mode, iteration 1 : 38/161 places, 174/324 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 35 transition count 171
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 18 place count 35 transition count 159
Applied a total of 18 rules in 16 ms. Remains 35 /38 variables (removed 3) and now considering 159/174 (removed 15) transitions.
[2024-06-02 22:07:45] [INFO ] Flow matrix only has 146 transitions (discarded 13 similar events)
// Phase 1: matrix 146 rows 35 cols
[2024-06-02 22:07:45] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 22:07:45] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-02 22:07:45] [INFO ] Flow matrix only has 146 transitions (discarded 13 similar events)
[2024-06-02 22:07:45] [INFO ] Invariant cache hit.
[2024-06-02 22:07:45] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-06-02 22:07:45] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 35/161 places, 159/324 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 20742 ms. Remains : 35/161 places, 159/324 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyA-PT-16-LTLFireability-09
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-16-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-16-LTLFireability-09 finished in 20882 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 324/324 transitions.
Graph (trivial) has 171 edges and 161 vertex of which 13 / 161 are part of one of the 3 SCC in 0 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 150 transition count 285
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 32 rules applied. Total rules applied 61 place count 122 transition count 281
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 63 place count 120 transition count 281
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 63 place count 120 transition count 272
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 81 place count 111 transition count 272
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 89 place count 103 transition count 256
Iterating global reduction 3 with 8 rules applied. Total rules applied 97 place count 103 transition count 256
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 100 place count 103 transition count 253
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 101 place count 102 transition count 253
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 102 place count 101 transition count 251
Iterating global reduction 5 with 1 rules applied. Total rules applied 103 place count 101 transition count 251
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 5 with 44 rules applied. Total rules applied 147 place count 79 transition count 229
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 152 place count 79 transition count 224
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 156 place count 75 transition count 213
Iterating global reduction 6 with 4 rules applied. Total rules applied 160 place count 75 transition count 213
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -106
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 6 with 36 rules applied. Total rules applied 196 place count 57 transition count 319
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 199 place count 57 transition count 316
Drop transitions (Redundant composition of simpler transitions.) removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 7 with 28 rules applied. Total rules applied 227 place count 57 transition count 288
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 231 place count 55 transition count 314
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 232 place count 54 transition count 313
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 55 edges and 52 vertex of which 19 / 52 are part of one of the 8 SCC in 0 ms
Free SCC test removed 11 places
Iterating post reduction 7 with 3 rules applied. Total rules applied 235 place count 41 transition count 313
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 8 with 43 rules applied. Total rules applied 278 place count 41 transition count 270
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 280 place count 39 transition count 248
Iterating global reduction 9 with 2 rules applied. Total rules applied 282 place count 39 transition count 248
Drop transitions (Redundant composition of simpler transitions.) removed 75 transitions
Redundant transition composition rules discarded 75 transitions
Iterating global reduction 9 with 75 rules applied. Total rules applied 357 place count 39 transition count 173
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 9 with 1 rules applied. Total rules applied 358 place count 39 transition count 172
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 359 place count 38 transition count 172
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 361 place count 36 transition count 164
Iterating global reduction 11 with 2 rules applied. Total rules applied 363 place count 36 transition count 164
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 367 place count 34 transition count 162
Applied a total of 367 rules in 47 ms. Remains 34 /161 variables (removed 127) and now considering 162/324 (removed 162) transitions.
[2024-06-02 22:07:45] [INFO ] Flow matrix only has 142 transitions (discarded 20 similar events)
// Phase 1: matrix 142 rows 34 cols
[2024-06-02 22:07:45] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 22:07:45] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-02 22:07:45] [INFO ] Flow matrix only has 142 transitions (discarded 20 similar events)
[2024-06-02 22:07:45] [INFO ] Invariant cache hit.
[2024-06-02 22:07:45] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-02 22:07:46] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2024-06-02 22:07:46] [INFO ] Redundant transitions in 19 ms returned [118, 161]
Found 2 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 2 transitions
Redundant transitions reduction (with SMT) removed 2 transitions.
Running 156 sub problems to find dead transitions.
[2024-06-02 22:07:46] [INFO ] Flow matrix only has 140 transitions (discarded 20 similar events)
// Phase 1: matrix 140 rows 34 cols
[2024-06-02 22:07:46] [INFO ] Computed 5 invariants in 6 ms
[2024-06-02 22:07:46] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-06-02 22:07:46] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-06-02 22:07:46] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:07:46] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2024-06-02 22:07:46] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (OVERLAPS) 139/173 variables, 34/43 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 36/79 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-06-02 22:07:48] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (OVERLAPS) 0/173 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Real declared 173/174 variables, and 80 constraints, problems are : Problem set: 0 solved, 156 unsolved in 4394 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 34/34 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 156 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (OVERLAPS) 139/173 variables, 34/44 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 36/80 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 156/236 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (OVERLAPS) 0/173 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Int declared 173/174 variables, and 236 constraints, problems are : Problem set: 0 solved, 156 unsolved in 5096 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 34/34 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 5/5 constraints]
After SMT, in 9613ms problems are : Problem set: 0 solved, 156 unsolved
Search for dead transitions found 0 dead transitions in 9615ms
Starting structural reductions in SI_LTL mode, iteration 1 : 34/161 places, 160/324 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 33 transition count 159
Applied a total of 2 rules in 4 ms. Remains 33 /34 variables (removed 1) and now considering 159/160 (removed 1) transitions.
[2024-06-02 22:07:55] [INFO ] Flow matrix only has 139 transitions (discarded 20 similar events)
// Phase 1: matrix 139 rows 33 cols
[2024-06-02 22:07:55] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 22:07:55] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-06-02 22:07:55] [INFO ] Flow matrix only has 139 transitions (discarded 20 similar events)
[2024-06-02 22:07:55] [INFO ] Invariant cache hit.
[2024-06-02 22:07:55] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-02 22:07:55] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 33/161 places, 159/324 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 10000 ms. Remains : 33/161 places, 159/324 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-16-LTLFireability-10
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-16-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-16-LTLFireability-10 finished in 10050 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)))'
Support contains 2 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 324/324 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 155 transition count 313
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 155 transition count 313
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 154 transition count 312
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 154 transition count 312
Applied a total of 14 rules in 8 ms. Remains 154 /161 variables (removed 7) and now considering 312/324 (removed 12) transitions.
// Phase 1: matrix 312 rows 154 cols
[2024-06-02 22:07:55] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 22:07:55] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-02 22:07:55] [INFO ] Invariant cache hit.
[2024-06-02 22:07:56] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
Running 311 sub problems to find dead transitions.
[2024-06-02 22:07:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 311 unsolved
[2024-06-02 22:07:58] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 2 ms to minimize.
[2024-06-02 22:07:59] [INFO ] Deduced a trap composed of 32 places in 128 ms of which 2 ms to minimize.
[2024-06-02 22:07:59] [INFO ] Deduced a trap composed of 21 places in 151 ms of which 3 ms to minimize.
[2024-06-02 22:07:59] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 2 ms to minimize.
[2024-06-02 22:07:59] [INFO ] Deduced a trap composed of 31 places in 125 ms of which 2 ms to minimize.
[2024-06-02 22:07:59] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 2 ms to minimize.
[2024-06-02 22:07:59] [INFO ] Deduced a trap composed of 91 places in 121 ms of which 3 ms to minimize.
[2024-06-02 22:07:59] [INFO ] Deduced a trap composed of 101 places in 149 ms of which 3 ms to minimize.
[2024-06-02 22:08:00] [INFO ] Deduced a trap composed of 24 places in 172 ms of which 3 ms to minimize.
[2024-06-02 22:08:00] [INFO ] Deduced a trap composed of 33 places in 167 ms of which 3 ms to minimize.
[2024-06-02 22:08:00] [INFO ] Deduced a trap composed of 87 places in 146 ms of which 3 ms to minimize.
[2024-06-02 22:08:01] [INFO ] Deduced a trap composed of 24 places in 170 ms of which 3 ms to minimize.
[2024-06-02 22:08:01] [INFO ] Deduced a trap composed of 25 places in 160 ms of which 3 ms to minimize.
[2024-06-02 22:08:01] [INFO ] Deduced a trap composed of 36 places in 160 ms of which 3 ms to minimize.
[2024-06-02 22:08:02] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 1 ms to minimize.
[2024-06-02 22:08:02] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 311 unsolved
[2024-06-02 22:08:03] [INFO ] Deduced a trap composed of 33 places in 155 ms of which 3 ms to minimize.
[2024-06-02 22:08:04] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 311 unsolved
[2024-06-02 22:08:07] [INFO ] Deduced a trap composed of 31 places in 143 ms of which 4 ms to minimize.
[2024-06-02 22:08:07] [INFO ] Deduced a trap composed of 34 places in 176 ms of which 3 ms to minimize.
[2024-06-02 22:08:08] [INFO ] Deduced a trap composed of 85 places in 154 ms of which 3 ms to minimize.
[2024-06-02 22:08:08] [INFO ] Deduced a trap composed of 107 places in 153 ms of which 3 ms to minimize.
[2024-06-02 22:08:08] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 2 ms to minimize.
[2024-06-02 22:08:09] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 2 ms to minimize.
[2024-06-02 22:08:09] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 7/32 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 6 (OVERLAPS) 312/466 variables, 154/186 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/466 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 8 (OVERLAPS) 0/466 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 311 unsolved
No progress, stopping.
After SMT solving in domain Real declared 466/466 variables, and 186 constraints, problems are : Problem set: 0 solved, 311 unsolved in 25460 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 311 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 25/32 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 4 (OVERLAPS) 312/466 variables, 154/186 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 311/497 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 7 (OVERLAPS) 0/466 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 311 unsolved
No progress, stopping.
After SMT solving in domain Int declared 466/466 variables, and 497 constraints, problems are : Problem set: 0 solved, 311 unsolved in 27870 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 25/25 constraints]
After SMT, in 53421ms problems are : Problem set: 0 solved, 311 unsolved
Search for dead transitions found 0 dead transitions in 53425ms
Starting structural reductions in LTL mode, iteration 1 : 154/161 places, 312/324 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53743 ms. Remains : 154/161 places, 312/324 transitions.
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-16-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-16-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-16-LTLFireability-11 finished in 53861 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 (G((p0||G(p1)))||((p0||G(p1))&&X(!p2))))))'
Support contains 3 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 324/324 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 155 transition count 313
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 155 transition count 313
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 155 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 154 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 154 transition count 310
Applied a total of 16 rules in 8 ms. Remains 154 /161 variables (removed 7) and now considering 310/324 (removed 14) transitions.
// Phase 1: matrix 310 rows 154 cols
[2024-06-02 22:08:49] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 22:08:49] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-02 22:08:49] [INFO ] Invariant cache hit.
[2024-06-02 22:08:50] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
Running 309 sub problems to find dead transitions.
[2024-06-02 22:08:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 22:08:53] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 2 ms to minimize.
[2024-06-02 22:08:53] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 2 ms to minimize.
[2024-06-02 22:08:53] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 2 ms to minimize.
[2024-06-02 22:08:53] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 3 ms to minimize.
[2024-06-02 22:08:53] [INFO ] Deduced a trap composed of 36 places in 112 ms of which 3 ms to minimize.
[2024-06-02 22:08:54] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 3 ms to minimize.
[2024-06-02 22:08:54] [INFO ] Deduced a trap composed of 89 places in 121 ms of which 2 ms to minimize.
[2024-06-02 22:08:54] [INFO ] Deduced a trap composed of 87 places in 136 ms of which 3 ms to minimize.
[2024-06-02 22:08:54] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 3 ms to minimize.
[2024-06-02 22:08:54] [INFO ] Deduced a trap composed of 93 places in 167 ms of which 3 ms to minimize.
[2024-06-02 22:08:54] [INFO ] Deduced a trap composed of 89 places in 174 ms of which 2 ms to minimize.
[2024-06-02 22:08:55] [INFO ] Deduced a trap composed of 87 places in 144 ms of which 3 ms to minimize.
[2024-06-02 22:08:55] [INFO ] Deduced a trap composed of 31 places in 165 ms of which 3 ms to minimize.
[2024-06-02 22:08:55] [INFO ] Deduced a trap composed of 34 places in 146 ms of which 3 ms to minimize.
[2024-06-02 22:08:56] [INFO ] Deduced a trap composed of 100 places in 101 ms of which 2 ms to minimize.
[2024-06-02 22:08:56] [INFO ] Deduced a trap composed of 102 places in 153 ms of which 3 ms to minimize.
[2024-06-02 22:08:56] [INFO ] Deduced a trap composed of 100 places in 130 ms of which 3 ms to minimize.
[2024-06-02 22:08:56] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 3 ms to minimize.
[2024-06-02 22:08:56] [INFO ] Deduced a trap composed of 34 places in 161 ms of which 3 ms to minimize.
[2024-06-02 22:08:57] [INFO ] Deduced a trap composed of 33 places in 146 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 22:08:57] [INFO ] Deduced a trap composed of 31 places in 171 ms of which 2 ms to minimize.
[2024-06-02 22:08:58] [INFO ] Deduced a trap composed of 34 places in 159 ms of which 3 ms to minimize.
[2024-06-02 22:08:58] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 3 ms to minimize.
[2024-06-02 22:08:58] [INFO ] Deduced a trap composed of 25 places in 133 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 22:09:02] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 2 ms to minimize.
[2024-06-02 22:09:03] [INFO ] Deduced a trap composed of 25 places in 167 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 22:09:05] [INFO ] Deduced a trap composed of 106 places in 152 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 7 (OVERLAPS) 310/464 variables, 154/188 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 22:09:12] [INFO ] Deduced a trap composed of 106 places in 128 ms of which 2 ms to minimize.
[2024-06-02 22:09:12] [INFO ] Deduced a trap composed of 109 places in 161 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/464 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/464 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 464/464 variables, and 190 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 309 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 29/36 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (OVERLAPS) 310/464 variables, 154/190 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 309/499 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 22:09:37] [INFO ] Deduced a trap composed of 87 places in 154 ms of which 3 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/464 variables, 1/500 constraints. Problems are: Problem set: 0 solved, 309 unsolved
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 1)
(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 1)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 1)
(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 1)
(s76 0)
(s77 0)
(s78 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/464 variables, and 500 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 30/30 constraints]
After SMT, in 60138ms problems are : Problem set: 0 solved, 309 unsolved
Search for dead transitions found 0 dead transitions in 60142ms
Starting structural reductions in LTL mode, iteration 1 : 154/161 places, 310/324 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60461 ms. Remains : 154/161 places, 310/324 transitions.
Stuttering acceptance computed with spot in 263 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p2), (NOT p1)]
Running random walk in product with property : MedleyA-PT-16-LTLFireability-12
Product exploration explored 100000 steps with 33333 reset in 144 ms.
Product exploration explored 100000 steps with 33333 reset in 180 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 23 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-16-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-16-LTLFireability-12 finished in 61105 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X((!p1||F(p2)))))'
Support contains 5 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 324/324 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 156 transition count 314
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 156 transition count 314
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 156 transition count 312
Applied a total of 12 rules in 5 ms. Remains 156 /161 variables (removed 5) and now considering 312/324 (removed 12) transitions.
// Phase 1: matrix 312 rows 156 cols
[2024-06-02 22:09:50] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 22:09:50] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-06-02 22:09:50] [INFO ] Invariant cache hit.
[2024-06-02 22:09:51] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
Running 311 sub problems to find dead transitions.
[2024-06-02 22:09:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 311 unsolved
[2024-06-02 22:09:54] [INFO ] Deduced a trap composed of 28 places in 99 ms of which 2 ms to minimize.
[2024-06-02 22:09:54] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 1 ms to minimize.
[2024-06-02 22:09:54] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 2 ms to minimize.
[2024-06-02 22:09:55] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 2 ms to minimize.
[2024-06-02 22:09:55] [INFO ] Deduced a trap composed of 91 places in 78 ms of which 2 ms to minimize.
[2024-06-02 22:09:55] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 1 ms to minimize.
[2024-06-02 22:09:55] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 2 ms to minimize.
[2024-06-02 22:09:55] [INFO ] Deduced a trap composed of 21 places in 156 ms of which 3 ms to minimize.
[2024-06-02 22:09:55] [INFO ] Deduced a trap composed of 33 places in 162 ms of which 3 ms to minimize.
[2024-06-02 22:09:56] [INFO ] Deduced a trap composed of 87 places in 138 ms of which 2 ms to minimize.
[2024-06-02 22:09:56] [INFO ] Deduced a trap composed of 31 places in 151 ms of which 3 ms to minimize.
[2024-06-02 22:09:56] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 1 ms to minimize.
[2024-06-02 22:09:56] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 2 ms to minimize.
[2024-06-02 22:09:56] [INFO ] Deduced a trap composed of 42 places in 94 ms of which 2 ms to minimize.
[2024-06-02 22:09:57] [INFO ] Deduced a trap composed of 102 places in 99 ms of which 2 ms to minimize.
[2024-06-02 22:09:57] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-02 22:09:57] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 2 ms to minimize.
[2024-06-02 22:09:57] [INFO ] Deduced a trap composed of 34 places in 88 ms of which 2 ms to minimize.
[2024-06-02 22:09:57] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 2 ms to minimize.
[2024-06-02 22:09:57] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 311 unsolved
[2024-06-02 22:09:58] [INFO ] Deduced a trap composed of 89 places in 156 ms of which 3 ms to minimize.
[2024-06-02 22:09:58] [INFO ] Deduced a trap composed of 102 places in 86 ms of which 2 ms to minimize.
[2024-06-02 22:09:58] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (OVERLAPS) 312/468 variables, 156/186 constraints. Problems are: Problem set: 0 solved, 311 unsolved
[2024-06-02 22:10:03] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-06-02 22:10:04] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 2/188 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/468 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 311 unsolved
[2024-06-02 22:10:11] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/468 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/468 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 10 (OVERLAPS) 0/468 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 311 unsolved
No progress, stopping.
After SMT solving in domain Real declared 468/468 variables, and 189 constraints, problems are : Problem set: 0 solved, 311 unsolved in 29154 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 311 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 26/33 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 4 (OVERLAPS) 312/468 variables, 156/189 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 311/500 constraints. Problems are: Problem set: 0 solved, 311 unsolved
[2024-06-02 22:10:28] [INFO ] Deduced a trap composed of 104 places in 101 ms of which 3 ms to minimize.
[2024-06-02 22:10:28] [INFO ] Deduced a trap composed of 116 places in 95 ms of which 1 ms to minimize.
[2024-06-02 22:10:28] [INFO ] Deduced a trap composed of 114 places in 94 ms of which 2 ms to minimize.
[2024-06-02 22:10:28] [INFO ] Deduced a trap composed of 87 places in 90 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 4/504 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/468 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 8 (OVERLAPS) 0/468 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 311 unsolved
No progress, stopping.
After SMT solving in domain Int declared 468/468 variables, and 504 constraints, problems are : Problem set: 0 solved, 311 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 30/30 constraints]
After SMT, in 59280ms problems are : Problem set: 0 solved, 311 unsolved
Search for dead transitions found 0 dead transitions in 59285ms
Starting structural reductions in LTL mode, iteration 1 : 156/161 places, 312/324 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59690 ms. Remains : 156/161 places, 312/324 transitions.
Stuttering acceptance computed with spot in 201 ms :[(AND p1 (NOT p2)), (AND (NOT p2) p1), (AND p1 (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : MedleyA-PT-16-LTLFireability-13
Product exploration explored 100000 steps with 50000 reset in 96 ms.
Product exploration explored 100000 steps with 50000 reset in 105 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p2)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 18 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-16-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-16-LTLFireability-13 finished in 60148 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)) U (F(G(p1)) U p0)))'
Support contains 3 out of 161 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 324/324 transitions.
Graph (trivial) has 151 edges and 161 vertex of which 8 / 161 are part of one of the 2 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 154 transition count 290
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 31 rules applied. Total rules applied 59 place count 127 transition count 286
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 62 place count 125 transition count 285
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 63 place count 124 transition count 285
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 63 place count 124 transition count 275
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 83 place count 114 transition count 275
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 92 place count 105 transition count 257
Iterating global reduction 4 with 9 rules applied. Total rules applied 101 place count 105 transition count 257
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 104 place count 105 transition count 254
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 105 place count 104 transition count 254
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 106 place count 103 transition count 252
Iterating global reduction 6 with 1 rules applied. Total rules applied 107 place count 103 transition count 252
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 6 with 44 rules applied. Total rules applied 151 place count 81 transition count 230
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 153 place count 81 transition count 228
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 157 place count 77 transition count 217
Iterating global reduction 7 with 4 rules applied. Total rules applied 161 place count 77 transition count 217
Performed 12 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 7 with 24 rules applied. Total rules applied 185 place count 65 transition count 292
Drop transitions (Redundant composition of simpler transitions.) removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 7 with 33 rules applied. Total rules applied 218 place count 65 transition count 259
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 220 place count 64 transition count 258
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 7 with 2 rules applied. Total rules applied 222 place count 63 transition count 267
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 223 place count 62 transition count 266
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 57 edges and 60 vertex of which 21 / 60 are part of one of the 8 SCC in 1 ms
Free SCC test removed 13 places
Iterating post reduction 7 with 3 rules applied. Total rules applied 226 place count 47 transition count 266
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Iterating post reduction 8 with 45 rules applied. Total rules applied 271 place count 47 transition count 221
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 273 place count 45 transition count 200
Iterating global reduction 9 with 2 rules applied. Total rules applied 275 place count 45 transition count 200
Drop transitions (Redundant composition of simpler transitions.) removed 66 transitions
Redundant transition composition rules discarded 66 transitions
Iterating global reduction 9 with 66 rules applied. Total rules applied 341 place count 45 transition count 134
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 1 rules applied. Total rules applied 342 place count 45 transition count 133
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 343 place count 44 transition count 133
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 346 place count 41 transition count 125
Iterating global reduction 11 with 3 rules applied. Total rules applied 349 place count 41 transition count 125
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 351 place count 40 transition count 124
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 353 place count 39 transition count 128
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 11 with 6 rules applied. Total rules applied 359 place count 39 transition count 122
Applied a total of 359 rules in 48 ms. Remains 39 /161 variables (removed 122) and now considering 122/324 (removed 202) transitions.
[2024-06-02 22:10:51] [INFO ] Flow matrix only has 118 transitions (discarded 4 similar events)
// Phase 1: matrix 118 rows 39 cols
[2024-06-02 22:10:51] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 22:10:51] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-02 22:10:51] [INFO ] Flow matrix only has 118 transitions (discarded 4 similar events)
[2024-06-02 22:10:51] [INFO ] Invariant cache hit.
[2024-06-02 22:10:51] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-02 22:10:51] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2024-06-02 22:10:51] [INFO ] Redundant transitions in 46 ms returned [91, 115]
Found 2 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 2 transitions
Redundant transitions reduction (with SMT) removed 2 transitions.
Running 116 sub problems to find dead transitions.
[2024-06-02 22:10:51] [INFO ] Flow matrix only has 116 transitions (discarded 4 similar events)
// Phase 1: matrix 116 rows 39 cols
[2024-06-02 22:10:51] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 22:10:51] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-06-02 22:10:51] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-06-02 22:10:51] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-06-02 22:10:51] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-06-02 22:10:51] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-06-02 22:10:51] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-06-02 22:10:51] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-06-02 22:10:51] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-06-02 22:10:51] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-06-02 22:10:51] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 115/154 variables, 39/53 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 0/154 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 154/155 variables, and 61 constraints, problems are : Problem set: 0 solved, 116 unsolved in 2958 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 39/39 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 115/154 variables, 39/53 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 116/177 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (OVERLAPS) 0/154 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 154/155 variables, and 177 constraints, problems are : Problem set: 0 solved, 116 unsolved in 2721 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 39/39 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 9/9 constraints]
After SMT, in 5745ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 5747ms
Starting structural reductions in SI_LTL mode, iteration 1 : 39/161 places, 120/324 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 37 transition count 118
Applied a total of 4 rules in 4 ms. Remains 37 /39 variables (removed 2) and now considering 118/120 (removed 2) transitions.
[2024-06-02 22:10:57] [INFO ] Flow matrix only has 114 transitions (discarded 4 similar events)
// Phase 1: matrix 114 rows 37 cols
[2024-06-02 22:10:57] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 22:10:57] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-02 22:10:57] [INFO ] Flow matrix only has 114 transitions (discarded 4 similar events)
[2024-06-02 22:10:57] [INFO ] Invariant cache hit.
[2024-06-02 22:10:57] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-02 22:10:57] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 37/161 places, 118/324 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6186 ms. Remains : 37/161 places, 118/324 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-16-LTLFireability-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-16-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-16-LTLFireability-14 finished in 6254 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U (G(!p0)||(!p0&&G(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' '!(G(F((G(p0)||(p0&&F(p1))))))'
[2024-06-02 22:10:57] [INFO ] Flatten gal took : 22 ms
[2024-06-02 22:10:57] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-06-02 22:10:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 161 places, 324 transitions and 1024 arcs took 8 ms.
Total runtime 504782 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running MedleyA-PT-16

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 161
TRANSITIONS: 324
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.009s, Sys 0.000s]


SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.001s, 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: 2108
MODEL NAME: /home/mcc/execution/414/model
161 places, 324 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 MedleyA-PT-16-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-16-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717366270602

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MedleyA-PT-16"
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 MedleyA-PT-16, 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 r575-smll-171734919600124"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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