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.r576-smll-171734920100124.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 itstools
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 r576-smll-171734920100124
=====================================================================

--------------------
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 1717371791494

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-06-02 23:43:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 23:43:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 23:43:14] [INFO ] Load time of PNML (sax parser for PT used): 191 ms
[2024-06-02 23:43:14] [INFO ] Transformed 196 places.
[2024-06-02 23:43:14] [INFO ] Transformed 392 transitions.
[2024-06-02 23:43:14] [INFO ] Found NUPN structural information;
[2024-06-02 23:43:14] [INFO ] Parsed PT model containing 196 places and 392 transitions and 1186 arcs in 432 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 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 112 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 23:43:14] [INFO ] Computed 7 invariants in 43 ms
[2024-06-02 23:43:15] [INFO ] Implicit Places using invariants in 592 ms returned []
[2024-06-02 23:43:15] [INFO ] Invariant cache hit.
[2024-06-02 23:43:15] [INFO ] Implicit Places using invariants and state equation in 422 ms returned []
Implicit Place search using SMT with State Equation took 1107 ms to find 0 implicit places.
Running 323 sub problems to find dead transitions.
[2024-06-02 23:43:15] [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 23:43:20] [INFO ] Deduced a trap composed of 25 places in 241 ms of which 31 ms to minimize.
[2024-06-02 23:43:20] [INFO ] Deduced a trap composed of 25 places in 212 ms of which 3 ms to minimize.
[2024-06-02 23:43:21] [INFO ] Deduced a trap composed of 28 places in 205 ms of which 3 ms to minimize.
[2024-06-02 23:43:21] [INFO ] Deduced a trap composed of 23 places in 199 ms of which 3 ms to minimize.
[2024-06-02 23:43:21] [INFO ] Deduced a trap composed of 22 places in 280 ms of which 4 ms to minimize.
[2024-06-02 23:43:21] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 2 ms to minimize.
[2024-06-02 23:43:21] [INFO ] Deduced a trap composed of 31 places in 112 ms of which 2 ms to minimize.
[2024-06-02 23:43:22] [INFO ] Deduced a trap composed of 89 places in 111 ms of which 3 ms to minimize.
[2024-06-02 23:43:22] [INFO ] Deduced a trap composed of 95 places in 109 ms of which 3 ms to minimize.
[2024-06-02 23:43:22] [INFO ] Deduced a trap composed of 89 places in 103 ms of which 3 ms to minimize.
[2024-06-02 23:43:22] [INFO ] Deduced a trap composed of 35 places in 112 ms of which 2 ms to minimize.
[2024-06-02 23:43:23] [INFO ] Deduced a trap composed of 105 places in 99 ms of which 2 ms to minimize.
[2024-06-02 23:43:23] [INFO ] Deduced a trap composed of 33 places in 128 ms of which 5 ms to minimize.
[2024-06-02 23:43:23] [INFO ] Deduced a trap composed of 105 places in 98 ms of which 2 ms to minimize.
[2024-06-02 23:43:23] [INFO ] Deduced a trap composed of 35 places in 122 ms of which 2 ms to minimize.
[2024-06-02 23:43:23] [INFO ] Deduced a trap composed of 30 places in 118 ms of which 2 ms to minimize.
[2024-06-02 23:43:24] [INFO ] Deduced a trap composed of 26 places in 118 ms of which 3 ms to minimize.
[2024-06-02 23:43:24] [INFO ] Deduced a trap composed of 31 places in 118 ms of which 2 ms to minimize.
[2024-06-02 23:43:24] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 2 ms to minimize.
[2024-06-02 23:43:24] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 2 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 23:43:25] [INFO ] Deduced a trap composed of 111 places in 105 ms of which 2 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 23:43:29] [INFO ] Deduced a trap composed of 39 places in 177 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 23:43:38] [INFO ] Deduced a trap composed of 111 places in 149 ms of which 2 ms to minimize.
[2024-06-02 23:43:38] [INFO ] Deduced a trap composed of 117 places in 167 ms of which 2 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 23:43:42] [INFO ] Deduced a trap composed of 26 places in 178 ms of which 2 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 30043 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 23:43:50] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 2 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 23:43:52] [INFO ] Deduced a trap composed of 26 places in 126 ms of which 3 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 23:43:55] [INFO ] Deduced a trap composed of 116 places in 175 ms of which 3 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 30032 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 60502ms problems are : Problem set: 0 solved, 323 unsolved
Search for dead transitions found 0 dead transitions in 60560ms
Starting structural reductions in LTL mode, iteration 1 : 161/196 places, 324/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61828 ms. Remains : 161/196 places, 324/390 transitions.
Support contains 31 out of 161 places after structural reductions.
[2024-06-02 23:44:16] [INFO ] Flatten gal took : 107 ms
[2024-06-02 23:44:16] [INFO ] Flatten gal took : 47 ms
[2024-06-02 23:44:17] [INFO ] Input system was already deterministic with 324 transitions.
RANDOM walk for 40000 steps (8 resets) in 2701 ms. (14 steps per ms) remains 19/22 properties
BEST_FIRST walk for 4000 steps (8 resets) in 47 ms. (83 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 106 ms. (37 steps per ms) remains 17/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 61 ms. (64 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 50 ms. (78 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (8 resets) in 69 ms. (57 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (8 resets) in 46 ms. (85 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (8 resets) in 48 ms. (81 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4000 steps (8 resets) in 18 ms. (210 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 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (8 resets) in 27 ms. (142 steps per ms) remains 17/17 properties
[2024-06-02 23:44:18] [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 23:44:18] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 2 ms to minimize.
[2024-06-02 23:44:18] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 1 ms to minimize.
[2024-06-02 23:44:18] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 3 ms to minimize.
[2024-06-02 23:44:18] [INFO ] Deduced a trap composed of 35 places in 124 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 23:44:18] [INFO ] Deduced a trap composed of 34 places in 118 ms of which 2 ms to minimize.
[2024-06-02 23:44:19] [INFO ] Deduced a trap composed of 35 places in 114 ms of which 3 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 23:44:19] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 9 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 1896 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 1721 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 3639ms problems are : Problem set: 0 solved, 17 unsolved
Fused 17 Parikh solutions to 16 different solutions.
Parikh walk visited 16 properties in 5052 ms.
Support contains 1 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 324/324 transitions.
Graph (trivial) has 173 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 1 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 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 93 place count 102 transition count 250
Iterating global reduction 4 with 9 rules applied. Total rules applied 102 place count 102 transition count 250
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 105 place count 102 transition count 247
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 106 place count 101 transition count 247
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 107 place count 100 transition count 245
Iterating global reduction 6 with 1 rules applied. Total rules applied 108 place count 100 transition count 245
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 6 with 48 rules applied. Total rules applied 156 place count 76 transition count 221
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 162 place count 76 transition count 215
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 166 place count 72 transition count 204
Iterating global reduction 7 with 4 rules applied. Total rules applied 170 place count 72 transition count 204
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -117
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 206 place count 54 transition count 321
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 213 place count 54 transition count 314
Drop transitions (Redundant composition of simpler transitions.) removed 43 transitions
Redundant transition composition rules discarded 43 transitions
Iterating global reduction 8 with 43 rules applied. Total rules applied 256 place count 54 transition count 271
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -43
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 262 place count 51 transition count 314
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 264 place count 51 transition count 312
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 270 place count 51 transition count 306
Free-agglomeration rule applied 12 times with reduction of 6 identical transitions.
Iterating global reduction 9 with 12 rules applied. Total rules applied 282 place count 51 transition count 288
Reduce places removed 12 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 9 with 33 rules applied. Total rules applied 315 place count 39 transition count 267
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 10 with 25 rules applied. Total rules applied 340 place count 39 transition count 242
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 341 place count 38 transition count 241
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 23 edges and 36 vertex of which 2 / 36 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 10 with 3 rules applied. Total rules applied 344 place count 35 transition count 241
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 11 with 13 rules applied. Total rules applied 357 place count 35 transition count 228
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 358 place count 34 transition count 221
Iterating global reduction 12 with 1 rules applied. Total rules applied 359 place count 34 transition count 221
Drop transitions (Redundant composition of simpler transitions.) removed 54 transitions
Redundant transition composition rules discarded 54 transitions
Iterating global reduction 12 with 54 rules applied. Total rules applied 413 place count 34 transition count 167
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 414 place count 33 transition count 163
Iterating global reduction 12 with 1 rules applied. Total rules applied 415 place count 33 transition count 163
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 12 with 4 rules applied. Total rules applied 419 place count 31 transition count 161
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 12 with 2 rules applied. Total rules applied 421 place count 30 transition count 167
Free-agglomeration rule applied 1 times.
Iterating global reduction 12 with 1 rules applied. Total rules applied 422 place count 30 transition count 166
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 423 place count 29 transition count 166
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 13 with 2 rules applied. Total rules applied 425 place count 29 transition count 164
Applied a total of 425 rules in 177 ms. Remains 29 /161 variables (removed 132) and now considering 164/324 (removed 160) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 178 ms. Remains : 29/161 places, 164/324 transitions.
RANDOM walk for 110 steps (12 resets) in 11 ms. (9 steps per ms) remains 0/1 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 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 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.
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 1 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 0 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 0 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 89 ms. Remains 36 /161 variables (removed 125) and now considering 152/324 (removed 172) transitions.
[2024-06-02 23:44:27] [INFO ] Flow matrix only has 137 transitions (discarded 15 similar events)
// Phase 1: matrix 137 rows 36 cols
[2024-06-02 23:44:27] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 23:44:27] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-02 23:44:27] [INFO ] Flow matrix only has 137 transitions (discarded 15 similar events)
[2024-06-02 23:44:27] [INFO ] Invariant cache hit.
[2024-06-02 23:44:27] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-06-02 23:44:27] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2024-06-02 23:44:27] [INFO ] Redundant transitions in 47 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 23:44:27] [INFO ] Flow matrix only has 134 transitions (discarded 15 similar events)
// Phase 1: matrix 134 rows 36 cols
[2024-06-02 23:44:27] [INFO ] Computed 5 invariants in 6 ms
[2024-06-02 23:44:27] [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 23:44:28] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
[2024-06-02 23:44:28] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-06-02 23:44:28] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-06-02 23:44:28] [INFO ] Deduced a trap composed of 7 places in 45 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 23:44:29] [INFO ] Deduced a trap composed of 7 places in 38 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 4190 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 4918 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 9353ms problems are : Problem set: 0 solved, 145 unsolved
Search for dead transitions found 0 dead transitions in 9357ms
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 0 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 12 ms. Remains 34 /36 variables (removed 2) and now considering 143/149 (removed 6) transitions.
[2024-06-02 23:44:37] [INFO ] Flow matrix only has 128 transitions (discarded 15 similar events)
// Phase 1: matrix 128 rows 34 cols
[2024-06-02 23:44:37] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 23:44:37] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-02 23:44:37] [INFO ] Flow matrix only has 128 transitions (discarded 15 similar events)
[2024-06-02 23:44:37] [INFO ] Invariant cache hit.
[2024-06-02 23:44:37] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-06-02 23:44:37] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 211 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 9895 ms. Remains : 34/161 places, 143/324 transitions.
Stuttering acceptance computed with spot in 400 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 392 ms.
Product exploration explored 100000 steps with 0 reset in 171 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 187 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 127 ms :[true, p0, (NOT p1), (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (9046 resets) in 354 ms. (112 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40002 steps (3100 resets) in 200 ms. (199 steps per ms) remains 1/1 properties
[2024-06-02 23:44:38] [INFO ] Flow matrix only has 128 transitions (discarded 15 similar events)
[2024-06-02 23:44:38] [INFO ] Invariant cache hit.
[2024-06-02 23:44:38] [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 28 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 38ms 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 390 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))]
Stuttering acceptance computed with spot in 133 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 3 ms. Remains 34 /34 variables (removed 0) and now considering 143/143 (removed 0) transitions.
[2024-06-02 23:44:39] [INFO ] Flow matrix only has 128 transitions (discarded 15 similar events)
[2024-06-02 23:44:39] [INFO ] Invariant cache hit.
[2024-06-02 23:44:39] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-02 23:44:39] [INFO ] Flow matrix only has 128 transitions (discarded 15 similar events)
[2024-06-02 23:44:39] [INFO ] Invariant cache hit.
[2024-06-02 23:44:39] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-06-02 23:44:39] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2024-06-02 23:44:39] [INFO ] Redundant transitions in 28 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 23:44:39] [INFO ] Flow matrix only has 126 transitions (discarded 15 similar events)
// Phase 1: matrix 126 rows 34 cols
[2024-06-02 23:44:39] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 23:44:39] [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 23:44:40] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-06-02 23:44:40] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-06-02 23:44:40] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-06-02 23:44:40] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-06-02 23:44:40] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 2 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 23:44:41] [INFO ] Deduced a trap composed of 7 places in 37 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 3314 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 3700 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 7119ms problems are : Problem set: 0 solved, 137 unsolved
Search for dead transitions found 0 dead transitions in 7120ms
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 7 ms. Remains 33 /34 variables (removed 1) and now considering 132/141 (removed 9) transitions.
[2024-06-02 23:44:46] [INFO ] Flow matrix only has 120 transitions (discarded 12 similar events)
// Phase 1: matrix 120 rows 33 cols
[2024-06-02 23:44:46] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 23:44:46] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-06-02 23:44:46] [INFO ] Flow matrix only has 120 transitions (discarded 12 similar events)
[2024-06-02 23:44:46] [INFO ] Invariant cache hit.
[2024-06-02 23:44:46] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-06-02 23:44:46] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 147 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 7494 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 146 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 144 ms :[true, p0, (NOT p1), (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (8951 resets) in 97 ms. (408 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (3207 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
[2024-06-02 23:44:47] [INFO ] Flow matrix only has 120 transitions (discarded 12 similar events)
[2024-06-02 23:44:47] [INFO ] Invariant cache hit.
[2024-06-02 23:44:47] [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 29 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 35ms 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 589 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 135 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 142 ms :[true, p0, (NOT p1), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 255 ms.
Product exploration explored 100000 steps with 0 reset in 150 ms.
Built C files in :
/tmp/ltsmin12033213462218292486
[2024-06-02 23:44:48] [INFO ] Computing symmetric may disable matrix : 132 transitions.
[2024-06-02 23:44:48] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:44:48] [INFO ] Computing symmetric may enable matrix : 132 transitions.
[2024-06-02 23:44:48] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:44:48] [INFO ] Computing Do-Not-Accords matrix : 132 transitions.
[2024-06-02 23:44:48] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:44:48] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12033213462218292486
Running compilation step : cd /tmp/ltsmin12033213462218292486;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 748 ms.
Running link step : cd /tmp/ltsmin12033213462218292486;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin12033213462218292486;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15783178649936135335.hoa' '--buchi-type=spotba'
LTSmin run took 200 ms.
FORMULA MedleyA-PT-16-LTLFireability-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-16-LTLFireability-01 finished in 22590 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 6 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 23:44:49] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:44:49] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-06-02 23:44:49] [INFO ] Invariant cache hit.
[2024-06-02 23:44:50] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
Running 311 sub problems to find dead transitions.
[2024-06-02 23:44:50] [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 23:44:53] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 2 ms to minimize.
[2024-06-02 23:44:53] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 1 ms to minimize.
[2024-06-02 23:44:53] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 2 ms to minimize.
[2024-06-02 23:44:53] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 2 ms to minimize.
[2024-06-02 23:44:53] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 3 ms to minimize.
[2024-06-02 23:44:53] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 3 ms to minimize.
[2024-06-02 23:44:53] [INFO ] Deduced a trap composed of 91 places in 96 ms of which 2 ms to minimize.
[2024-06-02 23:44:53] [INFO ] Deduced a trap composed of 101 places in 104 ms of which 2 ms to minimize.
[2024-06-02 23:44:54] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 2 ms to minimize.
[2024-06-02 23:44:54] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 4 ms to minimize.
[2024-06-02 23:44:54] [INFO ] Deduced a trap composed of 87 places in 86 ms of which 2 ms to minimize.
[2024-06-02 23:44:54] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 3 ms to minimize.
[2024-06-02 23:44:55] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 2 ms to minimize.
[2024-06-02 23:44:55] [INFO ] Deduced a trap composed of 36 places in 109 ms of which 2 ms to minimize.
[2024-06-02 23:44:55] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 2 ms to minimize.
[2024-06-02 23:44:55] [INFO ] Deduced a trap composed of 34 places in 65 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 23:44:56] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 2 ms to minimize.
[2024-06-02 23:44:57] [INFO ] Deduced a trap composed of 26 places in 80 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 23:44:59] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 2 ms to minimize.
[2024-06-02 23:45:00] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 2 ms to minimize.
[2024-06-02 23:45:00] [INFO ] Deduced a trap composed of 85 places in 126 ms of which 2 ms to minimize.
[2024-06-02 23:45:00] [INFO ] Deduced a trap composed of 107 places in 145 ms of which 2 ms to minimize.
[2024-06-02 23:45:00] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-06-02 23:45:00] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 2 ms to minimize.
[2024-06-02 23:45:01] [INFO ] Deduced a trap composed of 23 places in 138 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 21505 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 25533 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 47133ms problems are : Problem set: 0 solved, 311 unsolved
Search for dead transitions found 0 dead transitions in 47137ms
Starting structural reductions in LTL mode, iteration 1 : 154/161 places, 312/324 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47449 ms. Remains : 154/161 places, 312/324 transitions.
Stuttering acceptance computed with spot in 201 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 343 ms.
Stack based approach found an accepted trace after 27 steps with 0 reset with depth 28 and stack size 28 in 1 ms.
FORMULA MedleyA-PT-16-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-16-LTLFireability-04 finished in 48023 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 10 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 23:45:37] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:45:38] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-06-02 23:45:38] [INFO ] Invariant cache hit.
[2024-06-02 23:45:38] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
Running 309 sub problems to find dead transitions.
[2024-06-02 23:45:38] [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 23:45:41] [INFO ] Deduced a trap composed of 25 places in 120 ms of which 3 ms to minimize.
[2024-06-02 23:45:42] [INFO ] Deduced a trap composed of 21 places in 157 ms of which 2 ms to minimize.
[2024-06-02 23:45:42] [INFO ] Deduced a trap composed of 29 places in 149 ms of which 3 ms to minimize.
[2024-06-02 23:45:42] [INFO ] Deduced a trap composed of 24 places in 167 ms of which 3 ms to minimize.
[2024-06-02 23:45:42] [INFO ] Deduced a trap composed of 22 places in 159 ms of which 3 ms to minimize.
[2024-06-02 23:45:42] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 3 ms to minimize.
[2024-06-02 23:45:42] [INFO ] Deduced a trap composed of 31 places in 142 ms of which 2 ms to minimize.
[2024-06-02 23:45:43] [INFO ] Deduced a trap composed of 15 places in 179 ms of which 3 ms to minimize.
[2024-06-02 23:45:43] [INFO ] Deduced a trap composed of 89 places in 137 ms of which 3 ms to minimize.
[2024-06-02 23:45:43] [INFO ] Deduced a trap composed of 15 places in 177 ms of which 2 ms to minimize.
[2024-06-02 23:45:43] [INFO ] Deduced a trap composed of 93 places in 160 ms of which 3 ms to minimize.
[2024-06-02 23:45:43] [INFO ] Deduced a trap composed of 31 places in 184 ms of which 3 ms to minimize.
[2024-06-02 23:45:44] [INFO ] Deduced a trap composed of 34 places in 156 ms of which 3 ms to minimize.
[2024-06-02 23:45:44] [INFO ] Deduced a trap composed of 85 places in 143 ms of which 3 ms to minimize.
[2024-06-02 23:45:44] [INFO ] Deduced a trap composed of 89 places in 162 ms of which 3 ms to minimize.
[2024-06-02 23:45:44] [INFO ] Deduced a trap composed of 33 places in 165 ms of which 2 ms to minimize.
[2024-06-02 23:45:45] [INFO ] Deduced a trap composed of 87 places in 152 ms of which 3 ms to minimize.
[2024-06-02 23:45:45] [INFO ] Deduced a trap composed of 100 places in 123 ms of which 3 ms to minimize.
[2024-06-02 23:45:45] [INFO ] Deduced a trap composed of 31 places in 148 ms of which 3 ms to minimize.
[2024-06-02 23:45:45] [INFO ] Deduced a trap composed of 25 places in 101 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 23:45:46] [INFO ] Deduced a trap composed of 87 places in 143 ms of which 2 ms to minimize.
[2024-06-02 23:45:46] [INFO ] Deduced a trap composed of 100 places in 138 ms of which 3 ms to minimize.
[2024-06-02 23:45:47] [INFO ] Deduced a trap composed of 28 places in 159 ms of which 3 ms to minimize.
[2024-06-02 23:45:47] [INFO ] Deduced a trap composed of 26 places in 164 ms of which 3 ms to minimize.
[2024-06-02 23:45:47] [INFO ] Deduced a trap composed of 112 places in 160 ms of which 3 ms to minimize.
[2024-06-02 23:45:48] [INFO ] Deduced a trap composed of 113 places in 177 ms of which 2 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 23:45:51] [INFO ] Deduced a trap composed of 34 places in 166 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 28072 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 25322 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 53485ms problems are : Problem set: 0 solved, 309 unsolved
Search for dead transitions found 0 dead transitions in 53489ms
Starting structural reductions in LTL mode, iteration 1 : 154/161 places, 310/324 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53894 ms. Remains : 154/161 places, 310/324 transitions.
Stuttering acceptance computed with spot in 108 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 606 ms.
Product exploration explored 100000 steps with 33333 reset in 268 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 24 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 54924 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 1 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 96 ms. Remains 37 /161 variables (removed 124) and now considering 178/324 (removed 146) transitions.
[2024-06-02 23:46:32] [INFO ] Flow matrix only has 158 transitions (discarded 20 similar events)
// Phase 1: matrix 158 rows 37 cols
[2024-06-02 23:46:32] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 23:46:33] [INFO ] Implicit Places using invariants in 317 ms returned []
[2024-06-02 23:46:33] [INFO ] Flow matrix only has 158 transitions (discarded 20 similar events)
[2024-06-02 23:46:33] [INFO ] Invariant cache hit.
[2024-06-02 23:46:33] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-02 23:46:33] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
[2024-06-02 23:46:33] [INFO ] Redundant transitions in 41 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 23:46:33] [INFO ] Flow matrix only has 151 transitions (discarded 20 similar events)
// Phase 1: matrix 151 rows 37 cols
[2024-06-02 23:46:33] [INFO ] Computed 5 invariants in 6 ms
[2024-06-02 23:46:33] [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 23:46:34] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 2 ms to minimize.
[2024-06-02 23:46:34] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 2 ms to minimize.
[2024-06-02 23:46:34] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-06-02 23:46:34] [INFO ] Deduced a trap composed of 7 places in 44 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 23:46:36] [INFO ] Deduced a trap composed of 7 places in 46 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 6546 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 5956 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 12634ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 12636ms
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 0 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 5 ms. Remains 36 /37 variables (removed 1) and now considering 170/171 (removed 1) transitions.
[2024-06-02 23:46:46] [INFO ] Flow matrix only has 150 transitions (discarded 20 similar events)
// Phase 1: matrix 150 rows 36 cols
[2024-06-02 23:46:46] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 23:46:46] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-02 23:46:46] [INFO ] Flow matrix only has 150 transitions (discarded 20 similar events)
[2024-06-02 23:46:46] [INFO ] Invariant cache hit.
[2024-06-02 23:46:46] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-02 23:46:46] [INFO ] Implicit Places using invariants and state equation in 108 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 : 36/161 places, 170/324 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 13372 ms. Remains : 36/161 places, 170/324 transitions.
Stuttering acceptance computed with spot in 111 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 53 ms.
Product exploration explored 100000 steps with 0 reset in 91 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 188 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 109 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 40000 steps (8871 resets) in 65 ms. (606 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (101 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
[2024-06-02 23:46:46] [INFO ] Flow matrix only has 150 transitions (discarded 20 similar events)
[2024-06-02 23:46:46] [INFO ] Invariant cache hit.
[2024-06-02 23:46:46] [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 23 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 29ms 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 217 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 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 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 23:46:47] [INFO ] Flow matrix only has 150 transitions (discarded 20 similar events)
[2024-06-02 23:46:47] [INFO ] Invariant cache hit.
[2024-06-02 23:46:47] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-02 23:46:47] [INFO ] Flow matrix only has 150 transitions (discarded 20 similar events)
[2024-06-02 23:46:47] [INFO ] Invariant cache hit.
[2024-06-02 23:46:47] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-02 23:46:47] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2024-06-02 23:46:47] [INFO ] Redundant transitions in 28 ms returned []
Running 166 sub problems to find dead transitions.
[2024-06-02 23:46:47] [INFO ] Flow matrix only has 150 transitions (discarded 20 similar events)
[2024-06-02 23:46:47] [INFO ] Invariant cache hit.
[2024-06-02 23:46:47] [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 23:46:48] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-06-02 23:46:48] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-06-02 23:46:48] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-06-02 23:46:48] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-06-02 23:46:48] [INFO ] Deduced a trap composed of 7 places in 36 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 23:46:50] [INFO ] Deduced a trap composed of 7 places in 39 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 5495 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 23:46:56] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 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 9867 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 15509ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 15512ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 15717 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 73 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 65 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4695 steps (1078 resets) in 9 ms. (469 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 124 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 96 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 87 ms.
Product exploration explored 100000 steps with 0 reset in 92 ms.
Built C files in :
/tmp/ltsmin4753439664779379685
[2024-06-02 23:47:03] [INFO ] Computing symmetric may disable matrix : 170 transitions.
[2024-06-02 23:47:03] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:47:03] [INFO ] Computing symmetric may enable matrix : 170 transitions.
[2024-06-02 23:47:03] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:47:03] [INFO ] Computing Do-Not-Accords matrix : 170 transitions.
[2024-06-02 23:47:03] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:47:03] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4753439664779379685
Running compilation step : cd /tmp/ltsmin4753439664779379685;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 744 ms.
Running link step : cd /tmp/ltsmin4753439664779379685;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin4753439664779379685;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13741394706340532333.hoa' '--buchi-type=spotba'
LTSmin run took 256 ms.
FORMULA MedleyA-PT-16-LTLFireability-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-16-LTLFireability-06 finished in 31988 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 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 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 0 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 0 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 83 ms. Remains 38 /161 variables (removed 123) and now considering 156/324 (removed 168) transitions.
[2024-06-02 23:47:04] [INFO ] Flow matrix only has 144 transitions (discarded 12 similar events)
// Phase 1: matrix 144 rows 38 cols
[2024-06-02 23:47:04] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 23:47:05] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-02 23:47:05] [INFO ] Flow matrix only has 144 transitions (discarded 12 similar events)
[2024-06-02 23:47:05] [INFO ] Invariant cache hit.
[2024-06-02 23:47:05] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-06-02 23:47:05] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
[2024-06-02 23:47:05] [INFO ] Redundant transitions in 29 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 23:47:05] [INFO ] Flow matrix only has 142 transitions (discarded 12 similar events)
// Phase 1: matrix 142 rows 38 cols
[2024-06-02 23:47:05] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 23:47:05] [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 23:47:06] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-06-02 23:47:06] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-06-02 23:47:06] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-06-02 23:47:06] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-06-02 23:47:06] [INFO ] Deduced a trap composed of 9 places in 60 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 4994 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 23:47:13] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 2 ms to minimize.
[2024-06-02 23:47:13] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2024-06-02 23:47:14] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 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 8881 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 14051ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 14054ms
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 7 ms. Remains 37 /38 variables (removed 1) and now considering 153/154 (removed 1) transitions.
[2024-06-02 23:47:19] [INFO ] Flow matrix only has 141 transitions (discarded 12 similar events)
// Phase 1: matrix 141 rows 37 cols
[2024-06-02 23:47:19] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 23:47:19] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-02 23:47:19] [INFO ] Flow matrix only has 141 transitions (discarded 12 similar events)
[2024-06-02 23:47:19] [INFO ] Invariant cache hit.
[2024-06-02 23:47:19] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-06-02 23:47:19] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 197 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 14616 ms. Remains : 37/161 places, 153/324 transitions.
Stuttering acceptance computed with spot in 183 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 90 ms.
Product exploration explored 100000 steps with 0 reset in 91 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 161 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 133 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 (6054 resets) in 139 ms. (285 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (2349 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
[2024-06-02 23:47:20] [INFO ] Flow matrix only has 141 transitions (discarded 12 similar events)
[2024-06-02 23:47:20] [INFO ] Invariant cache hit.
[2024-06-02 23:47:20] [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 29 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 38ms 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 20 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 15470 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 1 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 0 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 36 ms. Remains 38 /161 variables (removed 123) and now considering 180/324 (removed 144) transitions.
[2024-06-02 23:47:20] [INFO ] Flow matrix only has 160 transitions (discarded 20 similar events)
// Phase 1: matrix 160 rows 38 cols
[2024-06-02 23:47:20] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 23:47:20] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-02 23:47:20] [INFO ] Flow matrix only has 160 transitions (discarded 20 similar events)
[2024-06-02 23:47:20] [INFO ] Invariant cache hit.
[2024-06-02 23:47:20] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-02 23:47:20] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2024-06-02 23:47:20] [INFO ] Redundant transitions in 36 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 23:47:20] [INFO ] Flow matrix only has 154 transitions (discarded 20 similar events)
// Phase 1: matrix 154 rows 38 cols
[2024-06-02 23:47:20] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 23:47:20] [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 23:47:21] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 2 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 23:47:22] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-06-02 23:47:23] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2024-06-02 23:47:23] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-06-02 23:47:23] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 2 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 23:47:25] [INFO ] Deduced a trap composed of 7 places in 54 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 8622 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 23:47:34] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 0 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 12729 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 21595ms problems are : Problem set: 0 solved, 171 unsolved
Search for dead transitions found 0 dead transitions in 21598ms
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 11 ms. Remains 35 /38 variables (removed 3) and now considering 159/174 (removed 15) transitions.
[2024-06-02 23:47:42] [INFO ] Flow matrix only has 146 transitions (discarded 13 similar events)
// Phase 1: matrix 146 rows 35 cols
[2024-06-02 23:47:42] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 23:47:42] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-02 23:47:42] [INFO ] Flow matrix only has 146 transitions (discarded 13 similar events)
[2024-06-02 23:47:42] [INFO ] Invariant cache hit.
[2024-06-02 23:47:42] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-06-02 23:47:42] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 229 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 22137 ms. Remains : 35/161 places, 159/324 transitions.
Stuttering acceptance computed with spot in 172 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 1 ms.
FORMULA MedleyA-PT-16-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-16-LTLFireability-09 finished in 22331 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 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 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.
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 61 ms. Remains 34 /161 variables (removed 127) and now considering 162/324 (removed 162) transitions.
[2024-06-02 23:47:42] [INFO ] Flow matrix only has 142 transitions (discarded 20 similar events)
// Phase 1: matrix 142 rows 34 cols
[2024-06-02 23:47:42] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 23:47:42] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-02 23:47:42] [INFO ] Flow matrix only has 142 transitions (discarded 20 similar events)
[2024-06-02 23:47:42] [INFO ] Invariant cache hit.
[2024-06-02 23:47:42] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-02 23:47:42] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2024-06-02 23:47:42] [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 23:47:42] [INFO ] Flow matrix only has 140 transitions (discarded 20 similar events)
// Phase 1: matrix 140 rows 34 cols
[2024-06-02 23:47:42] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 23:47:42] [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 23:47:43] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-06-02 23:47:43] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 2 ms to minimize.
[2024-06-02 23:47:43] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-06-02 23:47:44] [INFO ] Deduced a trap composed of 7 places in 74 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 23:47:45] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 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 5997 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 6299 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 12443ms problems are : Problem set: 0 solved, 156 unsolved
Search for dead transitions found 0 dead transitions in 12445ms
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 7 ms. Remains 33 /34 variables (removed 1) and now considering 159/160 (removed 1) transitions.
[2024-06-02 23:47:55] [INFO ] Flow matrix only has 139 transitions (discarded 20 similar events)
// Phase 1: matrix 139 rows 33 cols
[2024-06-02 23:47:55] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 23:47:55] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-06-02 23:47:55] [INFO ] Flow matrix only has 139 transitions (discarded 20 similar events)
[2024-06-02 23:47:55] [INFO ] Invariant cache hit.
[2024-06-02 23:47:55] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-02 23:47:55] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 215 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 12935 ms. Remains : 33/161 places, 159/324 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-16-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 96 ms.
Product exploration explored 100000 steps with 0 reset in 92 ms.
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 104 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
RANDOM walk for 1113 steps (231 resets) in 9 ms. (111 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 135 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Support contains 1 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 159/159 transitions.
Applied a total of 0 rules in 3 ms. Remains 33 /33 variables (removed 0) and now considering 159/159 (removed 0) transitions.
[2024-06-02 23:47:56] [INFO ] Flow matrix only has 139 transitions (discarded 20 similar events)
[2024-06-02 23:47:56] [INFO ] Invariant cache hit.
[2024-06-02 23:47:56] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-02 23:47:56] [INFO ] Flow matrix only has 139 transitions (discarded 20 similar events)
[2024-06-02 23:47:56] [INFO ] Invariant cache hit.
[2024-06-02 23:47:56] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-02 23:47:56] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
[2024-06-02 23:47:56] [INFO ] Redundant transitions in 25 ms returned []
Running 155 sub problems to find dead transitions.
[2024-06-02 23:47:56] [INFO ] Flow matrix only has 139 transitions (discarded 20 similar events)
[2024-06-02 23:47:56] [INFO ] Invariant cache hit.
[2024-06-02 23:47:56] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-06-02 23:47:57] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2024-06-02 23:47:57] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-06-02 23:47:57] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-06-02 23:47:57] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-06-02 23:47:57] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (OVERLAPS) 138/171 variables, 33/43 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 36/79 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-06-02 23:47:59] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 7 (OVERLAPS) 0/171 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Real declared 171/172 variables, and 80 constraints, problems are : Problem set: 0 solved, 155 unsolved in 6168 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 33/33 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 155 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (OVERLAPS) 138/171 variables, 33/44 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 36/80 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 155/235 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 7 (OVERLAPS) 0/171 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Int declared 171/172 variables, and 235 constraints, problems are : Problem set: 0 solved, 155 unsolved in 6734 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 33/33 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 6/6 constraints]
After SMT, in 13104ms problems are : Problem set: 0 solved, 155 unsolved
Search for dead transitions found 0 dead transitions in 13107ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 13380 ms. Remains : 33/33 places, 159/159 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 72 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
RANDOM walk for 1438 steps (325 resets) in 5 ms. (239 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 93 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 55 ms.
Product exploration explored 100000 steps with 0 reset in 62 ms.
Built C files in :
/tmp/ltsmin11663483494696142503
[2024-06-02 23:48:10] [INFO ] Computing symmetric may disable matrix : 159 transitions.
[2024-06-02 23:48:10] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:48:10] [INFO ] Computing symmetric may enable matrix : 159 transitions.
[2024-06-02 23:48:10] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:48:10] [INFO ] Computing Do-Not-Accords matrix : 159 transitions.
[2024-06-02 23:48:10] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:48:10] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11663483494696142503
Running compilation step : cd /tmp/ltsmin11663483494696142503;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 757 ms.
Running link step : cd /tmp/ltsmin11663483494696142503;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin11663483494696142503;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6841025100426820949.hoa' '--buchi-type=spotba'
LTSmin run took 195 ms.
FORMULA MedleyA-PT-16-LTLFireability-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-16-LTLFireability-10 finished in 28436 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 3 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 23:48:11] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:48:11] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-02 23:48:11] [INFO ] Invariant cache hit.
[2024-06-02 23:48:11] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
Running 311 sub problems to find dead transitions.
[2024-06-02 23:48:11] [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 23:48:15] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 2 ms to minimize.
[2024-06-02 23:48:15] [INFO ] Deduced a trap composed of 32 places in 132 ms of which 2 ms to minimize.
[2024-06-02 23:48:15] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 3 ms to minimize.
[2024-06-02 23:48:16] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 2 ms to minimize.
[2024-06-02 23:48:16] [INFO ] Deduced a trap composed of 31 places in 144 ms of which 3 ms to minimize.
[2024-06-02 23:48:16] [INFO ] Deduced a trap composed of 15 places in 180 ms of which 3 ms to minimize.
[2024-06-02 23:48:16] [INFO ] Deduced a trap composed of 91 places in 150 ms of which 2 ms to minimize.
[2024-06-02 23:48:16] [INFO ] Deduced a trap composed of 101 places in 142 ms of which 3 ms to minimize.
[2024-06-02 23:48:16] [INFO ] Deduced a trap composed of 24 places in 167 ms of which 3 ms to minimize.
[2024-06-02 23:48:17] [INFO ] Deduced a trap composed of 33 places in 156 ms of which 3 ms to minimize.
[2024-06-02 23:48:17] [INFO ] Deduced a trap composed of 87 places in 153 ms of which 2 ms to minimize.
[2024-06-02 23:48:17] [INFO ] Deduced a trap composed of 24 places in 174 ms of which 3 ms to minimize.
[2024-06-02 23:48:18] [INFO ] Deduced a trap composed of 25 places in 146 ms of which 3 ms to minimize.
[2024-06-02 23:48:18] [INFO ] Deduced a trap composed of 36 places in 174 ms of which 2 ms to minimize.
[2024-06-02 23:48:18] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 2 ms to minimize.
[2024-06-02 23:48:19] [INFO ] Deduced a trap composed of 34 places in 93 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 23:48:20] [INFO ] Deduced a trap composed of 33 places in 168 ms of which 3 ms to minimize.
[2024-06-02 23:48:20] [INFO ] Deduced a trap composed of 26 places in 106 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 23:48:24] [INFO ] Deduced a trap composed of 31 places in 139 ms of which 3 ms to minimize.
[2024-06-02 23:48:24] [INFO ] Deduced a trap composed of 34 places in 150 ms of which 2 ms to minimize.
[2024-06-02 23:48:25] [INFO ] Deduced a trap composed of 85 places in 150 ms of which 2 ms to minimize.
[2024-06-02 23:48:25] [INFO ] Deduced a trap composed of 107 places in 141 ms of which 3 ms to minimize.
[2024-06-02 23:48:25] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 3 ms to minimize.
[2024-06-02 23:48:25] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 2 ms to minimize.
[2024-06-02 23:48:26] [INFO ] Deduced a trap composed of 23 places in 158 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 29070 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 25877 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 55084ms problems are : Problem set: 0 solved, 311 unsolved
Search for dead transitions found 0 dead transitions in 55093ms
Starting structural reductions in LTL mode, iteration 1 : 154/161 places, 312/324 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55497 ms. Remains : 154/161 places, 312/324 transitions.
Stuttering acceptance computed with spot in 80 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 0 ms.
FORMULA MedleyA-PT-16-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-16-LTLFireability-11 finished in 55598 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 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 23:49:06] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:49:06] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-02 23:49:06] [INFO ] Invariant cache hit.
[2024-06-02 23:49:07] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
Running 309 sub problems to find dead transitions.
[2024-06-02 23:49:07] [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 23:49:11] [INFO ] Deduced a trap composed of 22 places in 117 ms of which 2 ms to minimize.
[2024-06-02 23:49:11] [INFO ] Deduced a trap composed of 28 places in 133 ms of which 2 ms to minimize.
[2024-06-02 23:49:11] [INFO ] Deduced a trap composed of 21 places in 139 ms of which 3 ms to minimize.
[2024-06-02 23:49:11] [INFO ] Deduced a trap composed of 19 places in 150 ms of which 3 ms to minimize.
[2024-06-02 23:49:11] [INFO ] Deduced a trap composed of 36 places in 142 ms of which 2 ms to minimize.
[2024-06-02 23:49:12] [INFO ] Deduced a trap composed of 15 places in 184 ms of which 3 ms to minimize.
[2024-06-02 23:49:12] [INFO ] Deduced a trap composed of 89 places in 142 ms of which 3 ms to minimize.
[2024-06-02 23:49:12] [INFO ] Deduced a trap composed of 87 places in 142 ms of which 2 ms to minimize.
[2024-06-02 23:49:12] [INFO ] Deduced a trap composed of 15 places in 175 ms of which 3 ms to minimize.
[2024-06-02 23:49:12] [INFO ] Deduced a trap composed of 93 places in 171 ms of which 3 ms to minimize.
[2024-06-02 23:49:12] [INFO ] Deduced a trap composed of 89 places in 172 ms of which 3 ms to minimize.
[2024-06-02 23:49:13] [INFO ] Deduced a trap composed of 87 places in 128 ms of which 3 ms to minimize.
[2024-06-02 23:49:13] [INFO ] Deduced a trap composed of 31 places in 170 ms of which 2 ms to minimize.
[2024-06-02 23:49:13] [INFO ] Deduced a trap composed of 34 places in 152 ms of which 2 ms to minimize.
[2024-06-02 23:49:14] [INFO ] Deduced a trap composed of 100 places in 121 ms of which 2 ms to minimize.
[2024-06-02 23:49:14] [INFO ] Deduced a trap composed of 102 places in 162 ms of which 3 ms to minimize.
[2024-06-02 23:49:14] [INFO ] Deduced a trap composed of 100 places in 128 ms of which 3 ms to minimize.
[2024-06-02 23:49:14] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 2 ms to minimize.
[2024-06-02 23:49:14] [INFO ] Deduced a trap composed of 34 places in 135 ms of which 3 ms to minimize.
[2024-06-02 23:49:15] [INFO ] Deduced a trap composed of 33 places in 134 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 23:49:15] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 2 ms to minimize.
[2024-06-02 23:49:15] [INFO ] Deduced a trap composed of 34 places in 122 ms of which 3 ms to minimize.
[2024-06-02 23:49:16] [INFO ] Deduced a trap composed of 31 places in 170 ms of which 2 ms to minimize.
[2024-06-02 23:49:16] [INFO ] Deduced a trap composed of 25 places in 177 ms of which 3 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 23:49:20] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-06-02 23:49:20] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 2 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 23:49:21] [INFO ] Deduced a trap composed of 106 places in 158 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 23:49:29] [INFO ] Deduced a trap composed of 106 places in 127 ms of which 2 ms to minimize.
[2024-06-02 23:49:29] [INFO ] Deduced a trap composed of 109 places in 169 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
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 30016 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 23:49:55] [INFO ] Deduced a trap composed of 87 places in 115 ms of which 2 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/464 variables, 1/500 constraints. Problems are: Problem set: 0 solved, 309 unsolved
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 30016 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 60161ms problems are : Problem set: 0 solved, 309 unsolved
Search for dead transitions found 0 dead transitions in 60168ms
Starting structural reductions in LTL mode, iteration 1 : 154/161 places, 310/324 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60521 ms. Remains : 154/161 places, 310/324 transitions.
Stuttering acceptance computed with spot in 238 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 172 ms.
Product exploration explored 100000 steps with 33333 reset in 200 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 61188 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 6 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 23:50:07] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:50:07] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-06-02 23:50:07] [INFO ] Invariant cache hit.
[2024-06-02 23:50:08] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 452 ms to find 0 implicit places.
Running 311 sub problems to find dead transitions.
[2024-06-02 23:50:08] [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 23:50:12] [INFO ] Deduced a trap composed of 28 places in 115 ms of which 2 ms to minimize.
[2024-06-02 23:50:12] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 2 ms to minimize.
[2024-06-02 23:50:12] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 2 ms to minimize.
[2024-06-02 23:50:12] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 2 ms to minimize.
[2024-06-02 23:50:12] [INFO ] Deduced a trap composed of 91 places in 86 ms of which 1 ms to minimize.
[2024-06-02 23:50:12] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 2 ms to minimize.
[2024-06-02 23:50:12] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 2 ms to minimize.
[2024-06-02 23:50:12] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 2 ms to minimize.
[2024-06-02 23:50:13] [INFO ] Deduced a trap composed of 33 places in 148 ms of which 3 ms to minimize.
[2024-06-02 23:50:13] [INFO ] Deduced a trap composed of 87 places in 134 ms of which 2 ms to minimize.
[2024-06-02 23:50:13] [INFO ] Deduced a trap composed of 31 places in 143 ms of which 2 ms to minimize.
[2024-06-02 23:50:13] [INFO ] Deduced a trap composed of 24 places in 162 ms of which 3 ms to minimize.
[2024-06-02 23:50:14] [INFO ] Deduced a trap composed of 28 places in 170 ms of which 3 ms to minimize.
[2024-06-02 23:50:14] [INFO ] Deduced a trap composed of 42 places in 168 ms of which 3 ms to minimize.
[2024-06-02 23:50:14] [INFO ] Deduced a trap composed of 102 places in 154 ms of which 3 ms to minimize.
[2024-06-02 23:50:14] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 2 ms to minimize.
[2024-06-02 23:50:15] [INFO ] Deduced a trap composed of 31 places in 151 ms of which 3 ms to minimize.
[2024-06-02 23:50:15] [INFO ] Deduced a trap composed of 34 places in 147 ms of which 2 ms to minimize.
[2024-06-02 23:50:15] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 2 ms to minimize.
[2024-06-02 23:50:15] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 2 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 23:50:16] [INFO ] Deduced a trap composed of 89 places in 132 ms of which 3 ms to minimize.
[2024-06-02 23:50:17] [INFO ] Deduced a trap composed of 102 places in 98 ms of which 2 ms to minimize.
[2024-06-02 23:50:17] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 3 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 23:50:22] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-06-02 23:50:23] [INFO ] Deduced a trap composed of 31 places in 88 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 23:50:30] [INFO ] Deduced a trap composed of 25 places in 89 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
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 468/468 variables, and 189 constraints, problems are : Problem set: 0 solved, 311 unsolved in 30016 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 23:50:48] [INFO ] Deduced a trap composed of 104 places in 141 ms of which 2 ms to minimize.
[2024-06-02 23:50:48] [INFO ] Deduced a trap composed of 116 places in 170 ms of which 3 ms to minimize.
[2024-06-02 23:50:49] [INFO ] Deduced a trap composed of 114 places in 152 ms of which 3 ms to minimize.
[2024-06-02 23:50:49] [INFO ] Deduced a trap composed of 87 places in 123 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
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 468/468 variables, and 504 constraints, problems are : Problem set: 0 solved, 311 unsolved in 30016 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 60176ms problems are : Problem set: 0 solved, 311 unsolved
Search for dead transitions found 0 dead transitions in 60182ms
Starting structural reductions in LTL mode, iteration 1 : 156/161 places, 312/324 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60643 ms. Remains : 156/161 places, 312/324 transitions.
Stuttering acceptance computed with spot in 362 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 152 ms.
Product exploration explored 100000 steps with 50000 reset in 177 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 24 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 61399 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 0 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 85 ms. Remains 39 /161 variables (removed 122) and now considering 122/324 (removed 202) transitions.
[2024-06-02 23:51:09] [INFO ] Flow matrix only has 118 transitions (discarded 4 similar events)
// Phase 1: matrix 118 rows 39 cols
[2024-06-02 23:51:09] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 23:51:09] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-02 23:51:09] [INFO ] Flow matrix only has 118 transitions (discarded 4 similar events)
[2024-06-02 23:51:09] [INFO ] Invariant cache hit.
[2024-06-02 23:51:09] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-02 23:51:09] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2024-06-02 23:51:09] [INFO ] Redundant transitions in 53 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 23:51:09] [INFO ] Flow matrix only has 116 transitions (discarded 4 similar events)
// Phase 1: matrix 116 rows 39 cols
[2024-06-02 23:51:09] [INFO ] Computed 5 invariants in 4 ms
[2024-06-02 23:51:09] [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 23:51:09] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-06-02 23:51:10] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-06-02 23:51:10] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-06-02 23:51:10] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-06-02 23:51:10] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-06-02 23:51:10] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-06-02 23:51:10] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-06-02 23:51:10] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-06-02 23:51:10] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 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 3526 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 4074 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 7659ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 7660ms
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 3 ms. Remains 37 /39 variables (removed 2) and now considering 118/120 (removed 2) transitions.
[2024-06-02 23:51:17] [INFO ] Flow matrix only has 114 transitions (discarded 4 similar events)
// Phase 1: matrix 114 rows 37 cols
[2024-06-02 23:51:17] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 23:51:17] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-02 23:51:17] [INFO ] Flow matrix only has 114 transitions (discarded 4 similar events)
[2024-06-02 23:51:17] [INFO ] Invariant cache hit.
[2024-06-02 23:51:17] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-02 23:51:17] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 131 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 8156 ms. Remains : 37/161 places, 118/324 transitions.
Stuttering acceptance computed with spot in 49 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 8230 ms.
All properties solved by simple procedures.
Total runtime 483835 ms.

BK_STOP 1717372277562

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="itstools"
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 itstools"
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 r576-smll-171734920100124"
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 ;