Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r234-tall-167856420800775.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is MultiCrashLeafsetExtension-PT-S16C05, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856420800775
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.0M
-rw-r--r-- 1 mcc users 14K Feb 26 02:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 02:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 02:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 02:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 02:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 26 02:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 02:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 02:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 4.6M Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679592451894

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=marciexred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C05
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-23 17:27:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 17:27:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 17:27:33] [INFO ] Load time of PNML (sax parser for PT used): 237 ms
[2023-03-23 17:27:33] [INFO ] Transformed 4914 places.
[2023-03-23 17:27:33] [INFO ] Transformed 6913 transitions.
[2023-03-23 17:27:33] [INFO ] Parsed PT model containing 4914 places and 6913 transitions and 26710 arcs in 347 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 191 resets, run finished after 553 ms. (steps per millisecond=18 ) properties (out of 16) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 32195 steps, run timeout after 3001 ms. (steps per millisecond=10 ) properties seen :{7=1}
Probabilistic random walk after 32195 steps, saw 15276 distinct states, run finished after 3001 ms. (steps per millisecond=10 ) properties seen :1
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 14 properties.
[2023-03-23 17:27:37] [INFO ] Flow matrix only has 6641 transitions (discarded 272 similar events)
// Phase 1: matrix 6641 rows 4914 cols
[2023-03-23 17:27:37] [INFO ] Computed 535 place invariants in 336 ms
[2023-03-23 17:27:39] [INFO ] [Real]Absence check using 48 positive place invariants in 33 ms returned sat
[2023-03-23 17:27:39] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 213 ms returned sat
[2023-03-23 17:27:45] [INFO ] After 7127ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:12
[2023-03-23 17:27:46] [INFO ] [Nat]Absence check using 48 positive place invariants in 20 ms returned sat
[2023-03-23 17:27:46] [INFO ] [Nat]Absence check using 48 positive and 487 generalized place invariants in 207 ms returned sat
[2023-03-23 17:28:08] [INFO ] After 20605ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :11
[2023-03-23 17:28:08] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2023-03-23 17:28:10] [INFO ] After 2055ms SMT Verify possible using 1906 Read/Feed constraints in natural domain returned unsat :3 sat :10
[2023-03-23 17:28:10] [INFO ] After 2056ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :10
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-23 17:28:10] [INFO ] After 25056ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :10
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 14 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 100 ms.
Support contains 153 out of 4914 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4914/4914 places, 6913/6913 transitions.
Graph (complete) has 15675 edges and 4914 vertex of which 4884 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.19 ms
Discarding 30 places :
Also discarding 0 output transitions
Drop transitions removed 1228 transitions
Trivial Post-agglo rules discarded 1228 transitions
Performed 1228 trivial Post agglomeration. Transition count delta: 1228
Iterating post reduction 0 with 1228 rules applied. Total rules applied 1229 place count 4884 transition count 5685
Reduce places removed 1228 places and 0 transitions.
Performed 110 Post agglomeration using F-continuation condition.Transition count delta: 110
Iterating post reduction 1 with 1338 rules applied. Total rules applied 2567 place count 3656 transition count 5575
Reduce places removed 110 places and 0 transitions.
Iterating post reduction 2 with 110 rules applied. Total rules applied 2677 place count 3546 transition count 5575
Performed 155 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 155 Pre rules applied. Total rules applied 2677 place count 3546 transition count 5420
Deduced a syphon composed of 155 places in 5 ms
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 3 with 310 rules applied. Total rules applied 2987 place count 3391 transition count 5420
Discarding 1153 places :
Symmetric choice reduction at 3 with 1153 rule applications. Total rules 4140 place count 2238 transition count 4267
Iterating global reduction 3 with 1153 rules applied. Total rules applied 5293 place count 2238 transition count 4267
Discarding 187 places :
Symmetric choice reduction at 3 with 187 rule applications. Total rules 5480 place count 2051 transition count 3332
Iterating global reduction 3 with 187 rules applied. Total rules applied 5667 place count 2051 transition count 3332
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 5685 place count 2042 transition count 3323
Free-agglomeration rule (complex) applied 95 times.
Iterating global reduction 3 with 95 rules applied. Total rules applied 5780 place count 2042 transition count 3228
Reduce places removed 95 places and 0 transitions.
Iterating post reduction 3 with 95 rules applied. Total rules applied 5875 place count 1947 transition count 3228
Partial Free-agglomeration rule applied 156 times.
Drop transitions removed 156 transitions
Iterating global reduction 4 with 156 rules applied. Total rules applied 6031 place count 1947 transition count 3228
Applied a total of 6031 rules in 1296 ms. Remains 1947 /4914 variables (removed 2967) and now considering 3228/6913 (removed 3685) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1297 ms. Remains : 1947/4914 places, 3228/6913 transitions.
Incomplete random walk after 10000 steps, including 269 resets, run finished after 303 ms. (steps per millisecond=33 ) properties (out of 11) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 54 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 54 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 56408 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 56408 steps, saw 25818 distinct states, run finished after 3002 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 10 properties.
[2023-03-23 17:28:15] [INFO ] Flow matrix only has 2861 transitions (discarded 367 similar events)
// Phase 1: matrix 2861 rows 1947 cols
[2023-03-23 17:28:15] [INFO ] Computed 505 place invariants in 66 ms
[2023-03-23 17:28:16] [INFO ] [Real]Absence check using 33 positive place invariants in 32 ms returned sat
[2023-03-23 17:28:16] [INFO ] [Real]Absence check using 33 positive and 472 generalized place invariants in 105 ms returned sat
[2023-03-23 17:28:17] [INFO ] After 2167ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-23 17:28:18] [INFO ] [Nat]Absence check using 33 positive place invariants in 25 ms returned sat
[2023-03-23 17:28:18] [INFO ] [Nat]Absence check using 33 positive and 472 generalized place invariants in 104 ms returned sat
[2023-03-23 17:28:23] [INFO ] After 4336ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-23 17:28:23] [INFO ] State equation strengthened by 1158 read => feed constraints.
[2023-03-23 17:28:29] [INFO ] After 6726ms SMT Verify possible using 1158 Read/Feed constraints in natural domain returned unsat :2 sat :8
[2023-03-23 17:28:33] [INFO ] Deduced a trap composed of 408 places in 1161 ms of which 6 ms to minimize.
[2023-03-23 17:28:35] [INFO ] Deduced a trap composed of 313 places in 1089 ms of which 2 ms to minimize.
[2023-03-23 17:28:37] [INFO ] Deduced a trap composed of 242 places in 1151 ms of which 5 ms to minimize.
[2023-03-23 17:28:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 4748 ms
[2023-03-23 17:28:39] [INFO ] Deduced a trap composed of 296 places in 1110 ms of which 4 ms to minimize.
[2023-03-23 17:28:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1298 ms
[2023-03-23 17:28:43] [INFO ] Deduced a trap composed of 338 places in 1159 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 17:28:43] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 17:28:43] [INFO ] After 25211ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 12 ms.
Support contains 117 out of 1947 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1947/1947 places, 3228/3228 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1947 transition count 3225
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 1944 transition count 3224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 1943 transition count 3224
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 8 place count 1943 transition count 3219
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 18 place count 1938 transition count 3219
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 29 place count 1927 transition count 3192
Iterating global reduction 3 with 11 rules applied. Total rules applied 40 place count 1927 transition count 3192
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 40 place count 1927 transition count 3191
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 42 place count 1926 transition count 3191
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 46 place count 1922 transition count 3171
Iterating global reduction 3 with 4 rules applied. Total rules applied 50 place count 1922 transition count 3171
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 52 place count 1921 transition count 3170
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 58 place count 1921 transition count 3164
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 64 place count 1915 transition count 3164
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 71 place count 1915 transition count 3164
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 74 place count 1912 transition count 3161
Iterating global reduction 4 with 3 rules applied. Total rules applied 77 place count 1912 transition count 3161
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 78 place count 1911 transition count 3156
Iterating global reduction 4 with 1 rules applied. Total rules applied 79 place count 1911 transition count 3156
Applied a total of 79 rules in 508 ms. Remains 1911 /1947 variables (removed 36) and now considering 3156/3228 (removed 72) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 508 ms. Remains : 1911/1947 places, 3156/3228 transitions.
Incomplete random walk after 10000 steps, including 270 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 54 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 56466 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 56466 steps, saw 25818 distinct states, run finished after 3001 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 8 properties.
[2023-03-23 17:28:47] [INFO ] Flow matrix only has 2783 transitions (discarded 373 similar events)
// Phase 1: matrix 2783 rows 1911 cols
[2023-03-23 17:28:47] [INFO ] Computed 505 place invariants in 56 ms
[2023-03-23 17:28:48] [INFO ] [Real]Absence check using 33 positive place invariants in 27 ms returned sat
[2023-03-23 17:28:48] [INFO ] [Real]Absence check using 33 positive and 472 generalized place invariants in 109 ms returned sat
[2023-03-23 17:28:48] [INFO ] After 815ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-23 17:28:48] [INFO ] [Nat]Absence check using 33 positive place invariants in 27 ms returned sat
[2023-03-23 17:28:48] [INFO ] [Nat]Absence check using 33 positive and 472 generalized place invariants in 113 ms returned sat
[2023-03-23 17:28:53] [INFO ] After 4801ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-23 17:28:53] [INFO ] State equation strengthened by 1122 read => feed constraints.
[2023-03-23 17:29:00] [INFO ] After 6759ms SMT Verify possible using 1122 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-23 17:29:02] [INFO ] Deduced a trap composed of 293 places in 1027 ms of which 5 ms to minimize.
[2023-03-23 17:29:03] [INFO ] Deduced a trap composed of 270 places in 1021 ms of which 2 ms to minimize.
[2023-03-23 17:29:04] [INFO ] Deduced a trap composed of 268 places in 1011 ms of which 2 ms to minimize.
[2023-03-23 17:29:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 3674 ms
[2023-03-23 17:29:07] [INFO ] Deduced a trap composed of 318 places in 1011 ms of which 2 ms to minimize.
[2023-03-23 17:29:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1529 ms
[2023-03-23 17:29:11] [INFO ] Deduced a trap composed of 316 places in 1036 ms of which 2 ms to minimize.
[2023-03-23 17:29:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1410 ms
[2023-03-23 17:29:13] [INFO ] Deduced a trap composed of 335 places in 1041 ms of which 2 ms to minimize.
[2023-03-23 17:29:13] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 1124 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 17:29:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 17:29:13] [INFO ] After 25030ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Parikh walk visited 0 properties in 18 ms.
Support contains 117 out of 1911 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1911/1911 places, 3156/3156 transitions.
Applied a total of 0 rules in 73 ms. Remains 1911 /1911 variables (removed 0) and now considering 3156/3156 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 1911/1911 places, 3156/3156 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1911/1911 places, 3156/3156 transitions.
Applied a total of 0 rules in 81 ms. Remains 1911 /1911 variables (removed 0) and now considering 3156/3156 (removed 0) transitions.
[2023-03-23 17:29:13] [INFO ] Flow matrix only has 2783 transitions (discarded 373 similar events)
[2023-03-23 17:29:13] [INFO ] Invariant cache hit.
[2023-03-23 17:29:15] [INFO ] Implicit Places using invariants in 1877 ms returned [4, 8, 12, 13, 15, 16, 17, 22, 28, 36, 49, 61, 75, 90, 105, 107, 108, 109, 110, 122, 132, 140, 146, 154, 157, 171, 178, 181, 182, 184, 185, 186, 189, 193, 201, 210, 220, 232, 245, 258, 259, 260, 261, 262, 263, 273, 281, 288, 292, 295, 297, 311, 318, 321, 323, 325, 326, 329, 333, 337, 347, 356, 366, 377, 388, 389, 390, 391, 393, 401, 408, 413, 415, 417, 421, 436, 442, 445, 446, 447, 448, 449, 450, 452, 454, 456, 461, 467, 475, 484, 493, 494, 495, 496, 497, 498, 504, 509, 511, 513, 515, 517, 530, 536, 539, 540, 541, 542, 544, 546, 548, 551, 554, 560, 566, 573, 580, 581, 582, 583, 584, 585, 589, 591, 593, 595, 597, 599, 613, 620, 623, 624, 625, 626, 628, 630, 632, 634, 636, 641, 645, 650, 655, 656, 657, 659, 660, 662, 664, 666, 668, 670, 675, 688, 694, 697, 698, 699, 700, 701, 702, 704, 706, 708, 711, 713, 715, 718, 722, 723, 724, 725, 726, 727, 729, 732, 734, 736, 738, 741, 754, 760, 763, 764, 765, 766, 767, 768, 770, 772, 774, 776, 778, 781, 783, 786, 787, 788, 790, 791, 793, 795, 797, 799, 803, 805, 819, 821, 824, 827, 828, 829, 830, 831, 832, 835, 837, 839, 841, 843, 845, 847, 851, 852, 853, 854, 855, 857, 862, 864, 866, 868, 870, 889, 892, 893, 894, 895, 897, 899, 904, 906, 908, 910, 912, 914, 917, 919, 920, 921, 922, 924, 926, 928, 930, 932, 937, 950, 956, 959, 960, 961, 962, 963, 964, 966, 968, 970, 973, 975, 977, 979, 983, 984, 985, 986, 987, 988, 990, 992, 994, 996, 998, 1000, 1013, 1019, 1022, 1024, 1025, 1027, 1029, 1031, 1033, 1038, 1040, 1044, 1048, 1054, 1055, 1056, 1057, 1058, 1059, 1063, 1065, 1067, 1071, 1073, 1088, 1094, 1097, 1098, 1099, 1101, 1102, 1105, 1107, 1111, 1113, 1116, 1123, 1138, 1139, 1140, 1141, 1143, 1149, 1153, 1155, 1157, 1159, 1164, 1178, 1184, 1187, 1188, 1189, 1190, 1192, 1197, 1199, 1201, 1203, 1208, 1214, 1222, 1232, 1233, 1234, 1236, 1237, 1245, 1251, 1258, 1260, 1262, 1264, 1277, 1284, 1287, 1288, 1289, 1290, 1291, 1292, 1294, 1297, 1299, 1303, 1310, 1318, 1328, 1340, 1341, 1343, 1344, 1345, 1358, 1366, 1372, 1376, 1378, 1380, 1400, 1403, 1404, 1405, 1406, 1409, 1414, 1420, 1426, 1432, 1441, 1451, 1463, 1478, 1479, 1480, 1481, 1482, 1496, 1506, 1514, 1520, 1524, 1527, 1541, 1543, 1547, 1550, 1551, 1552, 1554, 1555, 1561, 1566, 1572, 1580, 1591, 1603, 1617, 1634, 1635, 1636, 1637, 1638, 1653, 1665, 1675, 1686, 1692, 1697, 1711]
Discarding 434 places :
Implicit Place search using SMT only with invariants took 1884 ms to find 434 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1477/1911 places, 3156/3156 transitions.
Discarding 136 places :
Symmetric choice reduction at 0 with 136 rule applications. Total rules 136 place count 1341 transition count 3020
Iterating global reduction 0 with 136 rules applied. Total rules applied 272 place count 1341 transition count 3020
Discarding 136 places :
Symmetric choice reduction at 0 with 136 rule applications. Total rules 408 place count 1205 transition count 2884
Iterating global reduction 0 with 136 rules applied. Total rules applied 544 place count 1205 transition count 2884
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 554 place count 1195 transition count 2834
Iterating global reduction 0 with 10 rules applied. Total rules applied 564 place count 1195 transition count 2834
Applied a total of 564 rules in 135 ms. Remains 1195 /1477 variables (removed 282) and now considering 2834/3156 (removed 322) transitions.
[2023-03-23 17:29:15] [INFO ] Flow matrix only has 2461 transitions (discarded 373 similar events)
// Phase 1: matrix 2461 rows 1195 cols
[2023-03-23 17:29:15] [INFO ] Computed 71 place invariants in 28 ms
[2023-03-23 17:29:16] [INFO ] Implicit Places using invariants in 760 ms returned []
[2023-03-23 17:29:16] [INFO ] Flow matrix only has 2461 transitions (discarded 373 similar events)
[2023-03-23 17:29:16] [INFO ] Invariant cache hit.
[2023-03-23 17:29:17] [INFO ] State equation strengthened by 1082 read => feed constraints.
[2023-03-23 17:29:30] [INFO ] Implicit Places using invariants and state equation in 14423 ms returned []
Implicit Place search using SMT with State Equation took 15188 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1195/1911 places, 2834/3156 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 17289 ms. Remains : 1195/1911 places, 2834/3156 transitions.
Incomplete random walk after 10000 steps, including 270 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 54 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 7) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 54 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-23 17:29:31] [INFO ] Flow matrix only has 2461 transitions (discarded 373 similar events)
[2023-03-23 17:29:31] [INFO ] Invariant cache hit.
[2023-03-23 17:29:31] [INFO ] [Real]Absence check using 33 positive place invariants in 29 ms returned sat
[2023-03-23 17:29:31] [INFO ] [Real]Absence check using 33 positive and 38 generalized place invariants in 7 ms returned sat
[2023-03-23 17:29:32] [INFO ] After 789ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:4
[2023-03-23 17:29:32] [INFO ] State equation strengthened by 1082 read => feed constraints.
[2023-03-23 17:29:33] [INFO ] After 426ms SMT Verify possible using 1082 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-23 17:29:33] [INFO ] After 1599ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-23 17:29:33] [INFO ] [Nat]Absence check using 33 positive place invariants in 27 ms returned sat
[2023-03-23 17:29:33] [INFO ] [Nat]Absence check using 33 positive and 38 generalized place invariants in 8 ms returned sat
[2023-03-23 17:29:34] [INFO ] After 1604ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-23 17:29:38] [INFO ] After 3439ms SMT Verify possible using 1082 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-23 17:29:39] [INFO ] Deduced a trap composed of 180 places in 472 ms of which 1 ms to minimize.
[2023-03-23 17:29:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 617 ms
[2023-03-23 17:29:40] [INFO ] Deduced a trap composed of 192 places in 492 ms of which 1 ms to minimize.
[2023-03-23 17:29:42] [INFO ] Deduced a trap composed of 201 places in 513 ms of which 1 ms to minimize.
[2023-03-23 17:29:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2377 ms
[2023-03-23 17:29:43] [INFO ] Deduced a trap composed of 197 places in 487 ms of which 1 ms to minimize.
[2023-03-23 17:29:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 621 ms
[2023-03-23 17:29:44] [INFO ] Deduced a trap composed of 183 places in 495 ms of which 1 ms to minimize.
[2023-03-23 17:29:45] [INFO ] Deduced a trap composed of 170 places in 491 ms of which 2 ms to minimize.
[2023-03-23 17:29:45] [INFO ] Deduced a trap composed of 202 places in 490 ms of which 2 ms to minimize.
[2023-03-23 17:29:46] [INFO ] Deduced a trap composed of 183 places in 479 ms of which 1 ms to minimize.
[2023-03-23 17:29:46] [INFO ] Deduced a trap composed of 169 places in 507 ms of which 1 ms to minimize.
[2023-03-23 17:29:47] [INFO ] Deduced a trap composed of 175 places in 488 ms of which 2 ms to minimize.
[2023-03-23 17:29:47] [INFO ] Deduced a trap composed of 178 places in 480 ms of which 2 ms to minimize.
[2023-03-23 17:29:48] [INFO ] Deduced a trap composed of 229 places in 490 ms of which 1 ms to minimize.
[2023-03-23 17:29:49] [INFO ] Deduced a trap composed of 252 places in 470 ms of which 1 ms to minimize.
[2023-03-23 17:29:50] [INFO ] Deduced a trap composed of 174 places in 501 ms of which 2 ms to minimize.
[2023-03-23 17:29:50] [INFO ] Deduced a trap composed of 184 places in 496 ms of which 1 ms to minimize.
[2023-03-23 17:29:51] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 6996 ms
[2023-03-23 17:29:51] [INFO ] After 16157ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 3770 ms.
[2023-03-23 17:29:54] [INFO ] After 21872ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 8 ms.
Support contains 66 out of 1195 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1195/1195 places, 2834/2834 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 1195 transition count 2827
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 1188 transition count 2827
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 14 place count 1188 transition count 2824
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 20 place count 1185 transition count 2824
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 31 place count 1174 transition count 2781
Iterating global reduction 2 with 11 rules applied. Total rules applied 42 place count 1174 transition count 2781
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 44 place count 1172 transition count 2771
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 1172 transition count 2771
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 52 place count 1169 transition count 2768
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 2 with 18 rules applied. Total rules applied 70 place count 1169 transition count 2750
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 88 place count 1151 transition count 2750
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 89 place count 1150 transition count 2749
Iterating global reduction 3 with 1 rules applied. Total rules applied 90 place count 1150 transition count 2749
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 91 place count 1149 transition count 2744
Iterating global reduction 3 with 1 rules applied. Total rules applied 92 place count 1149 transition count 2744
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 101 place count 1149 transition count 2744
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 107 place count 1143 transition count 2738
Iterating global reduction 3 with 6 rules applied. Total rules applied 113 place count 1143 transition count 2738
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 119 place count 1137 transition count 2708
Iterating global reduction 3 with 6 rules applied. Total rules applied 125 place count 1137 transition count 2708
Applied a total of 125 rules in 356 ms. Remains 1137 /1195 variables (removed 58) and now considering 2708/2834 (removed 126) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 356 ms. Remains : 1137/1195 places, 2708/2834 transitions.
Incomplete random walk after 10000 steps, including 272 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 70543 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 70543 steps, saw 30750 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-23 17:29:58] [INFO ] Flow matrix only has 2318 transitions (discarded 390 similar events)
// Phase 1: matrix 2318 rows 1137 cols
[2023-03-23 17:29:58] [INFO ] Computed 71 place invariants in 23 ms
[2023-03-23 17:29:58] [INFO ] [Real]Absence check using 33 positive place invariants in 26 ms returned sat
[2023-03-23 17:29:58] [INFO ] [Real]Absence check using 33 positive and 38 generalized place invariants in 8 ms returned sat
[2023-03-23 17:29:59] [INFO ] After 1041ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-23 17:29:59] [INFO ] [Nat]Absence check using 33 positive place invariants in 26 ms returned sat
[2023-03-23 17:29:59] [INFO ] [Nat]Absence check using 33 positive and 38 generalized place invariants in 12 ms returned sat
[2023-03-23 17:30:01] [INFO ] After 1301ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-23 17:30:01] [INFO ] State equation strengthened by 1014 read => feed constraints.
[2023-03-23 17:30:05] [INFO ] After 4590ms SMT Verify possible using 1014 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-23 17:30:09] [INFO ] Deduced a trap composed of 177 places in 474 ms of which 1 ms to minimize.
[2023-03-23 17:30:10] [INFO ] Deduced a trap composed of 225 places in 420 ms of which 1 ms to minimize.
[2023-03-23 17:30:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1427 ms
[2023-03-23 17:30:11] [INFO ] Deduced a trap composed of 182 places in 454 ms of which 1 ms to minimize.
[2023-03-23 17:30:12] [INFO ] Deduced a trap composed of 174 places in 516 ms of which 1 ms to minimize.
[2023-03-23 17:30:13] [INFO ] Deduced a trap composed of 178 places in 463 ms of which 1 ms to minimize.
[2023-03-23 17:30:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1884 ms
[2023-03-23 17:30:13] [INFO ] After 11837ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 2402 ms.
[2023-03-23 17:30:15] [INFO ] After 15880ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 9 ms.
Support contains 66 out of 1137 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1137/1137 places, 2708/2708 transitions.
Applied a total of 0 rules in 56 ms. Remains 1137 /1137 variables (removed 0) and now considering 2708/2708 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 1137/1137 places, 2708/2708 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1137/1137 places, 2708/2708 transitions.
Applied a total of 0 rules in 51 ms. Remains 1137 /1137 variables (removed 0) and now considering 2708/2708 (removed 0) transitions.
[2023-03-23 17:30:15] [INFO ] Flow matrix only has 2318 transitions (discarded 390 similar events)
[2023-03-23 17:30:15] [INFO ] Invariant cache hit.
[2023-03-23 17:30:16] [INFO ] Implicit Places using invariants in 772 ms returned [89, 442, 513, 536, 613, 635, 807, 837, 904, 952]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 774 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1127/1137 places, 2708/2708 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1119 transition count 2700
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1119 transition count 2700
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 1112 transition count 2693
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 1112 transition count 2693
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 37 place count 1105 transition count 2658
Iterating global reduction 0 with 7 rules applied. Total rules applied 44 place count 1105 transition count 2658
Applied a total of 44 rules in 119 ms. Remains 1105 /1127 variables (removed 22) and now considering 2658/2708 (removed 50) transitions.
[2023-03-23 17:30:16] [INFO ] Flow matrix only has 2268 transitions (discarded 390 similar events)
// Phase 1: matrix 2268 rows 1105 cols
[2023-03-23 17:30:16] [INFO ] Computed 61 place invariants in 31 ms
[2023-03-23 17:30:17] [INFO ] Implicit Places using invariants in 749 ms returned []
[2023-03-23 17:30:17] [INFO ] Flow matrix only has 2268 transitions (discarded 390 similar events)
[2023-03-23 17:30:17] [INFO ] Invariant cache hit.
[2023-03-23 17:30:18] [INFO ] State equation strengthened by 986 read => feed constraints.
[2023-03-23 17:30:30] [INFO ] Implicit Places using invariants and state equation in 12875 ms returned []
Implicit Place search using SMT with State Equation took 13628 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1105/1137 places, 2658/2708 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 14573 ms. Remains : 1105/1137 places, 2658/2708 transitions.
Incomplete random walk after 10000 steps, including 272 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 54 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 55 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-23 17:30:30] [INFO ] Flow matrix only has 2268 transitions (discarded 390 similar events)
[2023-03-23 17:30:30] [INFO ] Invariant cache hit.
[2023-03-23 17:30:30] [INFO ] [Real]Absence check using 31 positive place invariants in 18 ms returned sat
[2023-03-23 17:30:30] [INFO ] [Real]Absence check using 31 positive and 30 generalized place invariants in 14 ms returned sat
[2023-03-23 17:30:31] [INFO ] After 946ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-23 17:30:31] [INFO ] [Nat]Absence check using 31 positive place invariants in 19 ms returned sat
[2023-03-23 17:30:31] [INFO ] [Nat]Absence check using 31 positive and 30 generalized place invariants in 17 ms returned sat
[2023-03-23 17:30:33] [INFO ] After 1374ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-23 17:30:33] [INFO ] State equation strengthened by 986 read => feed constraints.
[2023-03-23 17:30:36] [INFO ] After 2791ms SMT Verify possible using 986 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-23 17:30:36] [INFO ] Deduced a trap composed of 197 places in 396 ms of which 1 ms to minimize.
[2023-03-23 17:30:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 526 ms
[2023-03-23 17:30:39] [INFO ] Deduced a trap composed of 117 places in 448 ms of which 2 ms to minimize.
[2023-03-23 17:30:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 582 ms
[2023-03-23 17:30:40] [INFO ] Deduced a trap composed of 143 places in 457 ms of which 1 ms to minimize.
[2023-03-23 17:30:40] [INFO ] Deduced a trap composed of 145 places in 435 ms of which 1 ms to minimize.
[2023-03-23 17:30:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1124 ms
[2023-03-23 17:30:40] [INFO ] After 7477ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 2746 ms.
[2023-03-23 17:30:43] [INFO ] After 11915ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 3 ms.
Support contains 65 out of 1105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1105/1105 places, 2658/2658 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1105 transition count 2657
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1104 transition count 2657
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 1104 transition count 2657
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 4 place count 1103 transition count 2656
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 1103 transition count 2656
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 1102 transition count 2651
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 1102 transition count 2651
Applied a total of 7 rules in 146 ms. Remains 1102 /1105 variables (removed 3) and now considering 2651/2658 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 1102/1105 places, 2651/2658 transitions.
Incomplete random walk after 10000 steps, including 271 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 54 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 73762 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 73762 steps, saw 31906 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-23 17:30:47] [INFO ] Flow matrix only has 2261 transitions (discarded 390 similar events)
// Phase 1: matrix 2261 rows 1102 cols
[2023-03-23 17:30:47] [INFO ] Computed 61 place invariants in 29 ms
[2023-03-23 17:30:47] [INFO ] [Real]Absence check using 31 positive place invariants in 19 ms returned sat
[2023-03-23 17:30:47] [INFO ] [Real]Absence check using 31 positive and 30 generalized place invariants in 20 ms returned sat
[2023-03-23 17:30:48] [INFO ] After 879ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-23 17:30:48] [INFO ] [Nat]Absence check using 31 positive place invariants in 23 ms returned sat
[2023-03-23 17:30:48] [INFO ] [Nat]Absence check using 31 positive and 30 generalized place invariants in 14 ms returned sat
[2023-03-23 17:30:49] [INFO ] After 1374ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-23 17:30:49] [INFO ] State equation strengthened by 982 read => feed constraints.
[2023-03-23 17:30:52] [INFO ] After 2544ms SMT Verify possible using 982 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-23 17:30:53] [INFO ] Deduced a trap composed of 128 places in 407 ms of which 1 ms to minimize.
[2023-03-23 17:30:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 596 ms
[2023-03-23 17:30:55] [INFO ] Deduced a trap composed of 208 places in 411 ms of which 2 ms to minimize.
[2023-03-23 17:30:55] [INFO ] Deduced a trap composed of 196 places in 425 ms of which 1 ms to minimize.
[2023-03-23 17:30:56] [INFO ] Deduced a trap composed of 152 places in 434 ms of which 1 ms to minimize.
[2023-03-23 17:30:56] [INFO ] Deduced a trap composed of 161 places in 413 ms of which 1 ms to minimize.
[2023-03-23 17:30:57] [INFO ] Deduced a trap composed of 163 places in 462 ms of which 2 ms to minimize.
[2023-03-23 17:30:57] [INFO ] Deduced a trap composed of 200 places in 441 ms of which 1 ms to minimize.
[2023-03-23 17:30:58] [INFO ] Deduced a trap composed of 190 places in 415 ms of which 1 ms to minimize.
[2023-03-23 17:30:58] [INFO ] Deduced a trap composed of 132 places in 415 ms of which 1 ms to minimize.
[2023-03-23 17:30:59] [INFO ] Deduced a trap composed of 189 places in 427 ms of which 9 ms to minimize.
[2023-03-23 17:31:00] [INFO ] Deduced a trap composed of 148 places in 437 ms of which 1 ms to minimize.
[2023-03-23 17:31:00] [INFO ] Deduced a trap composed of 139 places in 440 ms of which 1 ms to minimize.
[2023-03-23 17:31:01] [INFO ] Deduced a trap composed of 179 places in 434 ms of which 2 ms to minimize.
[2023-03-23 17:31:01] [INFO ] Deduced a trap composed of 143 places in 429 ms of which 1 ms to minimize.
[2023-03-23 17:31:02] [INFO ] Deduced a trap composed of 146 places in 432 ms of which 1 ms to minimize.
[2023-03-23 17:31:03] [INFO ] Deduced a trap composed of 181 places in 442 ms of which 2 ms to minimize.
[2023-03-23 17:31:03] [INFO ] Deduced a trap composed of 185 places in 436 ms of which 1 ms to minimize.
[2023-03-23 17:31:04] [INFO ] Deduced a trap composed of 159 places in 439 ms of which 1 ms to minimize.
[2023-03-23 17:31:04] [INFO ] Deduced a trap composed of 158 places in 433 ms of which 4 ms to minimize.
[2023-03-23 17:31:05] [INFO ] Deduced a trap composed of 151 places in 439 ms of which 1 ms to minimize.
[2023-03-23 17:31:05] [INFO ] Deduced a trap composed of 212 places in 452 ms of which 1 ms to minimize.
[2023-03-23 17:31:06] [INFO ] Deduced a trap composed of 207 places in 451 ms of which 1 ms to minimize.
[2023-03-23 17:31:07] [INFO ] Deduced a trap composed of 165 places in 436 ms of which 1 ms to minimize.
[2023-03-23 17:31:08] [INFO ] Deduced a trap composed of 204 places in 404 ms of which 1 ms to minimize.
[2023-03-23 17:31:09] [INFO ] Deduced a trap composed of 268 places in 451 ms of which 1 ms to minimize.
[2023-03-23 17:31:09] [INFO ] Deduced a trap composed of 244 places in 449 ms of which 1 ms to minimize.
[2023-03-23 17:31:10] [INFO ] Deduced a trap composed of 137 places in 456 ms of which 3 ms to minimize.
[2023-03-23 17:31:10] [INFO ] Deduced a trap composed of 134 places in 461 ms of which 1 ms to minimize.
[2023-03-23 17:31:11] [INFO ] Deduced a trap composed of 228 places in 450 ms of which 3 ms to minimize.
[2023-03-23 17:31:12] [INFO ] Deduced a trap composed of 145 places in 439 ms of which 6 ms to minimize.
[2023-03-23 17:31:12] [INFO ] Deduced a trap composed of 154 places in 461 ms of which 2 ms to minimize.
[2023-03-23 17:31:13] [INFO ] Deduced a trap composed of 235 places in 456 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 17:31:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 17:31:13] [INFO ] After 25036ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Parikh walk visited 0 properties in 12 ms.
Support contains 65 out of 1102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1102/1102 places, 2651/2651 transitions.
Applied a total of 0 rules in 51 ms. Remains 1102 /1102 variables (removed 0) and now considering 2651/2651 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 1102/1102 places, 2651/2651 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1102/1102 places, 2651/2651 transitions.
Applied a total of 0 rules in 47 ms. Remains 1102 /1102 variables (removed 0) and now considering 2651/2651 (removed 0) transitions.
[2023-03-23 17:31:13] [INFO ] Flow matrix only has 2261 transitions (discarded 390 similar events)
[2023-03-23 17:31:13] [INFO ] Invariant cache hit.
[2023-03-23 17:31:14] [INFO ] Implicit Places using invariants in 738 ms returned [542]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 739 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1101/1102 places, 2651/2651 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1100 transition count 2650
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1100 transition count 2650
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1099 transition count 2649
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1099 transition count 2649
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1098 transition count 2644
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1098 transition count 2644
Applied a total of 6 rules in 116 ms. Remains 1098 /1101 variables (removed 3) and now considering 2644/2651 (removed 7) transitions.
[2023-03-23 17:31:14] [INFO ] Flow matrix only has 2254 transitions (discarded 390 similar events)
// Phase 1: matrix 2254 rows 1098 cols
[2023-03-23 17:31:14] [INFO ] Computed 60 place invariants in 30 ms
[2023-03-23 17:31:14] [INFO ] Implicit Places using invariants in 749 ms returned []
[2023-03-23 17:31:14] [INFO ] Flow matrix only has 2254 transitions (discarded 390 similar events)
[2023-03-23 17:31:14] [INFO ] Invariant cache hit.
[2023-03-23 17:31:15] [INFO ] State equation strengthened by 978 read => feed constraints.
[2023-03-23 17:31:27] [INFO ] Implicit Places using invariants and state equation in 12103 ms returned []
Implicit Place search using SMT with State Equation took 12852 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1098/1102 places, 2644/2651 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 13754 ms. Remains : 1098/1102 places, 2644/2651 transitions.
Incomplete random walk after 10000 steps, including 272 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 5) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-23 17:31:27] [INFO ] Flow matrix only has 2254 transitions (discarded 390 similar events)
[2023-03-23 17:31:27] [INFO ] Invariant cache hit.
[2023-03-23 17:31:27] [INFO ] [Real]Absence check using 33 positive place invariants in 23 ms returned sat
[2023-03-23 17:31:27] [INFO ] [Real]Absence check using 33 positive and 27 generalized place invariants in 5 ms returned sat
[2023-03-23 17:31:28] [INFO ] After 934ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-23 17:31:28] [INFO ] [Nat]Absence check using 33 positive place invariants in 24 ms returned sat
[2023-03-23 17:31:28] [INFO ] [Nat]Absence check using 33 positive and 27 generalized place invariants in 6 ms returned sat
[2023-03-23 17:31:29] [INFO ] After 1193ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-23 17:31:29] [INFO ] State equation strengthened by 978 read => feed constraints.
[2023-03-23 17:31:32] [INFO ] After 2736ms SMT Verify possible using 978 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-23 17:31:34] [INFO ] Deduced a trap composed of 128 places in 411 ms of which 1 ms to minimize.
[2023-03-23 17:31:34] [INFO ] Deduced a trap composed of 134 places in 429 ms of which 1 ms to minimize.
[2023-03-23 17:31:35] [INFO ] Deduced a trap composed of 151 places in 421 ms of which 1 ms to minimize.
[2023-03-23 17:31:35] [INFO ] Deduced a trap composed of 150 places in 411 ms of which 0 ms to minimize.
[2023-03-23 17:31:36] [INFO ] Deduced a trap composed of 146 places in 419 ms of which 1 ms to minimize.
[2023-03-23 17:31:36] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2959 ms
[2023-03-23 17:31:37] [INFO ] Deduced a trap composed of 202 places in 394 ms of which 1 ms to minimize.
[2023-03-23 17:31:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 518 ms
[2023-03-23 17:31:37] [INFO ] Deduced a trap composed of 165 places in 427 ms of which 1 ms to minimize.
[2023-03-23 17:31:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 557 ms
[2023-03-23 17:31:38] [INFO ] After 8350ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1455 ms.
[2023-03-23 17:31:39] [INFO ] After 11256ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 4 ms.
Support contains 47 out of 1098 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1098/1098 places, 2644/2644 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 1098 transition count 2638
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 1092 transition count 2638
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 12 place count 1092 transition count 2637
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 1091 transition count 2637
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 19 place count 1086 transition count 2620
Iterating global reduction 2 with 5 rules applied. Total rules applied 24 place count 1086 transition count 2620
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 26 place count 1084 transition count 2610
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 1084 transition count 2610
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 1083 transition count 2609
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 34 place count 1083 transition count 2605
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 38 place count 1079 transition count 2605
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 41 place count 1076 transition count 2602
Iterating global reduction 3 with 3 rules applied. Total rules applied 44 place count 1076 transition count 2602
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 47 place count 1073 transition count 2587
Iterating global reduction 3 with 3 rules applied. Total rules applied 50 place count 1073 transition count 2587
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 53 place count 1073 transition count 2587
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 55 place count 1071 transition count 2585
Iterating global reduction 3 with 2 rules applied. Total rules applied 57 place count 1071 transition count 2585
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 59 place count 1069 transition count 2575
Iterating global reduction 3 with 2 rules applied. Total rules applied 61 place count 1069 transition count 2575
Applied a total of 61 rules in 320 ms. Remains 1069 /1098 variables (removed 29) and now considering 2575/2644 (removed 69) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 320 ms. Remains : 1069/1098 places, 2575/2644 transitions.
Incomplete random walk after 10000 steps, including 273 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 75553 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 75553 steps, saw 32580 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-23 17:31:43] [INFO ] Flow matrix only has 2183 transitions (discarded 392 similar events)
// Phase 1: matrix 2183 rows 1069 cols
[2023-03-23 17:31:43] [INFO ] Computed 60 place invariants in 24 ms
[2023-03-23 17:31:43] [INFO ] [Real]Absence check using 33 positive place invariants in 27 ms returned sat
[2023-03-23 17:31:43] [INFO ] [Real]Absence check using 33 positive and 27 generalized place invariants in 6 ms returned sat
[2023-03-23 17:31:43] [INFO ] After 286ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-23 17:31:43] [INFO ] [Nat]Absence check using 33 positive place invariants in 38 ms returned sat
[2023-03-23 17:31:43] [INFO ] [Nat]Absence check using 33 positive and 27 generalized place invariants in 6 ms returned sat
[2023-03-23 17:31:44] [INFO ] After 1003ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-23 17:31:44] [INFO ] State equation strengthened by 938 read => feed constraints.
[2023-03-23 17:31:46] [INFO ] After 1610ms SMT Verify possible using 938 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-23 17:31:47] [INFO ] Deduced a trap composed of 160 places in 408 ms of which 1 ms to minimize.
[2023-03-23 17:31:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 516 ms
[2023-03-23 17:31:49] [INFO ] Deduced a trap composed of 122 places in 407 ms of which 1 ms to minimize.
[2023-03-23 17:31:50] [INFO ] Deduced a trap composed of 222 places in 446 ms of which 1 ms to minimize.
[2023-03-23 17:31:50] [INFO ] Deduced a trap composed of 109 places in 456 ms of which 1 ms to minimize.
[2023-03-23 17:31:51] [INFO ] Deduced a trap composed of 115 places in 410 ms of which 1 ms to minimize.
[2023-03-23 17:31:51] [INFO ] Deduced a trap composed of 195 places in 412 ms of which 0 ms to minimize.
[2023-03-23 17:31:52] [INFO ] Deduced a trap composed of 123 places in 412 ms of which 1 ms to minimize.
[2023-03-23 17:31:52] [INFO ] Deduced a trap composed of 113 places in 452 ms of which 1 ms to minimize.
[2023-03-23 17:31:53] [INFO ] Deduced a trap composed of 115 places in 408 ms of which 1 ms to minimize.
[2023-03-23 17:31:53] [INFO ] Deduced a trap composed of 111 places in 405 ms of which 1 ms to minimize.
[2023-03-23 17:31:54] [INFO ] Deduced a trap composed of 115 places in 410 ms of which 1 ms to minimize.
[2023-03-23 17:31:55] [INFO ] Deduced a trap composed of 114 places in 414 ms of which 10 ms to minimize.
[2023-03-23 17:31:55] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 6421 ms
[2023-03-23 17:31:57] [INFO ] Deduced a trap composed of 202 places in 407 ms of which 1 ms to minimize.
[2023-03-23 17:31:57] [INFO ] Deduced a trap composed of 209 places in 395 ms of which 1 ms to minimize.
[2023-03-23 17:31:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 979 ms
[2023-03-23 17:31:57] [INFO ] After 12755ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 3452 ms.
[2023-03-23 17:32:01] [INFO ] After 17493ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 7 ms.
Support contains 47 out of 1069 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1069/1069 places, 2575/2575 transitions.
Applied a total of 0 rules in 54 ms. Remains 1069 /1069 variables (removed 0) and now considering 2575/2575 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 1069/1069 places, 2575/2575 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1069/1069 places, 2575/2575 transitions.
Applied a total of 0 rules in 53 ms. Remains 1069 /1069 variables (removed 0) and now considering 2575/2575 (removed 0) transitions.
[2023-03-23 17:32:01] [INFO ] Flow matrix only has 2183 transitions (discarded 392 similar events)
[2023-03-23 17:32:01] [INFO ] Invariant cache hit.
[2023-03-23 17:32:01] [INFO ] Implicit Places using invariants in 771 ms returned [9, 448, 621, 704, 805, 966]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 773 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1063/1069 places, 2575/2575 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1057 transition count 2569
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1057 transition count 2569
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 1051 transition count 2563
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 1051 transition count 2563
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 1045 transition count 2533
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 1045 transition count 2533
Applied a total of 36 rules in 110 ms. Remains 1045 /1063 variables (removed 18) and now considering 2533/2575 (removed 42) transitions.
[2023-03-23 17:32:02] [INFO ] Flow matrix only has 2141 transitions (discarded 392 similar events)
// Phase 1: matrix 2141 rows 1045 cols
[2023-03-23 17:32:02] [INFO ] Computed 54 place invariants in 29 ms
[2023-03-23 17:32:02] [INFO ] Implicit Places using invariants in 728 ms returned []
[2023-03-23 17:32:02] [INFO ] Flow matrix only has 2141 transitions (discarded 392 similar events)
[2023-03-23 17:32:02] [INFO ] Invariant cache hit.
[2023-03-23 17:32:03] [INFO ] State equation strengthened by 914 read => feed constraints.
[2023-03-23 17:32:13] [INFO ] Implicit Places using invariants and state equation in 10840 ms returned []
Implicit Place search using SMT with State Equation took 11570 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1045/1069 places, 2533/2575 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 12506 ms. Remains : 1045/1069 places, 2533/2575 transitions.
Incomplete random walk after 10000 steps, including 273 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-23 17:32:13] [INFO ] Flow matrix only has 2141 transitions (discarded 392 similar events)
[2023-03-23 17:32:13] [INFO ] Invariant cache hit.
[2023-03-23 17:32:14] [INFO ] [Real]Absence check using 33 positive place invariants in 29 ms returned sat
[2023-03-23 17:32:14] [INFO ] [Real]Absence check using 33 positive and 21 generalized place invariants in 10 ms returned sat
[2023-03-23 17:32:14] [INFO ] After 229ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 17:32:14] [INFO ] [Nat]Absence check using 33 positive place invariants in 28 ms returned sat
[2023-03-23 17:32:14] [INFO ] [Nat]Absence check using 33 positive and 21 generalized place invariants in 4 ms returned sat
[2023-03-23 17:32:15] [INFO ] After 1019ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 17:32:15] [INFO ] State equation strengthened by 914 read => feed constraints.
[2023-03-23 17:32:17] [INFO ] After 2212ms SMT Verify possible using 914 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 17:32:18] [INFO ] Deduced a trap composed of 192 places in 393 ms of which 1 ms to minimize.
[2023-03-23 17:32:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 511 ms
[2023-03-23 17:32:19] [INFO ] Deduced a trap composed of 132 places in 387 ms of which 1 ms to minimize.
[2023-03-23 17:32:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 497 ms
[2023-03-23 17:32:19] [INFO ] After 3926ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 600 ms.
[2023-03-23 17:32:19] [INFO ] After 5767ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 1 ms.
Support contains 45 out of 1045 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1045/1045 places, 2533/2533 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1045 transition count 2532
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1044 transition count 2532
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1043 transition count 2531
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1043 transition count 2531
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1042 transition count 2526
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1042 transition count 2526
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 1042 transition count 2526
Applied a total of 7 rules in 146 ms. Remains 1042 /1045 variables (removed 3) and now considering 2526/2533 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 146 ms. Remains : 1042/1045 places, 2526/2533 transitions.
Incomplete random walk after 10000 steps, including 273 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 55 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 81125 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 81125 steps, saw 34730 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-23 17:32:23] [INFO ] Flow matrix only has 2134 transitions (discarded 392 similar events)
// Phase 1: matrix 2134 rows 1042 cols
[2023-03-23 17:32:23] [INFO ] Computed 54 place invariants in 31 ms
[2023-03-23 17:32:23] [INFO ] [Real]Absence check using 31 positive place invariants in 22 ms returned sat
[2023-03-23 17:32:23] [INFO ] [Real]Absence check using 31 positive and 23 generalized place invariants in 13 ms returned sat
[2023-03-23 17:32:23] [INFO ] After 230ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 17:32:23] [INFO ] [Nat]Absence check using 31 positive place invariants in 20 ms returned sat
[2023-03-23 17:32:23] [INFO ] [Nat]Absence check using 31 positive and 23 generalized place invariants in 12 ms returned sat
[2023-03-23 17:32:24] [INFO ] After 905ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 17:32:24] [INFO ] State equation strengthened by 910 read => feed constraints.
[2023-03-23 17:32:26] [INFO ] After 1994ms SMT Verify possible using 910 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 17:32:28] [INFO ] Deduced a trap composed of 118 places in 389 ms of which 1 ms to minimize.
[2023-03-23 17:32:28] [INFO ] Deduced a trap composed of 108 places in 392 ms of which 1 ms to minimize.
[2023-03-23 17:32:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1030 ms
[2023-03-23 17:32:29] [INFO ] Deduced a trap composed of 224 places in 380 ms of which 1 ms to minimize.
[2023-03-23 17:32:30] [INFO ] Deduced a trap composed of 220 places in 387 ms of which 1 ms to minimize.
[2023-03-23 17:32:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 951 ms
[2023-03-23 17:32:30] [INFO ] Deduced a trap composed of 102 places in 392 ms of which 1 ms to minimize.
[2023-03-23 17:32:31] [INFO ] Deduced a trap composed of 99 places in 393 ms of which 1 ms to minimize.
[2023-03-23 17:32:31] [INFO ] Deduced a trap composed of 115 places in 394 ms of which 1 ms to minimize.
[2023-03-23 17:32:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1424 ms
[2023-03-23 17:32:31] [INFO ] After 7096ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 856 ms.
[2023-03-23 17:32:32] [INFO ] After 9086ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 3 ms.
Support contains 45 out of 1042 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1042/1042 places, 2526/2526 transitions.
Applied a total of 0 rules in 53 ms. Remains 1042 /1042 variables (removed 0) and now considering 2526/2526 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 1042/1042 places, 2526/2526 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1042/1042 places, 2526/2526 transitions.
Applied a total of 0 rules in 57 ms. Remains 1042 /1042 variables (removed 0) and now considering 2526/2526 (removed 0) transitions.
[2023-03-23 17:32:32] [INFO ] Flow matrix only has 2134 transitions (discarded 392 similar events)
[2023-03-23 17:32:32] [INFO ] Invariant cache hit.
[2023-03-23 17:32:33] [INFO ] Implicit Places using invariants in 712 ms returned [296]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 726 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1041/1042 places, 2526/2526 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1040 transition count 2525
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1040 transition count 2525
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1039 transition count 2524
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1039 transition count 2524
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1038 transition count 2519
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1038 transition count 2519
Applied a total of 6 rules in 113 ms. Remains 1038 /1041 variables (removed 3) and now considering 2519/2526 (removed 7) transitions.
[2023-03-23 17:32:33] [INFO ] Flow matrix only has 2127 transitions (discarded 392 similar events)
// Phase 1: matrix 2127 rows 1038 cols
[2023-03-23 17:32:33] [INFO ] Computed 53 place invariants in 28 ms
[2023-03-23 17:32:34] [INFO ] Implicit Places using invariants in 703 ms returned []
[2023-03-23 17:32:34] [INFO ] Flow matrix only has 2127 transitions (discarded 392 similar events)
[2023-03-23 17:32:34] [INFO ] Invariant cache hit.
[2023-03-23 17:32:34] [INFO ] State equation strengthened by 906 read => feed constraints.
[2023-03-23 17:32:44] [INFO ] Implicit Places using invariants and state equation in 10263 ms returned []
Implicit Place search using SMT with State Equation took 10968 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1038/1042 places, 2519/2526 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 11864 ms. Remains : 1038/1042 places, 2519/2526 transitions.
Incomplete random walk after 10000 steps, including 273 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 82081 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 82081 steps, saw 35088 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-23 17:32:47] [INFO ] Flow matrix only has 2127 transitions (discarded 392 similar events)
[2023-03-23 17:32:47] [INFO ] Invariant cache hit.
[2023-03-23 17:32:48] [INFO ] [Real]Absence check using 33 positive place invariants in 28 ms returned sat
[2023-03-23 17:32:48] [INFO ] [Real]Absence check using 33 positive and 20 generalized place invariants in 4 ms returned sat
[2023-03-23 17:32:48] [INFO ] After 226ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 17:32:48] [INFO ] [Nat]Absence check using 33 positive place invariants in 27 ms returned sat
[2023-03-23 17:32:48] [INFO ] [Nat]Absence check using 33 positive and 20 generalized place invariants in 5 ms returned sat
[2023-03-23 17:32:49] [INFO ] After 998ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 17:32:49] [INFO ] State equation strengthened by 906 read => feed constraints.
[2023-03-23 17:32:51] [INFO ] After 2124ms SMT Verify possible using 906 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 17:32:52] [INFO ] Deduced a trap composed of 110 places in 388 ms of which 0 ms to minimize.
[2023-03-23 17:32:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 514 ms
[2023-03-23 17:32:52] [INFO ] Deduced a trap composed of 193 places in 376 ms of which 1 ms to minimize.
[2023-03-23 17:32:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 482 ms
[2023-03-23 17:32:52] [INFO ] After 3577ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 617 ms.
[2023-03-23 17:32:53] [INFO ] After 5410ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 2 ms.
Support contains 45 out of 1038 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1038/1038 places, 2519/2519 transitions.
Applied a total of 0 rules in 46 ms. Remains 1038 /1038 variables (removed 0) and now considering 2519/2519 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 1038/1038 places, 2519/2519 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1038/1038 places, 2519/2519 transitions.
Applied a total of 0 rules in 45 ms. Remains 1038 /1038 variables (removed 0) and now considering 2519/2519 (removed 0) transitions.
[2023-03-23 17:32:53] [INFO ] Flow matrix only has 2127 transitions (discarded 392 similar events)
[2023-03-23 17:32:53] [INFO ] Invariant cache hit.
[2023-03-23 17:32:54] [INFO ] Implicit Places using invariants in 692 ms returned []
[2023-03-23 17:32:54] [INFO ] Flow matrix only has 2127 transitions (discarded 392 similar events)
[2023-03-23 17:32:54] [INFO ] Invariant cache hit.
[2023-03-23 17:32:54] [INFO ] State equation strengthened by 906 read => feed constraints.
[2023-03-23 17:33:05] [INFO ] Implicit Places using invariants and state equation in 10755 ms returned []
Implicit Place search using SMT with State Equation took 11458 ms to find 0 implicit places.
[2023-03-23 17:33:05] [INFO ] Redundant transitions in 136 ms returned []
[2023-03-23 17:33:05] [INFO ] Flow matrix only has 2127 transitions (discarded 392 similar events)
[2023-03-23 17:33:05] [INFO ] Invariant cache hit.
[2023-03-23 17:33:06] [INFO ] Dead Transitions using invariants and state equation in 896 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12553 ms. Remains : 1038/1038 places, 2519/2519 transitions.
Graph (trivial) has 775 edges and 1038 vertex of which 14 / 1038 are part of one of the 1 SCC in 4 ms
Free SCC test removed 13 places
Drop transitions removed 234 transitions
Ensure Unique test removed 374 transitions
Reduce isomorphic transitions removed 608 transitions.
Graph (complete) has 3059 edges and 1025 vertex of which 1012 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Discarding 13 places :
Also discarding 0 output transitions
Ensure Unique test removed 15 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition Node6DetectsThatNode9CanReplaceNode8.Node9IsBecomingTheNewNodeMaster and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 52 rules applied. Total rules applied 54 place count 996 transition count 1859
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 39 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 1 with 127 rules applied. Total rules applied 181 place count 946 transition count 1782
Reduce places removed 38 places and 0 transitions.
Drop transitions removed 14 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 38 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 2 with 99 rules applied. Total rules applied 280 place count 908 transition count 1721
Reduce places removed 23 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 3 with 67 rules applied. Total rules applied 347 place count 885 transition count 1677
Reduce places removed 21 places and 0 transitions.
Drop transitions removed 10 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 4 with 53 rules applied. Total rules applied 400 place count 864 transition count 1645
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 5 with 32 rules applied. Total rules applied 432 place count 853 transition count 1624
Reduce places removed 10 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 6 with 25 rules applied. Total rules applied 457 place count 843 transition count 1609
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 7 with 13 rules applied. Total rules applied 470 place count 838 transition count 1601
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 7 rules applied. Total rules applied 477 place count 835 transition count 1597
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 9 with 5 rules applied. Total rules applied 482 place count 834 transition count 1593
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 486 place count 831 transition count 1592
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 17 Pre rules applied. Total rules applied 486 place count 831 transition count 1575
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 11 with 34 rules applied. Total rules applied 520 place count 814 transition count 1575
Discarding 200 places :
Symmetric choice reduction at 11 with 200 rule applications. Total rules 720 place count 614 transition count 1375
Iterating global reduction 11 with 200 rules applied. Total rules applied 920 place count 614 transition count 1375
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Iterating post reduction 11 with 120 rules applied. Total rules applied 1040 place count 614 transition count 1255
Performed 377 Post agglomeration using F-continuation condition.Transition count delta: 377
Deduced a syphon composed of 377 places in 0 ms
Reduce places removed 377 places and 0 transitions.
Iterating global reduction 12 with 754 rules applied. Total rules applied 1794 place count 237 transition count 878
Drop transitions removed 329 transitions
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 346 transitions.
Iterating post reduction 12 with 346 rules applied. Total rules applied 2140 place count 237 transition count 532
Discarding 34 places :
Symmetric choice reduction at 13 with 34 rule applications. Total rules 2174 place count 203 transition count 449
Iterating global reduction 13 with 34 rules applied. Total rules applied 2208 place count 203 transition count 449
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 13 with 10 rules applied. Total rules applied 2218 place count 198 transition count 480
Drop transitions removed 47 transitions
Redundant transition composition rules discarded 47 transitions
Iterating global reduction 13 with 47 rules applied. Total rules applied 2265 place count 198 transition count 433
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 13 with 4 rules applied. Total rules applied 2269 place count 198 transition count 429
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 14 with 5 rules applied. Total rules applied 2274 place count 194 transition count 428
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 2275 place count 193 transition count 428
Discarding 18 places :
Symmetric choice reduction at 16 with 18 rule applications. Total rules 2293 place count 175 transition count 398
Iterating global reduction 16 with 18 rules applied. Total rules applied 2311 place count 175 transition count 398
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 16 with 31 rules applied. Total rules applied 2342 place count 175 transition count 367
Discarding 2 places :
Symmetric choice reduction at 17 with 2 rule applications. Total rules 2344 place count 173 transition count 353
Iterating global reduction 17 with 2 rules applied. Total rules applied 2346 place count 173 transition count 353
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 2347 place count 172 transition count 352
Iterating global reduction 17 with 1 rules applied. Total rules applied 2348 place count 172 transition count 352
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 17 with 4 rules applied. Total rules applied 2352 place count 170 transition count 370
Free-agglomeration rule applied 3 times.
Iterating global reduction 17 with 3 rules applied. Total rules applied 2355 place count 170 transition count 367
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 17 with 3 rules applied. Total rules applied 2358 place count 167 transition count 367
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 18 with 12 rules applied. Total rules applied 2370 place count 167 transition count 355
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 18 with 12 rules applied. Total rules applied 2382 place count 155 transition count 355
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 19 with 15 rules applied. Total rules applied 2397 place count 155 transition count 355
Partial Post-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 19 with 25 rules applied. Total rules applied 2422 place count 155 transition count 355
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 2423 place count 154 transition count 352
Iterating global reduction 19 with 1 rules applied. Total rules applied 2424 place count 154 transition count 352
Applied a total of 2424 rules in 599 ms. Remains 154 /1038 variables (removed 884) and now considering 352/2519 (removed 2167) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 352 rows 154 cols
[2023-03-23 17:33:06] [INFO ] Computed 25 place invariants in 2 ms
[2023-03-23 17:33:06] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-23 17:33:06] [INFO ] [Real]Absence check using 4 positive and 21 generalized place invariants in 3 ms returned sat
[2023-03-23 17:33:06] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 17:33:06] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-23 17:33:06] [INFO ] [Nat]Absence check using 4 positive and 21 generalized place invariants in 3 ms returned sat
[2023-03-23 17:33:06] [INFO ] After 142ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 17:33:07] [INFO ] Deduced a trap composed of 60 places in 59 ms of which 1 ms to minimize.
[2023-03-23 17:33:07] [INFO ] Deduced a trap composed of 60 places in 66 ms of which 1 ms to minimize.
[2023-03-23 17:33:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 180 ms
[2023-03-23 17:33:07] [INFO ] After 417ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 106 ms.
[2023-03-23 17:33:07] [INFO ] After 571ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-23 17:33:07] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 2 ms.
[2023-03-23 17:33:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1038 places, 2519 transitions and 11735 arcs took 16 ms.
[2023-03-23 17:33:07] [INFO ] Flatten gal took : 218 ms
Total runtime 334512 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: gen
(NrP: 1038 NrTr: 2519 NrArc: 11735)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.218sec

net check time: 0m 0.001sec

init dd package: 0m 2.660sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9662260 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16091080 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.028sec

27905 53202 75384 115660 136170 184924 238489 284457 367884 439419 501894 580468 719747 829296 886716 1177721

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="MultiCrashLeafsetExtension-PT-S16C05"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="marciexred"
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-5348"
echo " Executing tool marciexred"
echo " Input is MultiCrashLeafsetExtension-PT-S16C05, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r234-tall-167856420800775"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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