Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r273-smll-162123879800219.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is VehicularWifi-COL-none, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r273-smll-162123879800219
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 22K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 146K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 83K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K Mar 28 16:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 28 16:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 28 16:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 27 14:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 14:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Mar 26 05:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 26 05:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_pt
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 5 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 188K May 5 16:52 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1621481778943

Running Version 0
[2021-05-20 03:36:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-20 03:36:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-20 03:36:22] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
[2021-05-20 03:36:22] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-20 03:36:23] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1410 ms
[2021-05-20 03:36:23] [WARNING] Unknown color function,Tuple skipping symmetry detection on parameters for transition WaitAIFS1
[2021-05-20 03:36:23] [INFO ] Detected 1 constant HL places corresponding to 81920 PT places.
[2021-05-20 03:36:23] [INFO ] Imported 21 HL places and 41 HL transitions for a total of 115566 PT places and 379924.0 transition bindings in 164 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
[2021-05-20 03:36:23] [INFO ] Built PT skeleton of HLPN with 21 places and 41 transitions in 8 ms.
[2021-05-20 03:36:23] [INFO ] Skeletonized HLPN properties in 8 ms.
Successfully produced net in file /tmp/petri1000_2145811829792899242.dot
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
Normalized transition count is 30 out of 31 initially.
// Phase 1: matrix 30 rows 20 cols
[2021-05-20 03:36:24] [INFO ] Computed 5 place invariants in 11 ms
FORMULA VehicularWifi-COL-none-UpperBounds-13 8256 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA VehicularWifi-COL-none-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA VehicularWifi-COL-none-UpperBounds-10 8256 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA VehicularWifi-COL-none-UpperBounds-08 8256 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA VehicularWifi-COL-none-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA VehicularWifi-COL-none-UpperBounds-03 4 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA VehicularWifi-COL-none-UpperBounds-02 4 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2021-05-20 03:36:25] [INFO ] Unfolded HLPN to a Petri net with 115566 places and 83836 transitions in 1208 ms.
[2021-05-20 03:36:25] [INFO ] Unfolded HLPN properties in 9 ms.
[2021-05-20 03:36:25] [INFO ] Flow matrix only has 30 transitions (discarded 1 similar events)
// Phase 1: matrix 30 rows 20 cols
[2021-05-20 03:36:25] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-20 03:36:25] [INFO ] [Real]Absence check using 4 positive place invariants in 8 ms returned sat
[2021-05-20 03:36:25] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-20 03:36:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 03:36:25] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2021-05-20 03:36:25] [INFO ] State equation strengthened by 10 read => feed constraints.
[2021-05-20 03:36:25] [INFO ] [Real]Added 10 Read/Feed constraints in 4 ms returned sat
[2021-05-20 03:36:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-20 03:36:25] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2021-05-20 03:36:25] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-20 03:36:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-20 03:36:25] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2021-05-20 03:36:25] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2021-05-20 03:36:25] [INFO ] Computed and/alt/rep : 26/70/26 causal constraints (skipped 0 transitions) in 10 ms.
[2021-05-20 03:36:25] [INFO ] Added : 19 causal constraints over 4 iterations in 69 ms. Result :sat
Minimization took 21 ms.
[2021-05-20 03:36:25] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-20 03:36:25] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-20 03:36:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 03:36:25] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2021-05-20 03:36:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-20 03:36:25] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2021-05-20 03:36:25] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-20 03:36:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-20 03:36:25] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2021-05-20 03:36:25] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2021-05-20 03:36:25] [INFO ] Computed and/alt/rep : 26/70/26 causal constraints (skipped 0 transitions) in 11 ms.
[2021-05-20 03:36:26] [INFO ] Added : 18 causal constraints over 4 iterations in 79 ms. Result :sat
Minimization took 20 ms.
[2021-05-20 03:36:26] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-20 03:36:26] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-20 03:36:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 03:36:26] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2021-05-20 03:36:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-20 03:36:26] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-20 03:36:26] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-20 03:36:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-20 03:36:26] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2021-05-20 03:36:26] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2021-05-20 03:36:26] [INFO ] Computed and/alt/rep : 26/70/26 causal constraints (skipped 0 transitions) in 13 ms.
[2021-05-20 03:36:26] [INFO ] Added : 19 causal constraints over 4 iterations in 51 ms. Result :sat
Minimization took 24 ms.
[2021-05-20 03:36:26] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-20 03:36:26] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-20 03:36:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 03:36:26] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2021-05-20 03:36:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-20 03:36:26] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-20 03:36:26] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-20 03:36:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-20 03:36:26] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2021-05-20 03:36:26] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2021-05-20 03:36:26] [INFO ] Computed and/alt/rep : 26/70/26 causal constraints (skipped 0 transitions) in 10 ms.
[2021-05-20 03:36:26] [INFO ] Added : 19 causal constraints over 4 iterations in 56 ms. Result :sat
Minimization took 33 ms.
[2021-05-20 03:36:26] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-20 03:36:26] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-20 03:36:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 03:36:26] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2021-05-20 03:36:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-20 03:36:26] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2021-05-20 03:36:26] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-20 03:36:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-20 03:36:26] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2021-05-20 03:36:26] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2021-05-20 03:36:26] [INFO ] Computed and/alt/rep : 26/70/26 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-20 03:36:26] [INFO ] Added : 19 causal constraints over 4 iterations in 40 ms. Result :sat
Minimization took 24 ms.
[2021-05-20 03:36:26] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-20 03:36:26] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-20 03:36:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 03:36:26] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2021-05-20 03:36:26] [INFO ] [Real]Added 10 Read/Feed constraints in 3 ms returned sat
[2021-05-20 03:36:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-20 03:36:26] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-20 03:36:26] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-20 03:36:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-20 03:36:26] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2021-05-20 03:36:26] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2021-05-20 03:36:26] [INFO ] Computed and/alt/rep : 26/70/26 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-20 03:36:26] [INFO ] Added : 19 causal constraints over 4 iterations in 37 ms. Result :sat
Minimization took 11 ms.
[2021-05-20 03:36:26] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-20 03:36:26] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-20 03:36:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 03:36:26] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2021-05-20 03:36:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-20 03:36:26] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-20 03:36:26] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-20 03:36:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-20 03:36:26] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2021-05-20 03:36:26] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2021-05-20 03:36:26] [INFO ] Computed and/alt/rep : 26/70/26 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-20 03:36:26] [INFO ] Added : 20 causal constraints over 4 iterations in 38 ms. Result :sat
Minimization took 11 ms.
[2021-05-20 03:36:26] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-20 03:36:26] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-20 03:36:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 03:36:26] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2021-05-20 03:36:26] [INFO ] [Real]Added 10 Read/Feed constraints in 2 ms returned sat
[2021-05-20 03:36:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-20 03:36:26] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-20 03:36:26] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-20 03:36:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-20 03:36:27] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2021-05-20 03:36:27] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2021-05-20 03:36:27] [INFO ] Computed and/alt/rep : 26/70/26 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-20 03:36:27] [INFO ] Added : 19 causal constraints over 4 iterations in 34 ms. Result :sat
Minimization took 26 ms.
[2021-05-20 03:36:27] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-20 03:36:27] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-20 03:36:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 03:36:27] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2021-05-20 03:36:27] [INFO ] [Real]Added 10 Read/Feed constraints in 3 ms returned sat
[2021-05-20 03:36:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-20 03:36:27] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-20 03:36:27] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-20 03:36:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-20 03:36:27] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2021-05-20 03:36:27] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2021-05-20 03:36:27] [INFO ] Computed and/alt/rep : 26/70/26 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-20 03:36:27] [INFO ] Added : 19 causal constraints over 4 iterations in 35 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : [-1, 11, 11, 11, 11, 4, -1, 4, 4]
[2021-05-20 03:36:28] [INFO ] Unfolded HLPN to a Petri net with 115566 places and 83836 transitions in 765 ms.
[2021-05-20 03:36:28] [INFO ] Unfolded HLPN properties in 1 ms.
Successfully produced net in file /tmp/petri1001_16206862685288752613.dot
Deduced a syphon composed of 98581 places in 378 ms
Reduce places removed 106837 places and 54136 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 684 ms. (steps per millisecond=14 ) properties (out of 9) seen :186
FORMULA VehicularWifi-COL-none-UpperBounds-14 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 8) seen :58
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 8) seen :49
FORMULA VehicularWifi-COL-none-UpperBounds-15 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA VehicularWifi-COL-none-UpperBounds-09 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 6) seen :26
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 6) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 6) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :43
[2021-05-20 03:36:31] [INFO ] Flow matrix only has 17308 transitions (discarded 12392 similar events)
// Phase 1: matrix 17308 rows 8729 cols
[2021-05-20 03:36:32] [INFO ] Computed 8 place invariants in 1364 ms
[2021-05-20 03:36:34] [INFO ] [Real]Absence check using 6 positive place invariants in 280 ms returned sat
[2021-05-20 03:36:34] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 152 ms returned sat
[2021-05-20 03:36:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 03:36:37] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-20 03:36:39] [INFO ] [Real]Absence check using 6 positive place invariants in 233 ms returned sat
[2021-05-20 03:36:39] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 103 ms returned sat
[2021-05-20 03:36:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 03:36:43] [INFO ] [Real]Absence check using state equation in 3346 ms returned unknown
[2021-05-20 03:36:44] [INFO ] [Real]Absence check using 6 positive place invariants in 347 ms returned sat
[2021-05-20 03:36:44] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 138 ms returned sat
[2021-05-20 03:36:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 03:36:48] [INFO ] [Real]Absence check using state equation in 3370 ms returned unknown
[2021-05-20 03:36:49] [INFO ] [Real]Absence check using 6 positive place invariants in 339 ms returned sat
[2021-05-20 03:36:49] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 151 ms returned sat
[2021-05-20 03:36:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 03:36:53] [INFO ] [Real]Absence check using state equation in 3263 ms returned unknown
[2021-05-20 03:36:54] [INFO ] [Real]Absence check using 6 positive place invariants in 230 ms returned sat
[2021-05-20 03:36:54] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 135 ms returned sat
[2021-05-20 03:36:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 03:36:58] [INFO ] [Real]Absence check using state equation in 3315 ms returned unknown
[2021-05-20 03:36:59] [INFO ] [Real]Absence check using 6 positive place invariants in 220 ms returned sat
[2021-05-20 03:36:59] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 94 ms returned sat
[2021-05-20 03:36:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 03:37:03] [INFO ] [Real]Absence check using state equation in 3615 ms returned unknown
Current structural bounds on expressions (after SMT) : [2147483647, 11, 11, 11, 11, 2147483647] Max seen :[43, 1, 8, 8, 8, 122]
Support contains 273 out of 8729 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8729/8729 places, 29700/29700 transitions.
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 24 Pre rules applied. Total rules applied 0 place count 8729 transition count 29676
Deduced a syphon composed of 24 places in 39 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 8705 transition count 29676
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 35 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 64 place count 8697 transition count 29668
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 71 place count 8697 transition count 29668
Applied a total of 71 rules in 7010 ms. Remains 8697 /8729 variables (removed 32) and now considering 29668/29700 (removed 32) transitions.
[2021-05-20 03:37:10] [INFO ] Flow matrix only has 17276 transitions (discarded 12392 similar events)
// Phase 1: matrix 17276 rows 8697 cols
[2021-05-20 03:37:11] [INFO ] Computed 8 place invariants in 941 ms
[2021-05-20 03:37:12] [INFO ] Dead Transitions using invariants and state equation in 1992 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8697/8729 places, 29668/29700 transitions.
Normalized transition count is 17276 out of 29668 initially.
// Phase 1: matrix 17276 rows 8697 cols
[2021-05-20 03:37:13] [INFO ] Computed 8 place invariants in 1083 ms
Interrupted random walk after 689690 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=22 ) properties seen :{0=103, 1=3, 2=4, 3=4, 4=5, 5=10004}
Interrupted Best-First random walk after 582993 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=116 ) properties seen :{0=2268, 1=2, 2=4, 3=1, 4=5, 5=1470}
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4071 ms. (steps per millisecond=245 ) properties (out of 6) seen :592
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2474 ms. (steps per millisecond=404 ) properties (out of 6) seen :27
Interrupted Best-First random walk after 417317 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=83 ) properties seen :{1=1, 3=8, 4=2, 5=2}
Interrupted Best-First random walk after 653663 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=130 ) properties seen :{4=8}
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4878 ms. (steps per millisecond=205 ) properties (out of 6) seen :1076
[2021-05-20 03:38:09] [INFO ] Flow matrix only has 17276 transitions (discarded 12392 similar events)
// Phase 1: matrix 17276 rows 8697 cols
[2021-05-20 03:38:10] [INFO ] Computed 8 place invariants in 934 ms
[2021-05-20 03:38:12] [INFO ] [Real]Absence check using 6 positive place invariants in 251 ms returned sat
[2021-05-20 03:38:12] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 3 ms returned sat
[2021-05-20 03:38:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 03:38:25] [INFO ] [Real]Absence check using state equation in 13772 ms returned sat
[2021-05-20 03:38:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-20 03:38:28] [INFO ] [Nat]Absence check using 6 positive place invariants in 245 ms returned sat
[2021-05-20 03:38:28] [INFO ] [Nat]Absence check using 6 positive and 2 generalized place invariants in 3 ms returned sat
[2021-05-20 03:38:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-20 03:38:45] [INFO ] [Nat]Absence check using state equation in 17152 ms returned sat
[2021-05-20 03:38:45] [INFO ] State equation strengthened by 8418 read => feed constraints.
[2021-05-20 03:38:49] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-20 03:38:52] [INFO ] [Nat]Added 8418 Read/Feed constraints in 7111 ms returned unknown
[2021-05-20 03:38:54] [INFO ] [Real]Absence check using 6 positive place invariants in 242 ms returned sat
[2021-05-20 03:38:54] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 6 ms returned sat
[2021-05-20 03:38:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 03:39:07] [INFO ] [Real]Absence check using state equation in 13561 ms returned sat
[2021-05-20 03:39:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-20 03:39:09] [INFO ] [Nat]Absence check using 6 positive place invariants in 265 ms returned sat
[2021-05-20 03:39:09] [INFO ] [Nat]Absence check using 6 positive and 2 generalized place invariants in 6 ms returned sat
[2021-05-20 03:39:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-20 03:39:25] [INFO ] [Nat]Absence check using state equation in 15322 ms returned sat
[2021-05-20 03:39:28] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-20 03:39:31] [INFO ] [Nat]Added 8418 Read/Feed constraints in 6922 ms returned unknown
[2021-05-20 03:39:33] [INFO ] [Real]Absence check using 6 positive place invariants in 247 ms returned sat
[2021-05-20 03:39:33] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 12 ms returned sat
[2021-05-20 03:39:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 03:39:46] [INFO ] [Real]Absence check using state equation in 13549 ms returned sat
[2021-05-20 03:39:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-20 03:39:48] [INFO ] [Nat]Absence check using 6 positive place invariants in 245 ms returned sat
[2021-05-20 03:39:48] [INFO ] [Nat]Absence check using 6 positive and 2 generalized place invariants in 12 ms returned sat
[2021-05-20 03:39:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-20 03:40:02] [INFO ] [Nat]Absence check using state equation in 14096 ms returned sat
[2021-05-20 03:40:05] [INFO ] [Nat]Added 8418 Read/Feed constraints in 2135 ms returned sat
[2021-05-20 03:40:27] [INFO ] Deduced a trap composed of 54 places in 21657 ms of which 8 ms to minimize.
[2021-05-20 03:40:48] [INFO ] Deduced a trap composed of 39 places in 20595 ms of which 6 ms to minimize.
[2021-05-20 03:40:48] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-20 03:40:50] [INFO ] [Real]Absence check using 6 positive place invariants in 242 ms returned sat
[2021-05-20 03:40:50] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 12 ms returned sat
[2021-05-20 03:40:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 03:41:05] [INFO ] [Real]Absence check using state equation in 14855 ms returned sat
[2021-05-20 03:41:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-20 03:41:07] [INFO ] [Nat]Absence check using 6 positive place invariants in 349 ms returned sat
[2021-05-20 03:41:07] [INFO ] [Nat]Absence check using 6 positive and 2 generalized place invariants in 20 ms returned sat
[2021-05-20 03:41:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-20 03:41:20] [INFO ] [Nat]Absence check using state equation in 12761 ms returned sat
[2021-05-20 03:41:22] [INFO ] [Nat]Added 8418 Read/Feed constraints in 2165 ms returned sat
[2021-05-20 03:41:42] [INFO ] Deduced a trap composed of 50 places in 19464 ms of which 7 ms to minimize.
[2021-05-20 03:42:03] [INFO ] Deduced a trap composed of 48 places in 20566 ms of which 6 ms to minimize.
[2021-05-20 03:42:03] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-20 03:42:05] [INFO ] [Real]Absence check using 6 positive place invariants in 295 ms returned sat
[2021-05-20 03:42:05] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 19 ms returned sat
[2021-05-20 03:42:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 03:42:31] [INFO ] [Real]Absence check using state equation in 25782 ms returned sat
[2021-05-20 03:42:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-20 03:42:33] [INFO ] [Nat]Absence check using 6 positive place invariants in 250 ms returned sat
[2021-05-20 03:42:33] [INFO ] [Nat]Absence check using 6 positive and 2 generalized place invariants in 11 ms returned sat
[2021-05-20 03:42:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-20 03:43:12] [INFO ] [Nat]Absence check using state equation in 39047 ms returned sat
[2021-05-20 03:43:16] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-20 03:43:16] [INFO ] [Nat]Added 8418 Read/Feed constraints in 4721 ms returned unknown
[2021-05-20 03:43:18] [INFO ] [Real]Absence check using 6 positive place invariants in 246 ms returned sat
[2021-05-20 03:43:18] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 3 ms returned sat
[2021-05-20 03:43:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 03:43:33] [INFO ] [Real]Absence check using state equation in 14962 ms returned sat
[2021-05-20 03:43:38] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-20 03:43:41] [INFO ] [Real]Added 8418 Read/Feed constraints in 7170 ms returned unknown
Current structural bounds on expressions (after SMT) : [2147483647, 11, 11, 11, 11, 2147483647] Max seen :[2268, 6, 8, 8, 8, 10004]
Interrupted Parikh walk after 508488 steps, including 1000 resets, run timeout after 30001 ms. (steps per millisecond=16 ) properties (out of 6) seen :11349
Support contains 273 out of 8697 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8697/8697 places, 29668/29668 transitions.
Applied a total of 0 rules in 1811 ms. Remains 8697 /8697 variables (removed 0) and now considering 29668/29668 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 8697/8697 places, 29668/29668 transitions.
Starting structural reductions, iteration 0 : 8697/8697 places, 29668/29668 transitions.
Applied a total of 0 rules in 1601 ms. Remains 8697 /8697 variables (removed 0) and now considering 29668/29668 (removed 0) transitions.
[2021-05-20 03:44:14] [INFO ] Flow matrix only has 17276 transitions (discarded 12392 similar events)
// Phase 1: matrix 17276 rows 8697 cols
[2021-05-20 03:44:15] [INFO ] Computed 8 place invariants in 1123 ms
[2021-05-20 03:44:16] [INFO ] Implicit Places using invariants in 2349 ms returned []
Implicit Place search using SMT only with invariants took 2350 ms to find 0 implicit places.
[2021-05-20 03:44:16] [INFO ] Flow matrix only has 17276 transitions (discarded 12392 similar events)
// Phase 1: matrix 17276 rows 8697 cols
[2021-05-20 03:44:18] [INFO ] Computed 8 place invariants in 1101 ms
[2021-05-20 03:44:19] [INFO ] Dead Transitions using invariants and state equation in 2279 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8697/8697 places, 29668/29668 transitions.
Normalized transition count is 17276 out of 29668 initially.
// Phase 1: matrix 17276 rows 8697 cols
[2021-05-20 03:44:20] [INFO ] Computed 8 place invariants in 1095 ms
Interrupted random walk after 677385 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=22 ) properties seen :{0=101, 1=2, 2=3, 3=5, 4=5, 5=9992}
Interrupted Best-First random walk after 626242 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=125 ) properties seen :{0=2269, 1=3, 2=4, 3=1, 4=5, 5=1461}
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3408 ms. (steps per millisecond=293 ) properties (out of 6) seen :517
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2512 ms. (steps per millisecond=398 ) properties (out of 6) seen :29
Interrupted Best-First random walk after 408139 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=81 ) properties seen :{3=8, 4=2, 5=2}
Interrupted Best-First random walk after 649872 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=129 ) properties seen :{4=8}
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4979 ms. (steps per millisecond=200 ) properties (out of 6) seen :1058
[2021-05-20 03:45:16] [INFO ] Flow matrix only has 17276 transitions (discarded 12392 similar events)
// Phase 1: matrix 17276 rows 8697 cols
[2021-05-20 03:45:17] [INFO ] Computed 8 place invariants in 909 ms
[2021-05-20 03:45:18] [INFO ] [Real]Absence check using 6 positive place invariants in 250 ms returned sat
[2021-05-20 03:45:18] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 3 ms returned sat
[2021-05-20 03:45:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 03:45:33] [INFO ] [Real]Absence check using state equation in 14631 ms returned sat
[2021-05-20 03:45:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-20 03:45:35] [INFO ] [Nat]Absence check using 6 positive place invariants in 249 ms returned sat
[2021-05-20 03:45:35] [INFO ] [Nat]Absence check using 6 positive and 2 generalized place invariants in 2 ms returned sat
[2021-05-20 03:45:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-20 03:45:52] [INFO ] [Nat]Absence check using state equation in 16995 ms returned sat
[2021-05-20 03:45:52] [INFO ] State equation strengthened by 8418 read => feed constraints.
[2021-05-20 03:45:56] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-20 03:45:59] [INFO ] [Nat]Added 8418 Read/Feed constraints in 6906 ms returned unknown
[2021-05-20 03:46:00] [INFO ] [Real]Absence check using 6 positive place invariants in 246 ms returned sat
[2021-05-20 03:46:00] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 5 ms returned sat
[2021-05-20 03:46:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 03:46:14] [INFO ] [Real]Absence check using state equation in 14267 ms returned sat
[2021-05-20 03:46:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-20 03:46:17] [INFO ] [Nat]Absence check using 6 positive place invariants in 250 ms returned sat
[2021-05-20 03:46:17] [INFO ] [Nat]Absence check using 6 positive and 2 generalized place invariants in 6 ms returned sat
[2021-05-20 03:46:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-20 03:46:31] [INFO ] [Nat]Absence check using state equation in 14234 ms returned sat
[2021-05-20 03:46:35] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-20 03:46:38] [INFO ] [Nat]Added 8418 Read/Feed constraints in 6982 ms returned unknown
[2021-05-20 03:46:39] [INFO ] [Real]Absence check using 6 positive place invariants in 246 ms returned sat
[2021-05-20 03:46:39] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 12 ms returned sat
[2021-05-20 03:46:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 03:46:53] [INFO ] [Real]Absence check using state equation in 13365 ms returned sat
[2021-05-20 03:46:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-20 03:46:55] [INFO ] [Nat]Absence check using 6 positive place invariants in 250 ms returned sat
[2021-05-20 03:46:55] [INFO ] [Nat]Absence check using 6 positive and 2 generalized place invariants in 12 ms returned sat
[2021-05-20 03:46:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-20 03:47:08] [INFO ] [Nat]Absence check using state equation in 13169 ms returned sat
[2021-05-20 03:47:10] [INFO ] [Nat]Added 8418 Read/Feed constraints in 1963 ms returned sat
[2021-05-20 03:47:31] [INFO ] Deduced a trap composed of 54 places in 20915 ms of which 6 ms to minimize.
[2021-05-20 03:47:53] [INFO ] Deduced a trap composed of 39 places in 20752 ms of which 6 ms to minimize.
[2021-05-20 03:47:53] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-20 03:47:54] [INFO ] [Real]Absence check using 6 positive place invariants in 249 ms returned sat
[2021-05-20 03:47:54] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 12 ms returned sat
[2021-05-20 03:47:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 03:48:09] [INFO ] [Real]Absence check using state equation in 14943 ms returned sat
[2021-05-20 03:48:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-20 03:48:11] [INFO ] [Nat]Absence check using 6 positive place invariants in 245 ms returned sat
[2021-05-20 03:48:11] [INFO ] [Nat]Absence check using 6 positive and 2 generalized place invariants in 12 ms returned sat
[2021-05-20 03:48:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-20 03:48:24] [INFO ] [Nat]Absence check using state equation in 13102 ms returned sat
[2021-05-20 03:48:26] [INFO ] [Nat]Added 8418 Read/Feed constraints in 2301 ms returned sat
[2021-05-20 03:48:47] [INFO ] Deduced a trap composed of 50 places in 20218 ms of which 5 ms to minimize.
[2021-05-20 03:49:09] [INFO ] Deduced a trap composed of 48 places in 20914 ms of which 6 ms to minimize.
[2021-05-20 03:49:09] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-20 03:49:10] [INFO ] [Real]Absence check using 6 positive place invariants in 245 ms returned sat
[2021-05-20 03:49:10] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 12 ms returned sat
[2021-05-20 03:49:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 03:49:35] [INFO ] [Real]Absence check using state equation in 25245 ms returned sat
[2021-05-20 03:49:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-20 03:49:38] [INFO ] [Nat]Absence check using 6 positive place invariants in 250 ms returned sat
[2021-05-20 03:49:38] [INFO ] [Nat]Absence check using 6 positive and 2 generalized place invariants in 11 ms returned sat
[2021-05-20 03:49:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-20 03:50:18] [INFO ] [Nat]Absence check using state equation in 39815 ms returned sat
[2021-05-20 03:50:21] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-20 03:50:21] [INFO ] [Nat]Added 8418 Read/Feed constraints in 3780 ms returned unknown
[2021-05-20 03:50:23] [INFO ] [Real]Absence check using 6 positive place invariants in 248 ms returned sat
[2021-05-20 03:50:23] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 3 ms returned sat
[2021-05-20 03:50:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 03:50:38] [INFO ] [Real]Absence check using state equation in 14896 ms returned sat
[2021-05-20 03:50:43] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-20 03:50:46] [INFO ] [Real]Added 8418 Read/Feed constraints in 7239 ms returned unknown
Current structural bounds on expressions (after SMT) : [2147483647, 11, 11, 11, 11, 2147483647] Max seen :[2269, 6, 8, 8, 8, 11064]
Interrupted Parikh walk after 566121 steps, including 1000 resets, run timeout after 30001 ms. (steps per millisecond=18 ) properties (out of 6) seen :14178
Support contains 273 out of 8697 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8697/8697 places, 29668/29668 transitions.
Applied a total of 0 rules in 1624 ms. Remains 8697 /8697 variables (removed 0) and now considering 29668/29668 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 8697/8697 places, 29668/29668 transitions.
Starting structural reductions, iteration 0 : 8697/8697 places, 29668/29668 transitions.
Applied a total of 0 rules in 1654 ms. Remains 8697 /8697 variables (removed 0) and now considering 29668/29668 (removed 0) transitions.
[2021-05-20 03:51:19] [INFO ] Flow matrix only has 17276 transitions (discarded 12392 similar events)
// Phase 1: matrix 17276 rows 8697 cols
[2021-05-20 03:51:21] [INFO ] Computed 8 place invariants in 1286 ms
[2021-05-20 03:51:22] [INFO ] Implicit Places using invariants in 2333 ms returned []
Implicit Place search using SMT only with invariants took 2334 ms to find 0 implicit places.
[2021-05-20 03:51:22] [INFO ] Flow matrix only has 17276 transitions (discarded 12392 similar events)
// Phase 1: matrix 17276 rows 8697 cols
[2021-05-20 03:51:23] [INFO ] Computed 8 place invariants in 1218 ms
[2021-05-20 03:51:24] [INFO ] Dead Transitions using invariants and state equation in 2356 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8697/8697 places, 29668/29668 transitions.
Normalized transition count is 17276 out of 29668 initially.
// Phase 1: matrix 17276 rows 8697 cols
[2021-05-20 03:51:25] [INFO ] Computed 8 place invariants in 1089 ms
Interrupted random walk after 683083 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=22 ) properties seen :{0=101, 1=2, 2=3, 3=4, 4=5, 5=10055}
Interrupted Best-First random walk after 605220 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=121 ) properties seen :{0=2300, 1=2, 2=4, 3=1, 4=5, 5=1477}
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3533 ms. (steps per millisecond=283 ) properties (out of 6) seen :702
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2402 ms. (steps per millisecond=416 ) properties (out of 6) seen :27
Interrupted Best-First random walk after 416415 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=83 ) properties seen :{3=8, 4=3, 5=2}
Interrupted Best-First random walk after 656975 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=131 ) properties seen :{4=8}
Interrupted Best-First random walk after 982150 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=196 ) properties seen :{0=74, 2=3, 3=5, 4=4, 5=967}
[2021-05-20 03:52:21] [INFO ] Flow matrix only has 17276 transitions (discarded 12392 similar events)
// Phase 1: matrix 17276 rows 8697 cols
[2021-05-20 03:52:22] [INFO ] Computed 8 place invariants in 1214 ms
[2021-05-20 03:52:24] [INFO ] [Real]Absence check using 6 positive place invariants in 247 ms returned sat
[2021-05-20 03:52:24] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 6 ms returned sat
[2021-05-20 03:52:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 03:52:38] [INFO ] [Real]Absence check using state equation in 13650 ms returned sat
[2021-05-20 03:52:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-20 03:52:40] [INFO ] [Nat]Absence check using 6 positive place invariants in 246 ms returned sat
[2021-05-20 03:52:40] [INFO ] [Nat]Absence check using 6 positive and 2 generalized place invariants in 3 ms returned sat
[2021-05-20 03:52:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-20 03:52:57] [INFO ] [Nat]Absence check using state equation in 17141 ms returned sat
[2021-05-20 03:52:57] [INFO ] State equation strengthened by 8418 read => feed constraints.
[2021-05-20 03:53:01] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-20 03:53:04] [INFO ] [Nat]Added 8418 Read/Feed constraints in 7008 ms returned unknown
[2021-05-20 03:53:05] [INFO ] [Real]Absence check using 6 positive place invariants in 243 ms returned sat
[2021-05-20 03:53:05] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 8 ms returned sat
[2021-05-20 03:53:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 03:53:18] [INFO ] [Real]Absence check using state equation in 13199 ms returned sat
[2021-05-20 03:53:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-20 03:53:20] [INFO ] [Nat]Absence check using 6 positive place invariants in 250 ms returned sat
[2021-05-20 03:53:20] [INFO ] [Nat]Absence check using 6 positive and 2 generalized place invariants in 8 ms returned sat
[2021-05-20 03:53:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-20 03:53:34] [INFO ] [Nat]Absence check using state equation in 13409 ms returned sat
[2021-05-20 03:53:36] [INFO ] [Nat]Added 8418 Read/Feed constraints in 2154 ms returned sat
[2021-05-20 03:53:49] [INFO ] Deduced a trap composed of 39 places in 12208 ms of which 4 ms to minimize.
[2021-05-20 03:54:02] [INFO ] Deduced a trap composed of 48 places in 12669 ms of which 4 ms to minimize.
[2021-05-20 03:54:16] [INFO ] Deduced a trap composed of 51 places in 12746 ms of which 4 ms to minimize.
[2021-05-20 03:54:16] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-20 03:54:17] [INFO ] [Real]Absence check using 6 positive place invariants in 248 ms returned sat
[2021-05-20 03:54:17] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 12 ms returned sat
[2021-05-20 03:54:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 03:54:30] [INFO ] [Real]Absence check using state equation in 12949 ms returned sat
[2021-05-20 03:54:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-20 03:54:32] [INFO ] [Nat]Absence check using 6 positive place invariants in 250 ms returned sat
[2021-05-20 03:54:32] [INFO ] [Nat]Absence check using 6 positive and 2 generalized place invariants in 12 ms returned sat
[2021-05-20 03:54:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-20 03:54:47] [INFO ] [Nat]Absence check using state equation in 14316 ms returned sat
[2021-05-20 03:54:49] [INFO ] [Nat]Added 8418 Read/Feed constraints in 2000 ms returned sat
[2021-05-20 03:55:11] [INFO ] Deduced a trap composed of 54 places in 21241 ms of which 6 ms to minimize.
[2021-05-20 03:55:33] [INFO ] Deduced a trap composed of 39 places in 21851 ms of which 6 ms to minimize.
[2021-05-20 03:55:33] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-20 03:55:35] [INFO ] [Real]Absence check using 6 positive place invariants in 253 ms returned sat
[2021-05-20 03:55:35] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 13 ms returned sat
[2021-05-20 03:55:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 03:55:52] [INFO ] [Real]Absence check using state equation in 17612 ms returned sat
[2021-05-20 03:55:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-20 03:55:54] [INFO ] [Nat]Absence check using 6 positive place invariants in 251 ms returned sat
[2021-05-20 03:55:54] [INFO ] [Nat]Absence check using 6 positive and 2 generalized place invariants in 12 ms returned sat
[2021-05-20 03:55:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-20 03:56:11] [INFO ] [Nat]Absence check using state equation in 16178 ms returned sat
[2021-05-20 03:56:13] [INFO ] [Nat]Added 8418 Read/Feed constraints in 2058 ms returned sat
[2021-05-20 03:56:35] [INFO ] Deduced a trap composed of 50 places in 21551 ms of which 6 ms to minimize.
[2021-05-20 03:56:57] [INFO ] Deduced a trap composed of 48 places in 21182 ms of which 5 ms to minimize.
[2021-05-20 03:56:57] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-20 03:56:59] [INFO ] [Real]Absence check using 6 positive place invariants in 253 ms returned sat
[2021-05-20 03:56:59] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 12 ms returned sat
[2021-05-20 03:56:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 03:57:25] [INFO ] [Real]Absence check using state equation in 26903 ms returned sat
[2021-05-20 03:57:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-20 03:57:28] [INFO ] [Nat]Absence check using 6 positive place invariants in 254 ms returned sat
[2021-05-20 03:57:28] [INFO ] [Nat]Absence check using 6 positive and 2 generalized place invariants in 11 ms returned sat
[2021-05-20 03:57:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-20 03:58:08] [INFO ] [Nat]Absence check using state equation in 40361 ms returned sat
[2021-05-20 03:58:11] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-20 03:58:11] [INFO ] [Nat]Added 8418 Read/Feed constraints in 3237 ms returned unknown
[2021-05-20 03:58:13] [INFO ] [Real]Absence check using 6 positive place invariants in 247 ms returned sat
[2021-05-20 03:58:13] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 3 ms returned sat
[2021-05-20 03:58:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 03:58:29] [INFO ] [Real]Absence check using state equation in 15657 ms returned sat
[2021-05-20 03:58:33] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-20 03:58:36] [INFO ] [Real]Added 8418 Read/Feed constraints in 6915 ms returned unknown
Current structural bounds on expressions (after SMT) : [2147483647, 11, 11, 11, 11, 2147483647] Max seen :[2300, 7, 8, 8, 8, 14041]
Interrupted Parikh walk after 273404 steps, including 998 resets, run timeout after 30001 ms. (steps per millisecond=9 ) properties (out of 6) seen :830
Support contains 273 out of 8697 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8697/8697 places, 29668/29668 transitions.
Applied a total of 0 rules in 1534 ms. Remains 8697 /8697 variables (removed 0) and now considering 29668/29668 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 8697/8697 places, 29668/29668 transitions.
Starting structural reductions, iteration 0 : 8697/8697 places, 29668/29668 transitions.
Applied a total of 0 rules in 1536 ms. Remains 8697 /8697 variables (removed 0) and now considering 29668/29668 (removed 0) transitions.
[2021-05-20 03:59:09] [INFO ] Flow matrix only has 17276 transitions (discarded 12392 similar events)
// Phase 1: matrix 17276 rows 8697 cols
[2021-05-20 03:59:10] [INFO ] Computed 8 place invariants in 1080 ms
[2021-05-20 03:59:12] [INFO ] Implicit Places using invariants in 2320 ms returned []
Implicit Place search using SMT only with invariants took 2324 ms to find 0 implicit places.
[2021-05-20 03:59:12] [INFO ] Flow matrix only has 17276 transitions (discarded 12392 similar events)
// Phase 1: matrix 17276 rows 8697 cols
[2021-05-20 03:59:13] [INFO ] Computed 8 place invariants in 1058 ms
[2021-05-20 03:59:14] [INFO ] Dead Transitions using invariants and state equation in 2087 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8697/8697 places, 29668/29668 transitions.
Normalized transition count is 17276 out of 29668 initially.
// Phase 1: matrix 17276 rows 8697 cols
[2021-05-20 03:59:15] [INFO ] Computed 8 place invariants in 1261 ms
Interrupted random walk after 716909 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=23 ) properties seen :{0=148, 1=3, 2=3, 3=4, 4=5, 5=10037}
Interrupted Best-First random walk after 634846 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=126 ) properties seen :{0=2281, 1=2, 2=3, 3=1, 4=5, 5=1511}
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3370 ms. (steps per millisecond=296 ) properties (out of 6) seen :532
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2426 ms. (steps per millisecond=412 ) properties (out of 6) seen :30
Interrupted Best-First random walk after 416369 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=83 ) properties seen :{3=8, 4=3, 5=2}
Interrupted Best-First random walk after 662404 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=132 ) properties seen :{4=8}
Interrupted Best-First random walk after 991353 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=198 ) properties seen :{0=66, 2=3, 3=4, 4=4, 5=962}
[2021-05-20 04:00:11] [INFO ] Flow matrix only has 17276 transitions (discarded 12392 similar events)
// Phase 1: matrix 17276 rows 8697 cols
[2021-05-20 04:00:12] [INFO ] Computed 8 place invariants in 912 ms
[2021-05-20 04:00:13] [INFO ] [Real]Absence check using 6 positive place invariants in 253 ms returned sat
[2021-05-20 04:00:13] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 3 ms returned sat
[2021-05-20 04:00:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 04:00:26] [INFO ] [Real]Absence check using state equation in 13051 ms returned sat
[2021-05-20 04:00:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-20 04:00:28] [INFO ] [Nat]Absence check using 6 positive place invariants in 246 ms returned sat
[2021-05-20 04:00:28] [INFO ] [Nat]Absence check using 6 positive and 2 generalized place invariants in 3 ms returned sat
[2021-05-20 04:00:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-20 04:00:46] [INFO ] [Nat]Absence check using state equation in 17412 ms returned sat
[2021-05-20 04:00:46] [INFO ] State equation strengthened by 8418 read => feed constraints.
[2021-05-20 04:00:50] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-20 04:00:53] [INFO ] [Nat]Added 8418 Read/Feed constraints in 6908 ms returned unknown
[2021-05-20 04:00:54] [INFO ] [Real]Absence check using 6 positive place invariants in 251 ms returned sat
[2021-05-20 04:00:54] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 9 ms returned sat
[2021-05-20 04:00:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 04:01:08] [INFO ] [Real]Absence check using state equation in 13970 ms returned sat
[2021-05-20 04:01:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-20 04:01:10] [INFO ] [Nat]Absence check using 6 positive place invariants in 255 ms returned sat
[2021-05-20 04:01:10] [INFO ] [Nat]Absence check using 6 positive and 2 generalized place invariants in 11 ms returned sat
[2021-05-20 04:01:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-20 04:01:26] [INFO ] [Nat]Absence check using state equation in 15277 ms returned sat
[2021-05-20 04:01:28] [INFO ] [Nat]Added 8418 Read/Feed constraints in 2216 ms returned sat
[2021-05-20 04:01:41] [INFO ] Deduced a trap composed of 39 places in 12164 ms of which 5 ms to minimize.
[2021-05-20 04:01:54] [INFO ] Deduced a trap composed of 48 places in 13105 ms of which 6 ms to minimize.
[2021-05-20 04:01:54] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-20 04:01:56] [INFO ] [Real]Absence check using 6 positive place invariants in 259 ms returned sat
[2021-05-20 04:01:56] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 13 ms returned sat
[2021-05-20 04:01:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 04:02:10] [INFO ] [Real]Absence check using state equation in 14247 ms returned sat
[2021-05-20 04:02:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-20 04:02:12] [INFO ] [Nat]Absence check using 6 positive place invariants in 260 ms returned sat
[2021-05-20 04:02:12] [INFO ] [Nat]Absence check using 6 positive and 2 generalized place invariants in 12 ms returned sat
[2021-05-20 04:02:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-20 04:02:26] [INFO ] [Nat]Absence check using state equation in 13898 ms returned sat
[2021-05-20 04:02:28] [INFO ] [Nat]Added 8418 Read/Feed constraints in 1955 ms returned sat
[2021-05-20 04:02:50] [INFO ] Deduced a trap composed of 54 places in 20694 ms of which 6 ms to minimize.
[2021-05-20 04:03:13] [INFO ] Deduced a trap composed of 39 places in 22748 ms of which 7 ms to minimize.
[2021-05-20 04:03:13] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-20 04:03:15] [INFO ] [Real]Absence check using 6 positive place invariants in 273 ms returned sat
[2021-05-20 04:03:15] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 20 ms returned sat
[2021-05-20 04:03:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 04:03:32] [INFO ] [Real]Absence check using state equation in 17624 ms returned sat
[2021-05-20 04:03:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-20 04:03:34] [INFO ] [Nat]Absence check using 6 positive place invariants in 264 ms returned sat
[2021-05-20 04:03:34] [INFO ] [Nat]Absence check using 6 positive and 2 generalized place invariants in 13 ms returned sat
[2021-05-20 04:03:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-20 04:03:50] [INFO ] [Nat]Absence check using state equation in 16034 ms returned sat
[2021-05-20 04:03:52] [INFO ] [Nat]Added 8418 Read/Feed constraints in 2023 ms returned sat
[2021-05-20 04:04:14] [INFO ] Deduced a trap composed of 50 places in 21221 ms of which 6 ms to minimize.
[2021-05-20 04:04:36] [INFO ] Deduced a trap composed of 48 places in 21168 ms of which 6 ms to minimize.
[2021-05-20 04:04:36] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-20 04:04:38] [INFO ] [Real]Absence check using 6 positive place invariants in 261 ms returned sat
[2021-05-20 04:04:38] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 12 ms returned sat
[2021-05-20 04:04:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 04:05:07] [INFO ] [Real]Absence check using state equation in 29029 ms returned sat
[2021-05-20 04:05:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-20 04:05:09] [INFO ] [Nat]Absence check using 6 positive place invariants in 261 ms returned sat
[2021-05-20 04:05:09] [INFO ] [Nat]Absence check using 6 positive and 2 generalized place invariants in 12 ms returned sat
[2021-05-20 04:05:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-20 04:05:53] [INFO ] [Nat]Absence check using state equation in 43623 ms returned unknown
[2021-05-20 04:05:54] [INFO ] [Real]Absence check using 6 positive place invariants in 258 ms returned sat
[2021-05-20 04:05:54] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 6 ms returned sat
[2021-05-20 04:05:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 04:06:11] [INFO ] [Real]Absence check using state equation in 17056 ms returned sat
[2021-05-20 04:06:16] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-20 04:06:19] [INFO ] [Real]Added 8418 Read/Feed constraints in 6923 ms returned unknown
Current structural bounds on expressions (after SMT) : [2147483647, 11, 11, 11, 11, 2147483647] Max seen :[2300, 7, 8, 8, 8, 14041]
Interrupted Parikh walk after 272491 steps, including 998 resets, run timeout after 30001 ms. (steps per millisecond=9 ) properties (out of 6) seen :2096
Support contains 273 out of 8697 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8697/8697 places, 29668/29668 transitions.
Applied a total of 0 rules in 1745 ms. Remains 8697 /8697 variables (removed 0) and now considering 29668/29668 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 8697/8697 places, 29668/29668 transitions.
Starting structural reductions, iteration 0 : 8697/8697 places, 29668/29668 transitions.
Applied a total of 0 rules in 1555 ms. Remains 8697 /8697 variables (removed 0) and now considering 29668/29668 (removed 0) transitions.
[2021-05-20 04:06:52] [INFO ] Flow matrix only has 17276 transitions (discarded 12392 similar events)
// Phase 1: matrix 17276 rows 8697 cols
[2021-05-20 04:06:53] [INFO ] Computed 8 place invariants in 1159 ms
[2021-05-20 04:06:54] [INFO ] Implicit Places using invariants in 2392 ms returned []
Implicit Place search using SMT only with invariants took 2398 ms to find 0 implicit places.
[2021-05-20 04:06:54] [INFO ] Flow matrix only has 17276 transitions (discarded 12392 similar events)
// Phase 1: matrix 17276 rows 8697 cols
[2021-05-20 04:06:55] [INFO ] Computed 8 place invariants in 898 ms
[2021-05-20 04:06:57] [INFO ] Dead Transitions using invariants and state equation in 2175 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8697/8697 places, 29668/29668 transitions.
Starting property specific reduction for VehicularWifi-COL-none-UpperBounds-00
Normalized transition count is 17276 out of 29668 initially.
// Phase 1: matrix 17276 rows 8697 cols
[2021-05-20 04:06:58] [INFO ] Computed 8 place invariants in 963 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 432 ms. (steps per millisecond=23 ) properties (out of 1) seen :39
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 1) seen :25
[2021-05-20 04:06:58] [INFO ] Flow matrix only has 17276 transitions (discarded 12392 similar events)
// Phase 1: matrix 17276 rows 8697 cols
[2021-05-20 04:06:59] [INFO ] Computed 8 place invariants in 1000 ms
[2021-05-20 04:07:01] [INFO ] [Real]Absence check using 6 positive place invariants in 261 ms returned sat
[2021-05-20 04:07:01] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 4 ms returned sat
[2021-05-20 04:07:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 04:07:04] [INFO ] [Real]Absence check using state equation in 3253 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[39]
Support contains 160 out of 8697 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8697/8697 places, 29668/29668 transitions.
Free-agglomeration rule applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 8697 transition count 29660
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 16 place count 8689 transition count 29660
Free-agglomeration rule (complex) applied 24 times.
Iterating global reduction 1 with 24 rules applied. Total rules applied 40 place count 8689 transition count 29685
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 64 place count 8665 transition count 29685
Partial Free-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 2 with 14 rules applied. Total rules applied 78 place count 8665 transition count 29685
Applied a total of 78 rules in 6763 ms. Remains 8665 /8697 variables (removed 32) and now considering 29685/29668 (removed -17) transitions.
[2021-05-20 04:07:11] [INFO ] Flow matrix only has 17275 transitions (discarded 12410 similar events)
// Phase 1: matrix 17275 rows 8665 cols
[2021-05-20 04:07:12] [INFO ] Computed 8 place invariants in 1073 ms
[2021-05-20 04:07:13] [INFO ] Dead Transitions using invariants and state equation in 2345 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8665/8697 places, 29685/29668 transitions.
Normalized transition count is 17275 out of 29685 initially.
// Phase 1: matrix 17275 rows 8665 cols
[2021-05-20 04:07:14] [INFO ] Computed 8 place invariants in 1071 ms
Interrupted random walk after 744803 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=24 ) properties seen :{0=115}
Interrupted Best-First random walk after 628845 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=125 ) properties seen :{0=2275}
[2021-05-20 04:07:49] [INFO ] Flow matrix only has 17275 transitions (discarded 12410 similar events)
// Phase 1: matrix 17275 rows 8665 cols
[2021-05-20 04:07:50] [INFO ] Computed 8 place invariants in 847 ms
[2021-05-20 04:07:52] [INFO ] [Real]Absence check using 6 positive place invariants in 224 ms returned sat
[2021-05-20 04:07:52] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 100 ms returned sat
[2021-05-20 04:07:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 04:08:13] [INFO ] [Real]Absence check using state equation in 21000 ms returned sat
[2021-05-20 04:08:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-20 04:08:15] [INFO ] [Nat]Absence check using 6 positive place invariants in 242 ms returned sat
[2021-05-20 04:08:15] [INFO ] [Nat]Absence check using 6 positive and 2 generalized place invariants in 99 ms returned sat
[2021-05-20 04:08:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-20 04:08:46] [INFO ] [Nat]Absence check using state equation in 31288 ms returned sat
[2021-05-20 04:08:46] [INFO ] State equation strengthened by 8463 read => feed constraints.
[2021-05-20 04:08:51] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-20 04:08:54] [INFO ] [Nat]Added 8463 Read/Feed constraints in 7198 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2275]
Support contains 160 out of 8665 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8665/8665 places, 29685/29685 transitions.
Applied a total of 0 rules in 1721 ms. Remains 8665 /8665 variables (removed 0) and now considering 29685/29685 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 8665/8665 places, 29685/29685 transitions.
Starting structural reductions, iteration 0 : 8665/8665 places, 29685/29685 transitions.
Applied a total of 0 rules in 1789 ms. Remains 8665 /8665 variables (removed 0) and now considering 29685/29685 (removed 0) transitions.
[2021-05-20 04:08:57] [INFO ] Flow matrix only has 17275 transitions (discarded 12410 similar events)
// Phase 1: matrix 17275 rows 8665 cols
[2021-05-20 04:08:58] [INFO ] Computed 8 place invariants in 900 ms
[2021-05-20 04:08:59] [INFO ] Implicit Places using invariants in 1968 ms returned []
Implicit Place search using SMT only with invariants took 1969 ms to find 0 implicit places.
[2021-05-20 04:08:59] [INFO ] Flow matrix only has 17275 transitions (discarded 12410 similar events)
// Phase 1: matrix 17275 rows 8665 cols
[2021-05-20 04:09:00] [INFO ] Computed 8 place invariants in 1018 ms
[2021-05-20 04:09:01] [INFO ] Dead Transitions using invariants and state equation in 2290 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8665/8665 places, 29685/29685 transitions.
Normalized transition count is 17275 out of 29685 initially.
// Phase 1: matrix 17275 rows 8665 cols
[2021-05-20 04:09:02] [INFO ] Computed 8 place invariants in 843 ms
Interrupted random walk after 729893 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=24 ) properties seen :{0=93}
Interrupted Best-First random walk after 591799 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=118 ) properties seen :{0=2275}
[2021-05-20 04:09:37] [INFO ] Flow matrix only has 17275 transitions (discarded 12410 similar events)
// Phase 1: matrix 17275 rows 8665 cols
[2021-05-20 04:09:39] [INFO ] Computed 8 place invariants in 1241 ms
[2021-05-20 04:09:40] [INFO ] [Real]Absence check using 6 positive place invariants in 235 ms returned sat
[2021-05-20 04:09:40] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 102 ms returned sat
[2021-05-20 04:09:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 04:10:02] [INFO ] [Real]Absence check using state equation in 21624 ms returned sat
[2021-05-20 04:10:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-20 04:10:04] [INFO ] [Nat]Absence check using 6 positive place invariants in 242 ms returned sat
[2021-05-20 04:10:04] [INFO ] [Nat]Absence check using 6 positive and 2 generalized place invariants in 100 ms returned sat
[2021-05-20 04:10:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-20 04:10:30] [INFO ] [Nat]Absence check using state equation in 26545 ms returned sat
[2021-05-20 04:10:31] [INFO ] State equation strengthened by 8463 read => feed constraints.
[2021-05-20 04:10:35] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-20 04:10:38] [INFO ] [Nat]Added 8463 Read/Feed constraints in 7027 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2275]
Support contains 160 out of 8665 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8665/8665 places, 29685/29685 transitions.
Applied a total of 0 rules in 1645 ms. Remains 8665 /8665 variables (removed 0) and now considering 29685/29685 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 8665/8665 places, 29685/29685 transitions.
Starting structural reductions, iteration 0 : 8665/8665 places, 29685/29685 transitions.
Applied a total of 0 rules in 1633 ms. Remains 8665 /8665 variables (removed 0) and now considering 29685/29685 (removed 0) transitions.
[2021-05-20 04:10:41] [INFO ] Flow matrix only has 17275 transitions (discarded 12410 similar events)
// Phase 1: matrix 17275 rows 8665 cols
[2021-05-20 04:10:42] [INFO ] Computed 8 place invariants in 1038 ms
[2021-05-20 04:10:43] [INFO ] Implicit Places using invariants in 2291 ms returned []
Implicit Place search using SMT only with invariants took 2298 ms to find 0 implicit places.
[2021-05-20 04:10:43] [INFO ] Flow matrix only has 17275 transitions (discarded 12410 similar events)
// Phase 1: matrix 17275 rows 8665 cols
[2021-05-20 04:10:44] [INFO ] Computed 8 place invariants in 858 ms
[2021-05-20 04:10:45] [INFO ] Dead Transitions using invariants and state equation in 1980 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8665/8665 places, 29685/29685 transitions.
Ending property specific reduction for VehicularWifi-COL-none-UpperBounds-00 in 228482 ms.
Starting property specific reduction for VehicularWifi-COL-none-UpperBounds-01
Normalized transition count is 17276 out of 29668 initially.
// Phase 1: matrix 17276 rows 8697 cols
[2021-05-20 04:10:46] [INFO ] Computed 8 place invariants in 939 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 361 ms. (steps per millisecond=27 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :2
[2021-05-20 04:10:47] [INFO ] Flow matrix only has 17276 transitions (discarded 12392 similar events)
// Phase 1: matrix 17276 rows 8697 cols
[2021-05-20 04:10:48] [INFO ] Computed 8 place invariants in 1007 ms
[2021-05-20 04:10:49] [INFO ] [Real]Absence check using 6 positive place invariants in 258 ms returned sat
[2021-05-20 04:10:49] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 3 ms returned sat
[2021-05-20 04:10:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 04:10:53] [INFO ] [Real]Absence check using state equation in 3394 ms returned unknown
Current structural bounds on expressions (after SMT) : [348] Max seen :[2]
Support contains 33 out of 8697 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8697/8697 places, 29668/29668 transitions.
Free-agglomeration rule applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 8697 transition count 29660
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 16 place count 8689 transition count 29660
Applied a total of 16 rules in 3366 ms. Remains 8689 /8697 variables (removed 8) and now considering 29660/29668 (removed 8) transitions.
[2021-05-20 04:10:56] [INFO ] Flow matrix only has 17264 transitions (discarded 12396 similar events)
// Phase 1: matrix 17264 rows 8689 cols
[2021-05-20 04:10:57] [INFO ] Computed 8 place invariants in 1093 ms
[2021-05-20 04:10:58] [INFO ] Dead Transitions using invariants and state equation in 2146 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8689/8697 places, 29660/29668 transitions.
Normalized transition count is 17264 out of 29660 initially.
// Phase 1: matrix 17264 rows 8689 cols
[2021-05-20 04:10:59] [INFO ] Computed 8 place invariants in 1186 ms
Interrupted random walk after 859050 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=28 ) properties seen :{0=3}
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3422 ms. (steps per millisecond=292 ) properties (out of 1) seen :7
[2021-05-20 04:11:33] [INFO ] Flow matrix only has 17264 transitions (discarded 12396 similar events)
// Phase 1: matrix 17264 rows 8689 cols
[2021-05-20 04:11:34] [INFO ] Computed 8 place invariants in 1086 ms
[2021-05-20 04:11:35] [INFO ] [Real]Absence check using 6 positive place invariants in 247 ms returned sat
[2021-05-20 04:11:36] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 96 ms returned sat
[2021-05-20 04:11:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 04:11:55] [INFO ] [Real]Absence check using state equation in 19279 ms returned sat
[2021-05-20 04:11:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-20 04:11:57] [INFO ] [Nat]Absence check using 6 positive place invariants in 243 ms returned sat
[2021-05-20 04:11:57] [INFO ] [Nat]Absence check using 6 positive and 2 generalized place invariants in 93 ms returned sat
[2021-05-20 04:11:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-20 04:12:17] [INFO ] [Nat]Absence check using state equation in 19659 ms returned sat
[2021-05-20 04:12:17] [INFO ] State equation strengthened by 8414 read => feed constraints.
[2021-05-20 04:12:21] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-20 04:12:24] [INFO ] [Nat]Added 8414 Read/Feed constraints in 7173 ms returned unknown
Current structural bounds on expressions (after SMT) : [225] Max seen :[7]
Support contains 33 out of 8689 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8689/8689 places, 29660/29660 transitions.
Applied a total of 0 rules in 1819 ms. Remains 8689 /8689 variables (removed 0) and now considering 29660/29660 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 8689/8689 places, 29660/29660 transitions.
Starting structural reductions, iteration 0 : 8689/8689 places, 29660/29660 transitions.
Applied a total of 0 rules in 1594 ms. Remains 8689 /8689 variables (removed 0) and now considering 29660/29660 (removed 0) transitions.
[2021-05-20 04:12:27] [INFO ] Flow matrix only has 17264 transitions (discarded 12396 similar events)
// Phase 1: matrix 17264 rows 8689 cols
[2021-05-20 04:12:28] [INFO ] Computed 8 place invariants in 1084 ms
[2021-05-20 04:12:30] [INFO ] Implicit Places using invariants in 2346 ms returned []
Implicit Place search using SMT only with invariants took 2347 ms to find 0 implicit places.
[2021-05-20 04:12:30] [INFO ] Flow matrix only has 17264 transitions (discarded 12396 similar events)
// Phase 1: matrix 17264 rows 8689 cols
[2021-05-20 04:12:31] [INFO ] Computed 8 place invariants in 1085 ms
[2021-05-20 04:12:32] [INFO ] Dead Transitions using invariants and state equation in 2335 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8689/8689 places, 29660/29660 transitions.
Normalized transition count is 17264 out of 29660 initially.
// Phase 1: matrix 17264 rows 8689 cols
[2021-05-20 04:12:33] [INFO ] Computed 8 place invariants in 926 ms
Interrupted random walk after 829026 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=27 ) properties seen :{0=3}
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3417 ms. (steps per millisecond=292 ) properties (out of 1) seen :6
[2021-05-20 04:13:06] [INFO ] Flow matrix only has 17264 transitions (discarded 12396 similar events)
// Phase 1: matrix 17264 rows 8689 cols
[2021-05-20 04:13:08] [INFO ] Computed 8 place invariants in 1135 ms
[2021-05-20 04:13:09] [INFO ] [Real]Absence check using 6 positive place invariants in 238 ms returned sat
[2021-05-20 04:13:09] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 96 ms returned sat
[2021-05-20 04:13:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 04:13:27] [INFO ] [Real]Absence check using state equation in 17936 ms returned sat
[2021-05-20 04:13:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-20 04:13:29] [INFO ] [Nat]Absence check using 6 positive place invariants in 247 ms returned sat
[2021-05-20 04:13:29] [INFO ] [Nat]Absence check using 6 positive and 2 generalized place invariants in 90 ms returned sat
[2021-05-20 04:13:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-20 04:13:52] [INFO ] [Nat]Absence check using state equation in 22140 ms returned sat
[2021-05-20 04:13:52] [INFO ] State equation strengthened by 8414 read => feed constraints.
[2021-05-20 04:13:56] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-20 04:13:59] [INFO ] [Nat]Added 8414 Read/Feed constraints in 7006 ms returned unknown
Current structural bounds on expressions (after SMT) : [225] Max seen :[7]
Support contains 33 out of 8689 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8689/8689 places, 29660/29660 transitions.
Applied a total of 0 rules in 2042 ms. Remains 8689 /8689 variables (removed 0) and now considering 29660/29660 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 8689/8689 places, 29660/29660 transitions.
Starting structural reductions, iteration 0 : 8689/8689 places, 29660/29660 transitions.
Applied a total of 0 rules in 1660 ms. Remains 8689 /8689 variables (removed 0) and now considering 29660/29660 (removed 0) transitions.
[2021-05-20 04:14:02] [INFO ] Flow matrix only has 17264 transitions (discarded 12396 similar events)
// Phase 1: matrix 17264 rows 8689 cols
[2021-05-20 04:14:03] [INFO ] Computed 8 place invariants in 1014 ms
[2021-05-20 04:14:04] [INFO ] Implicit Places using invariants in 2066 ms returned []
Implicit Place search using SMT only with invariants took 2067 ms to find 0 implicit places.
[2021-05-20 04:14:05] [INFO ] Flow matrix only has 17264 transitions (discarded 12396 similar events)
// Phase 1: matrix 17264 rows 8689 cols
[2021-05-20 04:14:05] [INFO ] Computed 8 place invariants in 920 ms
[2021-05-20 04:14:07] [INFO ] Dead Transitions using invariants and state equation in 2155 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8689/8689 places, 29660/29660 transitions.
Ending property specific reduction for VehicularWifi-COL-none-UpperBounds-01 in 201545 ms.
Starting property specific reduction for VehicularWifi-COL-none-UpperBounds-04
Normalized transition count is 17276 out of 29668 initially.
// Phase 1: matrix 17276 rows 8697 cols
[2021-05-20 04:14:08] [INFO ] Computed 8 place invariants in 945 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 573 ms. (steps per millisecond=17 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :8
[2021-05-20 04:14:08] [INFO ] Flow matrix only has 17276 transitions (discarded 12392 similar events)
// Phase 1: matrix 17276 rows 8697 cols
[2021-05-20 04:14:10] [INFO ] Computed 8 place invariants in 1245 ms
[2021-05-20 04:14:11] [INFO ] [Real]Absence check using 6 positive place invariants in 270 ms returned sat
[2021-05-20 04:14:11] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 12 ms returned sat
[2021-05-20 04:14:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 04:14:15] [INFO ] [Real]Absence check using state equation in 3350 ms returned unknown
Current structural bounds on expressions (after SMT) : [140] Max seen :[8]
Support contains 8 out of 8697 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8697/8697 places, 29668/29668 transitions.
Free-agglomeration rule applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 8697 transition count 29660
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 16 place count 8689 transition count 29660
Free-agglomeration rule (complex) applied 24 times.
Iterating global reduction 1 with 24 rules applied. Total rules applied 40 place count 8689 transition count 29685
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 64 place count 8665 transition count 29685
Partial Free-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 2 with 14 rules applied. Total rules applied 78 place count 8665 transition count 29685
Applied a total of 78 rules in 6240 ms. Remains 8665 /8697 variables (removed 32) and now considering 29685/29668 (removed -17) transitions.
[2021-05-20 04:14:21] [INFO ] Flow matrix only has 17275 transitions (discarded 12410 similar events)
// Phase 1: matrix 17275 rows 8665 cols
[2021-05-20 04:14:22] [INFO ] Computed 8 place invariants in 1027 ms
[2021-05-20 04:14:23] [INFO ] Dead Transitions using invariants and state equation in 2062 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8665/8697 places, 29685/29668 transitions.
Normalized transition count is 17275 out of 29685 initially.
// Phase 1: matrix 17275 rows 8665 cols
[2021-05-20 04:14:24] [INFO ] Computed 8 place invariants in 1019 ms
Interrupted random walk after 820675 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=27 ) properties seen :{0=3}
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2441 ms. (steps per millisecond=409 ) properties (out of 1) seen :8
[2021-05-20 04:14:56] [INFO ] Flow matrix only has 17275 transitions (discarded 12410 similar events)
// Phase 1: matrix 17275 rows 8665 cols
[2021-05-20 04:14:57] [INFO ] Computed 8 place invariants in 1037 ms
[2021-05-20 04:14:59] [INFO ] [Real]Absence check using 6 positive place invariants in 230 ms returned sat
[2021-05-20 04:14:59] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 105 ms returned sat
[2021-05-20 04:14:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 04:15:16] [INFO ] [Real]Absence check using state equation in 17025 ms returned sat
[2021-05-20 04:15:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-20 04:15:18] [INFO ] [Nat]Absence check using 6 positive place invariants in 233 ms returned sat
[2021-05-20 04:15:18] [INFO ] [Nat]Absence check using 6 positive and 2 generalized place invariants in 101 ms returned sat
[2021-05-20 04:15:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-20 04:15:35] [INFO ] [Nat]Absence check using state equation in 17359 ms returned sat
[2021-05-20 04:15:36] [INFO ] State equation strengthened by 8463 read => feed constraints.
[2021-05-20 04:15:40] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-20 04:15:43] [INFO ] [Nat]Added 8463 Read/Feed constraints in 7396 ms returned unknown
Current structural bounds on expressions (after SMT) : [47] Max seen :[8]
Support contains 8 out of 8665 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8665/8665 places, 29685/29685 transitions.
Applied a total of 0 rules in 1995 ms. Remains 8665 /8665 variables (removed 0) and now considering 29685/29685 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 8665/8665 places, 29685/29685 transitions.
Starting structural reductions, iteration 0 : 8665/8665 places, 29685/29685 transitions.
Applied a total of 0 rules in 1781 ms. Remains 8665 /8665 variables (removed 0) and now considering 29685/29685 (removed 0) transitions.
[2021-05-20 04:15:47] [INFO ] Flow matrix only has 17275 transitions (discarded 12410 similar events)
// Phase 1: matrix 17275 rows 8665 cols
[2021-05-20 04:15:48] [INFO ] Computed 8 place invariants in 1055 ms
[2021-05-20 04:15:49] [INFO ] Implicit Places using invariants in 2093 ms returned []
Implicit Place search using SMT only with invariants took 2094 ms to find 0 implicit places.
[2021-05-20 04:15:49] [INFO ] Flow matrix only has 17275 transitions (discarded 12410 similar events)
// Phase 1: matrix 17275 rows 8665 cols
[2021-05-20 04:15:50] [INFO ] Computed 8 place invariants in 831 ms
[2021-05-20 04:15:51] [INFO ] Dead Transitions using invariants and state equation in 1958 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8665/8665 places, 29685/29685 transitions.
Ending property specific reduction for VehicularWifi-COL-none-UpperBounds-04 in 104155 ms.
Starting property specific reduction for VehicularWifi-COL-none-UpperBounds-05
Normalized transition count is 17276 out of 29668 initially.
// Phase 1: matrix 17276 rows 8697 cols
[2021-05-20 04:15:52] [INFO ] Computed 8 place invariants in 1093 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 514 ms. (steps per millisecond=19 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 1) seen :8
[2021-05-20 04:15:53] [INFO ] Flow matrix only has 17276 transitions (discarded 12392 similar events)
// Phase 1: matrix 17276 rows 8697 cols
[2021-05-20 04:15:54] [INFO ] Computed 8 place invariants in 1098 ms
[2021-05-20 04:15:55] [INFO ] [Real]Absence check using 6 positive place invariants in 261 ms returned sat
[2021-05-20 04:15:55] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 12 ms returned sat
[2021-05-20 04:15:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 04:15:59] [INFO ] [Real]Absence check using state equation in 3408 ms returned unknown
Current structural bounds on expressions (after SMT) : [140] Max seen :[8]
Support contains 8 out of 8697 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8697/8697 places, 29668/29668 transitions.
Free-agglomeration rule applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 8697 transition count 29660
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 16 place count 8689 transition count 29660
Free-agglomeration rule (complex) applied 24 times.
Iterating global reduction 1 with 24 rules applied. Total rules applied 40 place count 8689 transition count 29685
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 64 place count 8665 transition count 29685
Partial Free-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 2 with 14 rules applied. Total rules applied 78 place count 8665 transition count 29685
Applied a total of 78 rules in 7062 ms. Remains 8665 /8697 variables (removed 32) and now considering 29685/29668 (removed -17) transitions.
[2021-05-20 04:16:06] [INFO ] Flow matrix only has 17275 transitions (discarded 12410 similar events)
// Phase 1: matrix 17275 rows 8665 cols
[2021-05-20 04:16:07] [INFO ] Computed 8 place invariants in 1012 ms
[2021-05-20 04:16:08] [INFO ] Dead Transitions using invariants and state equation in 2054 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8665/8697 places, 29685/29668 transitions.
Normalized transition count is 17275 out of 29685 initially.
// Phase 1: matrix 17275 rows 8665 cols
[2021-05-20 04:16:09] [INFO ] Computed 8 place invariants in 1049 ms
Interrupted random walk after 888968 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=29 ) properties seen :{0=3}
Interrupted Best-First random walk after 434912 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=86 ) properties seen :{0=8}
[2021-05-20 04:16:44] [INFO ] Flow matrix only has 17275 transitions (discarded 12410 similar events)
// Phase 1: matrix 17275 rows 8665 cols
[2021-05-20 04:16:45] [INFO ] Computed 8 place invariants in 1009 ms
[2021-05-20 04:16:46] [INFO ] [Real]Absence check using 6 positive place invariants in 221 ms returned sat
[2021-05-20 04:16:46] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 100 ms returned sat
[2021-05-20 04:16:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 04:17:03] [INFO ] [Real]Absence check using state equation in 16936 ms returned sat
[2021-05-20 04:17:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-20 04:17:05] [INFO ] [Nat]Absence check using 6 positive place invariants in 237 ms returned sat
[2021-05-20 04:17:05] [INFO ] [Nat]Absence check using 6 positive and 2 generalized place invariants in 101 ms returned sat
[2021-05-20 04:17:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-20 04:17:23] [INFO ] [Nat]Absence check using state equation in 17377 ms returned sat
[2021-05-20 04:17:23] [INFO ] State equation strengthened by 8463 read => feed constraints.
[2021-05-20 04:17:27] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-20 04:17:30] [INFO ] [Nat]Added 8463 Read/Feed constraints in 7231 ms returned unknown
Current structural bounds on expressions (after SMT) : [47] Max seen :[8]
Support contains 8 out of 8665 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8665/8665 places, 29685/29685 transitions.
Applied a total of 0 rules in 2043 ms. Remains 8665 /8665 variables (removed 0) and now considering 29685/29685 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 8665/8665 places, 29685/29685 transitions.
Starting structural reductions, iteration 0 : 8665/8665 places, 29685/29685 transitions.
Applied a total of 0 rules in 1690 ms. Remains 8665 /8665 variables (removed 0) and now considering 29685/29685 (removed 0) transitions.
[2021-05-20 04:17:34] [INFO ] Flow matrix only has 17275 transitions (discarded 12410 similar events)
// Phase 1: matrix 17275 rows 8665 cols
[2021-05-20 04:17:35] [INFO ] Computed 8 place invariants in 1017 ms
[2021-05-20 04:17:36] [INFO ] Implicit Places using invariants in 2240 ms returned []
Implicit Place search using SMT only with invariants took 2241 ms to find 0 implicit places.
[2021-05-20 04:17:36] [INFO ] Flow matrix only has 17275 transitions (discarded 12410 similar events)
// Phase 1: matrix 17275 rows 8665 cols
[2021-05-20 04:17:37] [INFO ] Computed 8 place invariants in 1062 ms
[2021-05-20 04:17:38] [INFO ] Dead Transitions using invariants and state equation in 2255 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8665/8665 places, 29685/29685 transitions.
Ending property specific reduction for VehicularWifi-COL-none-UpperBounds-05 in 107658 ms.
Starting property specific reduction for VehicularWifi-COL-none-UpperBounds-07
Normalized transition count is 17276 out of 29668 initially.
// Phase 1: matrix 17276 rows 8697 cols
[2021-05-20 04:17:40] [INFO ] Computed 8 place invariants in 1283 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 399 ms. (steps per millisecond=25 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 1) seen :8
[2021-05-20 04:17:40] [INFO ] Flow matrix only has 17276 transitions (discarded 12392 similar events)
// Phase 1: matrix 17276 rows 8697 cols
[2021-05-20 04:17:42] [INFO ] Computed 8 place invariants in 1223 ms
[2021-05-20 04:17:43] [INFO ] [Real]Absence check using 6 positive place invariants in 262 ms returned sat
[2021-05-20 04:17:43] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 12 ms returned sat
[2021-05-20 04:17:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 04:17:47] [INFO ] [Real]Absence check using state equation in 3588 ms returned unknown
Current structural bounds on expressions (after SMT) : [344] Max seen :[8]
Support contains 32 out of 8697 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8697/8697 places, 29668/29668 transitions.
Free-agglomeration rule (complex) applied 24 times.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 8697 transition count 29672
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 48 place count 8673 transition count 29672
Partial Free-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 1 with 14 rules applied. Total rules applied 62 place count 8673 transition count 29672
Applied a total of 62 rules in 4884 ms. Remains 8673 /8697 variables (removed 24) and now considering 29672/29668 (removed -4) transitions.
[2021-05-20 04:17:51] [INFO ] Flow matrix only has 17280 transitions (discarded 12392 similar events)
// Phase 1: matrix 17280 rows 8673 cols
[2021-05-20 04:17:53] [INFO ] Computed 8 place invariants in 1068 ms
[2021-05-20 04:17:54] [INFO ] Dead Transitions using invariants and state equation in 2103 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8673/8697 places, 29672/29668 transitions.
Normalized transition count is 17280 out of 29672 initially.
// Phase 1: matrix 17280 rows 8673 cols
[2021-05-20 04:17:55] [INFO ] Computed 8 place invariants in 1182 ms
Interrupted random walk after 835352 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=27 ) properties seen :{0=5}
Interrupted Best-First random walk after 688451 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=137 ) properties seen :{0=8}
[2021-05-20 04:18:30] [INFO ] Flow matrix only has 17280 transitions (discarded 12392 similar events)
// Phase 1: matrix 17280 rows 8673 cols
[2021-05-20 04:18:31] [INFO ] Computed 8 place invariants in 885 ms
[2021-05-20 04:18:32] [INFO ] [Real]Absence check using 6 positive place invariants in 258 ms returned sat
[2021-05-20 04:18:32] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 114 ms returned sat
[2021-05-20 04:18:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 04:18:48] [INFO ] [Real]Absence check using state equation in 16089 ms returned sat
[2021-05-20 04:18:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-20 04:18:50] [INFO ] [Nat]Absence check using 6 positive place invariants in 251 ms returned sat
[2021-05-20 04:18:50] [INFO ] [Nat]Absence check using 6 positive and 2 generalized place invariants in 112 ms returned sat
[2021-05-20 04:18:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-20 04:19:07] [INFO ] [Nat]Absence check using state equation in 16977 ms returned sat
[2021-05-20 04:19:07] [INFO ] State equation strengthened by 8460 read => feed constraints.
[2021-05-20 04:19:10] [INFO ] [Nat]Added 8460 Read/Feed constraints in 2410 ms returned sat
[2021-05-20 04:19:23] [INFO ] Deduced a trap composed of 18 places in 12176 ms of which 4 ms to minimize.
[2021-05-20 04:19:35] [INFO ] Deduced a trap composed of 25 places in 11641 ms of which 4 ms to minimize.
[2021-05-20 04:19:35] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [136] Max seen :[8]
Support contains 32 out of 8673 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8673/8673 places, 29672/29672 transitions.
Applied a total of 0 rules in 1555 ms. Remains 8673 /8673 variables (removed 0) and now considering 29672/29672 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 8673/8673 places, 29672/29672 transitions.
Starting structural reductions, iteration 0 : 8673/8673 places, 29672/29672 transitions.
Applied a total of 0 rules in 1549 ms. Remains 8673 /8673 variables (removed 0) and now considering 29672/29672 (removed 0) transitions.
[2021-05-20 04:19:39] [INFO ] Flow matrix only has 17280 transitions (discarded 12392 similar events)
// Phase 1: matrix 17280 rows 8673 cols
[2021-05-20 04:19:39] [INFO ] Computed 8 place invariants in 879 ms
[2021-05-20 04:19:41] [INFO ] Implicit Places using invariants in 1918 ms returned []
Implicit Place search using SMT only with invariants took 1919 ms to find 0 implicit places.
[2021-05-20 04:19:41] [INFO ] Flow matrix only has 17280 transitions (discarded 12392 similar events)
// Phase 1: matrix 17280 rows 8673 cols
[2021-05-20 04:19:42] [INFO ] Computed 8 place invariants in 1044 ms
[2021-05-20 04:19:43] [INFO ] Dead Transitions using invariants and state equation in 2100 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8673/8673 places, 29672/29672 transitions.
Ending property specific reduction for VehicularWifi-COL-none-UpperBounds-07 in 124144 ms.
Starting property specific reduction for VehicularWifi-COL-none-UpperBounds-12
Normalized transition count is 17276 out of 29668 initially.
// Phase 1: matrix 17276 rows 8697 cols
[2021-05-20 04:19:44] [INFO ] Computed 8 place invariants in 1248 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 577 ms. (steps per millisecond=17 ) properties (out of 1) seen :126
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 1) seen :17
[2021-05-20 04:19:45] [INFO ] Flow matrix only has 17276 transitions (discarded 12392 similar events)
// Phase 1: matrix 17276 rows 8697 cols
[2021-05-20 04:19:46] [INFO ] Computed 8 place invariants in 1076 ms
[2021-05-20 04:19:47] [INFO ] [Real]Absence check using 6 positive place invariants in 259 ms returned sat
[2021-05-20 04:19:47] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 3 ms returned sat
[2021-05-20 04:19:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 04:19:51] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[126]
Support contains 32 out of 8697 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8697/8697 places, 29668/29668 transitions.
Free-agglomeration rule applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 8697 transition count 29660
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 16 place count 8689 transition count 29660
Partial Free-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 1 with 14 rules applied. Total rules applied 30 place count 8689 transition count 29660
Applied a total of 30 rules in 4871 ms. Remains 8689 /8697 variables (removed 8) and now considering 29660/29668 (removed 8) transitions.
[2021-05-20 04:19:56] [INFO ] Flow matrix only has 17264 transitions (discarded 12396 similar events)
// Phase 1: matrix 17264 rows 8689 cols
[2021-05-20 04:19:57] [INFO ] Computed 8 place invariants in 1080 ms
[2021-05-20 04:19:58] [INFO ] Dead Transitions using invariants and state equation in 2149 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8689/8697 places, 29660/29668 transitions.
Normalized transition count is 17264 out of 29660 initially.
// Phase 1: matrix 17264 rows 8689 cols
[2021-05-20 04:19:59] [INFO ] Computed 8 place invariants in 1074 ms
Interrupted random walk after 855176 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=28 ) properties seen :{0=10010}
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4370 ms. (steps per millisecond=228 ) properties (out of 1) seen :983
[2021-05-20 04:20:33] [INFO ] Flow matrix only has 17264 transitions (discarded 12396 similar events)
// Phase 1: matrix 17264 rows 8689 cols
[2021-05-20 04:20:34] [INFO ] Computed 8 place invariants in 994 ms
[2021-05-20 04:20:36] [INFO ] [Real]Absence check using 6 positive place invariants in 238 ms returned sat
[2021-05-20 04:20:36] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 96 ms returned sat
[2021-05-20 04:20:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 04:20:52] [INFO ] [Real]Absence check using state equation in 16034 ms returned sat
[2021-05-20 04:20:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-20 04:20:54] [INFO ] [Nat]Absence check using 6 positive place invariants in 237 ms returned sat
[2021-05-20 04:20:54] [INFO ] [Nat]Absence check using 6 positive and 2 generalized place invariants in 95 ms returned sat
[2021-05-20 04:20:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-20 04:21:12] [INFO ] [Nat]Absence check using state equation in 17795 ms returned sat
[2021-05-20 04:21:12] [INFO ] State equation strengthened by 8428 read => feed constraints.
[2021-05-20 04:21:16] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-20 04:21:19] [INFO ] [Nat]Added 8428 Read/Feed constraints in 7074 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[10010]
Support contains 32 out of 8689 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8689/8689 places, 29660/29660 transitions.
Applied a total of 0 rules in 1827 ms. Remains 8689 /8689 variables (removed 0) and now considering 29660/29660 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 8689/8689 places, 29660/29660 transitions.
Starting structural reductions, iteration 0 : 8689/8689 places, 29660/29660 transitions.
Applied a total of 0 rules in 1609 ms. Remains 8689 /8689 variables (removed 0) and now considering 29660/29660 (removed 0) transitions.
[2021-05-20 04:21:22] [INFO ] Flow matrix only has 17264 transitions (discarded 12396 similar events)
// Phase 1: matrix 17264 rows 8689 cols
[2021-05-20 04:21:24] [INFO ] Computed 8 place invariants in 1065 ms
[2021-05-20 04:21:25] [INFO ] Implicit Places using invariants in 2061 ms returned []
Implicit Place search using SMT only with invariants took 2062 ms to find 0 implicit places.
[2021-05-20 04:21:25] [INFO ] Flow matrix only has 17264 transitions (discarded 12396 similar events)
// Phase 1: matrix 17264 rows 8689 cols
[2021-05-20 04:21:26] [INFO ] Computed 8 place invariants in 1076 ms
[2021-05-20 04:21:27] [INFO ] Dead Transitions using invariants and state equation in 2079 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8689/8689 places, 29660/29660 transitions.
Normalized transition count is 17264 out of 29660 initially.
// Phase 1: matrix 17264 rows 8689 cols
[2021-05-20 04:21:28] [INFO ] Computed 8 place invariants in 896 ms
Interrupted random walk after 833034 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=27 ) properties seen :{0=10029}
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4918 ms. (steps per millisecond=203 ) properties (out of 1) seen :984
[2021-05-20 04:22:02] [INFO ] Flow matrix only has 17264 transitions (discarded 12396 similar events)
// Phase 1: matrix 17264 rows 8689 cols
[2021-05-20 04:22:03] [INFO ] Computed 8 place invariants in 913 ms
[2021-05-20 04:22:05] [INFO ] [Real]Absence check using 6 positive place invariants in 234 ms returned sat
[2021-05-20 04:22:05] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 97 ms returned sat
[2021-05-20 04:22:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 04:22:21] [INFO ] [Real]Absence check using state equation in 15902 ms returned sat
[2021-05-20 04:22:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-20 04:22:23] [INFO ] [Nat]Absence check using 6 positive place invariants in 242 ms returned sat
[2021-05-20 04:22:23] [INFO ] [Nat]Absence check using 6 positive and 2 generalized place invariants in 96 ms returned sat
[2021-05-20 04:22:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-20 04:22:40] [INFO ] [Nat]Absence check using state equation in 17467 ms returned sat
[2021-05-20 04:22:40] [INFO ] State equation strengthened by 8428 read => feed constraints.
[2021-05-20 04:22:44] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-20 04:22:47] [INFO ] [Nat]Added 8428 Read/Feed constraints in 6920 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[10029]
Support contains 32 out of 8689 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8689/8689 places, 29660/29660 transitions.
Applied a total of 0 rules in 1907 ms. Remains 8689 /8689 variables (removed 0) and now considering 29660/29660 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 8689/8689 places, 29660/29660 transitions.
Starting structural reductions, iteration 0 : 8689/8689 places, 29660/29660 transitions.
Applied a total of 0 rules in 1652 ms. Remains 8689 /8689 variables (removed 0) and now considering 29660/29660 (removed 0) transitions.
[2021-05-20 04:22:51] [INFO ] Flow matrix only has 17264 transitions (discarded 12396 similar events)
// Phase 1: matrix 17264 rows 8689 cols
[2021-05-20 04:22:52] [INFO ] Computed 8 place invariants in 994 ms
[2021-05-20 04:22:53] [INFO ] Implicit Places using invariants in 2025 ms returned []
Implicit Place search using SMT only with invariants took 2026 ms to find 0 implicit places.
[2021-05-20 04:22:53] [INFO ] Flow matrix only has 17264 transitions (discarded 12396 similar events)
// Phase 1: matrix 17264 rows 8689 cols
[2021-05-20 04:22:54] [INFO ] Computed 8 place invariants in 1080 ms
[2021-05-20 04:22:55] [INFO ] Dead Transitions using invariants and state equation in 2158 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8689/8689 places, 29660/29660 transitions.
Normalized transition count is 17264 out of 29660 initially.
// Phase 1: matrix 17264 rows 8689 cols
[2021-05-20 04:22:56] [INFO ] Computed 8 place invariants in 1188 ms
Interrupted random walk after 854762 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=28 ) properties seen :{0=10076}
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4325 ms. (steps per millisecond=231 ) properties (out of 1) seen :977
[2021-05-20 04:23:31] [INFO ] Flow matrix only has 17264 transitions (discarded 12396 similar events)
// Phase 1: matrix 17264 rows 8689 cols
[2021-05-20 04:23:32] [INFO ] Computed 8 place invariants in 1082 ms
[2021-05-20 04:23:33] [INFO ] [Real]Absence check using 6 positive place invariants in 239 ms returned sat
[2021-05-20 04:23:33] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 98 ms returned sat
[2021-05-20 04:23:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 04:23:49] [INFO ] [Real]Absence check using state equation in 15977 ms returned sat
[2021-05-20 04:23:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-20 04:23:51] [INFO ] [Nat]Absence check using 6 positive place invariants in 235 ms returned sat
[2021-05-20 04:23:51] [INFO ] [Nat]Absence check using 6 positive and 2 generalized place invariants in 96 ms returned sat
[2021-05-20 04:23:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-20 04:24:11] [INFO ] [Nat]Absence check using state equation in 19324 ms returned sat
[2021-05-20 04:24:11] [INFO ] State equation strengthened by 8428 read => feed constraints.
[2021-05-20 04:24:15] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-20 04:24:18] [INFO ] [Nat]Added 8428 Read/Feed constraints in 7176 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[10076]
Support contains 32 out of 8689 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8689/8689 places, 29660/29660 transitions.
Applied a total of 0 rules in 1730 ms. Remains 8689 /8689 variables (removed 0) and now considering 29660/29660 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 8689/8689 places, 29660/29660 transitions.
Starting structural reductions, iteration 0 : 8689/8689 places, 29660/29660 transitions.
Applied a total of 0 rules in 1697 ms. Remains 8689 /8689 variables (removed 0) and now considering 29660/29660 (removed 0) transitions.
[2021-05-20 04:24:21] [INFO ] Flow matrix only has 17264 transitions (discarded 12396 similar events)
// Phase 1: matrix 17264 rows 8689 cols
[2021-05-20 04:24:23] [INFO ] Computed 8 place invariants in 1251 ms
[2021-05-20 04:24:24] [INFO ] Implicit Places using invariants in 2393 ms returned []
Implicit Place search using SMT only with invariants took 2394 ms to find 0 implicit places.
[2021-05-20 04:24:24] [INFO ] Flow matrix only has 17264 transitions (discarded 12396 similar events)
// Phase 1: matrix 17264 rows 8689 cols
[2021-05-20 04:24:25] [INFO ] Computed 8 place invariants in 1091 ms
[2021-05-20 04:24:26] [INFO ] Dead Transitions using invariants and state equation in 2268 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8689/8689 places, 29660/29660 transitions.
Normalized transition count is 17264 out of 29660 initially.
// Phase 1: matrix 17264 rows 8689 cols
[2021-05-20 04:24:27] [INFO ] Computed 8 place invariants in 972 ms
Interrupted random walk after 830591 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=27 ) properties seen :{0=9972}
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4530 ms. (steps per millisecond=220 ) properties (out of 1) seen :990
[2021-05-20 04:25:02] [INFO ] Flow matrix only has 17264 transitions (discarded 12396 similar events)
// Phase 1: matrix 17264 rows 8689 cols
[2021-05-20 04:25:03] [INFO ] Computed 8 place invariants in 1097 ms
[2021-05-20 04:25:04] [INFO ] [Real]Absence check using 6 positive place invariants in 243 ms returned sat
[2021-05-20 04:25:04] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 101 ms returned sat
[2021-05-20 04:25:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 04:25:22] [INFO ] [Real]Absence check using state equation in 17482 ms returned sat
[2021-05-20 04:25:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-20 04:25:24] [INFO ] [Nat]Absence check using 6 positive place invariants in 247 ms returned sat
[2021-05-20 04:25:24] [INFO ] [Nat]Absence check using 6 positive and 2 generalized place invariants in 146 ms returned sat
[2021-05-20 04:25:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-20 04:25:46] [INFO ] [Nat]Absence check using state equation in 21394 ms returned sat
[2021-05-20 04:25:46] [INFO ] State equation strengthened by 8428 read => feed constraints.
[2021-05-20 04:25:50] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-20 04:25:53] [INFO ] [Nat]Added 8428 Read/Feed constraints in 7240 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[10076]
Support contains 32 out of 8689 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8689/8689 places, 29660/29660 transitions.
Applied a total of 0 rules in 1659 ms. Remains 8689 /8689 variables (removed 0) and now considering 29660/29660 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 8689/8689 places, 29660/29660 transitions.
Starting structural reductions, iteration 0 : 8689/8689 places, 29660/29660 transitions.
Applied a total of 0 rules in 1655 ms. Remains 8689 /8689 variables (removed 0) and now considering 29660/29660 (removed 0) transitions.
[2021-05-20 04:25:56] [INFO ] Flow matrix only has 17264 transitions (discarded 12396 similar events)
// Phase 1: matrix 17264 rows 8689 cols
[2021-05-20 04:25:58] [INFO ] Computed 8 place invariants in 1293 ms
[2021-05-20 04:25:59] [INFO ] Implicit Places using invariants in 2506 ms returned []
Implicit Place search using SMT only with invariants took 2507 ms to find 0 implicit places.
[2021-05-20 04:25:59] [INFO ] Flow matrix only has 17264 transitions (discarded 12396 similar events)
// Phase 1: matrix 17264 rows 8689 cols
[2021-05-20 04:26:00] [INFO ] Computed 8 place invariants in 1095 ms
[2021-05-20 04:26:01] [INFO ] Dead Transitions using invariants and state equation in 2369 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8689/8689 places, 29660/29660 transitions.
Ending property specific reduction for VehicularWifi-COL-none-UpperBounds-12 in 378604 ms.
[2021-05-20 04:26:03] [INFO ] Flatten gal took : 1494 ms
[2021-05-20 04:26:04] [INFO ] Applying decomposition
[2021-05-20 04:26:06] [INFO ] Flatten gal took : 1116 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph6975354654714584539.txt, -o, /tmp/graph6975354654714584539.bin, -w, /tmp/graph6975354654714584539.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph6975354654714584539.bin, -l, -1, -v, -w, /tmp/graph6975354654714584539.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-20 04:26:08] [INFO ] Decomposing Gal with order
[2021-05-20 04:26:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-20 04:26:20] [INFO ] Removed a total of 6751 redundant transitions.
[2021-05-20 04:26:21] [INFO ] Flatten gal took : 11702 ms
[2021-05-20 04:26:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 9879 labels/synchronizations in 1124 ms.
[2021-05-20 04:26:24] [INFO ] Time to serialize gal into /tmp/UpperBounds3583761846483079265.gal : 287 ms
[2021-05-20 04:26:24] [INFO ] Time to serialize properties into /tmp/UpperBounds15473012737207705002.prop : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds3583761846483079265.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds15473012737207705002.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds3583761846483079265.gal -t CGAL -reachable-file /tmp/UpperBounds15473012737207705002.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds15473012737207705002.prop.

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="VehicularWifi-COL-none"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is VehicularWifi-COL-none, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r273-smll-162123879800219"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/VehicularWifi-COL-none.tgz
mv VehicularWifi-COL-none execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;