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.r197-tall-171640625100187.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 gold2023
Input is FunctionPointer-PT-c016, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-tall-171640625100187
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 18K May 19 18:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K 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-c016-LTLCardinality-00
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-01
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-02
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-03
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-04
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-05
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-06
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-07
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-08
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-09
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-10
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-11
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-12
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-13
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-14
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716532970687

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c016
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-24 06:42:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 06:42:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 06:42:52] [INFO ] Load time of PNML (sax parser for PT used): 335 ms
[2024-05-24 06:42:52] [INFO ] Transformed 2826 places.
[2024-05-24 06:42:52] [INFO ] Transformed 8960 transitions.
[2024-05-24 06:42:52] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 434 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1198 places in 40 ms
Reduce places removed 1198 places and 2998 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA FunctionPointer-PT-c016-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 17 out of 1628 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 1612 transition count 5962
Discarding 298 places :
Symmetric choice reduction at 1 with 298 rule applications. Total rules 314 place count 1314 transition count 3672
Iterating global reduction 1 with 298 rules applied. Total rules applied 612 place count 1314 transition count 3672
Ensure Unique test removed 346 transitions
Reduce isomorphic transitions removed 346 transitions.
Iterating post reduction 1 with 346 rules applied. Total rules applied 958 place count 1314 transition count 3326
Discarding 156 places :
Symmetric choice reduction at 2 with 156 rule applications. Total rules 1114 place count 1158 transition count 3014
Iterating global reduction 2 with 156 rules applied. Total rules applied 1270 place count 1158 transition count 3014
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 2 with 64 rules applied. Total rules applied 1334 place count 1158 transition count 2950
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1348 place count 1144 transition count 2922
Iterating global reduction 3 with 14 rules applied. Total rules applied 1362 place count 1144 transition count 2922
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1376 place count 1130 transition count 2894
Iterating global reduction 3 with 14 rules applied. Total rules applied 1390 place count 1130 transition count 2894
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1404 place count 1116 transition count 2866
Iterating global reduction 3 with 14 rules applied. Total rules applied 1418 place count 1116 transition count 2866
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1432 place count 1102 transition count 2838
Iterating global reduction 3 with 14 rules applied. Total rules applied 1446 place count 1102 transition count 2838
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1459 place count 1089 transition count 2812
Iterating global reduction 3 with 13 rules applied. Total rules applied 1472 place count 1089 transition count 2812
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1485 place count 1076 transition count 2786
Iterating global reduction 3 with 13 rules applied. Total rules applied 1498 place count 1076 transition count 2786
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1510 place count 1064 transition count 2762
Iterating global reduction 3 with 12 rules applied. Total rules applied 1522 place count 1064 transition count 2762
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 1580 place count 1006 transition count 2540
Iterating global reduction 3 with 58 rules applied. Total rules applied 1638 place count 1006 transition count 2540
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 1696 place count 948 transition count 2308
Iterating global reduction 3 with 58 rules applied. Total rules applied 1754 place count 948 transition count 2308
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 1812 place count 890 transition count 2182
Iterating global reduction 3 with 58 rules applied. Total rules applied 1870 place count 890 transition count 2182
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 1927 place count 833 transition count 2068
Iterating global reduction 3 with 57 rules applied. Total rules applied 1984 place count 833 transition count 2068
Discarding 55 places :
Symmetric choice reduction at 3 with 55 rule applications. Total rules 2039 place count 778 transition count 1958
Iterating global reduction 3 with 55 rules applied. Total rules applied 2094 place count 778 transition count 1958
Discarding 55 places :
Symmetric choice reduction at 3 with 55 rule applications. Total rules 2149 place count 723 transition count 1848
Iterating global reduction 3 with 55 rules applied. Total rules applied 2204 place count 723 transition count 1848
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 2257 place count 670 transition count 1742
Iterating global reduction 3 with 53 rules applied. Total rules applied 2310 place count 670 transition count 1742
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 2315 place count 665 transition count 1732
Iterating global reduction 3 with 5 rules applied. Total rules applied 2320 place count 665 transition count 1732
Applied a total of 2320 rules in 1167 ms. Remains 665 /1628 variables (removed 963) and now considering 1732/5962 (removed 4230) transitions.
[2024-05-24 06:42:54] [INFO ] Flow matrix only has 1164 transitions (discarded 568 similar events)
// Phase 1: matrix 1164 rows 665 cols
[2024-05-24 06:42:54] [INFO ] Computed 3 invariants in 41 ms
[2024-05-24 06:42:54] [INFO ] Implicit Places using invariants in 857 ms returned []
[2024-05-24 06:42:54] [INFO ] Flow matrix only has 1164 transitions (discarded 568 similar events)
[2024-05-24 06:42:54] [INFO ] Invariant cache hit.
[2024-05-24 06:42:55] [INFO ] State equation strengthened by 288 read => feed constraints.
[2024-05-24 06:42:57] [INFO ] Implicit Places using invariants and state equation in 2108 ms returned []
Implicit Place search using SMT with State Equation took 2995 ms to find 0 implicit places.
[2024-05-24 06:42:57] [INFO ] Flow matrix only has 1164 transitions (discarded 568 similar events)
[2024-05-24 06:42:57] [INFO ] Invariant cache hit.
[2024-05-24 06:42:57] [INFO ] Dead Transitions using invariants and state equation in 583 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 665/1628 places, 1732/5962 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4749 ms. Remains : 665/1628 places, 1732/5962 transitions.
Support contains 17 out of 665 places after structural reductions.
[2024-05-24 06:42:57] [INFO ] Flatten gal took : 158 ms
[2024-05-24 06:42:58] [INFO ] Flatten gal took : 114 ms
[2024-05-24 06:42:58] [INFO ] Input system was already deterministic with 1732 transitions.
Support contains 16 out of 665 places (down from 17) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 344 ms. (steps per millisecond=29 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-24 06:42:58] [INFO ] Flow matrix only has 1164 transitions (discarded 568 similar events)
[2024-05-24 06:42:58] [INFO ] Invariant cache hit.
[2024-05-24 06:42:59] [INFO ] After 163ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-24 06:42:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-24 06:42:59] [INFO ] After 617ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2024-05-24 06:42:59] [INFO ] State equation strengthened by 288 read => feed constraints.
[2024-05-24 06:43:00] [INFO ] After 218ms SMT Verify possible using 288 Read/Feed constraints in natural domain returned unsat :1 sat :5
[2024-05-24 06:43:00] [INFO ] After 556ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 191 ms.
[2024-05-24 06:43:00] [INFO ] After 1596ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 35 ms.
Support contains 10 out of 665 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 665/665 places, 1732/1732 transitions.
Graph (complete) has 2931 edges and 665 vertex of which 475 are kept as prefixes of interest. Removing 190 places using SCC suffix rule.4 ms
Discarding 190 places :
Also discarding 0 output transitions
Drop transitions removed 379 transitions
Reduce isomorphic transitions removed 379 transitions.
Iterating post reduction 0 with 379 rules applied. Total rules applied 380 place count 475 transition count 1353
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 384 place count 471 transition count 1345
Iterating global reduction 1 with 4 rules applied. Total rules applied 388 place count 471 transition count 1345
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 392 place count 471 transition count 1341
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 396 place count 467 transition count 1333
Iterating global reduction 2 with 4 rules applied. Total rules applied 400 place count 467 transition count 1333
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 403 place count 464 transition count 1327
Iterating global reduction 2 with 3 rules applied. Total rules applied 406 place count 464 transition count 1327
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 408 place count 462 transition count 1323
Iterating global reduction 2 with 2 rules applied. Total rules applied 410 place count 462 transition count 1323
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 411 place count 461 transition count 1321
Iterating global reduction 2 with 1 rules applied. Total rules applied 412 place count 461 transition count 1321
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 413 place count 460 transition count 1317
Iterating global reduction 2 with 1 rules applied. Total rules applied 414 place count 460 transition count 1317
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 415 place count 459 transition count 1313
Iterating global reduction 2 with 1 rules applied. Total rules applied 416 place count 459 transition count 1313
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 417 place count 458 transition count 1311
Iterating global reduction 2 with 1 rules applied. Total rules applied 418 place count 458 transition count 1311
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 419 place count 457 transition count 1309
Iterating global reduction 2 with 1 rules applied. Total rules applied 420 place count 457 transition count 1309
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 421 place count 456 transition count 1307
Iterating global reduction 2 with 1 rules applied. Total rules applied 422 place count 456 transition count 1307
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 423 place count 455 transition count 1305
Iterating global reduction 2 with 1 rules applied. Total rules applied 424 place count 455 transition count 1305
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 425 place count 454 transition count 1303
Iterating global reduction 2 with 1 rules applied. Total rules applied 426 place count 454 transition count 1303
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 2 with 10 rules applied. Total rules applied 436 place count 454 transition count 1293
Applied a total of 436 rules in 381 ms. Remains 454 /665 variables (removed 211) and now considering 1293/1732 (removed 439) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 381 ms. Remains : 454/665 places, 1293/1732 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-24 06:43:01] [INFO ] Flow matrix only has 745 transitions (discarded 548 similar events)
// Phase 1: matrix 745 rows 454 cols
[2024-05-24 06:43:01] [INFO ] Computed 3 invariants in 9 ms
[2024-05-24 06:43:01] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 06:43:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 06:43:01] [INFO ] After 215ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 06:43:01] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-24 06:43:01] [INFO ] After 83ms SMT Verify possible using 91 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 06:43:01] [INFO ] After 217ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 67 ms.
[2024-05-24 06:43:01] [INFO ] After 598ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 8 ms.
Support contains 6 out of 454 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 454/454 places, 1293/1293 transitions.
Graph (complete) has 2219 edges and 454 vertex of which 451 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 451 transition count 1288
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 9 place count 448 transition count 1280
Iterating global reduction 1 with 3 rules applied. Total rules applied 12 place count 448 transition count 1280
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 14 place count 448 transition count 1278
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 17 place count 445 transition count 1272
Iterating global reduction 2 with 3 rules applied. Total rules applied 20 place count 445 transition count 1272
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 23 place count 442 transition count 1266
Iterating global reduction 2 with 3 rules applied. Total rules applied 26 place count 442 transition count 1266
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 28 place count 440 transition count 1260
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 440 transition count 1260
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 32 place count 438 transition count 1256
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 438 transition count 1256
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 36 place count 436 transition count 1252
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 436 transition count 1252
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 40 place count 434 transition count 1248
Iterating global reduction 2 with 2 rules applied. Total rules applied 42 place count 434 transition count 1248
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 433 transition count 1246
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 433 transition count 1246
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 432 transition count 1244
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 432 transition count 1244
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 431 transition count 1242
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 431 transition count 1242
Applied a total of 48 rules in 153 ms. Remains 431 /454 variables (removed 23) and now considering 1242/1293 (removed 51) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 154 ms. Remains : 431/454 places, 1242/1293 transitions.
Incomplete random walk after 10003 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-24 06:43:02] [INFO ] Flow matrix only has 706 transitions (discarded 536 similar events)
// Phase 1: matrix 706 rows 431 cols
[2024-05-24 06:43:02] [INFO ] Computed 3 invariants in 8 ms
[2024-05-24 06:43:02] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 06:43:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-24 06:43:02] [INFO ] After 147ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 06:43:02] [INFO ] State equation strengthened by 80 read => feed constraints.
[2024-05-24 06:43:02] [INFO ] After 37ms SMT Verify possible using 80 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 06:43:02] [INFO ] After 80ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2024-05-24 06:43:02] [INFO ] After 317ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 431 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 431/431 places, 1242/1242 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 429 transition count 1238
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 429 transition count 1238
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 429 transition count 1236
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 427 transition count 1230
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 427 transition count 1230
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 426 transition count 1228
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 426 transition count 1228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 425 transition count 1226
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 425 transition count 1226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 424 transition count 1224
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 424 transition count 1224
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 423 transition count 1222
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 423 transition count 1222
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 422 transition count 1220
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 422 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 421 transition count 1218
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 421 transition count 1218
Applied a total of 22 rules in 136 ms. Remains 421 /431 variables (removed 10) and now considering 1218/1242 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 421/431 places, 1218/1242 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 586793 steps, run timeout after 3001 ms. (steps per millisecond=195 ) properties seen :{}
Probabilistic random walk after 586793 steps, saw 359811 distinct states, run finished after 3003 ms. (steps per millisecond=195 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 06:43:05] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
// Phase 1: matrix 688 rows 421 cols
[2024-05-24 06:43:05] [INFO ] Computed 3 invariants in 9 ms
[2024-05-24 06:43:05] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 06:43:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-24 06:43:06] [INFO ] After 160ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 06:43:06] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-24 06:43:06] [INFO ] After 61ms SMT Verify possible using 75 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 06:43:06] [INFO ] After 111ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2024-05-24 06:43:06] [INFO ] After 366ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 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 49 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 49 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 60 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2024-05-24 06:43:06] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-24 06:43:06] [INFO ] Invariant cache hit.
[2024-05-24 06:43:06] [INFO ] Implicit Places using invariants in 309 ms returned []
[2024-05-24 06:43:06] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-24 06:43:06] [INFO ] Invariant cache hit.
[2024-05-24 06:43:06] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-24 06:43:07] [INFO ] Implicit Places using invariants and state equation in 1372 ms returned []
Implicit Place search using SMT with State Equation took 1695 ms to find 0 implicit places.
[2024-05-24 06:43:08] [INFO ] Redundant transitions in 72 ms returned []
[2024-05-24 06:43:08] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-24 06:43:08] [INFO ] Invariant cache hit.
[2024-05-24 06:43:08] [INFO ] Dead Transitions using invariants and state equation in 372 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2206 ms. Remains : 421/421 places, 1218/1218 transitions.
Ensure Unique test removed 530 transitions
Reduce isomorphic transitions removed 530 transitions.
Drop transitions 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 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 550 place count 411 transition count 606
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 694 place count 339 transition count 606
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: 126
Deduced a syphon composed of 126 places in 0 ms
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 2 with 252 rules applied. Total rules applied 946 place count 213 transition count 480
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 1009 place count 150 transition count 354
Iterating global reduction 2 with 63 rules applied. Total rules applied 1072 place count 150 transition count 354
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1073 place count 150 transition count 353
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1135 place count 88 transition count 229
Iterating global reduction 3 with 62 rules applied. Total rules applied 1197 place count 88 transition count 229
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 1258 place count 27 transition count 107
Iterating global reduction 3 with 61 rules applied. Total rules applied 1319 place count 27 transition count 107
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 3 with 60 rules applied. Total rules applied 1379 place count 27 transition count 47
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 1381 place count 26 transition count 46
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 1383 place count 25 transition count 49
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 1387 place count 25 transition count 45
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1388 place count 25 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1389 place count 24 transition count 44
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1390 place count 24 transition count 43
Applied a total of 1390 rules in 55 ms. Remains 24 /421 variables (removed 397) and now considering 43/1218 (removed 1175) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 43 rows 24 cols
[2024-05-24 06:43:08] [INFO ] Computed 3 invariants in 0 ms
[2024-05-24 06:43:08] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 06:43:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-24 06:43:08] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 06:43:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 06:43:08] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 06:43:08] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-24 06:43:08] [INFO ] After 42ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
FORMULA FunctionPointer-PT-c016-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 6 simplifications.
Computed a total of 192 stabilizing places and 512 stable transitions
Graph (complete) has 3891 edges and 665 vertex of which 664 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.19 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 665 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 665/665 places, 1732/1732 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 656 transition count 1712
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 656 transition count 1712
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 24 place count 656 transition count 1706
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 33 place count 647 transition count 1682
Iterating global reduction 1 with 9 rules applied. Total rules applied 42 place count 647 transition count 1682
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 49 place count 640 transition count 1664
Iterating global reduction 1 with 7 rules applied. Total rules applied 56 place count 640 transition count 1664
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 61 place count 635 transition count 1652
Iterating global reduction 1 with 5 rules applied. Total rules applied 66 place count 635 transition count 1652
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 70 place count 631 transition count 1642
Iterating global reduction 1 with 4 rules applied. Total rules applied 74 place count 631 transition count 1642
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 78 place count 627 transition count 1634
Iterating global reduction 1 with 4 rules applied. Total rules applied 82 place count 627 transition count 1634
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 86 place count 623 transition count 1626
Iterating global reduction 1 with 4 rules applied. Total rules applied 90 place count 623 transition count 1626
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 93 place count 620 transition count 1620
Iterating global reduction 1 with 3 rules applied. Total rules applied 96 place count 620 transition count 1620
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 619 transition count 1618
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 619 transition count 1618
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 618 transition count 1616
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 618 transition count 1616
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 104 place count 618 transition count 1612
Applied a total of 104 rules in 613 ms. Remains 618 /665 variables (removed 47) and now considering 1612/1732 (removed 120) transitions.
[2024-05-24 06:43:09] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
// Phase 1: matrix 1075 rows 618 cols
[2024-05-24 06:43:09] [INFO ] Computed 3 invariants in 15 ms
[2024-05-24 06:43:09] [INFO ] Implicit Places using invariants in 412 ms returned []
[2024-05-24 06:43:09] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-24 06:43:09] [INFO ] Invariant cache hit.
[2024-05-24 06:43:10] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 06:43:11] [INFO ] Implicit Places using invariants and state equation in 1647 ms returned []
Implicit Place search using SMT with State Equation took 2061 ms to find 0 implicit places.
[2024-05-24 06:43:11] [INFO ] Redundant transitions in 33 ms returned []
[2024-05-24 06:43:11] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-24 06:43:11] [INFO ] Invariant cache hit.
[2024-05-24 06:43:11] [INFO ] Dead Transitions using invariants and state equation in 532 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 618/665 places, 1612/1732 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3247 ms. Remains : 618/665 places, 1612/1732 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 161 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c016-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s542 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 95 steps with 0 reset in 6 ms.
FORMULA FunctionPointer-PT-c016-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c016-LTLCardinality-00 finished in 3467 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((p0||X((G(p1) U (p0&&G(p1))))))))))'
Support contains 1 out of 665 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 665/665 places, 1732/1732 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 664 transition count 1732
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 656 transition count 1714
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 656 transition count 1714
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 25 place count 656 transition count 1706
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 33 place count 648 transition count 1686
Iterating global reduction 2 with 8 rules applied. Total rules applied 41 place count 648 transition count 1686
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 47 place count 642 transition count 1672
Iterating global reduction 2 with 6 rules applied. Total rules applied 53 place count 642 transition count 1672
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 58 place count 637 transition count 1660
Iterating global reduction 2 with 5 rules applied. Total rules applied 63 place count 637 transition count 1660
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 67 place count 633 transition count 1650
Iterating global reduction 2 with 4 rules applied. Total rules applied 71 place count 633 transition count 1650
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 75 place count 629 transition count 1640
Iterating global reduction 2 with 4 rules applied. Total rules applied 79 place count 629 transition count 1640
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 83 place count 625 transition count 1630
Iterating global reduction 2 with 4 rules applied. Total rules applied 87 place count 625 transition count 1630
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 90 place count 622 transition count 1624
Iterating global reduction 2 with 3 rules applied. Total rules applied 93 place count 622 transition count 1624
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 95 place count 620 transition count 1620
Iterating global reduction 2 with 2 rules applied. Total rules applied 97 place count 620 transition count 1620
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 99 place count 618 transition count 1616
Iterating global reduction 2 with 2 rules applied. Total rules applied 101 place count 618 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 102 place count 617 transition count 1614
Iterating global reduction 2 with 1 rules applied. Total rules applied 103 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 104 place count 616 transition count 1612
Iterating global reduction 2 with 1 rules applied. Total rules applied 105 place count 616 transition count 1612
Applied a total of 105 rules in 443 ms. Remains 616 /665 variables (removed 49) and now considering 1612/1732 (removed 120) transitions.
[2024-05-24 06:43:12] [INFO ] Flow matrix only has 1078 transitions (discarded 534 similar events)
// Phase 1: matrix 1078 rows 616 cols
[2024-05-24 06:43:12] [INFO ] Computed 2 invariants in 14 ms
[2024-05-24 06:43:13] [INFO ] Implicit Places using invariants in 411 ms returned []
[2024-05-24 06:43:13] [INFO ] Flow matrix only has 1078 transitions (discarded 534 similar events)
[2024-05-24 06:43:13] [INFO ] Invariant cache hit.
[2024-05-24 06:43:13] [INFO ] State equation strengthened by 267 read => feed constraints.
[2024-05-24 06:43:14] [INFO ] Implicit Places using invariants and state equation in 1788 ms returned []
Implicit Place search using SMT with State Equation took 2203 ms to find 0 implicit places.
[2024-05-24 06:43:14] [INFO ] Flow matrix only has 1078 transitions (discarded 534 similar events)
[2024-05-24 06:43:14] [INFO ] Invariant cache hit.
[2024-05-24 06:43:15] [INFO ] Dead Transitions using invariants and state equation in 492 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 616/665 places, 1612/1732 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3143 ms. Remains : 616/665 places, 1612/1732 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c016-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(LEQ s526 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 684 ms.
Product exploration explored 100000 steps with 25000 reset in 616 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, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 274 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 498435 steps, run timeout after 3001 ms. (steps per millisecond=166 ) properties seen :{}
Probabilistic random walk after 498435 steps, saw 323517 distinct states, run finished after 3001 ms. (steps per millisecond=166 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 06:43:20] [INFO ] Flow matrix only has 1078 transitions (discarded 534 similar events)
[2024-05-24 06:43:20] [INFO ] Invariant cache hit.
[2024-05-24 06:43:20] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 06:43:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 06:43:20] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 06:43:20] [INFO ] After 239ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 06:43:20] [INFO ] State equation strengthened by 267 read => feed constraints.
[2024-05-24 06:43:20] [INFO ] After 62ms SMT Verify possible using 267 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 06:43:20] [INFO ] After 128ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2024-05-24 06:43:20] [INFO ] After 494ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 616 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 616/616 places, 1612/1612 transitions.
Graph (complete) has 2690 edges and 616 vertex of which 424 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.1 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 424 transition count 1228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 386 place count 423 transition count 1226
Iterating global reduction 1 with 1 rules applied. Total rules applied 387 place count 423 transition count 1226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 388 place count 422 transition count 1222
Iterating global reduction 1 with 1 rules applied. Total rules applied 389 place count 422 transition count 1222
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 390 place count 421 transition count 1218
Iterating global reduction 1 with 1 rules applied. Total rules applied 391 place count 421 transition count 1218
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 392 place count 420 transition count 1216
Iterating global reduction 1 with 1 rules applied. Total rules applied 393 place count 420 transition count 1216
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 394 place count 419 transition count 1214
Iterating global reduction 1 with 1 rules applied. Total rules applied 395 place count 419 transition count 1214
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 396 place count 418 transition count 1212
Iterating global reduction 1 with 1 rules applied. Total rules applied 397 place count 418 transition count 1212
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 398 place count 417 transition count 1210
Iterating global reduction 1 with 1 rules applied. Total rules applied 399 place count 417 transition count 1210
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 400 place count 416 transition count 1208
Iterating global reduction 1 with 1 rules applied. Total rules applied 401 place count 416 transition count 1208
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 403 place count 416 transition count 1206
Applied a total of 403 rules in 178 ms. Remains 416 /616 variables (removed 200) and now considering 1206/1612 (removed 406) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 192 ms. Remains : 416/616 places, 1206/1612 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Finished Best-First random walk after 2433 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=608 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 135 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 616 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 616/616 places, 1612/1612 transitions.
Applied a total of 0 rules in 19 ms. Remains 616 /616 variables (removed 0) and now considering 1612/1612 (removed 0) transitions.
[2024-05-24 06:43:21] [INFO ] Flow matrix only has 1078 transitions (discarded 534 similar events)
[2024-05-24 06:43:21] [INFO ] Invariant cache hit.
[2024-05-24 06:43:21] [INFO ] Implicit Places using invariants in 375 ms returned []
[2024-05-24 06:43:21] [INFO ] Flow matrix only has 1078 transitions (discarded 534 similar events)
[2024-05-24 06:43:21] [INFO ] Invariant cache hit.
[2024-05-24 06:43:22] [INFO ] State equation strengthened by 267 read => feed constraints.
[2024-05-24 06:43:23] [INFO ] Implicit Places using invariants and state equation in 1647 ms returned []
Implicit Place search using SMT with State Equation took 2023 ms to find 0 implicit places.
[2024-05-24 06:43:23] [INFO ] Flow matrix only has 1078 transitions (discarded 534 similar events)
[2024-05-24 06:43:23] [INFO ] Invariant cache hit.
[2024-05-24 06:43:24] [INFO ] Dead Transitions using invariants and state equation in 470 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2523 ms. Remains : 616/616 places, 1612/1612 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, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 64 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10012 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=435 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 518898 steps, run timeout after 3001 ms. (steps per millisecond=172 ) properties seen :{}
Probabilistic random walk after 518898 steps, saw 336799 distinct states, run finished after 3001 ms. (steps per millisecond=172 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 06:43:27] [INFO ] Flow matrix only has 1078 transitions (discarded 534 similar events)
[2024-05-24 06:43:27] [INFO ] Invariant cache hit.
[2024-05-24 06:43:27] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 06:43:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-24 06:43:27] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 06:43:27] [INFO ] After 238ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 06:43:27] [INFO ] State equation strengthened by 267 read => feed constraints.
[2024-05-24 06:43:27] [INFO ] After 64ms SMT Verify possible using 267 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 06:43:27] [INFO ] After 124ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2024-05-24 06:43:27] [INFO ] After 483ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 616 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 616/616 places, 1612/1612 transitions.
Graph (complete) has 2690 edges and 616 vertex of which 424 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.0 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 424 transition count 1228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 386 place count 423 transition count 1226
Iterating global reduction 1 with 1 rules applied. Total rules applied 387 place count 423 transition count 1226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 388 place count 422 transition count 1222
Iterating global reduction 1 with 1 rules applied. Total rules applied 389 place count 422 transition count 1222
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 390 place count 421 transition count 1218
Iterating global reduction 1 with 1 rules applied. Total rules applied 391 place count 421 transition count 1218
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 392 place count 420 transition count 1216
Iterating global reduction 1 with 1 rules applied. Total rules applied 393 place count 420 transition count 1216
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 394 place count 419 transition count 1214
Iterating global reduction 1 with 1 rules applied. Total rules applied 395 place count 419 transition count 1214
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 396 place count 418 transition count 1212
Iterating global reduction 1 with 1 rules applied. Total rules applied 397 place count 418 transition count 1212
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 398 place count 417 transition count 1210
Iterating global reduction 1 with 1 rules applied. Total rules applied 399 place count 417 transition count 1210
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 400 place count 416 transition count 1208
Iterating global reduction 1 with 1 rules applied. Total rules applied 401 place count 416 transition count 1208
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 403 place count 416 transition count 1206
Applied a total of 403 rules in 159 ms. Remains 416 /616 variables (removed 200) and now considering 1206/1612 (removed 406) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 159 ms. Remains : 416/616 places, 1206/1612 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 583871 steps, run timeout after 3001 ms. (steps per millisecond=194 ) properties seen :{}
Probabilistic random walk after 583871 steps, saw 358018 distinct states, run finished after 3001 ms. (steps per millisecond=194 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 06:43:31] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
// Phase 1: matrix 681 rows 416 cols
[2024-05-24 06:43:31] [INFO ] Computed 3 invariants in 9 ms
[2024-05-24 06:43:31] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 06:43:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-24 06:43:31] [INFO ] After 156ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 06:43:31] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-24 06:43:31] [INFO ] After 32ms SMT Verify possible using 74 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 06:43:31] [INFO ] After 65ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2024-05-24 06:43:31] [INFO ] After 314ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1206/1206 transitions.
Applied a total of 0 rules in 45 ms. Remains 416 /416 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 416/416 places, 1206/1206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1206/1206 transitions.
Applied a total of 0 rules in 45 ms. Remains 416 /416 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2024-05-24 06:43:31] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-24 06:43:31] [INFO ] Invariant cache hit.
[2024-05-24 06:43:31] [INFO ] Implicit Places using invariants in 280 ms returned []
[2024-05-24 06:43:31] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-24 06:43:31] [INFO ] Invariant cache hit.
[2024-05-24 06:43:31] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-24 06:43:32] [INFO ] Implicit Places using invariants and state equation in 960 ms returned []
Implicit Place search using SMT with State Equation took 1242 ms to find 0 implicit places.
[2024-05-24 06:43:32] [INFO ] Redundant transitions in 18 ms returned []
[2024-05-24 06:43:32] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-24 06:43:32] [INFO ] Invariant cache hit.
[2024-05-24 06:43:33] [INFO ] Dead Transitions using invariants and state equation in 356 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1670 ms. Remains : 416/416 places, 1206/1206 transitions.
Ensure Unique test removed 525 transitions
Reduce isomorphic transitions removed 525 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 536 rules applied. Total rules applied 536 place count 416 transition count 670
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 547 place count 405 transition count 670
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 69 Pre rules applied. Total rules applied 547 place count 405 transition count 601
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 2 with 138 rules applied. Total rules applied 685 place count 336 transition count 601
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 939 place count 209 transition count 474
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1003 place count 145 transition count 346
Iterating global reduction 2 with 64 rules applied. Total rules applied 1067 place count 145 transition count 346
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1068 place count 145 transition count 345
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1068 place count 145 transition count 344
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1070 place count 144 transition count 344
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1133 place count 81 transition count 218
Iterating global reduction 3 with 63 rules applied. Total rules applied 1196 place count 81 transition count 218
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1259 place count 18 transition count 92
Iterating global reduction 3 with 63 rules applied. Total rules applied 1322 place count 18 transition count 92
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1385 place count 18 transition count 29
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1385 place count 18 transition count 28
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 1387 place count 17 transition count 28
Applied a total of 1387 rules in 44 ms. Remains 17 /416 variables (removed 399) and now considering 28/1206 (removed 1178) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 28 rows 17 cols
[2024-05-24 06:43:33] [INFO ] Computed 3 invariants in 1 ms
[2024-05-24 06:43:33] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 06:43:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-24 06:43:33] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 06:43:33] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 06:43:33] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 06:43:33] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-24 06:43:33] [INFO ] After 45ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 531 ms.
Product exploration explored 100000 steps with 25000 reset in 538 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 616 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 616/616 places, 1612/1612 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 615 transition count 1610
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 614 transition count 1606
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 614 transition count 1606
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 613 transition count 1602
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 613 transition count 1602
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 612 transition count 1600
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 612 transition count 1600
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 611 transition count 1598
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 611 transition count 1598
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 610 transition count 1596
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 610 transition count 1596
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 609 transition count 1594
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 609 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 608 transition count 1592
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 608 transition count 1592
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 608 transition count 1590
Applied a total of 18 rules in 374 ms. Remains 608 /616 variables (removed 8) and now considering 1590/1612 (removed 22) transitions.
[2024-05-24 06:43:35] [INFO ] Redundant transitions in 22 ms returned []
[2024-05-24 06:43:35] [INFO ] Flow matrix only has 1063 transitions (discarded 527 similar events)
// Phase 1: matrix 1063 rows 608 cols
[2024-05-24 06:43:35] [INFO ] Computed 2 invariants in 10 ms
[2024-05-24 06:43:36] [INFO ] Dead Transitions using invariants and state equation in 519 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 608/616 places, 1590/1612 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 927 ms. Remains : 608/616 places, 1590/1612 transitions.
Built C files in :
/tmp/ltsmin4286796562159316100
[2024-05-24 06:43:36] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4286796562159316100
Running compilation step : cd /tmp/ltsmin4286796562159316100;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2801 ms.
Running link step : cd /tmp/ltsmin4286796562159316100;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin4286796562159316100;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5314422753034377636.hoa' '--buchi-type=spotba'
LTSmin run took 511 ms.
FORMULA FunctionPointer-PT-c016-LTLCardinality-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FunctionPointer-PT-c016-LTLCardinality-03 finished in 27307 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(G(p1))))'
Support contains 2 out of 665 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 665/665 places, 1732/1732 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 664 transition count 1732
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 655 transition count 1712
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 655 transition count 1712
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 25 place count 655 transition count 1706
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 34 place count 646 transition count 1682
Iterating global reduction 2 with 9 rules applied. Total rules applied 43 place count 646 transition count 1682
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 51 place count 638 transition count 1662
Iterating global reduction 2 with 8 rules applied. Total rules applied 59 place count 638 transition count 1662
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 65 place count 632 transition count 1648
Iterating global reduction 2 with 6 rules applied. Total rules applied 71 place count 632 transition count 1648
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 76 place count 627 transition count 1636
Iterating global reduction 2 with 5 rules applied. Total rules applied 81 place count 627 transition count 1636
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 86 place count 622 transition count 1624
Iterating global reduction 2 with 5 rules applied. Total rules applied 91 place count 622 transition count 1624
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 96 place count 617 transition count 1612
Iterating global reduction 2 with 5 rules applied. Total rules applied 101 place count 617 transition count 1612
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 105 place count 613 transition count 1604
Iterating global reduction 2 with 4 rules applied. Total rules applied 109 place count 613 transition count 1604
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 111 place count 611 transition count 1600
Iterating global reduction 2 with 2 rules applied. Total rules applied 113 place count 611 transition count 1600
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 115 place count 609 transition count 1596
Iterating global reduction 2 with 2 rules applied. Total rules applied 117 place count 609 transition count 1596
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 118 place count 608 transition count 1594
Iterating global reduction 2 with 1 rules applied. Total rules applied 119 place count 608 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 120 place count 607 transition count 1592
Iterating global reduction 2 with 1 rules applied. Total rules applied 121 place count 607 transition count 1592
Applied a total of 121 rules in 156 ms. Remains 607 /665 variables (removed 58) and now considering 1592/1732 (removed 140) transitions.
[2024-05-24 06:43:39] [INFO ] Flow matrix only has 1063 transitions (discarded 529 similar events)
// Phase 1: matrix 1063 rows 607 cols
[2024-05-24 06:43:39] [INFO ] Computed 2 invariants in 11 ms
[2024-05-24 06:43:40] [INFO ] Implicit Places using invariants in 363 ms returned []
[2024-05-24 06:43:40] [INFO ] Flow matrix only has 1063 transitions (discarded 529 similar events)
[2024-05-24 06:43:40] [INFO ] Invariant cache hit.
[2024-05-24 06:43:40] [INFO ] State equation strengthened by 264 read => feed constraints.
[2024-05-24 06:43:41] [INFO ] Implicit Places using invariants and state equation in 1471 ms returned []
Implicit Place search using SMT with State Equation took 1838 ms to find 0 implicit places.
[2024-05-24 06:43:41] [INFO ] Flow matrix only has 1063 transitions (discarded 529 similar events)
[2024-05-24 06:43:41] [INFO ] Invariant cache hit.
[2024-05-24 06:43:41] [INFO ] Dead Transitions using invariants and state equation in 462 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 607/665 places, 1592/1732 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2458 ms. Remains : 607/665 places, 1592/1732 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), true, (AND p1 (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-c016-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(LEQ s76 0), p0:(LEQ s521 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33267 reset in 581 ms.
Product exploration explored 100000 steps with 33349 reset in 583 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/607 stabilizing places and 512/1592 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X p1), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 161 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (NOT p1), true, (AND p1 (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :4
Running SMT prover for 1 properties.
[2024-05-24 06:43:43] [INFO ] Flow matrix only has 1063 transitions (discarded 529 similar events)
[2024-05-24 06:43:43] [INFO ] Invariant cache hit.
[2024-05-24 06:43:43] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 06:43:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 06:43:43] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 06:43:44] [INFO ] After 239ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 06:43:44] [INFO ] State equation strengthened by 264 read => feed constraints.
[2024-05-24 06:43:44] [INFO ] After 61ms SMT Verify possible using 264 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 06:43:44] [INFO ] After 125ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2024-05-24 06:43:44] [INFO ] After 488ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 607 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 607/607 places, 1592/1592 transitions.
Graph (complete) has 2656 edges and 607 vertex of which 415 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.1 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 415 transition count 1208
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 387 place count 415 transition count 1206
Applied a total of 387 rules in 86 ms. Remains 415 /607 variables (removed 192) and now considering 1206/1592 (removed 386) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 415/607 places, 1206/1592 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 625871 steps, run timeout after 3001 ms. (steps per millisecond=208 ) properties seen :{}
Probabilistic random walk after 625871 steps, saw 383771 distinct states, run finished after 3001 ms. (steps per millisecond=208 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 06:43:47] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
// Phase 1: matrix 680 rows 415 cols
[2024-05-24 06:43:47] [INFO ] Computed 3 invariants in 6 ms
[2024-05-24 06:43:47] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 06:43:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-24 06:43:47] [INFO ] After 150ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 06:43:47] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-24 06:43:47] [INFO ] After 56ms SMT Verify possible using 74 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 06:43:47] [INFO ] After 89ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2024-05-24 06:43:47] [INFO ] After 319ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 415 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 47 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 415/415 places, 1206/1206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 44 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2024-05-24 06:43:47] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2024-05-24 06:43:47] [INFO ] Invariant cache hit.
[2024-05-24 06:43:48] [INFO ] Implicit Places using invariants in 271 ms returned []
[2024-05-24 06:43:48] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2024-05-24 06:43:48] [INFO ] Invariant cache hit.
[2024-05-24 06:43:48] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-24 06:43:49] [INFO ] Implicit Places using invariants and state equation in 790 ms returned []
Implicit Place search using SMT with State Equation took 1075 ms to find 0 implicit places.
[2024-05-24 06:43:49] [INFO ] Redundant transitions in 15 ms returned []
[2024-05-24 06:43:49] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2024-05-24 06:43:49] [INFO ] Invariant cache hit.
[2024-05-24 06:43:49] [INFO ] Dead Transitions using invariants and state equation in 351 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1499 ms. Remains : 415/415 places, 1206/1206 transitions.
Ensure Unique test removed 526 transitions
Reduce isomorphic transitions removed 526 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 536 rules applied. Total rules applied 536 place count 415 transition count 670
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 546 place count 405 transition count 670
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 67 Pre rules applied. Total rules applied 546 place count 405 transition count 603
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 134 rules applied. Total rules applied 680 place count 338 transition count 603
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 256 rules applied. Total rules applied 936 place count 210 transition count 475
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1000 place count 146 transition count 347
Iterating global reduction 2 with 64 rules applied. Total rules applied 1064 place count 146 transition count 347
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1065 place count 146 transition count 346
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1065 place count 146 transition count 345
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1067 place count 145 transition count 345
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1130 place count 82 transition count 219
Iterating global reduction 3 with 63 rules applied. Total rules applied 1193 place count 82 transition count 219
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1255 place count 20 transition count 95
Iterating global reduction 3 with 62 rules applied. Total rules applied 1317 place count 20 transition count 95
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Iterating post reduction 3 with 61 rules applied. Total rules applied 1378 place count 20 transition count 34
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 1380 place count 19 transition count 35
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 1386 place count 19 transition count 29
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1387 place count 19 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1388 place count 18 transition count 28
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1389 place count 18 transition count 27
Applied a total of 1389 rules in 27 ms. Remains 18 /415 variables (removed 397) and now considering 27/1206 (removed 1179) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 27 rows 18 cols
[2024-05-24 06:43:49] [INFO ] Computed 3 invariants in 0 ms
[2024-05-24 06:43:49] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 06:43:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 06:43:49] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 06:43:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 06:43:49] [INFO ] After 1ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 06:43:49] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2024-05-24 06:43:49] [INFO ] After 42ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X p1), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (NOT p1)), (F (NOT (AND p1 p0))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 14 factoid took 389 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (NOT p1), true, (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (NOT p1), true, (AND p1 (NOT p0))]
Support contains 2 out of 607 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 607/607 places, 1592/1592 transitions.
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 607 transition count 1590
Applied a total of 2 rules in 143 ms. Remains 607 /607 variables (removed 0) and now considering 1590/1592 (removed 2) transitions.
[2024-05-24 06:43:50] [INFO ] Flow matrix only has 1062 transitions (discarded 528 similar events)
// Phase 1: matrix 1062 rows 607 cols
[2024-05-24 06:43:50] [INFO ] Computed 2 invariants in 12 ms
[2024-05-24 06:43:50] [INFO ] Implicit Places using invariants in 386 ms returned []
[2024-05-24 06:43:50] [INFO ] Flow matrix only has 1062 transitions (discarded 528 similar events)
[2024-05-24 06:43:50] [INFO ] Invariant cache hit.
[2024-05-24 06:43:50] [INFO ] State equation strengthened by 264 read => feed constraints.
[2024-05-24 06:43:52] [INFO ] Implicit Places using invariants and state equation in 1937 ms returned []
Implicit Place search using SMT with State Equation took 2326 ms to find 0 implicit places.
[2024-05-24 06:43:52] [INFO ] Redundant transitions in 24 ms returned []
[2024-05-24 06:43:52] [INFO ] Flow matrix only has 1062 transitions (discarded 528 similar events)
[2024-05-24 06:43:52] [INFO ] Invariant cache hit.
[2024-05-24 06:43:53] [INFO ] Dead Transitions using invariants and state equation in 471 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 607/607 places, 1590/1592 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2973 ms. Remains : 607/607 places, 1590/1592 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/607 stabilizing places and 512/1590 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p1), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 156 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[(NOT p1), (NOT p1), true, (AND p1 (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-24 06:43:53] [INFO ] Flow matrix only has 1062 transitions (discarded 528 similar events)
[2024-05-24 06:43:53] [INFO ] Invariant cache hit.
[2024-05-24 06:43:53] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 06:43:53] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-24 06:43:53] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 06:43:53] [INFO ] After 253ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 06:43:53] [INFO ] State equation strengthened by 264 read => feed constraints.
[2024-05-24 06:43:54] [INFO ] After 117ms SMT Verify possible using 264 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 06:43:54] [INFO ] After 222ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 62 ms.
[2024-05-24 06:43:54] [INFO ] After 632ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 607 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 607/607 places, 1590/1590 transitions.
Graph (complete) has 2655 edges and 607 vertex of which 415 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.0 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 415 transition count 1206
Applied a total of 385 rules in 44 ms. Remains 415 /607 variables (removed 192) and now considering 1206/1590 (removed 384) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 415/607 places, 1206/1590 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2024-05-24 06:43:54] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
// Phase 1: matrix 680 rows 415 cols
[2024-05-24 06:43:54] [INFO ] Computed 3 invariants in 7 ms
[2024-05-24 06:43:54] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 06:43:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-24 06:43:54] [INFO ] After 152ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 06:43:54] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-24 06:43:54] [INFO ] After 39ms SMT Verify possible using 74 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 06:43:54] [INFO ] After 72ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2024-05-24 06:43:54] [INFO ] After 310ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 415 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 42 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 415/415 places, 1206/1206 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 623332 steps, run timeout after 3001 ms. (steps per millisecond=207 ) properties seen :{}
Probabilistic random walk after 623332 steps, saw 382214 distinct states, run finished after 3001 ms. (steps per millisecond=207 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 06:43:57] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2024-05-24 06:43:57] [INFO ] Invariant cache hit.
[2024-05-24 06:43:57] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 06:43:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-24 06:43:58] [INFO ] After 148ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 06:43:58] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-24 06:43:58] [INFO ] After 36ms SMT Verify possible using 74 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 06:43:58] [INFO ] After 71ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2024-05-24 06:43:58] [INFO ] After 307ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 415 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 43 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 415/415 places, 1206/1206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 41 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2024-05-24 06:43:58] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2024-05-24 06:43:58] [INFO ] Invariant cache hit.
[2024-05-24 06:43:58] [INFO ] Implicit Places using invariants in 275 ms returned []
[2024-05-24 06:43:58] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2024-05-24 06:43:58] [INFO ] Invariant cache hit.
[2024-05-24 06:43:58] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-24 06:43:59] [INFO ] Implicit Places using invariants and state equation in 885 ms returned []
Implicit Place search using SMT with State Equation took 1162 ms to find 0 implicit places.
[2024-05-24 06:43:59] [INFO ] Redundant transitions in 17 ms returned []
[2024-05-24 06:43:59] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2024-05-24 06:43:59] [INFO ] Invariant cache hit.
[2024-05-24 06:43:59] [INFO ] Dead Transitions using invariants and state equation in 359 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1590 ms. Remains : 415/415 places, 1206/1206 transitions.
Ensure Unique test removed 526 transitions
Reduce isomorphic transitions removed 526 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 536 rules applied. Total rules applied 536 place count 415 transition count 670
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 546 place count 405 transition count 670
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 67 Pre rules applied. Total rules applied 546 place count 405 transition count 603
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 134 rules applied. Total rules applied 680 place count 338 transition count 603
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 1 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 256 rules applied. Total rules applied 936 place count 210 transition count 475
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1000 place count 146 transition count 347
Iterating global reduction 2 with 64 rules applied. Total rules applied 1064 place count 146 transition count 347
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1065 place count 146 transition count 346
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1065 place count 146 transition count 345
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1067 place count 145 transition count 345
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1130 place count 82 transition count 219
Iterating global reduction 3 with 63 rules applied. Total rules applied 1193 place count 82 transition count 219
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1255 place count 20 transition count 95
Iterating global reduction 3 with 62 rules applied. Total rules applied 1317 place count 20 transition count 95
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Iterating post reduction 3 with 61 rules applied. Total rules applied 1378 place count 20 transition count 34
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 1380 place count 19 transition count 35
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 1386 place count 19 transition count 29
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1387 place count 19 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1388 place count 18 transition count 28
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1389 place count 18 transition count 27
Applied a total of 1389 rules in 27 ms. Remains 18 /415 variables (removed 397) and now considering 27/1206 (removed 1179) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 27 rows 18 cols
[2024-05-24 06:43:59] [INFO ] Computed 3 invariants in 0 ms
[2024-05-24 06:43:59] [INFO ] After 15ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 06:43:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 06:43:59] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 06:43:59] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 06:43:59] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 06:43:59] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-24 06:43:59] [INFO ] After 34ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p1), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1))), (F (NOT p1)), (F (NOT (AND p0 p1)))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p0) (NOT p1)))
Knowledge based reduction with 13 factoid took 165 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-c016-LTLCardinality-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-c016-LTLCardinality-06 finished in 20640 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 3 out of 665 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 665/665 places, 1732/1732 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 664 transition count 1732
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 655 transition count 1712
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 655 transition count 1712
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 27 place count 655 transition count 1704
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 36 place count 646 transition count 1682
Iterating global reduction 2 with 9 rules applied. Total rules applied 45 place count 646 transition count 1682
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 52 place count 639 transition count 1666
Iterating global reduction 2 with 7 rules applied. Total rules applied 59 place count 639 transition count 1666
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 64 place count 634 transition count 1654
Iterating global reduction 2 with 5 rules applied. Total rules applied 69 place count 634 transition count 1654
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 73 place count 630 transition count 1644
Iterating global reduction 2 with 4 rules applied. Total rules applied 77 place count 630 transition count 1644
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 81 place count 626 transition count 1634
Iterating global reduction 2 with 4 rules applied. Total rules applied 85 place count 626 transition count 1634
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 89 place count 622 transition count 1624
Iterating global reduction 2 with 4 rules applied. Total rules applied 93 place count 622 transition count 1624
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 96 place count 619 transition count 1618
Iterating global reduction 2 with 3 rules applied. Total rules applied 99 place count 619 transition count 1618
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 101 place count 617 transition count 1614
Iterating global reduction 2 with 2 rules applied. Total rules applied 103 place count 617 transition count 1614
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 105 place count 615 transition count 1610
Iterating global reduction 2 with 2 rules applied. Total rules applied 107 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 108 place count 614 transition count 1608
Iterating global reduction 2 with 1 rules applied. Total rules applied 109 place count 614 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 110 place count 613 transition count 1606
Iterating global reduction 2 with 1 rules applied. Total rules applied 111 place count 613 transition count 1606
Applied a total of 111 rules in 184 ms. Remains 613 /665 variables (removed 52) and now considering 1606/1732 (removed 126) transitions.
[2024-05-24 06:44:00] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
// Phase 1: matrix 1072 rows 613 cols
[2024-05-24 06:44:00] [INFO ] Computed 2 invariants in 14 ms
[2024-05-24 06:44:00] [INFO ] Implicit Places using invariants in 380 ms returned []
[2024-05-24 06:44:00] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2024-05-24 06:44:00] [INFO ] Invariant cache hit.
[2024-05-24 06:44:00] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 06:44:02] [INFO ] Implicit Places using invariants and state equation in 1515 ms returned []
Implicit Place search using SMT with State Equation took 1910 ms to find 0 implicit places.
[2024-05-24 06:44:02] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2024-05-24 06:44:02] [INFO ] Invariant cache hit.
[2024-05-24 06:44:02] [INFO ] Dead Transitions using invariants and state equation in 479 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 613/665 places, 1606/1732 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2573 ms. Remains : 613/665 places, 1606/1732 transitions.
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c016-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (LEQ s533 s474) (LEQ s70 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 362 steps with 1 reset in 8 ms.
FORMULA FunctionPointer-PT-c016-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c016-LTLCardinality-07 finished in 2722 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 665 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 665/665 places, 1732/1732 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 664 transition count 1732
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 654 transition count 1710
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 654 transition count 1710
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 29 place count 654 transition count 1702
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 39 place count 644 transition count 1676
Iterating global reduction 2 with 10 rules applied. Total rules applied 49 place count 644 transition count 1676
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 57 place count 636 transition count 1656
Iterating global reduction 2 with 8 rules applied. Total rules applied 65 place count 636 transition count 1656
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 71 place count 630 transition count 1642
Iterating global reduction 2 with 6 rules applied. Total rules applied 77 place count 630 transition count 1642
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 82 place count 625 transition count 1630
Iterating global reduction 2 with 5 rules applied. Total rules applied 87 place count 625 transition count 1630
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 92 place count 620 transition count 1618
Iterating global reduction 2 with 5 rules applied. Total rules applied 97 place count 620 transition count 1618
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 102 place count 615 transition count 1606
Iterating global reduction 2 with 5 rules applied. Total rules applied 107 place count 615 transition count 1606
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 111 place count 611 transition count 1598
Iterating global reduction 2 with 4 rules applied. Total rules applied 115 place count 611 transition count 1598
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 117 place count 609 transition count 1594
Iterating global reduction 2 with 2 rules applied. Total rules applied 119 place count 609 transition count 1594
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 121 place count 607 transition count 1590
Iterating global reduction 2 with 2 rules applied. Total rules applied 123 place count 607 transition count 1590
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 124 place count 606 transition count 1588
Iterating global reduction 2 with 1 rules applied. Total rules applied 125 place count 606 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 126 place count 605 transition count 1586
Iterating global reduction 2 with 1 rules applied. Total rules applied 127 place count 605 transition count 1586
Applied a total of 127 rules in 168 ms. Remains 605 /665 variables (removed 60) and now considering 1586/1732 (removed 146) transitions.
[2024-05-24 06:44:03] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
// Phase 1: matrix 1058 rows 605 cols
[2024-05-24 06:44:03] [INFO ] Computed 2 invariants in 5 ms
[2024-05-24 06:44:03] [INFO ] Implicit Places using invariants in 370 ms returned []
[2024-05-24 06:44:03] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2024-05-24 06:44:03] [INFO ] Invariant cache hit.
[2024-05-24 06:44:03] [INFO ] State equation strengthened by 262 read => feed constraints.
[2024-05-24 06:44:04] [INFO ] Implicit Places using invariants and state equation in 1573 ms returned []
Implicit Place search using SMT with State Equation took 1945 ms to find 0 implicit places.
[2024-05-24 06:44:04] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2024-05-24 06:44:04] [INFO ] Invariant cache hit.
[2024-05-24 06:44:05] [INFO ] Dead Transitions using invariants and state equation in 463 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 605/665 places, 1586/1732 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2577 ms. Remains : 605/665 places, 1586/1732 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : FunctionPointer-PT-c016-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 3 s242)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-c016-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c016-LTLCardinality-11 finished in 2666 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 665 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 665/665 places, 1732/1732 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 664 transition count 1732
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 655 transition count 1712
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 655 transition count 1712
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 25 place count 655 transition count 1706
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 34 place count 646 transition count 1682
Iterating global reduction 2 with 9 rules applied. Total rules applied 43 place count 646 transition count 1682
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 51 place count 638 transition count 1662
Iterating global reduction 2 with 8 rules applied. Total rules applied 59 place count 638 transition count 1662
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 65 place count 632 transition count 1648
Iterating global reduction 2 with 6 rules applied. Total rules applied 71 place count 632 transition count 1648
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 76 place count 627 transition count 1636
Iterating global reduction 2 with 5 rules applied. Total rules applied 81 place count 627 transition count 1636
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 86 place count 622 transition count 1624
Iterating global reduction 2 with 5 rules applied. Total rules applied 91 place count 622 transition count 1624
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 96 place count 617 transition count 1612
Iterating global reduction 2 with 5 rules applied. Total rules applied 101 place count 617 transition count 1612
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 105 place count 613 transition count 1604
Iterating global reduction 2 with 4 rules applied. Total rules applied 109 place count 613 transition count 1604
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 111 place count 611 transition count 1600
Iterating global reduction 2 with 2 rules applied. Total rules applied 113 place count 611 transition count 1600
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 115 place count 609 transition count 1596
Iterating global reduction 2 with 2 rules applied. Total rules applied 117 place count 609 transition count 1596
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 118 place count 608 transition count 1594
Iterating global reduction 2 with 1 rules applied. Total rules applied 119 place count 608 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 120 place count 607 transition count 1592
Iterating global reduction 2 with 1 rules applied. Total rules applied 121 place count 607 transition count 1592
Applied a total of 121 rules in 184 ms. Remains 607 /665 variables (removed 58) and now considering 1592/1732 (removed 140) transitions.
[2024-05-24 06:44:05] [INFO ] Flow matrix only has 1063 transitions (discarded 529 similar events)
// Phase 1: matrix 1063 rows 607 cols
[2024-05-24 06:44:05] [INFO ] Computed 2 invariants in 12 ms
[2024-05-24 06:44:06] [INFO ] Implicit Places using invariants in 369 ms returned []
[2024-05-24 06:44:06] [INFO ] Flow matrix only has 1063 transitions (discarded 529 similar events)
[2024-05-24 06:44:06] [INFO ] Invariant cache hit.
[2024-05-24 06:44:06] [INFO ] State equation strengthened by 264 read => feed constraints.
[2024-05-24 06:44:08] [INFO ] Implicit Places using invariants and state equation in 2649 ms returned []
Implicit Place search using SMT with State Equation took 3022 ms to find 0 implicit places.
[2024-05-24 06:44:08] [INFO ] Flow matrix only has 1063 transitions (discarded 529 similar events)
[2024-05-24 06:44:08] [INFO ] Invariant cache hit.
[2024-05-24 06:44:09] [INFO ] Dead Transitions using invariants and state equation in 472 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 607/665 places, 1592/1732 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3680 ms. Remains : 607/665 places, 1592/1732 transitions.
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c016-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GT s521 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-c016-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c016-LTLCardinality-13 finished in 3807 ms.
All properties solved by simple procedures.
Total runtime 77075 ms.

BK_STOP 1716533050307

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FunctionPointer-PT-c016"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is FunctionPointer-PT-c016, 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 r197-tall-171640625100187"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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