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-171654372300201.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-D4N025, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-tall-171654372300201
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 6.2K Apr 11 22:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 11 22:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Apr 11 22:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 11 22:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K 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.0K May 6 10:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 6 10:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 22:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Apr 11 22:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 22:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Apr 11 22:52 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 19K 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-D4N025-UpperBounds-00
FORMULA_NAME Murphy-PT-D4N025-UpperBounds-01
FORMULA_NAME Murphy-PT-D4N025-UpperBounds-02
FORMULA_NAME Murphy-PT-D4N025-UpperBounds-03
FORMULA_NAME Murphy-PT-D4N025-UpperBounds-04
FORMULA_NAME Murphy-PT-D4N025-UpperBounds-05
FORMULA_NAME Murphy-PT-D4N025-UpperBounds-06
FORMULA_NAME Murphy-PT-D4N025-UpperBounds-07
FORMULA_NAME Murphy-PT-D4N025-UpperBounds-08
FORMULA_NAME Murphy-PT-D4N025-UpperBounds-09
FORMULA_NAME Murphy-PT-D4N025-UpperBounds-10
FORMULA_NAME Murphy-PT-D4N025-UpperBounds-11
FORMULA_NAME Murphy-PT-D4N025-UpperBounds-12
FORMULA_NAME Murphy-PT-D4N025-UpperBounds-13
FORMULA_NAME Murphy-PT-D4N025-UpperBounds-14
FORMULA_NAME Murphy-PT-D4N025-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716679383996

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-D4N025
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-25 23:23:05] [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:23:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 23:23:05] [INFO ] Load time of PNML (sax parser for PT used): 28 ms
[2024-05-25 23:23:05] [INFO ] Transformed 30 places.
[2024-05-25 23:23:05] [INFO ] Transformed 35 transitions.
[2024-05-25 23:23:05] [INFO ] Parsed PT model containing 30 places and 35 transitions and 135 arcs in 87 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 35 rows 30 cols
[2024-05-25 23:23:05] [INFO ] Computed 6 invariants in 11 ms
Incomplete random walk after 10012 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=417 ) properties (out of 16) seen :260
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 16) seen :221
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 16) seen :150
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 :136
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 :227
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 :225
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 :148
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 16) seen :126
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 :160
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 16) seen :135
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 :130
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 :158
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 :207
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 :160
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 :173
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 :150
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 :159
[2024-05-25 23:23:05] [INFO ] Invariant cache hit.
[2024-05-25 23:23:06] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-25 23:23:06] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-25 23:23:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:06] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-25 23:23:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:23:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:06] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 23:23:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:06] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-25 23:23:06] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 23:23:06] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2024-05-25 23:23:06] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-25 23:23:06] [INFO ] Added : 0 causal constraints over 0 iterations in 12 ms. Result :sat
Minimization took 15 ms.
[2024-05-25 23:23:06] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:06] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 23:23:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:06] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-25 23:23:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:23:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:06] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 23:23:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:06] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-25 23:23:06] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:23:06] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 23:23:06] [INFO ] Added : 2 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 23:23:06] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 23:23:06] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 23:23:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:06] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-25 23:23:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:23:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:06] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-25 23:23:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:06] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-25 23:23:06] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2024-05-25 23:23:06] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-25 23:23:06] [INFO ] Added : 3 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 4 ms.
[2024-05-25 23:23:06] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:06] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 23:23:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:06] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-25 23:23:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:23:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-25 23:23:06] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 23:23:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:06] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-25 23:23:06] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2024-05-25 23:23:06] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-25 23:23:06] [INFO ] Added : 0 causal constraints over 0 iterations in 16 ms. Result :sat
Minimization took 11 ms.
[2024-05-25 23:23:06] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:06] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-05-25 23:23:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:06] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 23:23:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:23:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:06] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 23:23:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:06] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-25 23:23:06] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 23:23:06] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 23:23:06] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 11 ms.
[2024-05-25 23:23:06] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:06] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 23:23:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:06] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-25 23:23:06] [INFO ] [Real]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 23:23:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:23:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:06] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-05-25 23:23:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:06] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 23:23:06] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 23:23:06] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 23:23:06] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 4 ms.
[2024-05-25 23:23:06] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:06] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 23:23:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:06] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 23:23:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:23:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:06] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 23:23:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:06] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 23:23:06] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:23:06] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 23:23:06] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2024-05-25 23:23:06] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:06] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 23:23:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:06] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 23:23:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:23:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 23:23:06] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 23:23:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:06] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-25 23:23:06] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 23:23:06] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 7 ms to minimize.
[2024-05-25 23:23:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2024-05-25 23:23:06] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-25 23:23:06] [INFO ] Added : 3 causal constraints over 1 iterations in 15 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 23:23:07] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 23:23:07] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 23:23:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:07] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 23:23:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:23:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:07] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 23:23:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:07] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-25 23:23:07] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:23:07] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 23:23:07] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Minimization took 7 ms.
[2024-05-25 23:23:07] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 23:23:07] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-05-25 23:23:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:07] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-25 23:23:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:23:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:07] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 23:23:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:07] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-25 23:23:07] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 23:23:07] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 23:23:07] [INFO ] Added : 0 causal constraints over 0 iterations in 12 ms. Result :sat
Minimization took 17 ms.
[2024-05-25 23:23:07] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:07] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-05-25 23:23:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:07] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 23:23:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:23:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 23:23:07] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 23:23:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:07] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-25 23:23:07] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 23:23:07] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 23:23:07] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 16 ms.
[2024-05-25 23:23:07] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:07] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 23:23:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:07] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 23:23:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:23:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-25 23:23:07] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 23:23:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:07] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-25 23:23:07] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 23:23:07] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 23:23:07] [INFO ] Added : 0 causal constraints over 0 iterations in 14 ms. Result :sat
Minimization took 10 ms.
[2024-05-25 23:23:07] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:07] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 23:23:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:07] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-25 23:23:07] [INFO ] [Real]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 23:23:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:23:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:07] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 23:23:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:07] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-25 23:23:07] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:23:07] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 11 ms.
[2024-05-25 23:23:07] [INFO ] Added : 0 causal constraints over 0 iterations in 16 ms. Result :sat
Minimization took 12 ms.
[2024-05-25 23:23:07] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:07] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 5 ms returned sat
[2024-05-25 23:23:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:07] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-25 23:23:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:23:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:07] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 23:23:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:07] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 23:23:07] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:23:07] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 23:23:07] [INFO ] Added : 1 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 4 ms.
[2024-05-25 23:23:07] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 23:23:07] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-05-25 23:23:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:07] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 23:23:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:23:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:07] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 23:23:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:07] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 23:23:07] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 23:23:07] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 23:23:07] [INFO ] Added : 1 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 23:23:07] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:07] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 23:23:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:07] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-25 23:23:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:23:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:07] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 23:23:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:07] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 23:23:07] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2024-05-25 23:23:07] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 2 ms to minimize.
[2024-05-25 23:23:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2024-05-25 23:23:07] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 23:23:07] [INFO ] Added : 3 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [130, -1, -1, 130, 130, -1, -1, -1, 130, 130, 130, 130, 130, -1, -1, -1] Max seen :[66, 2, 3, 72, 66, 1, 2, 2, 70, 54, 56, 72, 58, 1, 1, 2]
FORMULA Murphy-PT-D4N025-UpperBounds-09 130 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Murphy-PT-D4N025-UpperBounds-04 130 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Murphy-PT-D4N025-UpperBounds-00 130 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Murphy-PT-D4N025-UpperBounds-11 130 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Murphy-PT-D4N025-UpperBounds-03 130 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 11 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 9 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-05-25 23:23:08] [INFO ] Invariant cache hit.
[2024-05-25 23:23:08] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 30/30 places, 35/35 transitions.
[2024-05-25 23:23:08] [INFO ] Invariant cache hit.
Incomplete random walk after 1000013 steps, including 2 resets, run finished after 672 ms. (steps per millisecond=1488 ) properties (out of 11) seen :148
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 530 ms. (steps per millisecond=1886 ) properties (out of 11) seen :149
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 454 ms. (steps per millisecond=2202 ) properties (out of 11) seen :193
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 434 ms. (steps per millisecond=2304 ) properties (out of 11) seen :193
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 496 ms. (steps per millisecond=2016 ) properties (out of 11) seen :167
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 500 ms. (steps per millisecond=2000 ) properties (out of 11) seen :134
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 484 ms. (steps per millisecond=2066 ) properties (out of 11) seen :114
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 446 ms. (steps per millisecond=2242 ) properties (out of 11) seen :138
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 450 ms. (steps per millisecond=2222 ) properties (out of 11) seen :166
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 462 ms. (steps per millisecond=2164 ) properties (out of 11) seen :114
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 454 ms. (steps per millisecond=2202 ) properties (out of 11) seen :113
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 511 ms. (steps per millisecond=1956 ) properties (out of 11) seen :146
[2024-05-25 23:23:14] [INFO ] Invariant cache hit.
[2024-05-25 23:23:14] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:14] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-05-25 23:23:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:14] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 23:23:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:23:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:14] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-05-25 23:23:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:14] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-25 23:23:14] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 23:23:14] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 23:23:14] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 23:23:14] [INFO ] Added : 2 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 9 ms.
[2024-05-25 23:23:14] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:14] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 23:23:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:14] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 23:23:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:23:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-25 23:23:14] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 23:23:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:14] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-25 23:23:14] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 23:23:14] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 23:23:14] [INFO ] Added : 3 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 4 ms.
[2024-05-25 23:23:14] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:14] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 23:23:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:14] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-25 23:23:14] [INFO ] [Real]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 23:23:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:23:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:14] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-05-25 23:23:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:14] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-25 23:23:14] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 23:23:14] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 23:23:14] [INFO ] Added : 1 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 23:23:14] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:14] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 23:23:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:14] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-25 23:23:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:23:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:14] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-25 23:23:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:14] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-25 23:23:14] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:23:14] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 23:23:14] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 23:23:14] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:14] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 23:23:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:14] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 23:23:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:23:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:14] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-25 23:23:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:14] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 23:23:14] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 23:23:14] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 2 ms to minimize.
[2024-05-25 23:23:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2024-05-25 23:23:14] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-25 23:23:14] [INFO ] Added : 3 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 23:23:14] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 23:23:14] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 23:23:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:14] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 23:23:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:23:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:14] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 23:23:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:14] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-25 23:23:14] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:23:14] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-05-25 23:23:14] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
[2024-05-25 23:23:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 57 ms
[2024-05-25 23:23:14] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 23:23:14] [INFO ] Added : 1 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 9 ms.
[2024-05-25 23:23:14] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:14] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-05-25 23:23:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:14] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 23:23:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:23:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:14] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 23:23:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:14] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-25 23:23:14] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:23:14] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 1 ms to minimize.
[2024-05-25 23:23:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2024-05-25 23:23:14] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 23:23:14] [INFO ] Added : 1 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 23:23:14] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:14] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 23:23:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:14] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 23:23:14] [INFO ] [Real]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:23:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:23:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:14] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 23:23:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:14] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-25 23:23:14] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:23:14] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-25 23:23:14] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 23:23:14] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:14] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 23:23:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:14] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-25 23:23:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:23:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:15] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 23:23:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:15] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 23:23:15] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:23:15] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 23:23:15] [INFO ] Added : 1 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 7 ms.
[2024-05-25 23:23:15] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:15] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 23:23:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:15] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 23:23:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:23:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:15] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 23:23:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:15] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-25 23:23:15] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 23:23:15] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 23:23:15] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2024-05-25 23:23:15] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:15] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-05-25 23:23:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:15] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-25 23:23:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:23:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:15] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 23:23:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:15] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-25 23:23:15] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 23:23:15] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
[2024-05-25 23:23:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
[2024-05-25 23:23:15] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-25 23:23:15] [INFO ] Added : 3 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, -1, 130, 130, 130, -1, -1, -1] Max seen :[2, 3, 1, 2, 2, 126, 128, 129, 1, 1, 2]
FORMULA Murphy-PT-D4N025-UpperBounds-12 130 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 10 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 30/30 places, 35/35 transitions.
[2024-05-25 23:23:15] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 629 ms. (steps per millisecond=1589 ) properties (out of 10) seen :97
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 536 ms. (steps per millisecond=1865 ) properties (out of 10) seen :80
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 468 ms. (steps per millisecond=2136 ) properties (out of 10) seen :70
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 455 ms. (steps per millisecond=2197 ) properties (out of 10) seen :73
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 522 ms. (steps per millisecond=1915 ) properties (out of 10) seen :72
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 520 ms. (steps per millisecond=1923 ) properties (out of 10) seen :71
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 457 ms. (steps per millisecond=2188 ) properties (out of 10) seen :111
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 450 ms. (steps per millisecond=2222 ) properties (out of 10) seen :107
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 443 ms. (steps per millisecond=2257 ) properties (out of 10) seen :70
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 428 ms. (steps per millisecond=2336 ) properties (out of 10) seen :69
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 510 ms. (steps per millisecond=1960 ) properties (out of 10) seen :70
[2024-05-25 23:23:20] [INFO ] Invariant cache hit.
[2024-05-25 23:23:20] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:20] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 23:23:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:20] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-25 23:23:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:23:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:20] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 23:23:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:20] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-25 23:23:20] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 23:23:20] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 23:23:20] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 23:23:20] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 10 ms.
[2024-05-25 23:23:20] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:20] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 23:23:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:20] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-25 23:23:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:23:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:20] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 23:23:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:20] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-25 23:23:20] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 23:23:20] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 23:23:20] [INFO ] Added : 3 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 4 ms.
[2024-05-25 23:23:20] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 23:23:20] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 23:23:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:20] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 23:23:20] [INFO ] [Real]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:23:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:23:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:20] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-05-25 23:23:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:20] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-25 23:23:21] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:23:21] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 23:23:21] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 23:23:21] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:21] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-05-25 23:23:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:21] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 23:23:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:23:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:21] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 23:23:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:21] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 23:23:21] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:23:21] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 23:23:21] [INFO ] Added : 2 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 4 ms.
[2024-05-25 23:23:21] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:21] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 23:23:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:21] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 23:23:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:23:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:21] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 23:23:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:21] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-25 23:23:21] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 23:23:21] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
[2024-05-25 23:23:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 19 ms
[2024-05-25 23:23:21] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-25 23:23:21] [INFO ] Added : 3 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 23:23:21] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:21] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 23:23:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:21] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 23:23:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:23:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:21] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 23:23:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:21] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 23:23:21] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 23:23:21] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
[2024-05-25 23:23:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2024-05-25 23:23:21] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 23:23:21] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 23:23:21] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:21] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 23:23:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:21] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 23:23:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:23:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:21] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-05-25 23:23:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:21] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-25 23:23:21] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:23:21] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
[2024-05-25 23:23:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2024-05-25 23:23:21] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 23:23:21] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 23:23:21] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:21] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 23:23:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:21] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-25 23:23:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:23:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:21] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 23:23:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:21] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-25 23:23:21] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:23:21] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 23:23:21] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2024-05-25 23:23:21] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:21] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 23:23:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:21] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-25 23:23:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:23:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 23:23:21] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 23:23:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:21] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 23:23:21] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 23:23:21] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 23:23:21] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2024-05-25 23:23:21] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:21] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 23:23:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:21] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-25 23:23:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:23:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-25 23:23:21] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 23:23:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:21] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 23:23:21] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:23:21] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
[2024-05-25 23:23:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
[2024-05-25 23:23:21] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 23:23:21] [INFO ] Added : 3 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, -1, 130, 130, -1, -1, -1] Max seen :[2, 3, 1, 2, 2, 128, 128, 1, 1, 2]
Support contains 10 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 4 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 30/30 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-05-25 23:23:21] [INFO ] Invariant cache hit.
[2024-05-25 23:23:21] [INFO ] Implicit Places using invariants in 34 ms returned [10, 11, 12, 13, 14]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 36 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 25/30 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 40 ms. Remains : 25/30 places, 35/35 transitions.
// Phase 1: matrix 35 rows 25 cols
[2024-05-25 23:23:21] [INFO ] Computed 1 invariants in 1 ms
Incomplete random walk after 1000003 steps, including 2 resets, run finished after 567 ms. (steps per millisecond=1763 ) properties (out of 10) seen :112
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 413 ms. (steps per millisecond=2421 ) properties (out of 10) seen :82
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 377 ms. (steps per millisecond=2652 ) properties (out of 10) seen :66
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 369 ms. (steps per millisecond=2710 ) properties (out of 10) seen :67
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 419 ms. (steps per millisecond=2386 ) properties (out of 10) seen :77
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 425 ms. (steps per millisecond=2352 ) properties (out of 10) seen :73
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 382 ms. (steps per millisecond=2617 ) properties (out of 10) seen :123
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 390 ms. (steps per millisecond=2564 ) properties (out of 10) seen :111
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 377 ms. (steps per millisecond=2652 ) properties (out of 10) seen :72
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 377 ms. (steps per millisecond=2652 ) properties (out of 10) seen :68
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 427 ms. (steps per millisecond=2341 ) properties (out of 10) seen :69
[2024-05-25 23:23:26] [INFO ] Invariant cache hit.
[2024-05-25 23:23:26] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:26] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 23:23:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:23:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 23:23:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:26] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 23:23:26] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 23:23:26] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2024-05-25 23:23:26] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 23:23:26] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 23:23:26] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:26] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 23:23:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:23:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 23:23:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:26] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 23:23:26] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:23:26] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 23:23:26] [INFO ] Added : 3 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 8 ms.
[2024-05-25 23:23:26] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:26] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 23:23:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:23:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:26] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 23:23:26] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:23:26] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 23:23:26] [INFO ] Added : 1 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 4 ms.
[2024-05-25 23:23:26] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:26] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-25 23:23:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:23:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:26] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 23:23:26] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 23:23:26] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 23:23:26] [INFO ] Added : 2 causal constraints over 1 iterations in 15 ms. Result :sat
Minimization took 4 ms.
[2024-05-25 23:23:26] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:26] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 23:23:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:23:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 23:23:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:26] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 23:23:26] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:23:26] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 23:23:26] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2024-05-25 23:23:26] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 23:23:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:26] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 23:23:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:23:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:26] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 23:23:26] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:23:26] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-05-25 23:23:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2024-05-25 23:23:26] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 23:23:26] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 23:23:26] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:26] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 23:23:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:23:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:26] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 23:23:26] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:23:26] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-05-25 23:23:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2024-05-25 23:23:26] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 23:23:26] [INFO ] Added : 2 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 23:23:26] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:26] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 23:23:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:23:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:27] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-25 23:23:27] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:23:27] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 23:23:27] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 23:23:27] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:27] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 23:23:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:23:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:27] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 23:23:27] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 23:23:27] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 23:23:27] [INFO ] Added : 1 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 4 ms.
[2024-05-25 23:23:27] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 23:23:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:27] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 23:23:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:23:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:27] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 23:23:27] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 23:23:27] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 23:23:27] [INFO ] Added : 2 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, -1, 130, 130, -1, -1, -1] Max seen :[2, 3, 1, 2, 2, 128, 128, 1, 1, 2]
Support contains 10 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 25/25 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-05-25 23:23:27] [INFO ] Invariant cache hit.
[2024-05-25 23:23:27] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-25 23:23:27] [INFO ] Invariant cache hit.
[2024-05-25 23:23:27] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 23:23:27] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-05-25 23:23:27] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 23:23:27] [INFO ] Invariant cache hit.
[2024-05-25 23:23:27] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 25/25 places, 35/35 transitions.
Starting property specific reduction for Murphy-PT-D4N025-UpperBounds-01
[2024-05-25 23:23:27] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) 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:23:27] [INFO ] Invariant cache hit.
[2024-05-25 23:23:27] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 23:23:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:27] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 23:23:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:23:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:27] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 23:23:27] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 23:23:27] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:23:27] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 23:23:27] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Graph (complete) has 70 edges and 25 vertex of which 3 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.0 ms
Discarding 22 places :
Also discarding 30 output transitions
Drop transitions removed 30 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 3 ms. Remains 3 /25 variables (removed 22) and now considering 4/35 (removed 31) transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-05-25 23:23:27] [INFO ] Computed 0 invariants in 1 ms
[2024-05-25 23:23:27] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 3/25 places, 4/35 transitions.
[2024-05-25 23:23:27] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 240 ms. (steps per millisecond=4166 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 238 ms. (steps per millisecond=4201 ) properties (out of 1) seen :2
[2024-05-25 23:23:27] [INFO ] Invariant cache hit.
[2024-05-25 23:23:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:27] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-25 23:23:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:23:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:27] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-25 23:23:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 23:23:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-25 23:23:27] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-25 23:23:27] [INFO ] Added : 2 causal constraints over 1 iterations in 3 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:23:27] [INFO ] Invariant cache hit.
[2024-05-25 23:23:27] [INFO ] Implicit Places using invariants in 13 ms returned []
[2024-05-25 23:23:27] [INFO ] Invariant cache hit.
[2024-05-25 23:23:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 23:23:28] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2024-05-25 23:23:28] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 23:23:28] [INFO ] Invariant cache hit.
[2024-05-25 23:23:28] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 3/3 places, 4/4 transitions.
Ending property specific reduction for Murphy-PT-D4N025-UpperBounds-01 in 700 ms.
Starting property specific reduction for Murphy-PT-D4N025-UpperBounds-02
// Phase 1: matrix 35 rows 25 cols
[2024-05-25 23:23:28] [INFO ] Computed 1 invariants in 1 ms
Incomplete random walk after 10021 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1670 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :3
[2024-05-25 23:23:28] [INFO ] Invariant cache hit.
[2024-05-25 23:23:28] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:28] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 23:23:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:23:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 23:23:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:28] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 23:23:28] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 23:23:28] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:23:28] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 23:23:28] [INFO ] Added : 3 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[3]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Graph (complete) has 70 edges and 25 vertex of which 3 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.0 ms
Discarding 22 places :
Also discarding 30 output transitions
Drop transitions removed 30 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 /25 variables (removed 22) and now considering 4/35 (removed 31) transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-05-25 23:23:28] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 23:23:28] [INFO ] Dead Transitions using invariants and state equation in 13 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 3/25 places, 4/35 transitions.
[2024-05-25 23:23:28] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 226 ms. (steps per millisecond=4424 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 179 ms. (steps per millisecond=5586 ) properties (out of 1) seen :3
[2024-05-25 23:23:28] [INFO ] Invariant cache hit.
[2024-05-25 23:23:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:28] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-25 23:23:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:23:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:28] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-25 23:23:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 23:23:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-25 23:23:28] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-25 23:23:28] [INFO ] Added : 3 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 10 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 1 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-05-25 23:23:28] [INFO ] Invariant cache hit.
[2024-05-25 23:23:28] [INFO ] Implicit Places using invariants in 13 ms returned []
[2024-05-25 23:23:28] [INFO ] Invariant cache hit.
[2024-05-25 23:23:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 23:23:28] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2024-05-25 23:23:28] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 23:23:28] [INFO ] Invariant cache hit.
[2024-05-25 23:23:28] [INFO ] Dead Transitions using invariants and state equation in 20 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-D4N025-UpperBounds-02 in 633 ms.
Starting property specific reduction for Murphy-PT-D4N025-UpperBounds-05
// Phase 1: matrix 35 rows 25 cols
[2024-05-25 23:23:28] [INFO ] Computed 1 invariants in 0 ms
Incomplete random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) 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:23:28] [INFO ] Invariant cache hit.
[2024-05-25 23:23:28] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:28] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 23:23:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:23:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:28] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 23:23:28] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 23:23:28] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:23:28] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 23:23:28] [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 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Graph (complete) has 70 edges and 25 vertex of which 3 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.0 ms
Discarding 22 places :
Also discarding 30 output transitions
Drop transitions removed 30 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 /25 variables (removed 22) and now considering 4/35 (removed 31) transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-05-25 23:23:28] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 23:23:28] [INFO ] Dead Transitions using invariants and state equation in 13 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 3/25 places, 4/35 transitions.
[2024-05-25 23:23:28] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 227 ms. (steps per millisecond=4405 ) 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:23:29] [INFO ] Invariant cache hit.
[2024-05-25 23:23:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:29] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-25 23:23:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:23:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:29] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-25 23:23:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 23:23:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-25 23:23:29] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-25 23:23:29] [INFO ] Added : 3 causal constraints over 2 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 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 1 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-05-25 23:23:29] [INFO ] Invariant cache hit.
[2024-05-25 23:23:29] [INFO ] Implicit Places using invariants in 12 ms returned []
[2024-05-25 23:23:29] [INFO ] Invariant cache hit.
[2024-05-25 23:23:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 23:23:29] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 28 ms to find 0 implicit places.
[2024-05-25 23:23:29] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 23:23:29] [INFO ] Invariant cache hit.
[2024-05-25 23:23:29] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 3/3 places, 4/4 transitions.
Ending property specific reduction for Murphy-PT-D4N025-UpperBounds-05 in 620 ms.
Starting property specific reduction for Murphy-PT-D4N025-UpperBounds-06
// Phase 1: matrix 35 rows 25 cols
[2024-05-25 23:23:29] [INFO ] Computed 1 invariants in 0 ms
Incomplete random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :2
[2024-05-25 23:23:29] [INFO ] Invariant cache hit.
[2024-05-25 23:23:29] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:29] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 23:23:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:23:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:29] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-25 23:23:29] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 23:23:29] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:23:29] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 23:23:29] [INFO ] Added : 2 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Graph (complete) has 70 edges and 25 vertex of which 3 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.1 ms
Discarding 22 places :
Also discarding 30 output transitions
Drop transitions removed 30 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 /25 variables (removed 22) and now considering 4/35 (removed 31) transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-05-25 23:23:29] [INFO ] Computed 0 invariants in 1 ms
[2024-05-25 23:23:29] [INFO ] Dead Transitions using invariants and state equation in 13 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 3/25 places, 4/35 transitions.
[2024-05-25 23:23:29] [INFO ] Invariant cache hit.
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 228 ms. (steps per millisecond=4385 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 176 ms. (steps per millisecond=5681 ) properties (out of 1) seen :2
[2024-05-25 23:23:29] [INFO ] Invariant cache hit.
[2024-05-25 23:23:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:29] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-25 23:23:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:23:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:29] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-25 23:23:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 23:23:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:23:29] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 23:23:29] [INFO ] Added : 2 causal constraints over 1 iterations in 4 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 1 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-05-25 23:23:29] [INFO ] Invariant cache hit.
[2024-05-25 23:23:29] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-25 23:23:29] [INFO ] Invariant cache hit.
[2024-05-25 23:23:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 23:23:29] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2024-05-25 23:23:29] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 23:23:29] [INFO ] Invariant cache hit.
[2024-05-25 23:23:29] [INFO ] Dead Transitions using invariants and state equation in 16 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-D4N025-UpperBounds-06 in 626 ms.
Starting property specific reduction for Murphy-PT-D4N025-UpperBounds-07
// Phase 1: matrix 35 rows 25 cols
[2024-05-25 23:23:29] [INFO ] Computed 1 invariants in 3 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :2
[2024-05-25 23:23:29] [INFO ] Invariant cache hit.
[2024-05-25 23:23:29] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:29] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-25 23:23:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:23:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:29] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 23:23:29] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 23:23:29] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2024-05-25 23:23:29] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 23:23:29] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Graph (complete) has 70 edges and 25 vertex of which 3 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.0 ms
Discarding 22 places :
Also discarding 30 output transitions
Drop transitions removed 30 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 /25 variables (removed 22) and now considering 4/35 (removed 31) transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-05-25 23:23:30] [INFO ] Computed 0 invariants in 1 ms
[2024-05-25 23:23:30] [INFO ] Dead Transitions using invariants and state equation in 14 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 3/25 places, 4/35 transitions.
[2024-05-25 23:23:30] [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 :2
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 174 ms. (steps per millisecond=5747 ) properties (out of 1) seen :2
[2024-05-25 23:23:30] [INFO ] Invariant cache hit.
[2024-05-25 23:23:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:30] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-25 23:23:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:23:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:30] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-25 23:23:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 23:23:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-25 23:23:30] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-25 23:23:30] [INFO ] Added : 2 causal constraints over 1 iterations in 2 ms. Result :sat
Minimization took 5 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 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-05-25 23:23:30] [INFO ] Invariant cache hit.
[2024-05-25 23:23:30] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-25 23:23:30] [INFO ] Invariant cache hit.
[2024-05-25 23:23:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 23:23:30] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2024-05-25 23:23:30] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 23:23:30] [INFO ] Invariant cache hit.
[2024-05-25 23:23:30] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 3/3 places, 4/4 transitions.
Ending property specific reduction for Murphy-PT-D4N025-UpperBounds-07 in 627 ms.
Starting property specific reduction for Murphy-PT-D4N025-UpperBounds-08
// Phase 1: matrix 35 rows 25 cols
[2024-05-25 23:23:30] [INFO ] Computed 1 invariants in 0 ms
Incomplete random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :26
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 :52
[2024-05-25 23:23:30] [INFO ] Invariant cache hit.
[2024-05-25 23:23:30] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:30] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-25 23:23:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:23:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 23:23:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:30] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 23:23:30] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 23:23:30] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:23:30] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 23:23:30] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : [130] Max seen :[52]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-05-25 23:23:30] [INFO ] Invariant cache hit.
[2024-05-25 23:23:30] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 25/25 places, 35/35 transitions.
[2024-05-25 23:23:30] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 494 ms. (steps per millisecond=2024 ) properties (out of 1) seen :56
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 374 ms. (steps per millisecond=2673 ) properties (out of 1) seen :80
[2024-05-25 23:23:31] [INFO ] Invariant cache hit.
[2024-05-25 23:23:31] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:31] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-25 23:23:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:23:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:31] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 23:23:31] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 23:23:31] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 23:23:31] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-05-25 23:23:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2024-05-25 23:23:31] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 23:23:31] [INFO ] Added : 1 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [130] Max seen :[128]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 25/25 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-05-25 23:23:31] [INFO ] Invariant cache hit.
[2024-05-25 23:23:31] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-25 23:23:31] [INFO ] Invariant cache hit.
[2024-05-25 23:23:31] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 23:23:31] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2024-05-25 23:23:31] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-25 23:23:31] [INFO ] Invariant cache hit.
[2024-05-25 23:23:31] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 25/25 places, 35/35 transitions.
Ending property specific reduction for Murphy-PT-D4N025-UpperBounds-08 in 1270 ms.
Starting property specific reduction for Murphy-PT-D4N025-UpperBounds-10
[2024-05-25 23:23:31] [INFO ] Invariant cache hit.
Incomplete random walk after 10012 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1668 ) properties (out of 1) seen :30
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :48
[2024-05-25 23:23:31] [INFO ] Invariant cache hit.
[2024-05-25 23:23:31] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-25 23:23:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:31] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 23:23:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:23:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 23:23:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:31] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-25 23:23:31] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 23:23:31] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 23:23:31] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-25 23:23:31] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [130] Max seen :[48]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-05-25 23:23:31] [INFO ] Invariant cache hit.
[2024-05-25 23:23:31] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 25/25 places, 35/35 transitions.
[2024-05-25 23:23:31] [INFO ] Invariant cache hit.
Incomplete random walk after 1000030 steps, including 2 resets, run finished after 485 ms. (steps per millisecond=2061 ) properties (out of 1) seen :44
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 375 ms. (steps per millisecond=2666 ) properties (out of 1) seen :82
[2024-05-25 23:23:32] [INFO ] Invariant cache hit.
[2024-05-25 23:23:32] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 23:23:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:32] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 23:23:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:23:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:32] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 23:23:32] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 23:23:32] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 23:23:32] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
[2024-05-25 23:23:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
[2024-05-25 23:23:32] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 23:23:32] [INFO ] Added : 2 causal constraints over 1 iterations in 15 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : [130] Max seen :[128]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 25/25 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-05-25 23:23:32] [INFO ] Invariant cache hit.
[2024-05-25 23:23:32] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-25 23:23:32] [INFO ] Invariant cache hit.
[2024-05-25 23:23:32] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 23:23:32] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2024-05-25 23:23:32] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 23:23:32] [INFO ] Invariant cache hit.
[2024-05-25 23:23:33] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 25/25 places, 35/35 transitions.
Ending property specific reduction for Murphy-PT-D4N025-UpperBounds-10 in 1217 ms.
Starting property specific reduction for Murphy-PT-D4N025-UpperBounds-13
[2024-05-25 23:23:33] [INFO ] Invariant cache hit.
Incomplete random walk after 10007 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1667 ) 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:23:33] [INFO ] Invariant cache hit.
[2024-05-25 23:23:33] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 23:23:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:33] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 23:23:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:23:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:33] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-25 23:23:33] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 23:23:33] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 23:23:33] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 23:23:33] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Graph (complete) has 70 edges and 25 vertex of which 3 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.0 ms
Discarding 22 places :
Also discarding 30 output transitions
Drop transitions removed 30 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 /25 variables (removed 22) and now considering 4/35 (removed 31) transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-05-25 23:23:33] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 23:23:33] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 3/25 places, 4/35 transitions.
[2024-05-25 23:23:33] [INFO ] Invariant cache hit.
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 236 ms. (steps per millisecond=4237 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 184 ms. (steps per millisecond=5434 ) properties (out of 1) seen :1
[2024-05-25 23:23:33] [INFO ] Invariant cache hit.
[2024-05-25 23:23:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:33] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 23:23:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:23:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:33] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-25 23:23:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 23:23:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-25 23:23:33] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 23:23:33] [INFO ] Added : 3 causal constraints over 2 iterations in 5 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 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 1 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-05-25 23:23:33] [INFO ] Invariant cache hit.
[2024-05-25 23:23:33] [INFO ] Implicit Places using invariants in 13 ms returned []
[2024-05-25 23:23:33] [INFO ] Invariant cache hit.
[2024-05-25 23:23:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 23:23:33] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2024-05-25 23:23:33] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 23:23:33] [INFO ] Invariant cache hit.
[2024-05-25 23:23:33] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 3/3 places, 4/4 transitions.
Ending property specific reduction for Murphy-PT-D4N025-UpperBounds-13 in 644 ms.
Starting property specific reduction for Murphy-PT-D4N025-UpperBounds-14
// Phase 1: matrix 35 rows 25 cols
[2024-05-25 23:23:33] [INFO ] Computed 1 invariants in 0 ms
Incomplete random walk after 10011 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1112 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :1
[2024-05-25 23:23:33] [INFO ] Invariant cache hit.
[2024-05-25 23:23:33] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:33] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 23:23:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:23:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 23:23:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:33] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-25 23:23:33] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 23:23:33] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 23:23:33] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 23:23:33] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Graph (complete) has 70 edges and 25 vertex of which 3 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.0 ms
Discarding 22 places :
Also discarding 30 output transitions
Drop transitions removed 30 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 /25 variables (removed 22) and now considering 4/35 (removed 31) transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-05-25 23:23:33] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 23:23:33] [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/25 places, 4/35 transitions.
[2024-05-25 23:23:33] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 227 ms. (steps per millisecond=4405 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 186 ms. (steps per millisecond=5376 ) properties (out of 1) seen :1
[2024-05-25 23:23:34] [INFO ] Invariant cache hit.
[2024-05-25 23:23:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:34] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-25 23:23:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:23:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:34] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-25 23:23:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 23:23:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-25 23:23:34] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-25 23:23:34] [INFO ] Added : 3 causal constraints over 2 iterations in 4 ms. Result :sat
Minimization took 3 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 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:23:34] [INFO ] Invariant cache hit.
[2024-05-25 23:23:34] [INFO ] Implicit Places using invariants in 13 ms returned []
[2024-05-25 23:23:34] [INFO ] Invariant cache hit.
[2024-05-25 23:23:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 23:23:34] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
[2024-05-25 23:23:34] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 23:23:34] [INFO ] Invariant cache hit.
[2024-05-25 23:23:34] [INFO ] Dead Transitions using invariants and state equation in 13 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 3/3 places, 4/4 transitions.
Ending property specific reduction for Murphy-PT-D4N025-UpperBounds-14 in 635 ms.
Starting property specific reduction for Murphy-PT-D4N025-UpperBounds-15
// Phase 1: matrix 35 rows 25 cols
[2024-05-25 23:23:34] [INFO ] Computed 1 invariants in 2 ms
Incomplete random walk after 10005 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) 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:23:34] [INFO ] Invariant cache hit.
[2024-05-25 23:23:34] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:34] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 23:23:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:23:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 23:23:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:34] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 23:23:34] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 23:23:34] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:23:34] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 23:23:34] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Graph (complete) has 70 edges and 25 vertex of which 3 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.0 ms
Discarding 22 places :
Also discarding 30 output transitions
Drop transitions removed 30 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 /25 variables (removed 22) and now considering 4/35 (removed 31) transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-05-25 23:23:34] [INFO ] Computed 0 invariants in 1 ms
[2024-05-25 23:23:34] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 3/25 places, 4/35 transitions.
[2024-05-25 23:23:34] [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 :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:23:34] [INFO ] Invariant cache hit.
[2024-05-25 23:23:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:34] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-25 23:23:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:23:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 23:23:34] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-25 23:23:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 23:23:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:23:34] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 23:23:34] [INFO ] Added : 2 causal constraints over 1 iterations in 3 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 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-05-25 23:23:34] [INFO ] Invariant cache hit.
[2024-05-25 23:23:34] [INFO ] Implicit Places using invariants in 12 ms returned []
[2024-05-25 23:23:34] [INFO ] Invariant cache hit.
[2024-05-25 23:23:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 23:23:34] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 29 ms to find 0 implicit places.
[2024-05-25 23:23:34] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 23:23:34] [INFO ] Invariant cache hit.
[2024-05-25 23:23:34] [INFO ] Dead Transitions using invariants and state equation in 14 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 3/3 places, 4/4 transitions.
Ending property specific reduction for Murphy-PT-D4N025-UpperBounds-15 in 613 ms.
[2024-05-25 23:23:35] [INFO ] Flatten gal took : 21 ms
[2024-05-25 23:23:35] [INFO ] Applying decomposition
[2024-05-25 23:23:35] [INFO ] Flatten gal took : 6 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/graph13324417257578014473.txt' '-o' '/tmp/graph13324417257578014473.bin' '-w' '/tmp/graph13324417257578014473.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13324417257578014473.bin' '-l' '-1' '-v' '-w' '/tmp/graph13324417257578014473.weights' '-q' '0' '-e' '0.001'
[2024-05-25 23:23:35] [INFO ] Decomposing Gal with order
[2024-05-25 23:23:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 23:23:35] [INFO ] Flatten gal took : 39 ms
[2024-05-25 23:23:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-25 23:23:35] [INFO ] Time to serialize gal into /tmp/UpperBounds1628935754328301830.gal : 1 ms
[2024-05-25 23:23:35] [INFO ] Time to serialize properties into /tmp/UpperBounds5281242409091711150.prop : 0 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/UpperBounds1628935754328301830.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds5281242409091711150.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 ...283
Loading property file /tmp/UpperBounds5281242409091711150.prop.
Detected timeout of ITS tools.
[2024-05-25 23:43:44] [INFO ] Flatten gal took : 4 ms
[2024-05-25 23:43:44] [INFO ] Time to serialize gal into /tmp/UpperBounds324655050576031260.gal : 2 ms
[2024-05-25 23:43:44] [INFO ] Time to serialize properties into /tmp/UpperBounds6907482847935293112.prop : 0 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/UpperBounds324655050576031260.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds6907482847935293112.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 ...303
Loading property file /tmp/UpperBounds6907482847935293112.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,2.00126e+16,29.1254,472064,2,5274,5,1.81204e+06,6,0,173,2.0019e+06,0
Total reachable state count : 20012606308670976

Verifying 10 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property Murphy-PT-D4N025-UpperBounds-01 :0 <= p4_3 <= 2
FORMULA Murphy-PT-D4N025-UpperBounds-01 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-D4N025-UpperBounds-01,0,29.1371,472064,1,0,7,1.81204e+06,9,1,230,2.0019e+06,4
Min sum of variable value : 0
Maximum sum along a path : 3
Bounds property Murphy-PT-D4N025-UpperBounds-02 :0 <= p5_1 <= 3
FORMULA Murphy-PT-D4N025-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-D4N025-UpperBounds-02,0,29.1665,472064,1,0,8,1.81204e+06,10,1,283,2.0019e+06,5
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property Murphy-PT-D4N025-UpperBounds-05 :0 <= p3_1 <= 1
FORMULA Murphy-PT-D4N025-UpperBounds-05 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-D4N025-UpperBounds-05,0,29.1992,472064,1,0,9,1.81204e+06,11,1,335,2.0019e+06,6
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property Murphy-PT-D4N025-UpperBounds-06 :0 <= p4_2 <= 2
FORMULA Murphy-PT-D4N025-UpperBounds-06 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-D4N025-UpperBounds-06,0,29.2203,472064,1,0,10,1.81204e+06,12,1,375,2.0019e+06,7
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property Murphy-PT-D4N025-UpperBounds-07 :0 <= p4_1 <= 2
FORMULA Murphy-PT-D4N025-UpperBounds-07 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-D4N025-UpperBounds-07,0,29.2498,472064,1,0,11,1.81204e+06,13,1,425,2.0019e+06,8
Min sum of variable value : 0
Maximum sum along a path : 128
Bounds property Murphy-PT-D4N025-UpperBounds-08 :0 <= p1_4 <= 128
FORMULA Murphy-PT-D4N025-UpperBounds-08 128 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-D4N025-UpperBounds-08,0,29.265,472064,1,0,12,1.81204e+06,14,1,573,2.0019e+06,9
Min sum of variable value : 0
Maximum sum along a path : 128
Bounds property Murphy-PT-D4N025-UpperBounds-10 :0 <= p1_3 <= 128
FORMULA Murphy-PT-D4N025-UpperBounds-10 128 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-D4N025-UpperBounds-10,0,29.3194,472064,1,0,13,1.81204e+06,15,1,731,2.0019e+06,10
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property Murphy-PT-D4N025-UpperBounds-13 :0 <= p3_4 <= 1
FORMULA Murphy-PT-D4N025-UpperBounds-13 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-D4N025-UpperBounds-13,0,29.3195,472064,1,0,14,1.81204e+06,16,1,744,2.0019e+06,11
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property Murphy-PT-D4N025-UpperBounds-14 :0 <= p3_3 <= 1
FORMULA Murphy-PT-D4N025-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-D4N025-UpperBounds-14,0,29.333,472064,1,0,15,1.81204e+06,17,1,771,2.0019e+06,12
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property Murphy-PT-D4N025-UpperBounds-15 :0 <= p4_5 <= 2
FORMULA Murphy-PT-D4N025-UpperBounds-15 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-D4N025-UpperBounds-15,0,29.3331,472064,1,0,16,1.81204e+06,18,1,781,2.0019e+06,13
Total runtime 1268352 ms.

BK_STOP 1716680654672

--------------------
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-D4N025"
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-D4N025, 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-171654372300201"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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