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.r263-tall-171654372300196.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is Murphy-PT-D3N050, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-tall-171654372300196
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 6.9K Apr 11 23:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 11 23:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 11 23:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 11 23:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 6 10:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 6 10:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 6 10:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 6 10:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 23:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K Apr 11 23:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 11 23:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 138K Apr 11 23:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 6 10:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 6 10:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 15K 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 Murphy-PT-D3N050-UpperBounds-00
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-01
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-02
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-03
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-04
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-05
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-06
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-07
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-08
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-09
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-10
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-11
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-12
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-13
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-14
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716678079042

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Murphy-PT-D3N050
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-25 23:01:20] [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-25 23:01:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 23:01:20] [INFO ] Load time of PNML (sax parser for PT used): 26 ms
[2024-05-25 23:01:20] [INFO ] Transformed 24 places.
[2024-05-25 23:01:20] [INFO ] Transformed 28 transitions.
[2024-05-25 23:01:20] [INFO ] Parsed PT model containing 24 places and 28 transitions and 108 arcs in 89 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 28 rows 24 cols
[2024-05-25 23:01:20] [INFO ] Computed 5 invariants in 10 ms
Incomplete random walk after 10046 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=456 ) properties (out of 16) seen :458
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 16) seen :249
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 16) seen :279
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 16) seen :265
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 16) seen :253
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 16) seen :211
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 16) seen :312
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 16) seen :376
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 16) seen :301
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 16) seen :263
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 16) seen :277
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 16) seen :194
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 16) seen :289
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 16) seen :243
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :307
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 16) seen :263
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 16) seen :285
[2024-05-25 23:01:20] [INFO ] Invariant cache hit.
[2024-05-25 23:01:21] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-25 23:01:21] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-25 23:01:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:21] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-25 23:01:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:21] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 23:01:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:21] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-25 23:01:21] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 23:01:21] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-25 23:01:21] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 2 ms to minimize.
[2024-05-25 23:01:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2024-05-25 23:01:21] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 23:01:21] [INFO ] Added : 3 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 23:01:21] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:21] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 23:01:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:21] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-25 23:01:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:21] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-25 23:01:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:21] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-25 23:01:21] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-25 23:01:21] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 23:01:21] [INFO ] Added : 3 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 4 ms.
[2024-05-25 23:01:21] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:21] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 23:01:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:21] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-25 23:01:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:21] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-25 23:01:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:21] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-25 23:01:21] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-25 23:01:21] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-25 23:01:21] [INFO ] Added : 3 causal constraints over 1 iterations in 22 ms. Result :sat
Minimization took 4 ms.
[2024-05-25 23:01:21] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:21] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 23:01:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:21] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 23:01:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:21] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 23:01:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:21] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 23:01:21] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:01:21] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
[2024-05-25 23:01:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 19 ms
[2024-05-25 23:01:21] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 23:01:21] [INFO ] Added : 3 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 8 ms.
[2024-05-25 23:01:21] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 23:01:21] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 23:01:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:21] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-25 23:01:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:21] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 23:01:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:21] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-25 23:01:21] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:01:21] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-25 23:01:21] [INFO ] Added : 0 causal constraints over 0 iterations in 10 ms. Result :sat
Minimization took 48 ms.
[2024-05-25 23:01:21] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:21] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 23:01:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:21] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-25 23:01:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:21] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 23:01:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:21] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-25 23:01:21] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:01:21] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 23:01:21] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 20 ms.
[2024-05-25 23:01:21] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:21] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 23:01:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:21] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-25 23:01:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:21] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 23:01:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:21] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-25 23:01:21] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:01:21] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 23:01:21] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 21 ms.
[2024-05-25 23:01:21] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:21] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 23:01:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:21] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 23:01:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:22] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 23:01:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:22] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-25 23:01:22] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:01:22] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 23:01:22] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 23:01:22] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 23:01:22] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 23:01:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:22] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-25 23:01:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:22] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 23:01:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:22] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 23:01:22] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-25 23:01:22] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 23:01:22] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 24 ms.
[2024-05-25 23:01:22] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:22] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 23:01:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:22] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 23:01:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:22] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 23:01:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:22] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 23:01:22] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:01:22] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 23:01:22] [INFO ] Added : 3 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 23:01:22] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:22] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 23:01:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:22] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 23:01:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:22] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 23:01:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:22] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-25 23:01:22] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:01:22] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 23:01:22] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 24 ms.
[2024-05-25 23:01:22] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:22] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 23:01:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:22] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 23:01:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:22] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 23:01:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:22] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 23:01:22] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:01:22] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 23:01:22] [INFO ] Added : 3 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 4 ms.
[2024-05-25 23:01:22] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:22] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 23:01:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:22] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 23:01:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 23:01:22] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 23:01:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:22] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 23:01:22] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-25 23:01:22] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 23:01:22] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 36 ms.
[2024-05-25 23:01:22] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-25 23:01:22] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 23:01:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:22] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 23:01:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:22] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 23:01:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:22] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-25 23:01:22] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-25 23:01:22] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 23:01:22] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Minimization took 26 ms.
[2024-05-25 23:01:22] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:22] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 23:01:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:22] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 23:01:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:22] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 23:01:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:22] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-25 23:01:22] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:01:22] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 23:01:22] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 23:01:22] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:22] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 23:01:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:22] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 23:01:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-25 23:01:22] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 23:01:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:22] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 23:01:22] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
[2024-05-25 23:01:22] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 23:01:22] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, 204, 204, 204, -1, 204, -1, 204, -1, 204, 204, -1, 204] Max seen :[2, 3, 3, 2, 73, 97, 97, 1, 79, 3, 63, 3, 93, 105, 1, 99]
Support contains 16 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 9 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2024-05-25 23:01:23] [INFO ] Invariant cache hit.
[2024-05-25 23:01:23] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 24/24 places, 28/28 transitions.
[2024-05-25 23:01:23] [INFO ] Invariant cache hit.
Incomplete random walk after 1000011 steps, including 2 resets, run finished after 493 ms. (steps per millisecond=2028 ) properties (out of 16) seen :560
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 492 ms. (steps per millisecond=2032 ) properties (out of 16) seen :683
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 439 ms. (steps per millisecond=2277 ) properties (out of 16) seen :611
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 440 ms. (steps per millisecond=2272 ) properties (out of 16) seen :567
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 444 ms. (steps per millisecond=2252 ) properties (out of 16) seen :817
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 371 ms. (steps per millisecond=2695 ) properties (out of 16) seen :198
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 377 ms. (steps per millisecond=2652 ) properties (out of 16) seen :340
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 379 ms. (steps per millisecond=2638 ) properties (out of 16) seen :393
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 390 ms. (steps per millisecond=2564 ) properties (out of 16) seen :742
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 381 ms. (steps per millisecond=2624 ) properties (out of 16) seen :279
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 401 ms. (steps per millisecond=2493 ) properties (out of 16) seen :709
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 400 ms. (steps per millisecond=2500 ) properties (out of 16) seen :218
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 418 ms. (steps per millisecond=2392 ) properties (out of 16) seen :630
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 383 ms. (steps per millisecond=2610 ) properties (out of 16) seen :187
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 392 ms. (steps per millisecond=2551 ) properties (out of 16) seen :288
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 400 ms. (steps per millisecond=2500 ) properties (out of 16) seen :564
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 390 ms. (steps per millisecond=2564 ) properties (out of 16) seen :263
[2024-05-25 23:01:30] [INFO ] Invariant cache hit.
[2024-05-25 23:01:30] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:30] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 23:01:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:30] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 23:01:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:30] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 23:01:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:30] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-25 23:01:30] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 23:01:30] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-25 23:01:30] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
[2024-05-25 23:01:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2024-05-25 23:01:30] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 23:01:30] [INFO ] Added : 3 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 23:01:30] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:30] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 23:01:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:30] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 23:01:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:30] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 23:01:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:30] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 23:01:30] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:01:30] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 23:01:30] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2024-05-25 23:01:30] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:30] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 23:01:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:30] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 23:01:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:30] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 23:01:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:30] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-25 23:01:30] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:01:30] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 23:01:30] [INFO ] Added : 3 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 3 ms.
[2024-05-25 23:01:30] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:30] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 23:01:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:30] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 23:01:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 23:01:30] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 23:01:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:30] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-25 23:01:30] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:01:30] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 7 ms to minimize.
[2024-05-25 23:01:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2024-05-25 23:01:30] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-25 23:01:30] [INFO ] Added : 3 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 23:01:30] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:30] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-25 23:01:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:30] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 23:01:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:30] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 23:01:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:30] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 23:01:30] [INFO ] [Nat]Added 8 Read/Feed constraints in 9 ms returned sat
[2024-05-25 23:01:30] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-25 23:01:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2024-05-25 23:01:30] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 23:01:30] [INFO ] Added : 2 causal constraints over 1 iterations in 32 ms. Result :sat
Minimization took 16 ms.
[2024-05-25 23:01:30] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:30] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 23:01:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:30] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-25 23:01:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 23:01:30] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 4 ms returned sat
[2024-05-25 23:01:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:30] [INFO ] [Nat]Absence check using state equation in 7 ms returned unsat
[2024-05-25 23:01:30] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:30] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 23:01:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:30] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 23:01:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-25 23:01:30] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 23:01:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:30] [INFO ] [Nat]Absence check using state equation in 5 ms returned unsat
[2024-05-25 23:01:30] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-25 23:01:30] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 23:01:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:30] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 23:01:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:30] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 23:01:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:30] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 23:01:30] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:01:30] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 23:01:30] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2024-05-25 23:01:30] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 23:01:30] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 23:01:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:30] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-25 23:01:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:31] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 23:01:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:31] [INFO ] [Nat]Absence check using state equation in 4 ms returned unsat
[2024-05-25 23:01:31] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 23:01:31] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 23:01:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:31] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 23:01:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 23:01:31] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 23:01:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:31] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 23:01:31] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:01:31] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 23:01:31] [INFO ] Added : 3 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2024-05-25 23:01:31] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:31] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 23:01:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:31] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 23:01:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 23:01:31] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 23:01:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:31] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 23:01:31] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-25 23:01:31] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-25 23:01:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2024-05-25 23:01:31] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 23:01:31] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 16 ms.
[2024-05-25 23:01:31] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:31] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 23:01:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:31] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 23:01:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:31] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 23:01:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:31] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 23:01:31] [INFO ] [Nat]Added 8 Read/Feed constraints in 14 ms returned sat
[2024-05-25 23:01:31] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 23:01:31] [INFO ] Added : 3 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 4 ms.
[2024-05-25 23:01:31] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:31] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 23:01:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:31] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-25 23:01:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:31] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 23:01:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:31] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 23:01:31] [INFO ] [Nat]Added 8 Read/Feed constraints in 17 ms returned sat
[2024-05-25 23:01:31] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-25 23:01:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2024-05-25 23:01:31] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 23:01:31] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 12 ms.
[2024-05-25 23:01:31] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:31] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 23:01:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:31] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 23:01:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:31] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 23:01:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:31] [INFO ] [Nat]Absence check using state equation in 7 ms returned unsat
[2024-05-25 23:01:31] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:31] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 23:01:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:31] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 23:01:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 23:01:31] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 23:01:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:31] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-25 23:01:31] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:01:31] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 23:01:31] [INFO ] Added : 1 causal constraints over 1 iterations in 23 ms. Result :sat
Minimization took 8 ms.
[2024-05-25 23:01:31] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:31] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 23:01:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:31] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 23:01:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:31] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 23:01:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:31] [INFO ] [Nat]Absence check using state equation in 6 ms returned unsat
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, 204, 201, 201, -1, 201, -1, 204, -1, 204, 201, -1, 201] Max seen :[2, 3, 3, 2, 199, 201, 201, 1, 201, 3, 199, 3, 197, 201, 1, 201]
FORMULA Murphy-PT-D3N050-UpperBounds-15 201 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Murphy-PT-D3N050-UpperBounds-13 201 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Murphy-PT-D3N050-UpperBounds-08 201 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Murphy-PT-D3N050-UpperBounds-06 201 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Murphy-PT-D3N050-UpperBounds-05 201 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 11 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 24/24 places, 28/28 transitions.
[2024-05-25 23:01:31] [INFO ] Invariant cache hit.
Incomplete random walk after 1000025 steps, including 2 resets, run finished after 410 ms. (steps per millisecond=2439 ) properties (out of 11) seen :239
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 430 ms. (steps per millisecond=2325 ) properties (out of 11) seen :212
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 375 ms. (steps per millisecond=2666 ) properties (out of 11) seen :192
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 405 ms. (steps per millisecond=2469 ) properties (out of 11) seen :173
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 424 ms. (steps per millisecond=2358 ) properties (out of 11) seen :185
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 355 ms. (steps per millisecond=2816 ) properties (out of 11) seen :194
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 379 ms. (steps per millisecond=2638 ) properties (out of 11) seen :191
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 380 ms. (steps per millisecond=2631 ) properties (out of 11) seen :176
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 365 ms. (steps per millisecond=2739 ) properties (out of 11) seen :235
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 382 ms. (steps per millisecond=2617 ) properties (out of 11) seen :189
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 359 ms. (steps per millisecond=2785 ) properties (out of 11) seen :233
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 390 ms. (steps per millisecond=2564 ) properties (out of 11) seen :175
[2024-05-25 23:01:36] [INFO ] Invariant cache hit.
[2024-05-25 23:01:36] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 23:01:36] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 23:01:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:36] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 23:01:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:36] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 23:01:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:36] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-25 23:01:36] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 23:01:36] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:01:36] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
[2024-05-25 23:01:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 19 ms
[2024-05-25 23:01:36] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 23:01:36] [INFO ] Added : 3 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 23:01:36] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:36] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 23:01:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:36] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 23:01:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:36] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 23:01:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:36] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-25 23:01:36] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:01:36] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 23:01:36] [INFO ] Added : 3 causal constraints over 1 iterations in 19 ms. Result :sat
Minimization took 3 ms.
[2024-05-25 23:01:36] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 23:01:36] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 23:01:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:36] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 23:01:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 23:01:36] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 23:01:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:36] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 23:01:36] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:01:36] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 23:01:36] [INFO ] Added : 3 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 4 ms.
[2024-05-25 23:01:36] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:36] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 23:01:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:36] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 23:01:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 23:01:36] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 23:01:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:36] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 23:01:36] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:01:36] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
[2024-05-25 23:01:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2024-05-25 23:01:36] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 23:01:36] [INFO ] Added : 3 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 23:01:36] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 23:01:36] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 23:01:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:36] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-25 23:01:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 23:01:36] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 23:01:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:36] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-25 23:01:36] [INFO ] [Nat]Added 8 Read/Feed constraints in 9 ms returned sat
[2024-05-25 23:01:36] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-25 23:01:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2024-05-25 23:01:36] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 23:01:36] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 16 ms.
[2024-05-25 23:01:37] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:37] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 4 ms returned sat
[2024-05-25 23:01:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:37] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-25 23:01:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:37] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 23:01:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:37] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 23:01:37] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:01:37] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 23:01:37] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 23:01:37] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:37] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 23:01:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:37] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-25 23:01:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:37] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 23:01:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:37] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 23:01:37] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:01:37] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 23:01:37] [INFO ] Added : 3 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 27 ms.
[2024-05-25 23:01:37] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:37] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 23:01:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:37] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 23:01:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:37] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 23:01:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:37] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 23:01:37] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-25 23:01:37] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-25 23:01:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
[2024-05-25 23:01:37] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 23:01:37] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 16 ms.
[2024-05-25 23:01:37] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:37] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 23:01:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:37] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-25 23:01:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:37] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 23:01:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:37] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-25 23:01:37] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-25 23:01:37] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 23:01:37] [INFO ] Added : 3 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2024-05-25 23:01:37] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:37] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 23:01:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:37] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 23:01:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 23:01:37] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 23:01:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:37] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 23:01:37] [INFO ] [Nat]Added 8 Read/Feed constraints in 9 ms returned sat
[2024-05-25 23:01:37] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-25 23:01:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2024-05-25 23:01:37] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 23:01:37] [INFO ] Added : 1 causal constraints over 1 iterations in 28 ms. Result :sat
Minimization took 11 ms.
[2024-05-25 23:01:37] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:37] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 23:01:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:37] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 23:01:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:37] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 23:01:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:37] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 23:01:37] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:01:37] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 23:01:37] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, 204, -1, -1, 204, -1, 204, -1] Max seen :[2, 3, 3, 2, 199, 1, 3, 199, 3, 197, 1]
Support contains 11 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 4 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 24/24 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 3 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2024-05-25 23:01:37] [INFO ] Invariant cache hit.
[2024-05-25 23:01:37] [INFO ] Implicit Places using invariants in 32 ms returned [8, 9, 10, 11]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 42 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 20/24 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 48 ms. Remains : 20/24 places, 28/28 transitions.
// Phase 1: matrix 28 rows 20 cols
[2024-05-25 23:01:37] [INFO ] Computed 1 invariants in 2 ms
Incomplete random walk after 1000055 steps, including 2 resets, run finished after 392 ms. (steps per millisecond=2551 ) properties (out of 11) seen :208
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 369 ms. (steps per millisecond=2710 ) properties (out of 11) seen :204
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 343 ms. (steps per millisecond=2915 ) properties (out of 11) seen :183
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 341 ms. (steps per millisecond=2932 ) properties (out of 11) seen :180
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 357 ms. (steps per millisecond=2801 ) properties (out of 11) seen :196
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 343 ms. (steps per millisecond=2915 ) properties (out of 11) seen :209
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 332 ms. (steps per millisecond=3012 ) properties (out of 11) seen :184
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 331 ms. (steps per millisecond=3021 ) properties (out of 11) seen :175
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 356 ms. (steps per millisecond=2808 ) properties (out of 11) seen :213
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 338 ms. (steps per millisecond=2958 ) properties (out of 11) seen :172
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 343 ms. (steps per millisecond=2915 ) properties (out of 11) seen :196
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 357 ms. (steps per millisecond=2801 ) properties (out of 11) seen :183
[2024-05-25 23:01:42] [INFO ] Invariant cache hit.
[2024-05-25 23:01:42] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 23:01:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:42] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 23:01:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 23:01:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:42] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 23:01:42] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 23:01:42] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:01:42] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 23:01:42] [INFO ] Added : 2 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 3 ms.
[2024-05-25 23:01:42] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 23:01:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:42] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 23:01:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 23:01:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:42] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 23:01:42] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:01:42] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 23:01:42] [INFO ] Added : 3 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2024-05-25 23:01:42] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 23:01:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:42] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 23:01:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:42] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 23:01:42] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:01:42] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 23:01:42] [INFO ] Added : 3 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 3 ms.
[2024-05-25 23:01:42] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:42] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-25 23:01:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:42] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 23:01:42] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:01:42] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 23:01:42] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 23:01:42] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 23:01:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:42] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 23:01:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 23:01:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:42] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-25 23:01:42] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:01:42] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-25 23:01:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2024-05-25 23:01:42] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 23:01:42] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 11 ms.
[2024-05-25 23:01:42] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:42] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 23:01:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 23:01:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:42] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 23:01:42] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:01:42] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 23:01:42] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 23:01:42] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:42] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-25 23:01:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 23:01:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:42] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-25 23:01:42] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:01:42] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 23:01:42] [INFO ] Added : 3 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2024-05-25 23:01:42] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 23:01:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:42] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-25 23:01:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:42] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 23:01:42] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:01:42] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 23:01:42] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 20 ms.
[2024-05-25 23:01:42] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-25 23:01:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:42] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-25 23:01:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 23:01:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:42] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-25 23:01:42] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:01:42] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 23:01:42] [INFO ] Added : 3 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 3 ms.
[2024-05-25 23:01:42] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2024-05-25 23:01:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:42] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-25 23:01:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:43] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 23:01:43] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2024-05-25 23:01:43] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 23:01:43] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 18 ms.
[2024-05-25 23:01:43] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 23:01:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:43] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 23:01:43] [INFO ] [Real]Added 8 Read/Feed constraints in 0 ms returned sat
[2024-05-25 23:01:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:43] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 23:01:43] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:01:43] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 23:01:43] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, 204, -1, -1, 204, -1, 204, -1] Max seen :[2, 3, 3, 2, 199, 1, 3, 199, 3, 197, 1]
Support contains 11 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 20/20 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2024-05-25 23:01:43] [INFO ] Invariant cache hit.
[2024-05-25 23:01:43] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-25 23:01:43] [INFO ] Invariant cache hit.
[2024-05-25 23:01:43] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 23:01:43] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2024-05-25 23:01:43] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-25 23:01:43] [INFO ] Invariant cache hit.
[2024-05-25 23:01:43] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 20/20 places, 28/28 transitions.
Starting property specific reduction for Murphy-PT-D3N050-UpperBounds-00
[2024-05-25 23:01:43] [INFO ] Invariant cache hit.
Incomplete random walk after 10006 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2001 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :2
[2024-05-25 23:01:43] [INFO ] Invariant cache hit.
[2024-05-25 23:01:43] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:43] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-25 23:01:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:43] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 23:01:43] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 23:01:43] [INFO ] [Nat]Added 8 Read/Feed constraints in 11 ms returned sat
[2024-05-25 23:01:43] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 23:01:43] [INFO ] Added : 2 causal constraints over 1 iterations in 23 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Graph (complete) has 56 edges and 20 vertex of which 3 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.1 ms
Discarding 17 places :
Also discarding 23 output transitions
Drop transitions removed 23 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 4
Applied a total of 2 rules in 2 ms. Remains 3 /20 variables (removed 17) and now considering 4/28 (removed 24) transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-05-25 23:01:43] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 23:01:43] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 3/20 places, 4/28 transitions.
[2024-05-25 23:01:43] [INFO ] Invariant cache hit.
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 237 ms. (steps per millisecond=4219 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 256 ms. (steps per millisecond=3906 ) properties (out of 1) seen :2
[2024-05-25 23:01:44] [INFO ] Invariant cache hit.
[2024-05-25 23:01:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:44] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-25 23:01:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:44] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-25 23:01:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 23:01:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-25 23:01:44] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-25 23:01:44] [INFO ] Added : 2 causal constraints over 1 iterations in 2 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 3/3 places, 4/4 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-05-25 23:01:44] [INFO ] Invariant cache hit.
[2024-05-25 23:01:44] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-25 23:01:44] [INFO ] Invariant cache hit.
[2024-05-25 23:01:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 23:01:44] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2024-05-25 23:01:44] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 23:01:44] [INFO ] Invariant cache hit.
[2024-05-25 23:01:44] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 3/3 places, 4/4 transitions.
Ending property specific reduction for Murphy-PT-D3N050-UpperBounds-00 in 941 ms.
Starting property specific reduction for Murphy-PT-D3N050-UpperBounds-01
// Phase 1: matrix 28 rows 20 cols
[2024-05-25 23:01:44] [INFO ] Computed 1 invariants in 0 ms
Incomplete random walk after 10028 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1671 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :3
[2024-05-25 23:01:44] [INFO ] Invariant cache hit.
[2024-05-25 23:01:44] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:44] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 23:01:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 23:01:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:44] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-25 23:01:44] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 23:01:44] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:01:44] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 23:01:44] [INFO ] Added : 3 causal constraints over 1 iterations in 44 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[3]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Graph (complete) has 56 edges and 20 vertex of which 3 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 23 output transitions
Drop transitions removed 23 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 4
Applied a total of 2 rules in 1 ms. Remains 3 /20 variables (removed 17) and now considering 4/28 (removed 24) transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-05-25 23:01:44] [INFO ] Computed 0 invariants in 1 ms
[2024-05-25 23:01:44] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 3/20 places, 4/28 transitions.
[2024-05-25 23:01:44] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 261 ms. (steps per millisecond=3831 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 182 ms. (steps per millisecond=5494 ) properties (out of 1) seen :3
[2024-05-25 23:01:44] [INFO ] Invariant cache hit.
[2024-05-25 23:01:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:45] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 23:01:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:45] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-25 23:01:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 23:01:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-25 23:01:45] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 23:01:45] [INFO ] Added : 3 causal constraints over 1 iterations in 3 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[3]
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 3/3 places, 4/4 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-05-25 23:01:45] [INFO ] Invariant cache hit.
[2024-05-25 23:01:45] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-05-25 23:01:45] [INFO ] Invariant cache hit.
[2024-05-25 23:01:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 23:01:45] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2024-05-25 23:01:45] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 23:01:45] [INFO ] Invariant cache hit.
[2024-05-25 23:01:45] [INFO ] Dead Transitions using invariants and state equation in 14 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 3/3 places, 4/4 transitions.
Ending property specific reduction for Murphy-PT-D3N050-UpperBounds-01 in 805 ms.
Starting property specific reduction for Murphy-PT-D3N050-UpperBounds-02
// Phase 1: matrix 28 rows 20 cols
[2024-05-25 23:01:45] [INFO ] Computed 1 invariants in 1 ms
Incomplete random walk after 10028 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1671 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :3
[2024-05-25 23:01:45] [INFO ] Invariant cache hit.
[2024-05-25 23:01:45] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:45] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 23:01:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:45] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 23:01:45] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 23:01:45] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:01:45] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 23:01:45] [INFO ] Added : 3 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[3]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Graph (complete) has 56 edges and 20 vertex of which 3 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 23 output transitions
Drop transitions removed 23 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 4
Applied a total of 2 rules in 1 ms. Remains 3 /20 variables (removed 17) and now considering 4/28 (removed 24) transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-05-25 23:01:45] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 23:01:45] [INFO ] Dead Transitions using invariants and state equation in 14 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 3/20 places, 4/28 transitions.
[2024-05-25 23:01:45] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 242 ms. (steps per millisecond=4132 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 180 ms. (steps per millisecond=5555 ) properties (out of 1) seen :3
[2024-05-25 23:01:45] [INFO ] Invariant cache hit.
[2024-05-25 23:01:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:45] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-25 23:01:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:45] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-25 23:01:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 23:01:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-25 23:01:45] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-25 23:01:45] [INFO ] Added : 3 causal constraints over 1 iterations in 2 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[3]
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 3/3 places, 4/4 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-05-25 23:01:45] [INFO ] Invariant cache hit.
[2024-05-25 23:01:45] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-25 23:01:45] [INFO ] Invariant cache hit.
[2024-05-25 23:01:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 23:01:45] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2024-05-25 23:01:45] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 23:01:45] [INFO ] Invariant cache hit.
[2024-05-25 23:01:45] [INFO ] Dead Transitions using invariants and state equation in 14 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 3/3 places, 4/4 transitions.
Ending property specific reduction for Murphy-PT-D3N050-UpperBounds-02 in 692 ms.
Starting property specific reduction for Murphy-PT-D3N050-UpperBounds-03
// Phase 1: matrix 28 rows 20 cols
[2024-05-25 23:01:45] [INFO ] Computed 1 invariants in 0 ms
Incomplete random walk after 10026 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2506 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :2
[2024-05-25 23:01:45] [INFO ] Invariant cache hit.
[2024-05-25 23:01:45] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 23:01:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:45] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 23:01:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 23:01:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:45] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 23:01:45] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 23:01:45] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:01:45] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 23:01:45] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Graph (complete) has 56 edges and 20 vertex of which 3 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 23 output transitions
Drop transitions removed 23 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 4
Applied a total of 2 rules in 0 ms. Remains 3 /20 variables (removed 17) and now considering 4/28 (removed 24) transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-05-25 23:01:45] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 23:01:45] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 3/20 places, 4/28 transitions.
[2024-05-25 23:01:45] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 242 ms. (steps per millisecond=4132 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 182 ms. (steps per millisecond=5494 ) properties (out of 1) seen :2
[2024-05-25 23:01:46] [INFO ] Invariant cache hit.
[2024-05-25 23:01:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:46] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-25 23:01:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:46] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-25 23:01:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 23:01:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:01:46] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-25 23:01:46] [INFO ] Added : 2 causal constraints over 1 iterations in 2 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 3/3 places, 4/4 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 3 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-05-25 23:01:46] [INFO ] Invariant cache hit.
[2024-05-25 23:01:46] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-25 23:01:46] [INFO ] Invariant cache hit.
[2024-05-25 23:01:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 23:01:46] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2024-05-25 23:01:46] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 23:01:46] [INFO ] Invariant cache hit.
[2024-05-25 23:01:46] [INFO ] Dead Transitions using invariants and state equation in 14 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 3/3 places, 4/4 transitions.
Ending property specific reduction for Murphy-PT-D3N050-UpperBounds-03 in 700 ms.
Starting property specific reduction for Murphy-PT-D3N050-UpperBounds-04
// Phase 1: matrix 28 rows 20 cols
[2024-05-25 23:01:46] [INFO ] Computed 1 invariants in 0 ms
Incomplete random walk after 10009 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2001 ) properties (out of 1) seen :55
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :67
[2024-05-25 23:01:46] [INFO ] Invariant cache hit.
[2024-05-25 23:01:46] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:46] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 23:01:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:46] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 23:01:46] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 23:01:46] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:01:46] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 23:01:46] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT) : [204] Max seen :[67]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2024-05-25 23:01:46] [INFO ] Invariant cache hit.
[2024-05-25 23:01:46] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 20/20 places, 28/28 transitions.
[2024-05-25 23:01:46] [INFO ] Invariant cache hit.
Incomplete random walk after 1000027 steps, including 2 resets, run finished after 357 ms. (steps per millisecond=2801 ) properties (out of 1) seen :73
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 328 ms. (steps per millisecond=3048 ) properties (out of 1) seen :61
[2024-05-25 23:01:47] [INFO ] Invariant cache hit.
[2024-05-25 23:01:47] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 23:01:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:47] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-25 23:01:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 23:01:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:47] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-25 23:01:47] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 23:01:47] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-25 23:01:47] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-25 23:01:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2024-05-25 23:01:47] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 23:01:47] [INFO ] Added : 1 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : [204] Max seen :[199]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 20/20 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2024-05-25 23:01:47] [INFO ] Invariant cache hit.
[2024-05-25 23:01:47] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-25 23:01:47] [INFO ] Invariant cache hit.
[2024-05-25 23:01:47] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 23:01:47] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2024-05-25 23:01:47] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 23:01:47] [INFO ] Invariant cache hit.
[2024-05-25 23:01:47] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 20/20 places, 28/28 transitions.
Ending property specific reduction for Murphy-PT-D3N050-UpperBounds-04 in 1126 ms.
Starting property specific reduction for Murphy-PT-D3N050-UpperBounds-07
[2024-05-25 23:01:47] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :1
[2024-05-25 23:01:47] [INFO ] Invariant cache hit.
[2024-05-25 23:01:47] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:47] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 23:01:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:47] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-25 23:01:47] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 23:01:47] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2024-05-25 23:01:47] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 23:01:47] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Graph (complete) has 56 edges and 20 vertex of which 3 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 23 output transitions
Drop transitions removed 23 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 4
Applied a total of 2 rules in 1 ms. Remains 3 /20 variables (removed 17) and now considering 4/28 (removed 24) transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-05-25 23:01:47] [INFO ] Computed 0 invariants in 1 ms
[2024-05-25 23:01:47] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 3/20 places, 4/28 transitions.
[2024-05-25 23:01:47] [INFO ] Invariant cache hit.
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 222 ms. (steps per millisecond=4504 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 188 ms. (steps per millisecond=5319 ) properties (out of 1) seen :1
[2024-05-25 23:01:48] [INFO ] Invariant cache hit.
[2024-05-25 23:01:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:48] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-25 23:01:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:48] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-25 23:01:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 23:01:48] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:01:48] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 23:01:48] [INFO ] Added : 3 causal constraints over 2 iterations in 3 ms. Result :sat
Minimization took 1 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 3/3 places, 4/4 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-05-25 23:01:48] [INFO ] Invariant cache hit.
[2024-05-25 23:01:48] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-25 23:01:48] [INFO ] Invariant cache hit.
[2024-05-25 23:01:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 23:01:48] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2024-05-25 23:01:48] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 23:01:48] [INFO ] Invariant cache hit.
[2024-05-25 23:01:48] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 3/3 places, 4/4 transitions.
Ending property specific reduction for Murphy-PT-D3N050-UpperBounds-07 in 658 ms.
Starting property specific reduction for Murphy-PT-D3N050-UpperBounds-09
// Phase 1: matrix 28 rows 20 cols
[2024-05-25 23:01:48] [INFO ] Computed 1 invariants in 0 ms
Incomplete random walk after 10047 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2511 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :3
[2024-05-25 23:01:48] [INFO ] Invariant cache hit.
[2024-05-25 23:01:48] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:48] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 23:01:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 23:01:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:48] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-25 23:01:48] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 23:01:48] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-25 23:01:48] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 23:01:48] [INFO ] Added : 3 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[3]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Graph (complete) has 56 edges and 20 vertex of which 3 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.1 ms
Discarding 17 places :
Also discarding 23 output transitions
Drop transitions removed 23 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 4
Applied a total of 2 rules in 1 ms. Remains 3 /20 variables (removed 17) and now considering 4/28 (removed 24) transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-05-25 23:01:48] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 23:01:48] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 3/20 places, 4/28 transitions.
[2024-05-25 23:01:48] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 224 ms. (steps per millisecond=4464 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 180 ms. (steps per millisecond=5555 ) properties (out of 1) seen :3
[2024-05-25 23:01:48] [INFO ] Invariant cache hit.
[2024-05-25 23:01:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:48] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-25 23:01:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:48] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-25 23:01:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 23:01:48] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-25 23:01:48] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-25 23:01:48] [INFO ] Added : 3 causal constraints over 1 iterations in 2 ms. Result :sat
Minimization took 1 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[3]
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 3/3 places, 4/4 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-05-25 23:01:48] [INFO ] Invariant cache hit.
[2024-05-25 23:01:48] [INFO ] Implicit Places using invariants in 12 ms returned []
[2024-05-25 23:01:48] [INFO ] Invariant cache hit.
[2024-05-25 23:01:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 23:01:48] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2024-05-25 23:01:48] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 23:01:48] [INFO ] Invariant cache hit.
[2024-05-25 23:01:48] [INFO ] Dead Transitions using invariants and state equation in 14 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 3/3 places, 4/4 transitions.
Ending property specific reduction for Murphy-PT-D3N050-UpperBounds-09 in 637 ms.
Starting property specific reduction for Murphy-PT-D3N050-UpperBounds-10
// Phase 1: matrix 28 rows 20 cols
[2024-05-25 23:01:48] [INFO ] Computed 1 invariants in 7 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :58
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :67
[2024-05-25 23:01:48] [INFO ] Invariant cache hit.
[2024-05-25 23:01:48] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:48] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 23:01:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:48] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-25 23:01:48] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 23:01:48] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:01:48] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 23:01:48] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : [204] Max seen :[67]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2024-05-25 23:01:49] [INFO ] Invariant cache hit.
[2024-05-25 23:01:49] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 20/20 places, 28/28 transitions.
[2024-05-25 23:01:49] [INFO ] Invariant cache hit.
Incomplete random walk after 1000029 steps, including 2 resets, run finished after 348 ms. (steps per millisecond=2873 ) properties (out of 1) seen :71
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 328 ms. (steps per millisecond=3048 ) properties (out of 1) seen :77
[2024-05-25 23:01:49] [INFO ] Invariant cache hit.
[2024-05-25 23:01:49] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:49] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 23:01:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 23:01:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:49] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-25 23:01:49] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 23:01:49] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-25 23:01:49] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 23:01:49] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : [204] Max seen :[199]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 20/20 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2024-05-25 23:01:49] [INFO ] Invariant cache hit.
[2024-05-25 23:01:49] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-25 23:01:49] [INFO ] Invariant cache hit.
[2024-05-25 23:01:49] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 23:01:49] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-05-25 23:01:49] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 23:01:49] [INFO ] Invariant cache hit.
[2024-05-25 23:01:50] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 20/20 places, 28/28 transitions.
Ending property specific reduction for Murphy-PT-D3N050-UpperBounds-10 in 1117 ms.
Starting property specific reduction for Murphy-PT-D3N050-UpperBounds-11
[2024-05-25 23:01:50] [INFO ] Invariant cache hit.
Incomplete random walk after 10039 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2509 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :3
[2024-05-25 23:01:50] [INFO ] Invariant cache hit.
[2024-05-25 23:01:50] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 23:01:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:50] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-25 23:01:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:50] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-25 23:01:50] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 23:01:50] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:01:50] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 23:01:50] [INFO ] Added : 3 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[3]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Graph (complete) has 56 edges and 20 vertex of which 3 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 23 output transitions
Drop transitions removed 23 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 4
Applied a total of 2 rules in 0 ms. Remains 3 /20 variables (removed 17) and now considering 4/28 (removed 24) transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-05-25 23:01:50] [INFO ] Computed 0 invariants in 1 ms
[2024-05-25 23:01:50] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 3/20 places, 4/28 transitions.
[2024-05-25 23:01:50] [INFO ] Invariant cache hit.
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 227 ms. (steps per millisecond=4405 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 185 ms. (steps per millisecond=5405 ) properties (out of 1) seen :3
[2024-05-25 23:01:50] [INFO ] Invariant cache hit.
[2024-05-25 23:01:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:50] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-25 23:01:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:50] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-25 23:01:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 23:01:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:01:50] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 23:01:50] [INFO ] Added : 3 causal constraints over 1 iterations in 2 ms. Result :sat
Minimization took 1 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[3]
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 3/3 places, 4/4 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-05-25 23:01:50] [INFO ] Invariant cache hit.
[2024-05-25 23:01:50] [INFO ] Implicit Places using invariants in 13 ms returned []
[2024-05-25 23:01:50] [INFO ] Invariant cache hit.
[2024-05-25 23:01:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 23:01:50] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
[2024-05-25 23:01:50] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 23:01:50] [INFO ] Invariant cache hit.
[2024-05-25 23:01:50] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 3/3 places, 4/4 transitions.
Ending property specific reduction for Murphy-PT-D3N050-UpperBounds-11 in 633 ms.
Starting property specific reduction for Murphy-PT-D3N050-UpperBounds-12
// Phase 1: matrix 28 rows 20 cols
[2024-05-25 23:01:50] [INFO ] Computed 1 invariants in 1 ms
Incomplete random walk after 10024 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2004 ) properties (out of 1) seen :53
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :69
[2024-05-25 23:01:50] [INFO ] Invariant cache hit.
[2024-05-25 23:01:50] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:50] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 23:01:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:50] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-25 23:01:50] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 23:01:50] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:01:50] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 23:01:50] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : [204] Max seen :[69]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2024-05-25 23:01:50] [INFO ] Invariant cache hit.
[2024-05-25 23:01:50] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 20/20 places, 28/28 transitions.
[2024-05-25 23:01:50] [INFO ] Invariant cache hit.
Incomplete random walk after 1000002 steps, including 2 resets, run finished after 337 ms. (steps per millisecond=2967 ) properties (out of 1) seen :71
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 327 ms. (steps per millisecond=3058 ) properties (out of 1) seen :67
[2024-05-25 23:01:51] [INFO ] Invariant cache hit.
[2024-05-25 23:01:51] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:51] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 23:01:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:51] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-25 23:01:51] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 23:01:51] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2024-05-25 23:01:51] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 23:01:51] [INFO ] Added : 2 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [204] Max seen :[199]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 20/20 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 3 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2024-05-25 23:01:51] [INFO ] Invariant cache hit.
[2024-05-25 23:01:51] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-25 23:01:51] [INFO ] Invariant cache hit.
[2024-05-25 23:01:51] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 23:01:51] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2024-05-25 23:01:51] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 23:01:51] [INFO ] Invariant cache hit.
[2024-05-25 23:01:51] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 20/20 places, 28/28 transitions.
Ending property specific reduction for Murphy-PT-D3N050-UpperBounds-12 in 1123 ms.
Starting property specific reduction for Murphy-PT-D3N050-UpperBounds-14
[2024-05-25 23:01:51] [INFO ] Invariant cache hit.
Incomplete random walk after 10039 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2007 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :1
[2024-05-25 23:01:51] [INFO ] Invariant cache hit.
[2024-05-25 23:01:51] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:51] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 23:01:51] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 23:01:51] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:01:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 23:01:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:51] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 23:01:51] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:01:51] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 23:01:51] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Graph (complete) has 56 edges and 20 vertex of which 3 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 23 output transitions
Drop transitions removed 23 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 4
Applied a total of 2 rules in 1 ms. Remains 3 /20 variables (removed 17) and now considering 4/28 (removed 24) transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-05-25 23:01:51] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 23:01:51] [INFO ] Dead Transitions using invariants and state equation in 14 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 3/20 places, 4/28 transitions.
[2024-05-25 23:01:51] [INFO ] Invariant cache hit.
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 224 ms. (steps per millisecond=4464 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 182 ms. (steps per millisecond=5494 ) properties (out of 1) seen :1
[2024-05-25 23:01:52] [INFO ] Invariant cache hit.
[2024-05-25 23:01:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:52] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-25 23:01:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:01:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:01:52] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-25 23:01:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 23:01:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-25 23:01:52] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-25 23:01:52] [INFO ] Added : 3 causal constraints over 2 iterations in 3 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 3/3 places, 4/4 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-05-25 23:01:52] [INFO ] Invariant cache hit.
[2024-05-25 23:01:52] [INFO ] Implicit Places using invariants in 12 ms returned []
[2024-05-25 23:01:52] [INFO ] Invariant cache hit.
[2024-05-25 23:01:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 23:01:52] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2024-05-25 23:01:52] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 23:01:52] [INFO ] Invariant cache hit.
[2024-05-25 23:01:52] [INFO ] Dead Transitions using invariants and state equation in 14 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 3/3 places, 4/4 transitions.
Ending property specific reduction for Murphy-PT-D3N050-UpperBounds-14 in 632 ms.
[2024-05-25 23:01:52] [INFO ] Flatten gal took : 20 ms
[2024-05-25 23:01:52] [INFO ] Applying decomposition
[2024-05-25 23:01:52] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph8002092292799903995.txt' '-o' '/tmp/graph8002092292799903995.bin' '-w' '/tmp/graph8002092292799903995.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8002092292799903995.bin' '-l' '-1' '-v' '-w' '/tmp/graph8002092292799903995.weights' '-q' '0' '-e' '0.001'
[2024-05-25 23:01:52] [INFO ] Decomposing Gal with order
[2024-05-25 23:01:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 23:01:52] [INFO ] Flatten gal took : 86 ms
[2024-05-25 23:01:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-25 23:01:52] [INFO ] Time to serialize gal into /tmp/UpperBounds11398613913103114665.gal : 11 ms
[2024-05-25 23:01:52] [INFO ] Time to serialize properties into /tmp/UpperBounds12243010708096734123.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.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds11398613913103114665.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds12243010708096734123.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...285
Loading property file /tmp/UpperBounds12243010708096734123.prop.
Detected timeout of ITS tools.
[2024-05-25 23:22:03] [INFO ] Flatten gal took : 4 ms
[2024-05-25 23:22:03] [INFO ] Time to serialize gal into /tmp/UpperBounds3635813167009397364.gal : 15 ms
[2024-05-25 23:22:03] [INFO ] Time to serialize properties into /tmp/UpperBounds1185288349505295586.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.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds3635813167009397364.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds1185288349505295586.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.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...304
Loading property file /tmp/UpperBounds1185288349505295586.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,5.4071e+14,49.9349,715300,2,7445,5,2.50568e+06,6,0,139,2.74917e+06,0
Total reachable state count : 540710084330928

Verifying 11 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property Murphy-PT-D3N050-UpperBounds-00 :0 <= p4_4 <= 2
FORMULA Murphy-PT-D3N050-UpperBounds-00 2 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Murphy-PT-D3N050-UpperBounds-00,0,49.9359,715300,1,0,7,2.50568e+06,9,1,171,2.74917e+06,4
Min sum of variable value : 0
Maximum sum along a path : 3
Bounds property Murphy-PT-D3N050-UpperBounds-01 :0 <= p5_1 <= 3
FORMULA Murphy-PT-D3N050-UpperBounds-01 3 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Murphy-PT-D3N050-UpperBounds-01,0,49.9861,715300,1,0,8,2.50568e+06,10,1,214,2.74917e+06,5
Min sum of variable value : 0
Maximum sum along a path : 3
Bounds property Murphy-PT-D3N050-UpperBounds-02 :0 <= p5_2 <= 3
FORMULA Murphy-PT-D3N050-UpperBounds-02 3 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Murphy-PT-D3N050-UpperBounds-02,0,50.0127,715300,1,0,9,2.50568e+06,11,1,241,2.74917e+06,6
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property Murphy-PT-D3N050-UpperBounds-03 :0 <= p4_2 <= 2
FORMULA Murphy-PT-D3N050-UpperBounds-03 2 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Murphy-PT-D3N050-UpperBounds-03,0,50.0411,715300,1,0,10,2.50568e+06,12,1,271,2.74917e+06,7
Min sum of variable value : 0
Maximum sum along a path : 199
Bounds property Murphy-PT-D3N050-UpperBounds-04 :0 <= p1_4 <= 199
FORMULA Murphy-PT-D3N050-UpperBounds-04 199 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Murphy-PT-D3N050-UpperBounds-04,0,50.043,715300,1,0,11,2.50568e+06,13,1,480,2.74917e+06,8
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property Murphy-PT-D3N050-UpperBounds-07 :0 <= p3_3 <= 1
FORMULA Murphy-PT-D3N050-UpperBounds-07 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Murphy-PT-D3N050-UpperBounds-07,0,50.0485,715300,1,0,12,2.50568e+06,14,1,497,2.74917e+06,9
Min sum of variable value : 0
Maximum sum along a path : 3
Bounds property Murphy-PT-D3N050-UpperBounds-09 :0 <= p5_3 <= 3
FORMULA Murphy-PT-D3N050-UpperBounds-09 3 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Murphy-PT-D3N050-UpperBounds-09,0,50.0541,715300,1,0,13,2.50568e+06,15,1,514,2.74917e+06,10
Min sum of variable value : 0
Maximum sum along a path : 199
Bounds property Murphy-PT-D3N050-UpperBounds-10 :0 <= p1_3 <= 199
FORMULA Murphy-PT-D3N050-UpperBounds-10 199 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Murphy-PT-D3N050-UpperBounds-10,0,50.1174,715300,1,0,14,2.50568e+06,16,1,733,2.74917e+06,11
Min sum of variable value : 0
Maximum sum along a path : 3
Bounds property Murphy-PT-D3N050-UpperBounds-11 :0 <= p5_4 <= 3
FORMULA Murphy-PT-D3N050-UpperBounds-11 3 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Murphy-PT-D3N050-UpperBounds-11,0,50.1175,715300,1,0,15,2.50568e+06,17,1,740,2.74917e+06,12
Min sum of variable value : 0
Maximum sum along a path : 199
Bounds property Murphy-PT-D3N050-UpperBounds-12 :0 <= p1_2 <= 199
FORMULA Murphy-PT-D3N050-UpperBounds-12 199 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Murphy-PT-D3N050-UpperBounds-12,0,50.2694,715300,1,0,16,2.50568e+06,18,1,969,2.74917e+06,13
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property Murphy-PT-D3N050-UpperBounds-14 :0 <= p3_2 <= 1
FORMULA Murphy-PT-D3N050-UpperBounds-14 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Murphy-PT-D3N050-UpperBounds-14,0,50.2972,715300,1,0,17,2.50568e+06,19,1,996,2.74917e+06,14
Total runtime 1292884 ms.

BK_STOP 1716679374312

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="Murphy-PT-D3N050"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is Murphy-PT-D3N050, 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 r263-tall-171654372300196"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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