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.r378-smll-171683810800109.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is SieveSingleMsgMbox-PT-d2m06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r378-smll-171683810800109
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 19:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 12 19:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 12 19:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 12 19:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.1M May 18 16:43 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716930649882

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d2m06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-28 21:10:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 21:10:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 21:10:52] [INFO ] Load time of PNML (sax parser for PT used): 494 ms
[2024-05-28 21:10:52] [INFO ] Transformed 2398 places.
[2024-05-28 21:10:52] [INFO ] Transformed 1954 transitions.
[2024-05-28 21:10:53] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 752 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 ms.
Deduced a syphon composed of 1984 places in 24 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0] Max Struct:[+inf, +inf, +inf]
// Phase 1: matrix 1954 rows 414 cols
[2024-05-28 21:10:53] [INFO ] Computed 6 invariants in 65 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[42, 1, 42]
RANDOM walk for 10000 steps (2192 resets) in 471 ms. (21 steps per ms)
BEST_FIRST walk for 30001 steps (2834 resets) in 334 ms. (89 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[42, 1, 42]
[2024-05-28 21:10:54] [INFO ] Invariant cache hit.
[2024-05-28 21:10:54] [INFO ] [Real]Absence check using 3 positive place invariants in 15 ms returned sat
[2024-05-28 21:10:54] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 11 ms returned sat
[2024-05-28 21:10:55] [INFO ] [Real]Absence check using state equation in 945 ms returned sat
[2024-05-28 21:10:55] [INFO ] State equation strengthened by 1674 read => feed constraints.
[2024-05-28 21:10:56] [INFO ] [Real]Added 1674 Read/Feed constraints in 855 ms returned sat
[2024-05-28 21:10:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:10:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-28 21:10:56] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2024-05-28 21:10:57] [INFO ] [Nat]Absence check using state equation in 546 ms returned sat
[2024-05-28 21:10:58] [INFO ] [Nat]Added 1674 Read/Feed constraints in 1112 ms returned sat
[2024-05-28 21:10:59] [INFO ] Computed and/alt/rep : 141/395/141 causal constraints (skipped 1812 transitions) in 485 ms.
[2024-05-28 21:11:01] [INFO ] Deduced a trap composed of 24 places in 752 ms of which 72 ms to minimize.
[2024-05-28 21:11:02] [INFO ] Deduced a trap composed of 31 places in 713 ms of which 8 ms to minimize.
[2024-05-28 21:11:02] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1128)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-28 21:11:02] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2024-05-28 21:11:02] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 7 ms returned sat
[2024-05-28 21:11:03] [INFO ] [Real]Absence check using state equation in 669 ms returned sat
[2024-05-28 21:11:03] [INFO ] [Real]Added 1674 Read/Feed constraints in 474 ms returned sat
[2024-05-28 21:11:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:11:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2024-05-28 21:11:03] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 6 ms returned sat
[2024-05-28 21:11:04] [INFO ] [Nat]Absence check using state equation in 681 ms returned sat
[2024-05-28 21:11:04] [INFO ] [Nat]Added 1674 Read/Feed constraints in 440 ms returned sat
[2024-05-28 21:11:05] [INFO ] Deduced a trap composed of 45 places in 641 ms of which 9 ms to minimize.
[2024-05-28 21:11:06] [INFO ] Deduced a trap composed of 44 places in 624 ms of which 8 ms to minimize.
[2024-05-28 21:11:06] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 1971 ms
[2024-05-28 21:11:07] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2024-05-28 21:11:07] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 7 ms returned sat
[2024-05-28 21:11:07] [INFO ] [Real]Absence check using state equation in 778 ms returned sat
[2024-05-28 21:11:08] [INFO ] [Real]Added 1674 Read/Feed constraints in 852 ms returned sat
[2024-05-28 21:11:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:11:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2024-05-28 21:11:08] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 5 ms returned sat
[2024-05-28 21:11:09] [INFO ] [Nat]Absence check using state equation in 753 ms returned sat
[2024-05-28 21:11:10] [INFO ] [Nat]Added 1674 Read/Feed constraints in 862 ms returned sat
[2024-05-28 21:11:10] [INFO ] Computed and/alt/rep : 141/395/141 causal constraints (skipped 1812 transitions) in 251 ms.
[2024-05-28 21:11:12] [INFO ] Deduced a trap composed of 24 places in 697 ms of which 8 ms to minimize.
[2024-05-28 21:11:13] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 1303 ms
Maximisation of solution failed !
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[42, 1, 42]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[42, 1, 42]
Support contains 3 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Graph (complete) has 2618 edges and 414 vertex of which 388 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.14 ms
Discarding 26 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 830 transitions.
Iterating post reduction 0 with 830 rules applied. Total rules applied 831 place count 388 transition count 1124
Discarding 119 places :
Symmetric choice reduction at 1 with 119 rule applications. Total rules 950 place count 269 transition count 372
Iterating global reduction 1 with 119 rules applied. Total rules applied 1069 place count 269 transition count 372
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 1079 place count 269 transition count 362
Discarding 90 places :
Symmetric choice reduction at 2 with 90 rule applications. Total rules 1169 place count 179 transition count 272
Iterating global reduction 2 with 90 rules applied. Total rules applied 1259 place count 179 transition count 272
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 1293 place count 179 transition count 238
Discarding 37 places :
Symmetric choice reduction at 3 with 37 rule applications. Total rules 1330 place count 142 transition count 188
Iterating global reduction 3 with 37 rules applied. Total rules applied 1367 place count 142 transition count 188
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 3 with 22 rules applied. Total rules applied 1389 place count 142 transition count 166
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1397 place count 134 transition count 154
Iterating global reduction 4 with 8 rules applied. Total rules applied 1405 place count 134 transition count 154
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1413 place count 126 transition count 146
Iterating global reduction 4 with 8 rules applied. Total rules applied 1421 place count 126 transition count 146
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1425 place count 122 transition count 141
Iterating global reduction 4 with 4 rules applied. Total rules applied 1429 place count 122 transition count 141
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1430 place count 122 transition count 140
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1434 place count 118 transition count 136
Iterating global reduction 5 with 4 rules applied. Total rules applied 1438 place count 118 transition count 136
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1441 place count 115 transition count 133
Iterating global reduction 5 with 3 rules applied. Total rules applied 1444 place count 115 transition count 133
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1445 place count 114 transition count 132
Iterating global reduction 5 with 1 rules applied. Total rules applied 1446 place count 114 transition count 132
Applied a total of 1446 rules in 274 ms. Remains 114 /414 variables (removed 300) and now considering 132/1954 (removed 1822) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 295 ms. Remains : 114/414 places, 132/1954 transitions.
// Phase 1: matrix 132 rows 114 cols
[2024-05-28 21:11:14] [INFO ] Computed 4 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[42, 1, 42]
RANDOM walk for 1000000 steps (224632 resets) in 1526 ms. (654 steps per ms)
BEST_FIRST walk for 3000001 steps (309860 resets) in 1829 ms. (1639 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[42, 1, 42]
[2024-05-28 21:11:17] [INFO ] Invariant cache hit.
[2024-05-28 21:11:17] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 21:11:17] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-28 21:11:17] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-05-28 21:11:17] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-28 21:11:17] [INFO ] [Real]Added 49 Read/Feed constraints in 11 ms returned sat
[2024-05-28 21:11:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:11:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 21:11:17] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 21:11:17] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2024-05-28 21:11:17] [INFO ] [Nat]Added 49 Read/Feed constraints in 15 ms returned sat
[2024-05-28 21:11:17] [INFO ] Computed and/alt/rep : 31/86/31 causal constraints (skipped 100 transitions) in 11 ms.
[2024-05-28 21:11:17] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 3 ms to minimize.
[2024-05-28 21:11:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2024-05-28 21:11:18] [INFO ] Added : 15 causal constraints over 3 iterations in 192 ms. Result :sat
Minimization took 137 ms.
[2024-05-28 21:11:18] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-28 21:11:18] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-28 21:11:18] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2024-05-28 21:11:18] [INFO ] [Real]Added 49 Read/Feed constraints in 27 ms returned sat
[2024-05-28 21:11:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:11:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-28 21:11:18] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 21:11:18] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2024-05-28 21:11:18] [INFO ] [Nat]Added 49 Read/Feed constraints in 20 ms returned sat
[2024-05-28 21:11:18] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 2 ms to minimize.
[2024-05-28 21:11:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2024-05-28 21:11:18] [INFO ] Computed and/alt/rep : 31/86/31 causal constraints (skipped 100 transitions) in 28 ms.
[2024-05-28 21:11:18] [INFO ] Added : 12 causal constraints over 3 iterations in 98 ms. Result :sat
Minimization took 112 ms.
[2024-05-28 21:11:18] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-28 21:11:18] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-28 21:11:19] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2024-05-28 21:11:19] [INFO ] [Real]Added 49 Read/Feed constraints in 20 ms returned sat
[2024-05-28 21:11:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:11:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 21:11:19] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 21:11:19] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2024-05-28 21:11:19] [INFO ] [Nat]Added 49 Read/Feed constraints in 32 ms returned sat
[2024-05-28 21:11:19] [INFO ] Computed and/alt/rep : 31/86/31 causal constraints (skipped 100 transitions) in 25 ms.
[2024-05-28 21:11:19] [INFO ] Added : 13 causal constraints over 3 iterations in 91 ms. Result :sat
Minimization took 129 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[42, 1, 42]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[42, 1, 42]
Support contains 3 out of 114 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 132/132 transitions.
Applied a total of 0 rules in 18 ms. Remains 114 /114 variables (removed 0) and now considering 132/132 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 114/114 places, 132/132 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 132/132 transitions.
Applied a total of 0 rules in 18 ms. Remains 114 /114 variables (removed 0) and now considering 132/132 (removed 0) transitions.
[2024-05-28 21:11:19] [INFO ] Invariant cache hit.
[2024-05-28 21:11:19] [INFO ] Implicit Places using invariants in 207 ms returned []
[2024-05-28 21:11:19] [INFO ] Invariant cache hit.
[2024-05-28 21:11:20] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-28 21:11:20] [INFO ] Implicit Places using invariants and state equation in 488 ms returned []
Implicit Place search using SMT with State Equation took 698 ms to find 0 implicit places.
[2024-05-28 21:11:20] [INFO ] Redundant transitions in 6 ms returned []
Running 131 sub problems to find dead transitions.
[2024-05-28 21:11:20] [INFO ] Invariant cache hit.
[2024-05-28 21:11:20] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (OVERLAPS) 1/114 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-28 21:11:22] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 132/246 variables, 114/119 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 49/168 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-28 21:11:26] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 2 ms to minimize.
[2024-05-28 21:11:26] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
Problem TDEAD47 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD119 is UNSAT
At refinement iteration 9 (OVERLAPS) 0/246 variables, 2/170 constraints. Problems are: Problem set: 3 solved, 128 unsolved
[2024-05-28 21:11:29] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 2 ms to minimize.
[2024-05-28 21:11:30] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 2/172 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 0/172 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 12 (OVERLAPS) 0/246 variables, 0/172 constraints. Problems are: Problem set: 3 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 172 constraints, problems are : Problem set: 3 solved, 128 unsolved in 14845 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 114/114 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 3 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 2/3 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 3 (OVERLAPS) 4/114 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 2/6 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 3/9 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/9 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 7 (OVERLAPS) 132/246 variables, 114/123 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 49/172 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 128/300 constraints. Problems are: Problem set: 3 solved, 128 unsolved
[2024-05-28 21:11:40] [INFO ] Deduced a trap composed of 53 places in 53 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 1/301 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 0/301 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 12 (OVERLAPS) 0/246 variables, 0/301 constraints. Problems are: Problem set: 3 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 301 constraints, problems are : Problem set: 3 solved, 128 unsolved in 20850 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 114/114 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 128/131 constraints, Known Traps: 6/6 constraints]
After SMT, in 36216ms problems are : Problem set: 3 solved, 128 unsolved
Search for dead transitions found 3 dead transitions in 36244ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 114/114 places, 129/132 transitions.
Graph (complete) has 322 edges and 114 vertex of which 111 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 12 ms. Remains 111 /114 variables (removed 3) and now considering 129/129 (removed 0) transitions.
// Phase 1: matrix 129 rows 111 cols
[2024-05-28 21:11:56] [INFO ] Computed 3 invariants in 2 ms
[2024-05-28 21:11:56] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-28 21:11:56] [INFO ] Invariant cache hit.
[2024-05-28 21:11:56] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-28 21:11:57] [INFO ] Implicit Places using invariants and state equation in 500 ms returned []
Implicit Place search using SMT with State Equation took 638 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 111/114 places, 129/132 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 37648 ms. Remains : 111/114 places, 129/132 transitions.
[2024-05-28 21:11:57] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[42, 1, 42]
RANDOM walk for 1000000 steps (224438 resets) in 1401 ms. (713 steps per ms)
BEST_FIRST walk for 3000001 steps (310518 resets) in 1784 ms. (1680 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[42, 1, 42]
[2024-05-28 21:12:00] [INFO ] Invariant cache hit.
[2024-05-28 21:12:00] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-28 21:12:00] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2024-05-28 21:12:00] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-28 21:12:00] [INFO ] [Real]Added 48 Read/Feed constraints in 15 ms returned sat
[2024-05-28 21:12:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:12:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-28 21:12:00] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2024-05-28 21:12:00] [INFO ] [Nat]Added 48 Read/Feed constraints in 16 ms returned sat
[2024-05-28 21:12:00] [INFO ] Computed and/alt/rep : 30/81/30 causal constraints (skipped 98 transitions) in 12 ms.
[2024-05-28 21:12:00] [INFO ] Added : 12 causal constraints over 3 iterations in 59 ms. Result :sat
Minimization took 62 ms.
[2024-05-28 21:12:00] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-28 21:12:01] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2024-05-28 21:12:01] [INFO ] [Real]Added 48 Read/Feed constraints in 24 ms returned sat
[2024-05-28 21:12:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:12:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-28 21:12:01] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2024-05-28 21:12:01] [INFO ] [Nat]Added 48 Read/Feed constraints in 29 ms returned sat
[2024-05-28 21:12:01] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 2 ms to minimize.
[2024-05-28 21:12:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2024-05-28 21:12:01] [INFO ] Computed and/alt/rep : 30/81/30 causal constraints (skipped 98 transitions) in 18 ms.
[2024-05-28 21:12:01] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 2 ms to minimize.
[2024-05-28 21:12:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2024-05-28 21:12:01] [INFO ] Added : 20 causal constraints over 4 iterations in 226 ms. Result :sat
Minimization took 93 ms.
[2024-05-28 21:12:01] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-28 21:12:01] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2024-05-28 21:12:01] [INFO ] [Real]Added 48 Read/Feed constraints in 14 ms returned sat
[2024-05-28 21:12:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:12:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-28 21:12:01] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2024-05-28 21:12:01] [INFO ] [Nat]Added 48 Read/Feed constraints in 26 ms returned sat
[2024-05-28 21:12:02] [INFO ] Computed and/alt/rep : 30/81/30 causal constraints (skipped 98 transitions) in 14 ms.
[2024-05-28 21:12:02] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 3 ms to minimize.
[2024-05-28 21:12:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2024-05-28 21:12:02] [INFO ] Added : 16 causal constraints over 4 iterations in 230 ms. Result :sat
Minimization took 99 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[42, 1, 42]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[42, 1, 42]
Support contains 3 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 129/129 transitions.
Applied a total of 0 rules in 7 ms. Remains 111 /111 variables (removed 0) and now considering 129/129 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 111/111 places, 129/129 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 129/129 transitions.
Applied a total of 0 rules in 8 ms. Remains 111 /111 variables (removed 0) and now considering 129/129 (removed 0) transitions.
[2024-05-28 21:12:02] [INFO ] Invariant cache hit.
[2024-05-28 21:12:02] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-05-28 21:12:02] [INFO ] Invariant cache hit.
[2024-05-28 21:12:02] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-28 21:12:03] [INFO ] Implicit Places using invariants and state equation in 412 ms returned []
Implicit Place search using SMT with State Equation took 574 ms to find 0 implicit places.
[2024-05-28 21:12:03] [INFO ] Redundant transitions in 4 ms returned []
Running 128 sub problems to find dead transitions.
[2024-05-28 21:12:03] [INFO ] Invariant cache hit.
[2024-05-28 21:12:03] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (OVERLAPS) 1/111 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-05-28 21:12:04] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Problem TDEAD44 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD114 is UNSAT
At refinement iteration 5 (OVERLAPS) 129/240 variables, 111/115 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 48/163 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 0/163 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 8 (OVERLAPS) 0/240 variables, 0/163 constraints. Problems are: Problem set: 3 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 163 constraints, problems are : Problem set: 3 solved, 125 unsolved in 7427 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 3 solved, 125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 2 (OVERLAPS) 1/108 variables, 2/3 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 125 unsolved
[2024-05-28 21:12:12] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 125 unsolved
[2024-05-28 21:12:12] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 1/6 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 7 (OVERLAPS) 128/236 variables, 108/114 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 47/161 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 16/177 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 0/177 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 11 (OVERLAPS) 4/240 variables, 3/180 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/240 variables, 1/181 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/240 variables, 109/290 constraints. Problems are: Problem set: 3 solved, 125 unsolved
[2024-05-28 21:12:21] [INFO ] Deduced a trap composed of 41 places in 32 ms of which 2 ms to minimize.
[2024-05-28 21:12:21] [INFO ] Deduced a trap composed of 58 places in 66 ms of which 2 ms to minimize.
[2024-05-28 21:12:21] [INFO ] Deduced a trap composed of 51 places in 64 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/240 variables, 3/293 constraints. Problems are: Problem set: 3 solved, 125 unsolved
[2024-05-28 21:12:26] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/240 variables, 1/294 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/240 variables, 0/294 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 17 (OVERLAPS) 0/240 variables, 0/294 constraints. Problems are: Problem set: 3 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 294 constraints, problems are : Problem set: 3 solved, 125 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 125/128 constraints, Known Traps: 7/7 constraints]
After SMT, in 37707ms problems are : Problem set: 3 solved, 125 unsolved
Search for dead transitions found 3 dead transitions in 37710ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 111/111 places, 126/129 transitions.
Graph (complete) has 313 edges and 111 vertex of which 108 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 11 ms. Remains 108 /111 variables (removed 3) and now considering 126/126 (removed 0) transitions.
// Phase 1: matrix 126 rows 108 cols
[2024-05-28 21:12:40] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 21:12:40] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-28 21:12:40] [INFO ] Invariant cache hit.
[2024-05-28 21:12:40] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-28 21:12:41] [INFO ] Implicit Places using invariants and state equation in 438 ms returned []
Implicit Place search using SMT with State Equation took 538 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 108/111 places, 126/129 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 38854 ms. Remains : 108/111 places, 126/129 transitions.
[2024-05-28 21:12:41] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[42, 1, 42]
RANDOM walk for 1000000 steps (224085 resets) in 1380 ms. (724 steps per ms)
BEST_FIRST walk for 3000001 steps (309769 resets) in 1888 ms. (1588 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[42, 1, 42]
[2024-05-28 21:12:44] [INFO ] Invariant cache hit.
[2024-05-28 21:12:44] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 21:12:44] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 21:12:44] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-05-28 21:12:44] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-28 21:12:44] [INFO ] [Real]Added 47 Read/Feed constraints in 14 ms returned sat
[2024-05-28 21:12:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:12:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 21:12:44] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 21:12:44] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2024-05-28 21:12:44] [INFO ] [Nat]Added 47 Read/Feed constraints in 14 ms returned sat
[2024-05-28 21:12:44] [INFO ] Computed and/alt/rep : 29/75/29 causal constraints (skipped 96 transitions) in 11 ms.
[2024-05-28 21:12:44] [INFO ] Added : 10 causal constraints over 2 iterations in 47 ms. Result :sat
Minimization took 68 ms.
[2024-05-28 21:12:44] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-28 21:12:44] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 21:12:45] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2024-05-28 21:12:45] [INFO ] [Real]Added 47 Read/Feed constraints in 23 ms returned sat
[2024-05-28 21:12:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:12:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 21:12:45] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 21:12:45] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2024-05-28 21:12:45] [INFO ] [Nat]Added 47 Read/Feed constraints in 28 ms returned sat
[2024-05-28 21:12:45] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 3 ms to minimize.
[2024-05-28 21:12:45] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
[2024-05-28 21:12:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 146 ms
[2024-05-28 21:12:45] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 21:12:45] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-28 21:12:45] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2024-05-28 21:12:45] [INFO ] [Real]Added 47 Read/Feed constraints in 11 ms returned sat
[2024-05-28 21:12:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:12:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 21:12:45] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 21:12:45] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2024-05-28 21:12:45] [INFO ] [Nat]Added 47 Read/Feed constraints in 17 ms returned sat
[2024-05-28 21:12:45] [INFO ] Computed and/alt/rep : 29/75/29 causal constraints (skipped 96 transitions) in 11 ms.
[2024-05-28 21:12:45] [INFO ] Added : 15 causal constraints over 3 iterations in 62 ms. Result :sat
Minimization took 65 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[42, 0, 42]
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[42, 42]
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 126/126 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 107 transition count 125
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 107 transition count 125
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 107 transition count 124
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 106 transition count 122
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 106 transition count 122
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 105 transition count 121
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 105 transition count 121
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 104 transition count 120
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 104 transition count 120
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 103 transition count 119
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 103 transition count 119
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 102 transition count 118
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 102 transition count 118
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 101 transition count 115
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 101 transition count 115
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 100 transition count 114
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 100 transition count 114
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 99 transition count 113
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 99 transition count 113
Applied a total of 19 rules in 33 ms. Remains 99 /108 variables (removed 9) and now considering 113/126 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 99/108 places, 113/126 transitions.
// Phase 1: matrix 113 rows 99 cols
[2024-05-28 21:12:45] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[42, 42]
RANDOM walk for 1000000 steps (224691 resets) in 1040 ms. (960 steps per ms)
BEST_FIRST walk for 2000002 steps (206395 resets) in 1053 ms. (1897 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[42, 42]
[2024-05-28 21:12:47] [INFO ] Invariant cache hit.
[2024-05-28 21:12:47] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-28 21:12:48] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2024-05-28 21:12:48] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-28 21:12:48] [INFO ] [Real]Added 42 Read/Feed constraints in 14 ms returned sat
[2024-05-28 21:12:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:12:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-28 21:12:48] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2024-05-28 21:12:48] [INFO ] [Nat]Added 42 Read/Feed constraints in 20 ms returned sat
[2024-05-28 21:12:48] [INFO ] Computed and/alt/rep : 26/67/26 causal constraints (skipped 86 transitions) in 13 ms.
[2024-05-28 21:12:48] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 2 ms to minimize.
[2024-05-28 21:12:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2024-05-28 21:12:48] [INFO ] Added : 17 causal constraints over 4 iterations in 186 ms. Result :sat
Minimization took 91 ms.
[2024-05-28 21:12:48] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-28 21:12:48] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2024-05-28 21:12:48] [INFO ] [Real]Added 42 Read/Feed constraints in 18 ms returned sat
[2024-05-28 21:12:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:12:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-28 21:12:48] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-05-28 21:12:48] [INFO ] [Nat]Added 42 Read/Feed constraints in 24 ms returned sat
[2024-05-28 21:12:48] [INFO ] Computed and/alt/rep : 26/67/26 causal constraints (skipped 86 transitions) in 11 ms.
[2024-05-28 21:12:48] [INFO ] Added : 20 causal constraints over 4 iterations in 101 ms. Result :sat
Minimization took 90 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[42, 42]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[42, 42]
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 113/113 transitions.
Applied a total of 0 rules in 7 ms. Remains 99 /99 variables (removed 0) and now considering 113/113 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 99/99 places, 113/113 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 113/113 transitions.
Applied a total of 0 rules in 7 ms. Remains 99 /99 variables (removed 0) and now considering 113/113 (removed 0) transitions.
[2024-05-28 21:12:49] [INFO ] Invariant cache hit.
[2024-05-28 21:12:49] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-05-28 21:12:49] [INFO ] Invariant cache hit.
[2024-05-28 21:12:49] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-28 21:12:49] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 533 ms to find 0 implicit places.
[2024-05-28 21:12:49] [INFO ] Redundant transitions in 4 ms returned []
Running 112 sub problems to find dead transitions.
[2024-05-28 21:12:49] [INFO ] Invariant cache hit.
[2024-05-28 21:12:49] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 1/99 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 21:12:51] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (OVERLAPS) 113/212 variables, 99/103 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 42/145 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 0/212 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 145 constraints, problems are : Problem set: 0 solved, 112 unsolved in 6700 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 99/99 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 1/99 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (OVERLAPS) 113/212 variables, 99/103 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 42/145 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 112/257 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (OVERLAPS) 0/212 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/212 variables, and 257 constraints, problems are : Problem set: 0 solved, 112 unsolved in 11906 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 99/99 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 1/1 constraints]
After SMT, in 18799ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 18802ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19356 ms. Remains : 99/99 places, 113/113 transitions.
RANDOM walk for 40000 steps (8938 resets) in 1466 ms. (27 steps per ms) remains 4/4 properties
[2024-05-28 21:13:09] [INFO ] Flatten gal took : 171 ms
BEST_FIRST walk for 40003 steps (4047 resets) in 621 ms. (64 steps per ms) remains 4/4 properties
[2024-05-28 21:13:09] [INFO ] Flatten gal took : 70 ms
BEST_FIRST walk for 40002 steps (4138 resets) in 251 ms. (158 steps per ms) remains 4/4 properties
[2024-05-28 21:13:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1070142387905223844.gal : 14 ms
[2024-05-28 21:13:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5634518438213340961.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1070142387905223844.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5634518438213340961.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40001 steps (4016 resets) in 134 ms. (296 steps per ms) remains 4/4 properties

BEST_FIRST walk for 40001 steps (4226 resets) in 146 ms. (272 steps per ms) remains 4/4 properties
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality5634518438213340961.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :7 after 41
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :41 after 194
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :194 after 214
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :214 after 901
Invariant property MIN0 does not hold.
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :901 after 2842
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :2842 after 3482
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :3482 after 4914
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :4914 after 25677
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :25677 after 52025
Invariant property MIN1 does not hold.
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :78931 after 89389
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,120031,0.974204,23716,2,3086,19,72618,8,0,513,41982,0
Total reachable state count : 120031

Verifying 4 reachability properties.
Reachability property MAX0 does not hold.
No reachable states exhibit your property : MAX0

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,0,0.974954,23976,1,0,19,72618,8,0,514,41982,0
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,3102,0.975563,23976,2,534,19,72618,9,0,516,41982,0
Reachability property MAX1 does not hold.
No reachable states exhibit your property : MAX1

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX1,0,0.975827,23976,1,0,19,72618,9,0,516,41982,0
Invariant property MIN1 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN1,1440,0.976186,23976,2,341,19,72618,10,0,518,41982,0
Probably explored full state space saw : 120031 states, properties seen :2
Probabilistic random walk after 302520 steps, saw 120031 distinct states, run finished after 1371 ms. (steps per millisecond=220 ) properties seen :2
Explored full state space saw : 120031 states, properties seen :0
Exhaustive walk after 302520 steps, saw 120031 distinct states, run finished after 1324 ms. (steps per millisecond=228 ) properties seen :0
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 0] Max Struct:[42, 42]
Starting property specific reduction for SieveSingleMsgMbox-PT-d2m06-UpperBounds-00
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[42]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[42]
[2024-05-28 21:13:12] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[42]
RANDOM walk for 10000 steps (2248 resets) in 12 ms. (769 steps per ms)
BEST_FIRST walk for 10001 steps (960 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[42]
[2024-05-28 21:13:12] [INFO ] Invariant cache hit.
[2024-05-28 21:13:12] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-28 21:13:12] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2024-05-28 21:13:12] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-28 21:13:12] [INFO ] [Real]Added 42 Read/Feed constraints in 10 ms returned sat
[2024-05-28 21:13:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:13:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 21:13:12] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2024-05-28 21:13:12] [INFO ] [Nat]Added 42 Read/Feed constraints in 12 ms returned sat
[2024-05-28 21:13:12] [INFO ] Computed and/alt/rep : 26/67/26 causal constraints (skipped 86 transitions) in 10 ms.
[2024-05-28 21:13:12] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 2 ms to minimize.
[2024-05-28 21:13:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2024-05-28 21:13:12] [INFO ] Added : 17 causal constraints over 4 iterations in 196 ms. Result :sat
Minimization took 86 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[42]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[42]
Support contains 1 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 113/113 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 98 transition count 112
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 98 transition count 112
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 98 transition count 111
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 97 transition count 109
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 97 transition count 109
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 97 transition count 108
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 96 transition count 107
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 96 transition count 107
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 95 transition count 106
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 95 transition count 106
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 94 transition count 105
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 94 transition count 105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 94 transition count 104
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 14 place count 93 transition count 103
Iterating global reduction 3 with 1 rules applied. Total rules applied 15 place count 93 transition count 103
Applied a total of 15 rules in 33 ms. Remains 93 /99 variables (removed 6) and now considering 103/113 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 93/99 places, 103/113 transitions.
// Phase 1: matrix 103 rows 93 cols
[2024-05-28 21:13:12] [INFO ] Computed 3 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[42]
RANDOM walk for 1000000 steps (224569 resets) in 1155 ms. (865 steps per ms)
BEST_FIRST walk for 1000000 steps (103202 resets) in 489 ms. (2040 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[42]
[2024-05-28 21:13:14] [INFO ] Invariant cache hit.
[2024-05-28 21:13:14] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-28 21:13:14] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2024-05-28 21:13:14] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-28 21:13:14] [INFO ] [Real]Added 38 Read/Feed constraints in 13 ms returned sat
[2024-05-28 21:13:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:13:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-28 21:13:14] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2024-05-28 21:13:14] [INFO ] [Nat]Added 38 Read/Feed constraints in 22 ms returned sat
[2024-05-28 21:13:14] [INFO ] Computed and/alt/rep : 24/59/24 causal constraints (skipped 78 transitions) in 14 ms.
[2024-05-28 21:13:14] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 2 ms to minimize.
[2024-05-28 21:13:14] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 2 ms to minimize.
[2024-05-28 21:13:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 177 ms
[2024-05-28 21:13:15] [INFO ] Added : 14 causal constraints over 3 iterations in 270 ms. Result :sat
Minimization took 89 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[42]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[42]
Support contains 1 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 103/103 transitions.
Applied a total of 0 rules in 5 ms. Remains 93 /93 variables (removed 0) and now considering 103/103 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 93/93 places, 103/103 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 103/103 transitions.
Applied a total of 0 rules in 5 ms. Remains 93 /93 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2024-05-28 21:13:15] [INFO ] Invariant cache hit.
[2024-05-28 21:13:15] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-05-28 21:13:15] [INFO ] Invariant cache hit.
[2024-05-28 21:13:15] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-28 21:13:15] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 522 ms to find 0 implicit places.
[2024-05-28 21:13:15] [INFO ] Redundant transitions in 4 ms returned []
Running 102 sub problems to find dead transitions.
[2024-05-28 21:13:15] [INFO ] Invariant cache hit.
[2024-05-28 21:13:15] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-28 21:13:17] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (OVERLAPS) 103/196 variables, 93/97 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 38/135 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-28 21:13:20] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 2 ms to minimize.
[2024-05-28 21:13:20] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 3 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/196 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (OVERLAPS) 0/196 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 137 constraints, problems are : Problem set: 0 solved, 102 unsolved in 8888 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 93/93 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 1/93 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 103/196 variables, 93/99 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 38/137 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 102/239 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (OVERLAPS) 0/196 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 239 constraints, problems are : Problem set: 0 solved, 102 unsolved in 10711 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 93/93 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 3/3 constraints]
After SMT, in 19781ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 19785ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20331 ms. Remains : 93/93 places, 103/103 transitions.
[2024-05-28 21:13:35] [INFO ] Flatten gal took : 32 ms
RANDOM walk for 40000 steps (8960 resets) in 99 ms. (400 steps per ms) remains 2/2 properties
[2024-05-28 21:13:35] [INFO ] Flatten gal took : 18 ms
[2024-05-28 21:13:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10680432202657111314.gal : 4 ms
[2024-05-28 21:13:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6289703338564322301.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10680432202657111314.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6289703338564322301.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality6289703338564322301.prop.
BEST_FIRST walk for 40002 steps (4131 resets) in 90 ms. (439 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 41
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :41 after 178
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :178 after 214
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :214 after 684
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :684 after 2946
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2946 after 3522
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :3522 after 5462
BEST_FIRST walk for 40002 steps (4151 resets) in 180 ms. (221 steps per ms) remains 2/2 properties
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :5462 after 25124
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :25124 after 45791
Probably explored full state space saw : 95259 states, properties seen :1
Probabilistic random walk after 235248 steps, saw 95259 distinct states, run finished after 297 ms. (steps per millisecond=792 ) properties seen :1
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,95259,0.58478,18984,2,2618,16,56167,7,0,478,31124,0
Total reachable state count : 95259

Verifying 2 reachability properties.
Reachability property MAX0 does not hold.
No reachable states exhibit your property : MAX0

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,0,0.585739,18984,1,0,16,56167,7,0,479,31124,0
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,2610,0.586538,18984,2,509,16,56167,8,0,481,31124,0
Explored full state space saw : 95259 states, properties seen :0
Exhaustive walk after 235248 steps, saw 95259 distinct states, run finished after 343 ms. (steps per millisecond=685 ) properties seen :0
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[42]
Ending property specific reduction for SieveSingleMsgMbox-PT-d2m06-UpperBounds-00 in 24160 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d2m06-UpperBounds-14
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[42]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[42]
// Phase 1: matrix 113 rows 99 cols
[2024-05-28 21:13:36] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[42]
RANDOM walk for 10000 steps (2254 resets) in 17 ms. (555 steps per ms)
BEST_FIRST walk for 10001 steps (1014 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[42]
[2024-05-28 21:13:36] [INFO ] Invariant cache hit.
[2024-05-28 21:13:36] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-28 21:13:36] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2024-05-28 21:13:36] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-28 21:13:36] [INFO ] [Real]Added 42 Read/Feed constraints in 20 ms returned sat
[2024-05-28 21:13:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:13:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-28 21:13:36] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2024-05-28 21:13:36] [INFO ] [Nat]Added 42 Read/Feed constraints in 25 ms returned sat
[2024-05-28 21:13:36] [INFO ] Computed and/alt/rep : 26/67/26 causal constraints (skipped 86 transitions) in 20 ms.
[2024-05-28 21:13:36] [INFO ] Added : 20 causal constraints over 4 iterations in 111 ms. Result :sat
Minimization took 90 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[42]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[42]
Support contains 1 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 113/113 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 98 transition count 112
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 98 transition count 112
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 97 transition count 110
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 97 transition count 110
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 97 transition count 109
Applied a total of 5 rules in 12 ms. Remains 97 /99 variables (removed 2) and now considering 109/113 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 97/99 places, 109/113 transitions.
// Phase 1: matrix 109 rows 97 cols
[2024-05-28 21:13:36] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[42]
RANDOM walk for 1000000 steps (224148 resets) in 1263 ms. (791 steps per ms)
BEST_FIRST walk for 1000001 steps (103183 resets) in 594 ms. (1680 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[42]
[2024-05-28 21:13:38] [INFO ] Invariant cache hit.
[2024-05-28 21:13:38] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-28 21:13:38] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2024-05-28 21:13:38] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-28 21:13:38] [INFO ] [Real]Added 41 Read/Feed constraints in 8 ms returned sat
[2024-05-28 21:13:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:13:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 21:13:38] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2024-05-28 21:13:38] [INFO ] [Nat]Added 41 Read/Feed constraints in 11 ms returned sat
[2024-05-28 21:13:39] [INFO ] Computed and/alt/rep : 25/64/25 causal constraints (skipped 83 transitions) in 9 ms.
[2024-05-28 21:13:39] [INFO ] Added : 13 causal constraints over 3 iterations in 55 ms. Result :sat
Minimization took 68 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[42]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[42]
Support contains 1 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 109/109 transitions.
Applied a total of 0 rules in 4 ms. Remains 97 /97 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 97/97 places, 109/109 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 109/109 transitions.
Applied a total of 0 rules in 4 ms. Remains 97 /97 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2024-05-28 21:13:39] [INFO ] Invariant cache hit.
[2024-05-28 21:13:39] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-05-28 21:13:39] [INFO ] Invariant cache hit.
[2024-05-28 21:13:39] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-28 21:13:39] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 511 ms to find 0 implicit places.
[2024-05-28 21:13:39] [INFO ] Redundant transitions in 7 ms returned []
Running 108 sub problems to find dead transitions.
[2024-05-28 21:13:39] [INFO ] Invariant cache hit.
[2024-05-28 21:13:39] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-28 21:13:41] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (OVERLAPS) 109/206 variables, 97/101 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 41/142 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/206 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 142 constraints, problems are : Problem set: 0 solved, 108 unsolved in 5996 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 97/97 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (OVERLAPS) 109/206 variables, 97/101 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 41/142 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 108/250 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/206 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 250 constraints, problems are : Problem set: 0 solved, 108 unsolved in 9855 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 97/97 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 1/1 constraints]
After SMT, in 16028ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 16030ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16565 ms. Remains : 97/97 places, 109/109 transitions.
[2024-05-28 21:13:55] [INFO ] Flatten gal took : 15 ms
[2024-05-28 21:13:55] [INFO ] Flatten gal took : 13 ms
[2024-05-28 21:13:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1103879043359285099.gal : 4 ms
[2024-05-28 21:13:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2805965364740006365.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1103879043359285099.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2805965364740006365.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (8933 resets) in 117 ms. (338 steps per ms) remains 2/2 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality2805965364740006365.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 41
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :41 after 194
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :194 after 218
BEST_FIRST walk for 40003 steps (4094 resets) in 130 ms. (305 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :218 after 914
BEST_FIRST walk for 40001 steps (4114 resets) in 69 ms. (571 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :914 after 2600
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2600 after 3392
Probably explored full state space saw : 96730 states, properties seen :1
Probabilistic random walk after 239870 steps, saw 96730 distinct states, run finished after 279 ms. (steps per millisecond=859 ) properties seen :1
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :3392 after 19698
Explored full state space saw : 96730 states, properties seen :0
Exhaustive walk after 239870 steps, saw 96730 distinct states, run finished after 203 ms. (steps per millisecond=1181 ) properties seen :0
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[42]
Ending property specific reduction for SieveSingleMsgMbox-PT-d2m06-UpperBounds-14 in 20052 ms.
[2024-05-28 21:13:56] [INFO ] Flatten gal took : 23 ms
[2024-05-28 21:13:56] [INFO ] Applying decomposition
[2024-05-28 21:13:56] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5983857141107789117.txt' '-o' '/tmp/graph5983857141107789117.bin' '-w' '/tmp/graph5983857141107789117.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5983857141107789117.bin' '-l' '-1' '-v' '-w' '/tmp/graph5983857141107789117.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:13:56] [INFO ] Decomposing Gal with order
[2024-05-28 21:13:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:13:56] [INFO ] Removed a total of 105 redundant transitions.
[2024-05-28 21:13:56] [INFO ] Flatten gal took : 88 ms
[2024-05-28 21:13:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 79 labels/synchronizations in 22 ms.
[2024-05-28 21:13:56] [INFO ] Time to serialize gal into /tmp/UpperBounds10659912019150359127.gal : 7 ms
[2024-05-28 21:13:56] [INFO ] Time to serialize properties into /tmp/UpperBounds714397913666264879.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds10659912019150359127.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds714397913666264879.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...283
Loading property file /tmp/UpperBounds714397913666264879.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,120031,0.275495,12876,632,375,15243,2618,338,31141,100,14891,0
Total reachable state count : 120031

Verifying 2 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property SieveSingleMsgMbox-PT-d2m06-UpperBounds-00 :0 <= i4.u8.p138 <= 1
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-00 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
SieveSingleMsgMbox-PT-d2m06-UpperBounds-00,0,0.289608,12876,1,0,15243,2618,452,31141,125,14891,678
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property SieveSingleMsgMbox-PT-d2m06-UpperBounds-14 :0 <= i8.u21.p110 <= 1
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-14 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
SieveSingleMsgMbox-PT-d2m06-UpperBounds-14,0,0.291366,12876,1,0,15243,2618,487,31141,125,14891,809
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 184959 ms.

BK_STOP 1716930837264

--------------------
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
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -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="SieveSingleMsgMbox-PT-d2m06"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is SieveSingleMsgMbox-PT-d2m06, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r378-smll-171683810800109"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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