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.r496-tall-171640603100307.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 ltsminxred
Input is FunctionPointer-PT-c032, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640603100307
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.7M
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 194K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 4.2M May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME FunctionPointer-PT-c032-LTLCardinality-00
FORMULA_NAME FunctionPointer-PT-c032-LTLCardinality-01
FORMULA_NAME FunctionPointer-PT-c032-LTLCardinality-02
FORMULA_NAME FunctionPointer-PT-c032-LTLCardinality-03
FORMULA_NAME FunctionPointer-PT-c032-LTLCardinality-04
FORMULA_NAME FunctionPointer-PT-c032-LTLCardinality-05
FORMULA_NAME FunctionPointer-PT-c032-LTLCardinality-06
FORMULA_NAME FunctionPointer-PT-c032-LTLCardinality-07
FORMULA_NAME FunctionPointer-PT-c032-LTLCardinality-08
FORMULA_NAME FunctionPointer-PT-c032-LTLCardinality-09
FORMULA_NAME FunctionPointer-PT-c032-LTLCardinality-10
FORMULA_NAME FunctionPointer-PT-c032-LTLCardinality-11
FORMULA_NAME FunctionPointer-PT-c032-LTLCardinality-12
FORMULA_NAME FunctionPointer-PT-c032-LTLCardinality-13
FORMULA_NAME FunctionPointer-PT-c032-LTLCardinality-14
FORMULA_NAME FunctionPointer-PT-c032-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717193609224

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c032
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:13:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 22:13:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:13:30] [INFO ] Load time of PNML (sax parser for PT used): 381 ms
[2024-05-31 22:13:30] [INFO ] Transformed 2826 places.
[2024-05-31 22:13:30] [INFO ] Transformed 8960 transitions.
[2024-05-31 22:13:30] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 566 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 1198 places in 46 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c032-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c032-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c032-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c032-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 1628 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 1611 transition count 5962
Discarding 295 places :
Symmetric choice reduction at 1 with 295 rule applications. Total rules 312 place count 1316 transition count 3732
Iterating global reduction 1 with 295 rules applied. Total rules applied 607 place count 1316 transition count 3732
Ensure Unique test removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 1 with 384 rules applied. Total rules applied 991 place count 1316 transition count 3348
Discarding 150 places :
Symmetric choice reduction at 2 with 150 rule applications. Total rules 1141 place count 1166 transition count 3048
Iterating global reduction 2 with 150 rules applied. Total rules applied 1291 place count 1166 transition count 3048
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 2 with 80 rules applied. Total rules applied 1371 place count 1166 transition count 2968
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1384 place count 1153 transition count 2942
Iterating global reduction 3 with 13 rules applied. Total rules applied 1397 place count 1153 transition count 2942
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1410 place count 1140 transition count 2916
Iterating global reduction 3 with 13 rules applied. Total rules applied 1423 place count 1140 transition count 2916
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1436 place count 1127 transition count 2890
Iterating global reduction 3 with 13 rules applied. Total rules applied 1449 place count 1127 transition count 2890
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1462 place count 1114 transition count 2864
Iterating global reduction 3 with 13 rules applied. Total rules applied 1475 place count 1114 transition count 2864
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1488 place count 1101 transition count 2838
Iterating global reduction 3 with 13 rules applied. Total rules applied 1501 place count 1101 transition count 2838
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1513 place count 1089 transition count 2814
Iterating global reduction 3 with 12 rules applied. Total rules applied 1525 place count 1089 transition count 2814
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1536 place count 1078 transition count 2792
Iterating global reduction 3 with 11 rules applied. Total rules applied 1547 place count 1078 transition count 2792
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 1585 place count 1040 transition count 2652
Iterating global reduction 3 with 38 rules applied. Total rules applied 1623 place count 1040 transition count 2652
Discarding 47 places :
Symmetric choice reduction at 3 with 47 rule applications. Total rules 1670 place count 993 transition count 2464
Iterating global reduction 3 with 47 rules applied. Total rules applied 1717 place count 993 transition count 2464
Discarding 46 places :
Symmetric choice reduction at 3 with 46 rule applications. Total rules 1763 place count 947 transition count 2342
Iterating global reduction 3 with 46 rules applied. Total rules applied 1809 place count 947 transition count 2342
Discarding 46 places :
Symmetric choice reduction at 3 with 46 rule applications. Total rules 1855 place count 901 transition count 2250
Iterating global reduction 3 with 46 rules applied. Total rules applied 1901 place count 901 transition count 2250
Discarding 46 places :
Symmetric choice reduction at 3 with 46 rule applications. Total rules 1947 place count 855 transition count 2158
Iterating global reduction 3 with 46 rules applied. Total rules applied 1993 place count 855 transition count 2158
Discarding 46 places :
Symmetric choice reduction at 3 with 46 rule applications. Total rules 2039 place count 809 transition count 2066
Iterating global reduction 3 with 46 rules applied. Total rules applied 2085 place count 809 transition count 2066
Discarding 45 places :
Symmetric choice reduction at 3 with 45 rule applications. Total rules 2130 place count 764 transition count 1976
Iterating global reduction 3 with 45 rules applied. Total rules applied 2175 place count 764 transition count 1976
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 2190 place count 749 transition count 1946
Iterating global reduction 3 with 15 rules applied. Total rules applied 2205 place count 749 transition count 1946
Applied a total of 2205 rules in 1228 ms. Remains 749 /1628 variables (removed 879) and now considering 1946/5962 (removed 4016) transitions.
[2024-05-31 22:13:32] [INFO ] Flow matrix only has 1310 transitions (discarded 636 similar events)
// Phase 1: matrix 1310 rows 749 cols
[2024-05-31 22:13:32] [INFO ] Computed 2 invariants in 37 ms
[2024-05-31 22:13:33] [INFO ] Implicit Places using invariants in 901 ms returned []
[2024-05-31 22:13:33] [INFO ] Flow matrix only has 1310 transitions (discarded 636 similar events)
[2024-05-31 22:13:33] [INFO ] Invariant cache hit.
[2024-05-31 22:13:33] [INFO ] State equation strengthened by 316 read => feed constraints.
[2024-05-31 22:13:35] [INFO ] Implicit Places using invariants and state equation in 2394 ms returned []
Implicit Place search using SMT with State Equation took 3332 ms to find 0 implicit places.
Running 1944 sub problems to find dead transitions.
[2024-05-31 22:13:35] [INFO ] Flow matrix only has 1310 transitions (discarded 636 similar events)
[2024-05-31 22:13:35] [INFO ] Invariant cache hit.
[2024-05-31 22:13:35] [INFO ] State equation strengthened by 316 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/749 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1944 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/749 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1944 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 749/2059 variables, and 2 constraints, problems are : Problem set: 0 solved, 1944 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/749 constraints, ReadFeed: 0/316 constraints, PredecessorRefiner: 1944/1944 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1944 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/749 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1944 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/749 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1944 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/749 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1944 unsolved
At refinement iteration 3 (OVERLAPS) 1310/2059 variables, 749/751 constraints. Problems are: Problem set: 0 solved, 1944 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2059 variables, 316/1067 constraints. Problems are: Problem set: 0 solved, 1944 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2059/2059 variables, and 3011 constraints, problems are : Problem set: 0 solved, 1944 unsolved in 31917 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 749/749 constraints, ReadFeed: 316/316 constraints, PredecessorRefiner: 1944/1944 constraints, Known Traps: 0/0 constraints]
After SMT, in 71516ms problems are : Problem set: 0 solved, 1944 unsolved
Search for dead transitions found 0 dead transitions in 71554ms
Starting structural reductions in LTL mode, iteration 1 : 749/1628 places, 1946/5962 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 76147 ms. Remains : 749/1628 places, 1946/5962 transitions.
Support contains 21 out of 749 places after structural reductions.
[2024-05-31 22:14:47] [INFO ] Flatten gal took : 131 ms
[2024-05-31 22:14:47] [INFO ] Flatten gal took : 94 ms
[2024-05-31 22:14:47] [INFO ] Input system was already deterministic with 1946 transitions.
RANDOM walk for 40020 steps (8 resets) in 2438 ms. (16 steps per ms) remains 11/17 properties
BEST_FIRST walk for 40004 steps (20 resets) in 134 ms. (296 steps per ms) remains 8/11 properties
BEST_FIRST walk for 40004 steps (15 resets) in 128 ms. (310 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (17 resets) in 85 ms. (465 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (14 resets) in 94 ms. (421 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (10 resets) in 93 ms. (425 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (15 resets) in 101 ms. (392 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (17 resets) in 70 ms. (563 steps per ms) remains 6/6 properties
[2024-05-31 22:14:48] [INFO ] Flow matrix only has 1310 transitions (discarded 636 similar events)
[2024-05-31 22:14:48] [INFO ] Invariant cache hit.
[2024-05-31 22:14:48] [INFO ] State equation strengthened by 316 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 383/389 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/389 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 653/1042 variables, 389/390 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1042 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 366/1408 variables, 14/404 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1408 variables, 230/634 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1408 variables, 0/634 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 538/1946 variables, 245/879 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1946 variables, 1/880 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1946 variables, 86/966 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1946 variables, 0/966 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 111/2057 variables, 99/1065 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2057 variables, 0/1065 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 2/2059 variables, 2/1067 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2059 variables, 0/1067 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/2059 variables, 0/1067 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2059/2059 variables, and 1067 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1308 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 749/749 constraints, ReadFeed: 316/316 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 383/389 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/389 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 653/1042 variables, 389/390 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1042 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 366/1408 variables, 14/404 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1408 variables, 230/634 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1408 variables, 6/640 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1408 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 538/1946 variables, 245/885 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1946 variables, 1/886 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1946 variables, 86/972 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1946 variables, 0/972 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 111/2057 variables, 99/1071 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2057 variables, 0/1071 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 2/2059 variables, 2/1073 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2059 variables, 0/1073 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 0/2059 variables, 0/1073 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2059/2059 variables, and 1073 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1683 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 749/749 constraints, ReadFeed: 316/316 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 3022ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 908 ms.
Support contains 5 out of 749 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 749/749 places, 1946/1946 transitions.
Graph (complete) has 3188 edges and 749 vertex of which 557 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.6 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 557 transition count 1562
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 396 place count 546 transition count 1536
Iterating global reduction 1 with 11 rules applied. Total rules applied 407 place count 546 transition count 1536
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 413 place count 546 transition count 1530
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 424 place count 535 transition count 1502
Iterating global reduction 2 with 11 rules applied. Total rules applied 435 place count 535 transition count 1502
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 445 place count 525 transition count 1472
Iterating global reduction 2 with 10 rules applied. Total rules applied 455 place count 525 transition count 1472
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 467 place count 513 transition count 1434
Iterating global reduction 2 with 12 rules applied. Total rules applied 479 place count 513 transition count 1434
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 491 place count 501 transition count 1402
Iterating global reduction 2 with 12 rules applied. Total rules applied 503 place count 501 transition count 1402
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 514 place count 490 transition count 1380
Iterating global reduction 2 with 11 rules applied. Total rules applied 525 place count 490 transition count 1380
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 536 place count 479 transition count 1358
Iterating global reduction 2 with 11 rules applied. Total rules applied 547 place count 479 transition count 1358
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 557 place count 469 transition count 1336
Iterating global reduction 2 with 10 rules applied. Total rules applied 567 place count 469 transition count 1336
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 575 place count 461 transition count 1318
Iterating global reduction 2 with 8 rules applied. Total rules applied 583 place count 461 transition count 1318
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 588 place count 456 transition count 1308
Iterating global reduction 2 with 5 rules applied. Total rules applied 593 place count 456 transition count 1308
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 594 place count 455 transition count 1306
Iterating global reduction 2 with 1 rules applied. Total rules applied 595 place count 455 transition count 1306
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 596 place count 454 transition count 1304
Iterating global reduction 2 with 1 rules applied. Total rules applied 597 place count 454 transition count 1304
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 598 place count 453 transition count 1302
Iterating global reduction 2 with 1 rules applied. Total rules applied 599 place count 453 transition count 1302
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 600 place count 452 transition count 1300
Iterating global reduction 2 with 1 rules applied. Total rules applied 601 place count 452 transition count 1300
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 613 place count 452 transition count 1288
Applied a total of 613 rules in 420 ms. Remains 452 /749 variables (removed 297) and now considering 1288/1946 (removed 658) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 421 ms. Remains : 452/749 places, 1288/1946 transitions.
RANDOM walk for 40002 steps (8 resets) in 245 ms. (162 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 2/2 properties
[2024-05-31 22:14:53] [INFO ] Flow matrix only has 739 transitions (discarded 549 similar events)
// Phase 1: matrix 739 rows 452 cols
[2024-05-31 22:14:53] [INFO ] Computed 3 invariants in 5 ms
[2024-05-31 22:14:53] [INFO ] State equation strengthened by 87 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 19/26 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 386/412 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/412 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/412 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 15/427 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/427 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/427 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 631/1058 variables, 357/383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1058 variables, 86/469 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1058 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 62/1120 variables, 1/470 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1120 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 71/1191 variables, 72/542 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1191 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1191 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1191/1191 variables, and 542 constraints, problems are : Problem set: 0 solved, 2 unsolved in 369 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 452/452 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 19/26 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 386/412 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/412 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/412 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/412 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 15/427 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/427 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/427 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 631/1058 variables, 357/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1058 variables, 86/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1058 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 62/1120 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1120 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 71/1191 variables, 72/544 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1191 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/1191 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1191/1191 variables, and 544 constraints, problems are : Problem set: 0 solved, 2 unsolved in 453 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 452/452 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 847ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 452 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 452/452 places, 1288/1288 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 449 transition count 1280
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 449 transition count 1280
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 446 transition count 1272
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 446 transition count 1272
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 443 transition count 1264
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 443 transition count 1264
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 440 transition count 1258
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 440 transition count 1258
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 437 transition count 1252
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 437 transition count 1252
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 434 transition count 1246
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 434 transition count 1246
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 431 transition count 1240
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 431 transition count 1240
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 429 transition count 1236
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 429 transition count 1236
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 428 transition count 1234
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 428 transition count 1234
Applied a total of 48 rules in 188 ms. Remains 428 /452 variables (removed 24) and now considering 1234/1288 (removed 54) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 188 ms. Remains : 428/452 places, 1234/1288 transitions.
RANDOM walk for 40005 steps (8 resets) in 167 ms. (238 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
[2024-05-31 22:14:54] [INFO ] Flow matrix only has 700 transitions (discarded 534 similar events)
// Phase 1: matrix 700 rows 428 cols
[2024-05-31 22:14:54] [INFO ] Computed 3 invariants in 4 ms
[2024-05-31 22:14:54] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/21 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 360/381 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/381 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/381 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 9/390 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/390 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/390 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 610/1000 variables, 342/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1000 variables, 77/441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/1000 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 62/1062 variables, 1/442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1062 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 66/1128 variables, 67/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1128 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1128 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1128/1128 variables, and 509 constraints, problems are : Problem set: 0 solved, 1 unsolved in 263 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 428/428 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/21 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 360/381 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/381 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/381 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/381 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/390 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/390 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 610/1000 variables, 342/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1000 variables, 77/442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1000 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 62/1062 variables, 1/443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1062 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 66/1128 variables, 67/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1128 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1128 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1128/1128 variables, and 510 constraints, problems are : Problem set: 0 solved, 1 unsolved in 273 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 428/428 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 553ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 1234/1234 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 427 transition count 1230
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 427 transition count 1230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 426 transition count 1228
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 426 transition count 1228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 425 transition count 1226
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 425 transition count 1226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 424 transition count 1224
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 424 transition count 1224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 423 transition count 1222
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 423 transition count 1222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 422 transition count 1220
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 422 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 421 transition count 1218
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 421 transition count 1218
Applied a total of 14 rules in 105 ms. Remains 421 /428 variables (removed 7) and now considering 1218/1234 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 421/428 places, 1218/1234 transitions.
RANDOM walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 668877 steps, run timeout after 3001 ms. (steps per millisecond=222 ) properties seen :0 out of 1
Probabilistic random walk after 668877 steps, saw 410097 distinct states, run finished after 3005 ms. (steps per millisecond=222 ) properties seen :0
[2024-05-31 22:14:58] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
// Phase 1: matrix 688 rows 421 cols
[2024-05-31 22:14:58] [INFO ] Computed 3 invariants in 7 ms
[2024-05-31 22:14:58] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/19 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 352/371 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/378 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/378 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 604/982 variables, 337/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/982 variables, 74/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/982 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 62/1044 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1044 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (OVERLAPS) 65/1109 variables, 66/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1109 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1109 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1109/1109 variables, and 499 constraints, problems are : Problem set: 0 solved, 1 unsolved in 263 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 421/421 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/19 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 352/371 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/378 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 604/982 variables, 337/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/982 variables, 74/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/982 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 62/1044 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1044 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 65/1109 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1109 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1109 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1109/1109 variables, and 500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 269 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 421/421 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 550ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 50 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 421/421 places, 1218/1218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 44 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2024-05-31 22:14:58] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 22:14:58] [INFO ] Invariant cache hit.
[2024-05-31 22:14:59] [INFO ] Implicit Places using invariants in 291 ms returned []
[2024-05-31 22:14:59] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 22:14:59] [INFO ] Invariant cache hit.
[2024-05-31 22:14:59] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 22:15:00] [INFO ] Implicit Places using invariants and state equation in 1315 ms returned []
Implicit Place search using SMT with State Equation took 1612 ms to find 0 implicit places.
[2024-05-31 22:15:00] [INFO ] Redundant transitions in 79 ms returned []
Running 1216 sub problems to find dead transitions.
[2024-05-31 22:15:00] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 22:15:00] [INFO ] Invariant cache hit.
[2024-05-31 22:15:00] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
[2024-05-31 22:15:17] [INFO ] Deduced a trap composed of 131 places in 141 ms of which 16 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 3 (OVERLAPS) 688/1109 variables, 421/425 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
SMT process timed out in 34010ms, After SMT, problems are : Problem set: 0 solved, 1216 unsolved
Search for dead transitions found 0 dead transitions in 34025ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35779 ms. Remains : 421/421 places, 1218/1218 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 530 transitions
Reduce isomorphic transitions removed 530 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 540 rules applied. Total rules applied 540 place count 421 transition count 678
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 550 place count 411 transition count 678
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 550 place count 411 transition count 605
Deduced a syphon composed of 73 places in 1 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 696 place count 338 transition count 605
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 254 rules applied. Total rules applied 950 place count 211 transition count 478
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1014 place count 147 transition count 350
Iterating global reduction 2 with 64 rules applied. Total rules applied 1078 place count 147 transition count 350
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1079 place count 147 transition count 349
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1142 place count 84 transition count 223
Iterating global reduction 3 with 63 rules applied. Total rules applied 1205 place count 84 transition count 223
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1268 place count 21 transition count 97
Iterating global reduction 3 with 63 rules applied. Total rules applied 1331 place count 21 transition count 97
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1394 place count 21 transition count 34
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1394 place count 21 transition count 33
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1396 place count 20 transition count 33
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 4 with 2 rules applied. Total rules applied 1398 place count 19 transition count 32
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1399 place count 19 transition count 31
Applied a total of 1399 rules in 74 ms. Remains 19 /421 variables (removed 402) and now considering 31/1218 (removed 1187) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 31 rows 19 cols
[2024-05-31 22:15:34] [INFO ] Computed 3 invariants in 0 ms
[2024-05-31 22:15:34] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 22:15:34] [INFO ] After 13ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-31 22:15:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 22:15:34] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 22:15:34] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 22:15:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-31 22:15:34] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 22:15:34] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 22:15:34] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 22:15:34] [INFO ] After 42ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 181 ms.
FORMULA FunctionPointer-PT-c032-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA FunctionPointer-PT-c032-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 192 stabilizing places and 512 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&&X(F(p1))) U X((G(p2)||G(p3)))))'
Support contains 4 out of 749 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 749/749 places, 1946/1946 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 737 transition count 1914
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 737 transition count 1914
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 28 place count 737 transition count 1910
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 40 place count 725 transition count 1876
Iterating global reduction 1 with 12 rules applied. Total rules applied 52 place count 725 transition count 1876
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 63 place count 714 transition count 1844
Iterating global reduction 1 with 11 rules applied. Total rules applied 74 place count 714 transition count 1844
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 86 place count 702 transition count 1810
Iterating global reduction 1 with 12 rules applied. Total rules applied 98 place count 702 transition count 1810
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 110 place count 690 transition count 1782
Iterating global reduction 1 with 12 rules applied. Total rules applied 122 place count 690 transition count 1782
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 133 place count 679 transition count 1760
Iterating global reduction 1 with 11 rules applied. Total rules applied 144 place count 679 transition count 1760
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 155 place count 668 transition count 1738
Iterating global reduction 1 with 11 rules applied. Total rules applied 166 place count 668 transition count 1738
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 175 place count 659 transition count 1716
Iterating global reduction 1 with 9 rules applied. Total rules applied 184 place count 659 transition count 1716
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 191 place count 652 transition count 1698
Iterating global reduction 1 with 7 rules applied. Total rules applied 198 place count 652 transition count 1698
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 202 place count 648 transition count 1690
Iterating global reduction 1 with 4 rules applied. Total rules applied 206 place count 648 transition count 1690
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 208 place count 646 transition count 1686
Iterating global reduction 1 with 2 rules applied. Total rules applied 210 place count 646 transition count 1686
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 212 place count 644 transition count 1682
Iterating global reduction 1 with 2 rules applied. Total rules applied 214 place count 644 transition count 1682
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 216 place count 642 transition count 1678
Iterating global reduction 1 with 2 rules applied. Total rules applied 218 place count 642 transition count 1678
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 220 place count 640 transition count 1674
Iterating global reduction 1 with 2 rules applied. Total rules applied 222 place count 640 transition count 1674
Applied a total of 222 rules in 252 ms. Remains 640 /749 variables (removed 109) and now considering 1674/1946 (removed 272) transitions.
[2024-05-31 22:15:35] [INFO ] Flow matrix only has 1118 transitions (discarded 556 similar events)
// Phase 1: matrix 1118 rows 640 cols
[2024-05-31 22:15:35] [INFO ] Computed 2 invariants in 6 ms
[2024-05-31 22:15:35] [INFO ] Implicit Places using invariants in 435 ms returned []
[2024-05-31 22:15:35] [INFO ] Flow matrix only has 1118 transitions (discarded 556 similar events)
[2024-05-31 22:15:35] [INFO ] Invariant cache hit.
[2024-05-31 22:15:36] [INFO ] State equation strengthened by 274 read => feed constraints.
[2024-05-31 22:15:37] [INFO ] Implicit Places using invariants and state equation in 1956 ms returned []
Implicit Place search using SMT with State Equation took 2398 ms to find 0 implicit places.
Running 1672 sub problems to find dead transitions.
[2024-05-31 22:15:37] [INFO ] Flow matrix only has 1118 transitions (discarded 556 similar events)
[2024-05-31 22:15:37] [INFO ] Invariant cache hit.
[2024-05-31 22:15:37] [INFO ] State equation strengthened by 274 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/640 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1672 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/640 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1672 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 640/1758 variables, and 2 constraints, problems are : Problem set: 0 solved, 1672 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/640 constraints, ReadFeed: 0/274 constraints, PredecessorRefiner: 1672/1672 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1672 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/640 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1672 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/640 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1672 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/640 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1672 unsolved
At refinement iteration 3 (OVERLAPS) 1118/1758 variables, 640/642 constraints. Problems are: Problem set: 0 solved, 1672 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1758 variables, 274/916 constraints. Problems are: Problem set: 0 solved, 1672 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1758/1758 variables, and 2588 constraints, problems are : Problem set: 0 solved, 1672 unsolved in 31504 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 640/640 constraints, ReadFeed: 274/274 constraints, PredecessorRefiner: 1672/1672 constraints, Known Traps: 0/0 constraints]
After SMT, in 69478ms problems are : Problem set: 0 solved, 1672 unsolved
Search for dead transitions found 0 dead transitions in 69495ms
Starting structural reductions in LTL mode, iteration 1 : 640/749 places, 1674/1946 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72149 ms. Remains : 640/749 places, 1674/1946 transitions.
Stuttering acceptance computed with spot in 441 ms :[(AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), true, (NOT p2), (NOT p3), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FunctionPointer-PT-c032-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 13658 steps with 99 reset in 137 ms.
FORMULA FunctionPointer-PT-c032-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c032-LTLCardinality-00 finished in 72807 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 2 out of 749 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 749/749 places, 1946/1946 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 734 transition count 1908
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 734 transition count 1908
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 34 place count 734 transition count 1904
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 49 place count 719 transition count 1860
Iterating global reduction 1 with 15 rules applied. Total rules applied 64 place count 719 transition count 1860
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 78 place count 705 transition count 1816
Iterating global reduction 1 with 14 rules applied. Total rules applied 92 place count 705 transition count 1816
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 108 place count 689 transition count 1770
Iterating global reduction 1 with 16 rules applied. Total rules applied 124 place count 689 transition count 1770
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 140 place count 673 transition count 1732
Iterating global reduction 1 with 16 rules applied. Total rules applied 156 place count 673 transition count 1732
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 171 place count 658 transition count 1702
Iterating global reduction 1 with 15 rules applied. Total rules applied 186 place count 658 transition count 1702
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 201 place count 643 transition count 1672
Iterating global reduction 1 with 15 rules applied. Total rules applied 216 place count 643 transition count 1672
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 228 place count 631 transition count 1646
Iterating global reduction 1 with 12 rules applied. Total rules applied 240 place count 631 transition count 1646
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 248 place count 623 transition count 1628
Iterating global reduction 1 with 8 rules applied. Total rules applied 256 place count 623 transition count 1628
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 260 place count 619 transition count 1620
Iterating global reduction 1 with 4 rules applied. Total rules applied 264 place count 619 transition count 1620
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 265 place count 618 transition count 1618
Iterating global reduction 1 with 1 rules applied. Total rules applied 266 place count 618 transition count 1618
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 267 place count 617 transition count 1616
Iterating global reduction 1 with 1 rules applied. Total rules applied 268 place count 617 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 269 place count 616 transition count 1614
Iterating global reduction 1 with 1 rules applied. Total rules applied 270 place count 616 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 271 place count 615 transition count 1612
Iterating global reduction 1 with 1 rules applied. Total rules applied 272 place count 615 transition count 1612
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 276 place count 615 transition count 1608
Applied a total of 276 rules in 604 ms. Remains 615 /749 variables (removed 134) and now considering 1608/1946 (removed 338) transitions.
[2024-05-31 22:16:48] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 615 cols
[2024-05-31 22:16:48] [INFO ] Computed 2 invariants in 7 ms
[2024-05-31 22:16:48] [INFO ] Implicit Places using invariants in 563 ms returned []
[2024-05-31 22:16:48] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-31 22:16:48] [INFO ] Invariant cache hit.
[2024-05-31 22:16:49] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-31 22:16:51] [INFO ] Implicit Places using invariants and state equation in 2439 ms returned []
Implicit Place search using SMT with State Equation took 3014 ms to find 0 implicit places.
[2024-05-31 22:16:51] [INFO ] Redundant transitions in 36 ms returned []
Running 1606 sub problems to find dead transitions.
[2024-05-31 22:16:51] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-31 22:16:51] [INFO ] Invariant cache hit.
[2024-05-31 22:16:51] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 615/1688 variables, and 2 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/615 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1606 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/615 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 3 (OVERLAPS) 1073/1688 variables, 615/617 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1688 variables, 265/882 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1688/1688 variables, and 2488 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 31105 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
After SMT, in 68271ms problems are : Problem set: 0 solved, 1606 unsolved
Search for dead transitions found 0 dead transitions in 68289ms
Starting structural reductions in SI_LTL mode, iteration 1 : 615/749 places, 1608/1946 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71959 ms. Remains : 615/749 places, 1608/1946 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c032-LTLCardinality-01
Product exploration explored 100000 steps with 18 reset in 738 ms.
Product exploration explored 100000 steps with 0 reset in 765 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 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 31 ms :[(NOT p0)]
RANDOM walk for 40028 steps (8 resets) in 76 ms. (519 steps per ms) remains 1/1 properties
BEST_FIRST walk for 37871 steps (16 resets) in 69 ms. (541 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 90 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 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Support contains 2 out of 615 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 615/615 places, 1608/1608 transitions.
Applied a total of 0 rules in 83 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
[2024-05-31 22:18:01] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-31 22:18:01] [INFO ] Invariant cache hit.
[2024-05-31 22:18:02] [INFO ] Implicit Places using invariants in 526 ms returned []
[2024-05-31 22:18:02] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-31 22:18:02] [INFO ] Invariant cache hit.
[2024-05-31 22:18:02] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-31 22:18:04] [INFO ] Implicit Places using invariants and state equation in 2427 ms returned []
Implicit Place search using SMT with State Equation took 2955 ms to find 0 implicit places.
[2024-05-31 22:18:04] [INFO ] Redundant transitions in 28 ms returned []
Running 1606 sub problems to find dead transitions.
[2024-05-31 22:18:04] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-31 22:18:04] [INFO ] Invariant cache hit.
[2024-05-31 22:18:04] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 615/1688 variables, and 2 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/615 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1606 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/615 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 3 (OVERLAPS) 1073/1688 variables, 615/617 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1688 variables, 265/882 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1688/1688 variables, and 2488 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 31111 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
After SMT, in 68455ms problems are : Problem set: 0 solved, 1606 unsolved
Search for dead transitions found 0 dead transitions in 68470ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 71545 ms. Remains : 615/615 places, 1608/1608 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 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 28 ms :[(NOT p0)]
RANDOM walk for 40029 steps (8 resets) in 160 ms. (248 steps per ms) remains 1/1 properties
BEST_FIRST walk for 21397 steps (10 resets) in 28 ms. (737 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 83 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 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 87 reset in 629 ms.
Product exploration explored 100000 steps with 72 reset in 643 ms.
Support contains 2 out of 615 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 615/615 places, 1608/1608 transitions.
Applied a total of 0 rules in 75 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
[2024-05-31 22:19:14] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-31 22:19:14] [INFO ] Invariant cache hit.
[2024-05-31 22:19:15] [INFO ] Implicit Places using invariants in 427 ms returned []
[2024-05-31 22:19:15] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-31 22:19:15] [INFO ] Invariant cache hit.
[2024-05-31 22:19:15] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-31 22:19:17] [INFO ] Implicit Places using invariants and state equation in 2343 ms returned []
Implicit Place search using SMT with State Equation took 2776 ms to find 0 implicit places.
[2024-05-31 22:19:17] [INFO ] Redundant transitions in 31 ms returned []
Running 1606 sub problems to find dead transitions.
[2024-05-31 22:19:17] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-31 22:19:17] [INFO ] Invariant cache hit.
[2024-05-31 22:19:17] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 615/1688 variables, and 2 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/615 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1606 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/615 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 3 (OVERLAPS) 1073/1688 variables, 615/617 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1688 variables, 265/882 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1688/1688 variables, and 2488 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 31122 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
After SMT, in 68830ms problems are : Problem set: 0 solved, 1606 unsolved
Search for dead transitions found 0 dead transitions in 68843ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 71731 ms. Remains : 615/615 places, 1608/1608 transitions.
Treatment of property FunctionPointer-PT-c032-LTLCardinality-01 finished in 219045 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)))'
Support contains 1 out of 749 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 749/749 places, 1946/1946 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 733 transition count 1906
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 733 transition count 1906
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 38 place count 733 transition count 1900
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 54 place count 717 transition count 1854
Iterating global reduction 1 with 16 rules applied. Total rules applied 70 place count 717 transition count 1854
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 85 place count 702 transition count 1808
Iterating global reduction 1 with 15 rules applied. Total rules applied 100 place count 702 transition count 1808
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 117 place count 685 transition count 1758
Iterating global reduction 1 with 17 rules applied. Total rules applied 134 place count 685 transition count 1758
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 151 place count 668 transition count 1716
Iterating global reduction 1 with 17 rules applied. Total rules applied 168 place count 668 transition count 1716
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 184 place count 652 transition count 1684
Iterating global reduction 1 with 16 rules applied. Total rules applied 200 place count 652 transition count 1684
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 216 place count 636 transition count 1652
Iterating global reduction 1 with 16 rules applied. Total rules applied 232 place count 636 transition count 1652
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 245 place count 623 transition count 1624
Iterating global reduction 1 with 13 rules applied. Total rules applied 258 place count 623 transition count 1624
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 267 place count 614 transition count 1604
Iterating global reduction 1 with 9 rules applied. Total rules applied 276 place count 614 transition count 1604
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 281 place count 609 transition count 1594
Iterating global reduction 1 with 5 rules applied. Total rules applied 286 place count 609 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 287 place count 608 transition count 1592
Iterating global reduction 1 with 1 rules applied. Total rules applied 288 place count 608 transition count 1592
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 289 place count 607 transition count 1590
Iterating global reduction 1 with 1 rules applied. Total rules applied 290 place count 607 transition count 1590
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 291 place count 606 transition count 1588
Iterating global reduction 1 with 1 rules applied. Total rules applied 292 place count 606 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 293 place count 605 transition count 1586
Iterating global reduction 1 with 1 rules applied. Total rules applied 294 place count 605 transition count 1586
Applied a total of 294 rules in 224 ms. Remains 605 /749 variables (removed 144) and now considering 1586/1946 (removed 360) transitions.
[2024-05-31 22:20:27] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
// Phase 1: matrix 1058 rows 605 cols
[2024-05-31 22:20:27] [INFO ] Computed 2 invariants in 5 ms
[2024-05-31 22:20:27] [INFO ] Implicit Places using invariants in 466 ms returned []
[2024-05-31 22:20:27] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2024-05-31 22:20:27] [INFO ] Invariant cache hit.
[2024-05-31 22:20:27] [INFO ] State equation strengthened by 262 read => feed constraints.
[2024-05-31 22:20:29] [INFO ] Implicit Places using invariants and state equation in 1937 ms returned []
Implicit Place search using SMT with State Equation took 2406 ms to find 0 implicit places.
Running 1584 sub problems to find dead transitions.
[2024-05-31 22:20:29] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2024-05-31 22:20:29] [INFO ] Invariant cache hit.
[2024-05-31 22:20:29] [INFO ] State equation strengthened by 262 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 605/1663 variables, and 2 constraints, problems are : Problem set: 0 solved, 1584 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/605 constraints, ReadFeed: 0/262 constraints, PredecessorRefiner: 1584/1584 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1584 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/605 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 3 (OVERLAPS) 1058/1663 variables, 605/607 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1663 variables, 262/869 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1663/1663 variables, and 2453 constraints, problems are : Problem set: 0 solved, 1584 unsolved in 30615 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 605/605 constraints, ReadFeed: 262/262 constraints, PredecessorRefiner: 1584/1584 constraints, Known Traps: 0/0 constraints]
After SMT, in 67442ms problems are : Problem set: 0 solved, 1584 unsolved
Search for dead transitions found 0 dead transitions in 67457ms
Starting structural reductions in LTL mode, iteration 1 : 605/749 places, 1586/1946 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70093 ms. Remains : 605/749 places, 1586/1946 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c032-LTLCardinality-02
Stuttering criterion allowed to conclude after 104 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-c032-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c032-LTLCardinality-02 finished in 70199 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 749 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 749/749 places, 1946/1946 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 734 transition count 1910
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 734 transition count 1910
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 36 place count 734 transition count 1904
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 51 place count 719 transition count 1862
Iterating global reduction 1 with 15 rules applied. Total rules applied 66 place count 719 transition count 1862
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 80 place count 705 transition count 1818
Iterating global reduction 1 with 14 rules applied. Total rules applied 94 place count 705 transition count 1818
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 110 place count 689 transition count 1770
Iterating global reduction 1 with 16 rules applied. Total rules applied 126 place count 689 transition count 1770
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 142 place count 673 transition count 1730
Iterating global reduction 1 with 16 rules applied. Total rules applied 158 place count 673 transition count 1730
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 173 place count 658 transition count 1700
Iterating global reduction 1 with 15 rules applied. Total rules applied 188 place count 658 transition count 1700
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 203 place count 643 transition count 1670
Iterating global reduction 1 with 15 rules applied. Total rules applied 218 place count 643 transition count 1670
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 231 place count 630 transition count 1642
Iterating global reduction 1 with 13 rules applied. Total rules applied 244 place count 630 transition count 1642
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 253 place count 621 transition count 1622
Iterating global reduction 1 with 9 rules applied. Total rules applied 262 place count 621 transition count 1622
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 267 place count 616 transition count 1612
Iterating global reduction 1 with 5 rules applied. Total rules applied 272 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 273 place count 615 transition count 1610
Iterating global reduction 1 with 1 rules applied. Total rules applied 274 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 275 place count 614 transition count 1608
Iterating global reduction 1 with 1 rules applied. Total rules applied 276 place count 614 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 277 place count 613 transition count 1606
Iterating global reduction 1 with 1 rules applied. Total rules applied 278 place count 613 transition count 1606
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 279 place count 612 transition count 1604
Iterating global reduction 1 with 1 rules applied. Total rules applied 280 place count 612 transition count 1604
Applied a total of 280 rules in 243 ms. Remains 612 /749 variables (removed 137) and now considering 1604/1946 (removed 342) transitions.
[2024-05-31 22:21:37] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 612 cols
[2024-05-31 22:21:37] [INFO ] Computed 2 invariants in 4 ms
[2024-05-31 22:21:37] [INFO ] Implicit Places using invariants in 404 ms returned []
[2024-05-31 22:21:37] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-31 22:21:37] [INFO ] Invariant cache hit.
[2024-05-31 22:21:37] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-31 22:21:39] [INFO ] Implicit Places using invariants and state equation in 1814 ms returned []
Implicit Place search using SMT with State Equation took 2221 ms to find 0 implicit places.
Running 1602 sub problems to find dead transitions.
[2024-05-31 22:21:39] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-31 22:21:39] [INFO ] Invariant cache hit.
[2024-05-31 22:21:39] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/612 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/612 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 612/1683 variables, and 2 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/612 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1602 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/612 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/612 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/612 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 3 (OVERLAPS) 1071/1683 variables, 612/614 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1683 variables, 265/879 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1683/1683 variables, and 2481 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 31195 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 612/612 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
After SMT, in 68228ms problems are : Problem set: 0 solved, 1602 unsolved
Search for dead transitions found 0 dead transitions in 68242ms
Starting structural reductions in LTL mode, iteration 1 : 612/749 places, 1604/1946 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70713 ms. Remains : 612/749 places, 1604/1946 transitions.
Stuttering acceptance computed with spot in 141 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c032-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-c032-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c032-LTLCardinality-03 finished in 70881 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)))'
Support contains 1 out of 749 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 749/749 places, 1946/1946 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 733 transition count 1906
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 733 transition count 1906
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 38 place count 733 transition count 1900
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 54 place count 717 transition count 1854
Iterating global reduction 1 with 16 rules applied. Total rules applied 70 place count 717 transition count 1854
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 85 place count 702 transition count 1808
Iterating global reduction 1 with 15 rules applied. Total rules applied 100 place count 702 transition count 1808
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 117 place count 685 transition count 1758
Iterating global reduction 1 with 17 rules applied. Total rules applied 134 place count 685 transition count 1758
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 151 place count 668 transition count 1716
Iterating global reduction 1 with 17 rules applied. Total rules applied 168 place count 668 transition count 1716
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 184 place count 652 transition count 1684
Iterating global reduction 1 with 16 rules applied. Total rules applied 200 place count 652 transition count 1684
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 216 place count 636 transition count 1652
Iterating global reduction 1 with 16 rules applied. Total rules applied 232 place count 636 transition count 1652
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 245 place count 623 transition count 1624
Iterating global reduction 1 with 13 rules applied. Total rules applied 258 place count 623 transition count 1624
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 267 place count 614 transition count 1604
Iterating global reduction 1 with 9 rules applied. Total rules applied 276 place count 614 transition count 1604
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 281 place count 609 transition count 1594
Iterating global reduction 1 with 5 rules applied. Total rules applied 286 place count 609 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 287 place count 608 transition count 1592
Iterating global reduction 1 with 1 rules applied. Total rules applied 288 place count 608 transition count 1592
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 289 place count 607 transition count 1590
Iterating global reduction 1 with 1 rules applied. Total rules applied 290 place count 607 transition count 1590
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 291 place count 606 transition count 1588
Iterating global reduction 1 with 1 rules applied. Total rules applied 292 place count 606 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 293 place count 605 transition count 1586
Iterating global reduction 1 with 1 rules applied. Total rules applied 294 place count 605 transition count 1586
Applied a total of 294 rules in 230 ms. Remains 605 /749 variables (removed 144) and now considering 1586/1946 (removed 360) transitions.
[2024-05-31 22:22:48] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
// Phase 1: matrix 1058 rows 605 cols
[2024-05-31 22:22:48] [INFO ] Computed 2 invariants in 12 ms
[2024-05-31 22:22:48] [INFO ] Implicit Places using invariants in 441 ms returned []
[2024-05-31 22:22:48] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2024-05-31 22:22:48] [INFO ] Invariant cache hit.
[2024-05-31 22:22:48] [INFO ] State equation strengthened by 262 read => feed constraints.
[2024-05-31 22:22:50] [INFO ] Implicit Places using invariants and state equation in 2034 ms returned []
Implicit Place search using SMT with State Equation took 2480 ms to find 0 implicit places.
Running 1584 sub problems to find dead transitions.
[2024-05-31 22:22:50] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2024-05-31 22:22:50] [INFO ] Invariant cache hit.
[2024-05-31 22:22:50] [INFO ] State equation strengthened by 262 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/605 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 3 (OVERLAPS) 1058/1663 variables, 605/607 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
SMT process timed out in 37172ms, After SMT, problems are : Problem set: 0 solved, 1584 unsolved
Search for dead transitions found 0 dead transitions in 37185ms
Starting structural reductions in LTL mode, iteration 1 : 605/749 places, 1586/1946 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39901 ms. Remains : 605/749 places, 1586/1946 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c032-LTLCardinality-07
Stuttering criterion allowed to conclude after 58 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-c032-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c032-LTLCardinality-07 finished in 40009 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 749 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 749/749 places, 1946/1946 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 734 transition count 1910
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 734 transition count 1910
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 36 place count 734 transition count 1904
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 51 place count 719 transition count 1862
Iterating global reduction 1 with 15 rules applied. Total rules applied 66 place count 719 transition count 1862
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 80 place count 705 transition count 1818
Iterating global reduction 1 with 14 rules applied. Total rules applied 94 place count 705 transition count 1818
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 110 place count 689 transition count 1770
Iterating global reduction 1 with 16 rules applied. Total rules applied 126 place count 689 transition count 1770
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 142 place count 673 transition count 1730
Iterating global reduction 1 with 16 rules applied. Total rules applied 158 place count 673 transition count 1730
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 173 place count 658 transition count 1700
Iterating global reduction 1 with 15 rules applied. Total rules applied 188 place count 658 transition count 1700
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 203 place count 643 transition count 1670
Iterating global reduction 1 with 15 rules applied. Total rules applied 218 place count 643 transition count 1670
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 231 place count 630 transition count 1642
Iterating global reduction 1 with 13 rules applied. Total rules applied 244 place count 630 transition count 1642
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 253 place count 621 transition count 1622
Iterating global reduction 1 with 9 rules applied. Total rules applied 262 place count 621 transition count 1622
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 267 place count 616 transition count 1612
Iterating global reduction 1 with 5 rules applied. Total rules applied 272 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 273 place count 615 transition count 1610
Iterating global reduction 1 with 1 rules applied. Total rules applied 274 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 275 place count 614 transition count 1608
Iterating global reduction 1 with 1 rules applied. Total rules applied 276 place count 614 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 277 place count 613 transition count 1606
Iterating global reduction 1 with 1 rules applied. Total rules applied 278 place count 613 transition count 1606
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 279 place count 612 transition count 1604
Iterating global reduction 1 with 1 rules applied. Total rules applied 280 place count 612 transition count 1604
Applied a total of 280 rules in 228 ms. Remains 612 /749 variables (removed 137) and now considering 1604/1946 (removed 342) transitions.
[2024-05-31 22:23:28] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 612 cols
[2024-05-31 22:23:28] [INFO ] Computed 2 invariants in 10 ms
[2024-05-31 22:23:28] [INFO ] Implicit Places using invariants in 400 ms returned []
[2024-05-31 22:23:28] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-31 22:23:28] [INFO ] Invariant cache hit.
[2024-05-31 22:23:28] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-31 22:23:30] [INFO ] Implicit Places using invariants and state equation in 1757 ms returned []
Implicit Place search using SMT with State Equation took 2160 ms to find 0 implicit places.
Running 1602 sub problems to find dead transitions.
[2024-05-31 22:23:30] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-31 22:23:30] [INFO ] Invariant cache hit.
[2024-05-31 22:23:30] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/612 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/612 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/612 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1683/1683 variables, and 614 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 612/612 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1602 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/612 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/612 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/612 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 3 (OVERLAPS) 1071/1683 variables, 612/614 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1683 variables, 265/879 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1683/1683 variables, and 2481 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 31502 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 612/612 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
After SMT, in 68787ms problems are : Problem set: 0 solved, 1602 unsolved
Search for dead transitions found 0 dead transitions in 68800ms
Starting structural reductions in LTL mode, iteration 1 : 612/749 places, 1604/1946 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71192 ms. Remains : 612/749 places, 1604/1946 transitions.
Stuttering acceptance computed with spot in 154 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c032-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 16213 steps with 111 reset in 87 ms.
FORMULA FunctionPointer-PT-c032-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c032-LTLCardinality-08 finished in 71452 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)||G(p1))))'
Support contains 3 out of 749 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 749/749 places, 1946/1946 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 735 transition count 1912
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 735 transition count 1912
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 36 place count 735 transition count 1904
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 50 place count 721 transition count 1862
Iterating global reduction 1 with 14 rules applied. Total rules applied 64 place count 721 transition count 1862
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 77 place count 708 transition count 1822
Iterating global reduction 1 with 13 rules applied. Total rules applied 90 place count 708 transition count 1822
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 105 place count 693 transition count 1778
Iterating global reduction 1 with 15 rules applied. Total rules applied 120 place count 693 transition count 1778
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 135 place count 678 transition count 1740
Iterating global reduction 1 with 15 rules applied. Total rules applied 150 place count 678 transition count 1740
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 165 place count 663 transition count 1710
Iterating global reduction 1 with 15 rules applied. Total rules applied 180 place count 663 transition count 1710
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 195 place count 648 transition count 1680
Iterating global reduction 1 with 15 rules applied. Total rules applied 210 place count 648 transition count 1680
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 222 place count 636 transition count 1654
Iterating global reduction 1 with 12 rules applied. Total rules applied 234 place count 636 transition count 1654
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 242 place count 628 transition count 1636
Iterating global reduction 1 with 8 rules applied. Total rules applied 250 place count 628 transition count 1636
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 255 place count 623 transition count 1626
Iterating global reduction 1 with 5 rules applied. Total rules applied 260 place count 623 transition count 1626
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 261 place count 622 transition count 1624
Iterating global reduction 1 with 1 rules applied. Total rules applied 262 place count 622 transition count 1624
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 263 place count 621 transition count 1622
Iterating global reduction 1 with 1 rules applied. Total rules applied 264 place count 621 transition count 1622
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 265 place count 620 transition count 1620
Iterating global reduction 1 with 1 rules applied. Total rules applied 266 place count 620 transition count 1620
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 267 place count 619 transition count 1618
Iterating global reduction 1 with 1 rules applied. Total rules applied 268 place count 619 transition count 1618
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 272 place count 619 transition count 1614
Applied a total of 272 rules in 394 ms. Remains 619 /749 variables (removed 130) and now considering 1614/1946 (removed 332) transitions.
[2024-05-31 22:24:39] [INFO ] Flow matrix only has 1080 transitions (discarded 534 similar events)
// Phase 1: matrix 1080 rows 619 cols
[2024-05-31 22:24:39] [INFO ] Computed 2 invariants in 16 ms
[2024-05-31 22:24:40] [INFO ] Implicit Places using invariants in 424 ms returned []
[2024-05-31 22:24:40] [INFO ] Flow matrix only has 1080 transitions (discarded 534 similar events)
[2024-05-31 22:24:40] [INFO ] Invariant cache hit.
[2024-05-31 22:24:40] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-31 22:24:42] [INFO ] Implicit Places using invariants and state equation in 2144 ms returned []
Implicit Place search using SMT with State Equation took 2569 ms to find 0 implicit places.
[2024-05-31 22:24:42] [INFO ] Redundant transitions in 29 ms returned []
Running 1612 sub problems to find dead transitions.
[2024-05-31 22:24:42] [INFO ] Flow matrix only has 1080 transitions (discarded 534 similar events)
[2024-05-31 22:24:42] [INFO ] Invariant cache hit.
[2024-05-31 22:24:42] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/619 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/619 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 7.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 0.0)
(s143 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 619/1699 variables, and 2 constraints, problems are : Problem set: 0 solved, 1612 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/619 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 1612/1612 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1612 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/619 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/619 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/619 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 3 (OVERLAPS) 1080/1699 variables, 619/621 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1699 variables, 268/889 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1699/1699 variables, and 2501 constraints, problems are : Problem set: 0 solved, 1612 unsolved in 31287 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 619/619 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 1612/1612 constraints, Known Traps: 0/0 constraints]
After SMT, in 68395ms problems are : Problem set: 0 solved, 1612 unsolved
Search for dead transitions found 0 dead transitions in 68410ms
Starting structural reductions in SI_LTL mode, iteration 1 : 619/749 places, 1614/1946 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71410 ms. Remains : 619/749 places, 1614/1946 transitions.
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-c032-LTLCardinality-10
Product exploration explored 100000 steps with 13 reset in 656 ms.
Stack based approach found an accepted trace after 44169 steps with 82 reset with depth 33485 and stack size 33480 in 292 ms.
FORMULA FunctionPointer-PT-c032-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c032-LTLCardinality-10 finished in 72422 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||G(p1))))'
Support contains 2 out of 749 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 749/749 places, 1946/1946 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 735 transition count 1910
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 735 transition count 1910
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 34 place count 735 transition count 1904
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 48 place count 721 transition count 1864
Iterating global reduction 1 with 14 rules applied. Total rules applied 62 place count 721 transition count 1864
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 75 place count 708 transition count 1824
Iterating global reduction 1 with 13 rules applied. Total rules applied 88 place count 708 transition count 1824
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 103 place count 693 transition count 1778
Iterating global reduction 1 with 15 rules applied. Total rules applied 118 place count 693 transition count 1778
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 133 place count 678 transition count 1740
Iterating global reduction 1 with 15 rules applied. Total rules applied 148 place count 678 transition count 1740
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 162 place count 664 transition count 1712
Iterating global reduction 1 with 14 rules applied. Total rules applied 176 place count 664 transition count 1712
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 190 place count 650 transition count 1684
Iterating global reduction 1 with 14 rules applied. Total rules applied 204 place count 650 transition count 1684
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 215 place count 639 transition count 1662
Iterating global reduction 1 with 11 rules applied. Total rules applied 226 place count 639 transition count 1662
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 234 place count 631 transition count 1646
Iterating global reduction 1 with 8 rules applied. Total rules applied 242 place count 631 transition count 1646
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 246 place count 627 transition count 1638
Iterating global reduction 1 with 4 rules applied. Total rules applied 250 place count 627 transition count 1638
Applied a total of 250 rules in 181 ms. Remains 627 /749 variables (removed 122) and now considering 1638/1946 (removed 308) transitions.
[2024-05-31 22:25:51] [INFO ] Flow matrix only has 1094 transitions (discarded 544 similar events)
// Phase 1: matrix 1094 rows 627 cols
[2024-05-31 22:25:51] [INFO ] Computed 2 invariants in 10 ms
[2024-05-31 22:25:52] [INFO ] Implicit Places using invariants in 422 ms returned []
[2024-05-31 22:25:52] [INFO ] Flow matrix only has 1094 transitions (discarded 544 similar events)
[2024-05-31 22:25:52] [INFO ] Invariant cache hit.
[2024-05-31 22:25:52] [INFO ] State equation strengthened by 269 read => feed constraints.
[2024-05-31 22:25:54] [INFO ] Implicit Places using invariants and state equation in 1876 ms returned []
Implicit Place search using SMT with State Equation took 2315 ms to find 0 implicit places.
Running 1636 sub problems to find dead transitions.
[2024-05-31 22:25:54] [INFO ] Flow matrix only has 1094 transitions (discarded 544 similar events)
[2024-05-31 22:25:54] [INFO ] Invariant cache hit.
[2024-05-31 22:25:54] [INFO ] State equation strengthened by 269 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/627 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1636 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/627 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1636 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 627/1721 variables, and 2 constraints, problems are : Problem set: 0 solved, 1636 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/627 constraints, ReadFeed: 0/269 constraints, PredecessorRefiner: 1636/1636 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1636 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/627 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1636 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/627 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1636 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/627 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1636 unsolved
At refinement iteration 3 (OVERLAPS) 1094/1721 variables, 627/629 constraints. Problems are: Problem set: 0 solved, 1636 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1721 variables, 269/898 constraints. Problems are: Problem set: 0 solved, 1636 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1721/1721 variables, and 2534 constraints, problems are : Problem set: 0 solved, 1636 unsolved in 31368 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 627/627 constraints, ReadFeed: 269/269 constraints, PredecessorRefiner: 1636/1636 constraints, Known Traps: 0/0 constraints]
After SMT, in 68499ms problems are : Problem set: 0 solved, 1636 unsolved
Search for dead transitions found 0 dead transitions in 68516ms
Starting structural reductions in LTL mode, iteration 1 : 627/749 places, 1638/1946 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71018 ms. Remains : 627/749 places, 1638/1946 transitions.
Stuttering acceptance computed with spot in 139 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-c032-LTLCardinality-11
Product exploration explored 100000 steps with 50000 reset in 565 ms.
Product exploration explored 100000 steps with 50000 reset in 560 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) p1))), (X p1), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 13 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-c032-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-c032-LTLCardinality-11 finished in 72328 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 2 out of 749 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 749/749 places, 1946/1946 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 735 transition count 1910
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 735 transition count 1910
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 34 place count 735 transition count 1904
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 48 place count 721 transition count 1862
Iterating global reduction 1 with 14 rules applied. Total rules applied 62 place count 721 transition count 1862
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 75 place count 708 transition count 1824
Iterating global reduction 1 with 13 rules applied. Total rules applied 88 place count 708 transition count 1824
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 103 place count 693 transition count 1782
Iterating global reduction 1 with 15 rules applied. Total rules applied 118 place count 693 transition count 1782
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 133 place count 678 transition count 1744
Iterating global reduction 1 with 15 rules applied. Total rules applied 148 place count 678 transition count 1744
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 162 place count 664 transition count 1716
Iterating global reduction 1 with 14 rules applied. Total rules applied 176 place count 664 transition count 1716
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 190 place count 650 transition count 1688
Iterating global reduction 1 with 14 rules applied. Total rules applied 204 place count 650 transition count 1688
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 215 place count 639 transition count 1664
Iterating global reduction 1 with 11 rules applied. Total rules applied 226 place count 639 transition count 1664
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 233 place count 632 transition count 1648
Iterating global reduction 1 with 7 rules applied. Total rules applied 240 place count 632 transition count 1648
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 245 place count 627 transition count 1638
Iterating global reduction 1 with 5 rules applied. Total rules applied 250 place count 627 transition count 1638
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 251 place count 626 transition count 1636
Iterating global reduction 1 with 1 rules applied. Total rules applied 252 place count 626 transition count 1636
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 253 place count 625 transition count 1634
Iterating global reduction 1 with 1 rules applied. Total rules applied 254 place count 625 transition count 1634
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 255 place count 624 transition count 1632
Iterating global reduction 1 with 1 rules applied. Total rules applied 256 place count 624 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 257 place count 623 transition count 1630
Iterating global reduction 1 with 1 rules applied. Total rules applied 258 place count 623 transition count 1630
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 264 place count 623 transition count 1624
Applied a total of 264 rules in 387 ms. Remains 623 /749 variables (removed 126) and now considering 1624/1946 (removed 322) transitions.
[2024-05-31 22:27:04] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
// Phase 1: matrix 1085 rows 623 cols
[2024-05-31 22:27:04] [INFO ] Computed 2 invariants in 13 ms
[2024-05-31 22:27:04] [INFO ] Implicit Places using invariants in 421 ms returned []
[2024-05-31 22:27:04] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2024-05-31 22:27:04] [INFO ] Invariant cache hit.
[2024-05-31 22:27:05] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-31 22:27:06] [INFO ] Implicit Places using invariants and state equation in 1830 ms returned []
Implicit Place search using SMT with State Equation took 2253 ms to find 0 implicit places.
[2024-05-31 22:27:06] [INFO ] Redundant transitions in 28 ms returned []
Running 1622 sub problems to find dead transitions.
[2024-05-31 22:27:06] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2024-05-31 22:27:06] [INFO ] Invariant cache hit.
[2024-05-31 22:27:06] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/623 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/623 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1708 variables, and 2 constraints, problems are : Problem set: 0 solved, 1622 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/623 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 1622/1622 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1622 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/623 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/623 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/623 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
At refinement iteration 3 (OVERLAPS) 1085/1708 variables, 623/625 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1708 variables, 268/893 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1708/1708 variables, and 2515 constraints, problems are : Problem set: 0 solved, 1622 unsolved in 31296 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 623/623 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 1622/1622 constraints, Known Traps: 0/0 constraints]
After SMT, in 69116ms problems are : Problem set: 0 solved, 1622 unsolved
Search for dead transitions found 0 dead transitions in 69129ms
Starting structural reductions in SI_LTL mode, iteration 1 : 623/749 places, 1624/1946 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71806 ms. Remains : 623/749 places, 1624/1946 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c032-LTLCardinality-12
Stuttering criterion allowed to conclude after 242 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-c032-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c032-LTLCardinality-12 finished in 71871 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 749 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 749/749 places, 1946/1946 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 733 transition count 1906
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 733 transition count 1906
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 38 place count 733 transition count 1900
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 54 place count 717 transition count 1854
Iterating global reduction 1 with 16 rules applied. Total rules applied 70 place count 717 transition count 1854
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 85 place count 702 transition count 1808
Iterating global reduction 1 with 15 rules applied. Total rules applied 100 place count 702 transition count 1808
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 117 place count 685 transition count 1758
Iterating global reduction 1 with 17 rules applied. Total rules applied 134 place count 685 transition count 1758
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 151 place count 668 transition count 1716
Iterating global reduction 1 with 17 rules applied. Total rules applied 168 place count 668 transition count 1716
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 184 place count 652 transition count 1684
Iterating global reduction 1 with 16 rules applied. Total rules applied 200 place count 652 transition count 1684
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 216 place count 636 transition count 1652
Iterating global reduction 1 with 16 rules applied. Total rules applied 232 place count 636 transition count 1652
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 245 place count 623 transition count 1624
Iterating global reduction 1 with 13 rules applied. Total rules applied 258 place count 623 transition count 1624
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 267 place count 614 transition count 1604
Iterating global reduction 1 with 9 rules applied. Total rules applied 276 place count 614 transition count 1604
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 281 place count 609 transition count 1594
Iterating global reduction 1 with 5 rules applied. Total rules applied 286 place count 609 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 287 place count 608 transition count 1592
Iterating global reduction 1 with 1 rules applied. Total rules applied 288 place count 608 transition count 1592
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 289 place count 607 transition count 1590
Iterating global reduction 1 with 1 rules applied. Total rules applied 290 place count 607 transition count 1590
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 291 place count 606 transition count 1588
Iterating global reduction 1 with 1 rules applied. Total rules applied 292 place count 606 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 293 place count 605 transition count 1586
Iterating global reduction 1 with 1 rules applied. Total rules applied 294 place count 605 transition count 1586
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 296 place count 605 transition count 1584
Applied a total of 296 rules in 379 ms. Remains 605 /749 variables (removed 144) and now considering 1584/1946 (removed 362) transitions.
[2024-05-31 22:28:16] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
// Phase 1: matrix 1057 rows 605 cols
[2024-05-31 22:28:16] [INFO ] Computed 2 invariants in 14 ms
[2024-05-31 22:28:16] [INFO ] Implicit Places using invariants in 410 ms returned []
[2024-05-31 22:28:16] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-31 22:28:16] [INFO ] Invariant cache hit.
[2024-05-31 22:28:17] [INFO ] State equation strengthened by 262 read => feed constraints.
[2024-05-31 22:28:18] [INFO ] Implicit Places using invariants and state equation in 2037 ms returned []
Implicit Place search using SMT with State Equation took 2451 ms to find 0 implicit places.
[2024-05-31 22:28:18] [INFO ] Redundant transitions in 28 ms returned []
Running 1582 sub problems to find dead transitions.
[2024-05-31 22:28:18] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-31 22:28:18] [INFO ] Invariant cache hit.
[2024-05-31 22:28:18] [INFO ] State equation strengthened by 262 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 605/1662 variables, and 2 constraints, problems are : Problem set: 0 solved, 1582 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/605 constraints, ReadFeed: 0/262 constraints, PredecessorRefiner: 1582/1582 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1582 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/605 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 3 (OVERLAPS) 1057/1662 variables, 605/607 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1662 variables, 262/869 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1662/1662 variables, and 2451 constraints, problems are : Problem set: 0 solved, 1582 unsolved in 30890 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 605/605 constraints, ReadFeed: 262/262 constraints, PredecessorRefiner: 1582/1582 constraints, Known Traps: 0/0 constraints]
After SMT, in 67546ms problems are : Problem set: 0 solved, 1582 unsolved
Search for dead transitions found 0 dead transitions in 67560ms
Starting structural reductions in SI_LTL mode, iteration 1 : 605/749 places, 1584/1946 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 70424 ms. Remains : 605/749 places, 1584/1946 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c032-LTLCardinality-15
Product exploration explored 100000 steps with 108 reset in 516 ms.
Product exploration explored 100000 steps with 45 reset in 588 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Detected a total of 192/605 stabilizing places and 512/1584 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 85 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 66 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40058 steps (8 resets) in 95 ms. (417 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (16 resets) in 121 ms. (327 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 583781 steps, run timeout after 3001 ms. (steps per millisecond=194 ) properties seen :0 out of 1
Probabilistic random walk after 583781 steps, saw 378907 distinct states, run finished after 3001 ms. (steps per millisecond=194 ) properties seen :0
[2024-05-31 22:29:30] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-31 22:29:30] [INFO ] Invariant cache hit.
[2024-05-31 22:29:30] [INFO ] State equation strengthened by 262 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 383/384 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 641/1025 variables, 384/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1025 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 208/1233 variables, 4/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1233 variables, 194/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1233 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 343/1576 variables, 141/724 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1576 variables, 1/725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1576 variables, 68/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1576 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 72/1648 variables, 68/861 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1648 variables, 0/861 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/1656 variables, 4/865 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1656 variables, 0/865 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/1662 variables, 4/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1662 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1662 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1662/1662 variables, and 869 constraints, problems are : Problem set: 0 solved, 1 unsolved in 426 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 605/605 constraints, ReadFeed: 262/262 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 383/384 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 641/1025 variables, 384/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1025 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 208/1233 variables, 4/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1233 variables, 194/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1233 variables, 1/584 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1233 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 343/1576 variables, 141/725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1576 variables, 1/726 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1576 variables, 68/794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1576 variables, 0/794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 72/1648 variables, 68/862 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1648 variables, 0/862 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/1656 variables, 4/866 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1656 variables, 0/866 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/1662 variables, 4/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1662 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1662 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1662/1662 variables, and 870 constraints, problems are : Problem set: 0 solved, 1 unsolved in 450 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 605/605 constraints, ReadFeed: 262/262 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 890ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 64 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=64 )
Parikh walk visited 1 properties in 8 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 122 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 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 605 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 605/605 places, 1584/1584 transitions.
Applied a total of 0 rules in 98 ms. Remains 605 /605 variables (removed 0) and now considering 1584/1584 (removed 0) transitions.
[2024-05-31 22:29:32] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-31 22:29:32] [INFO ] Invariant cache hit.
[2024-05-31 22:29:32] [INFO ] Implicit Places using invariants in 434 ms returned []
[2024-05-31 22:29:32] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-31 22:29:32] [INFO ] Invariant cache hit.
[2024-05-31 22:29:32] [INFO ] State equation strengthened by 262 read => feed constraints.
[2024-05-31 22:29:34] [INFO ] Implicit Places using invariants and state equation in 2087 ms returned []
Implicit Place search using SMT with State Equation took 2523 ms to find 0 implicit places.
[2024-05-31 22:29:34] [INFO ] Redundant transitions in 24 ms returned []
Running 1582 sub problems to find dead transitions.
[2024-05-31 22:29:34] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-31 22:29:34] [INFO ] Invariant cache hit.
[2024-05-31 22:29:34] [INFO ] State equation strengthened by 262 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 605/1662 variables, and 2 constraints, problems are : Problem set: 0 solved, 1582 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/605 constraints, ReadFeed: 0/262 constraints, PredecessorRefiner: 1582/1582 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1582 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/605 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 3 (OVERLAPS) 1057/1662 variables, 605/607 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1662 variables, 262/869 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1662/1662 variables, and 2451 constraints, problems are : Problem set: 0 solved, 1582 unsolved in 31327 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 605/605 constraints, ReadFeed: 262/262 constraints, PredecessorRefiner: 1582/1582 constraints, Known Traps: 0/0 constraints]
After SMT, in 68742ms problems are : Problem set: 0 solved, 1582 unsolved
Search for dead transitions found 0 dead transitions in 68756ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 71414 ms. Remains : 605/605 places, 1584/1584 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Detected a total of 192/605 stabilizing places and 512/1584 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 107 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 82 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40039 steps (8 resets) in 102 ms. (388 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (15 resets) in 58 ms. (678 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 598885 steps, run timeout after 3001 ms. (steps per millisecond=199 ) properties seen :0 out of 1
Probabilistic random walk after 598885 steps, saw 388708 distinct states, run finished after 3001 ms. (steps per millisecond=199 ) properties seen :0
[2024-05-31 22:30:46] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-31 22:30:46] [INFO ] Invariant cache hit.
[2024-05-31 22:30:46] [INFO ] State equation strengthened by 262 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 383/384 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 641/1025 variables, 384/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1025 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 208/1233 variables, 4/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1233 variables, 194/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1233 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 343/1576 variables, 141/724 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1576 variables, 1/725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1576 variables, 68/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1576 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 72/1648 variables, 68/861 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1648 variables, 0/861 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/1656 variables, 4/865 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1656 variables, 0/865 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/1662 variables, 4/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1662 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1662 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1662/1662 variables, and 869 constraints, problems are : Problem set: 0 solved, 1 unsolved in 446 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 605/605 constraints, ReadFeed: 262/262 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 383/384 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 641/1025 variables, 384/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1025 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 208/1233 variables, 4/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1233 variables, 194/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1233 variables, 1/584 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1233 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 343/1576 variables, 141/725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1576 variables, 1/726 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1576 variables, 68/794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1576 variables, 0/794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 72/1648 variables, 68/862 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1648 variables, 0/862 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/1656 variables, 4/866 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1656 variables, 0/866 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/1662 variables, 4/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1662 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1662 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1662/1662 variables, and 870 constraints, problems are : Problem set: 0 solved, 1 unsolved in 492 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 605/605 constraints, ReadFeed: 262/262 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 958ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 60 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=60 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 105 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 58 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 78 reset in 514 ms.
Product exploration explored 100000 steps with 15 reset in 628 ms.
Support contains 1 out of 605 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 605/605 places, 1584/1584 transitions.
Applied a total of 0 rules in 71 ms. Remains 605 /605 variables (removed 0) and now considering 1584/1584 (removed 0) transitions.
[2024-05-31 22:30:49] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-31 22:30:49] [INFO ] Invariant cache hit.
[2024-05-31 22:30:49] [INFO ] Implicit Places using invariants in 398 ms returned []
[2024-05-31 22:30:49] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-31 22:30:49] [INFO ] Invariant cache hit.
[2024-05-31 22:30:49] [INFO ] State equation strengthened by 262 read => feed constraints.
[2024-05-31 22:30:51] [INFO ] Implicit Places using invariants and state equation in 2153 ms returned []
Implicit Place search using SMT with State Equation took 2553 ms to find 0 implicit places.
[2024-05-31 22:30:51] [INFO ] Redundant transitions in 25 ms returned []
Running 1582 sub problems to find dead transitions.
[2024-05-31 22:30:51] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-31 22:30:51] [INFO ] Invariant cache hit.
[2024-05-31 22:30:51] [INFO ] State equation strengthened by 262 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 605/1662 variables, and 2 constraints, problems are : Problem set: 0 solved, 1582 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/605 constraints, ReadFeed: 0/262 constraints, PredecessorRefiner: 1582/1582 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1582 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/605 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 3 (OVERLAPS) 1057/1662 variables, 605/607 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1662 variables, 262/869 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1662/1662 variables, and 2451 constraints, problems are : Problem set: 0 solved, 1582 unsolved in 31261 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 605/605 constraints, ReadFeed: 262/262 constraints, PredecessorRefiner: 1582/1582 constraints, Known Traps: 0/0 constraints]
After SMT, in 68634ms problems are : Problem set: 0 solved, 1582 unsolved
Search for dead transitions found 0 dead transitions in 68650ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 71313 ms. Remains : 605/605 places, 1584/1584 transitions.
Treatment of property FunctionPointer-PT-c032-LTLCardinality-15 finished in 224584 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)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2024-05-31 22:32:00] [INFO ] Flatten gal took : 70 ms
[2024-05-31 22:32:00] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-31 22:32:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 749 places, 1946 transitions and 7910 arcs took 16 ms.
Total runtime 1110549 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : FunctionPointer-PT-c032-LTLCardinality-01
Could not compute solution for formula : FunctionPointer-PT-c032-LTLCardinality-15

BK_STOP 1717194860433

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name FunctionPointer-PT-c032-LTLCardinality-01
ltl formula formula --ltl=/tmp/1197/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 749 places, 1946 transitions and 7910 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.180 real 0.060 user 0.060 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1197/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1197/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1197/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1197/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 750 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 750, there are 1950 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~1273 levels ~10000 states ~31536 transitions
pnml2lts-mc( 0/ 4): ~2264 levels ~20000 states ~58520 transitions
pnml2lts-mc( 0/ 4): ~4246 levels ~40000 states ~112484 transitions
pnml2lts-mc( 0/ 4): ~8208 levels ~80000 states ~220400 transitions
pnml2lts-mc( 0/ 4): ~16132 levels ~160000 states ~436264 transitions
pnml2lts-mc( 1/ 4): ~80000 levels ~320000 states ~1041172 transitions
pnml2lts-mc( 1/ 4): ~160000 levels ~640000 states ~2081172 transitions
pnml2lts-mc( 1/ 4): ~320000 levels ~1280000 states ~4161172 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 1281102
pnml2lts-mc( 0/ 4): unique transitions count: 5123095
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 139265
pnml2lts-mc( 0/ 4): - claim success count: 1281120
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1085495
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1281120 states 5123160 transitions, fanout: 3.999
pnml2lts-mc( 0/ 4): Total exploration time 56.800 sec (56.770 sec minimum, 56.785 sec on average)
pnml2lts-mc( 0/ 4): States per second: 22555, Transitions per second: 90196
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 102.0MB, 21.5 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 14.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 1976 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 102.0MB (~256.0MB paged-in)
ltl formula name FunctionPointer-PT-c032-LTLCardinality-15
ltl formula formula --ltl=/tmp/1197/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 749 places, 1946 transitions and 7910 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.170 real 0.070 user 0.050 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1197/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1197/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1197/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1197/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 751 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 750, there are 1949 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~1227 levels ~10000 states ~27344 transitions
pnml2lts-mc( 0/ 4): ~2228 levels ~20000 states ~50672 transitions
pnml2lts-mc( 0/ 4): ~4227 levels ~40000 states ~97344 transitions
pnml2lts-mc( 0/ 4): ~8228 levels ~80000 states ~190672 transitions
pnml2lts-mc( 0/ 4): ~16227 levels ~160000 states ~377344 transitions
pnml2lts-mc( 0/ 4): ~32228 levels ~320000 states ~750672 transitions
pnml2lts-mc( 0/ 4): ~64227 levels ~640000 states ~1497344 transitions
pnml2lts-mc( 0/ 4): ~128228 levels ~1280000 states ~2990672 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 1837656
pnml2lts-mc( 0/ 4): unique transitions count: 6151556
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 338684
pnml2lts-mc( 0/ 4): - claim success count: 1837668
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1439405
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1837668 states 6151611 transitions, fanout: 3.348
pnml2lts-mc( 0/ 4): Total exploration time 80.790 sec (80.770 sec minimum, 80.783 sec on average)
pnml2lts-mc( 0/ 4): States per second: 22746, Transitions per second: 76143
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 106.7MB, 20.0 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 16.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 1976 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 106.7MB (~256.0MB paged-in)

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="FunctionPointer-PT-c032"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is FunctionPointer-PT-c032, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r496-tall-171640603100307"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c032.tgz
mv FunctionPointer-PT-c032 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;