Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r168-tall-165277016500332.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-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 Philosophers-PT-000500, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277016500332
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.5M
-rw-r--r-- 1 mcc users 331K Apr 29 12:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.8M Apr 29 12:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 278K Apr 29 11:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.7M Apr 29 11:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 238K May 9 08:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 895K May 9 08:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 195K May 9 08:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 884K May 9 08:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 46K May 9 08:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 130K May 9 08:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 1.1M May 10 09:34 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652826494750

Running Version 202205111006
[2022-05-17 22:28:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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]
[2022-05-17 22:28:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 22:28:16] [INFO ] Load time of PNML (sax parser for PT used): 214 ms
[2022-05-17 22:28:16] [INFO ] Transformed 2500 places.
[2022-05-17 22:28:16] [INFO ] Transformed 2500 transitions.
[2022-05-17 22:28:16] [INFO ] Parsed PT model containing 2500 places and 2500 transitions in 324 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 51 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Philosophers-PT-000500-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000500-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000500-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 2003 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 82 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:28:16] [INFO ] Computed 1000 place invariants in 35 ms
[2022-05-17 22:28:17] [INFO ] Implicit Places using invariants in 877 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:28:17] [INFO ] Computed 1000 place invariants in 24 ms
[2022-05-17 22:28:19] [INFO ] Implicit Places using invariants and state equation in 1793 ms returned []
Implicit Place search using SMT with State Equation took 2695 ms to find 0 implicit places.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:28:19] [INFO ] Computed 1000 place invariants in 13 ms
[2022-05-17 22:28:20] [INFO ] Dead Transitions using invariants and state equation in 1388 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2500/2500 transitions.
Support contains 2003 out of 2500 places after structural reductions.
[2022-05-17 22:28:21] [INFO ] Flatten gal took : 236 ms
[2022-05-17 22:28:21] [INFO ] Flatten gal took : 181 ms
[2022-05-17 22:28:22] [INFO ] Input system was already deterministic with 2500 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 854 ms. (steps per millisecond=11 ) properties (out of 22) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 958 ms. (steps per millisecond=10 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 945 ms. (steps per millisecond=10 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1781 ms. (steps per millisecond=5 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:28:26] [INFO ] Computed 1000 place invariants in 18 ms
[2022-05-17 22:28:29] [INFO ] [Real]Absence check using 1000 positive place invariants in 181 ms returned sat
[2022-05-17 22:28:29] [INFO ] After 841ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-17 22:28:30] [INFO ] [Nat]Absence check using 1000 positive place invariants in 189 ms returned sat
[2022-05-17 22:28:33] [INFO ] After 2748ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-17 22:28:34] [INFO ] After 3899ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 906 ms.
[2022-05-17 22:28:35] [INFO ] After 5875ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 500 steps, including 0 resets, run visited all 3 properties in 53 ms. (steps per millisecond=9 )
Parikh walk visited 3 properties in 55 ms.
FORMULA Philosophers-PT-000500-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Philosophers-PT-000500-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(((p0 U p1)&&F(G(p0)))) U G(p0)))'
Support contains 1500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 86 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:28:36] [INFO ] Computed 1000 place invariants in 12 ms
[2022-05-17 22:28:36] [INFO ] Implicit Places using invariants in 695 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:28:37] [INFO ] Computed 1000 place invariants in 10 ms
[2022-05-17 22:28:38] [INFO ] Implicit Places using invariants and state equation in 1799 ms returned []
Implicit Place search using SMT with State Equation took 2495 ms to find 0 implicit places.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:28:38] [INFO ] Computed 1000 place invariants in 5 ms
[2022-05-17 22:28:40] [INFO ] Dead Transitions using invariants and state equation in 1454 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 401 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), true, (NOT p1), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000500-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(OR p0 p1), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(OR p0 p1), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 5}, { cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (AND (GEQ s988 1) (GEQ s1977 1)) (AND (GEQ s940 1) (GEQ s1792 1)) (AND (GEQ s662 1) (GEQ s1732 1)) (AND (GEQ s928 1) (GEQ s2030 1)) (AND (GEQ s557 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 3131 ms.
Stack based approach found an accepted trace after 37439 steps with 0 reset with depth 37440 and stack size 34273 in 1083 ms.
FORMULA Philosophers-PT-000500-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000500-LTLFireability-02 finished in 8735 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 202 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:28:45] [INFO ] Computed 1000 place invariants in 5 ms
[2022-05-17 22:28:46] [INFO ] Implicit Places using invariants in 1343 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:28:46] [INFO ] Computed 1000 place invariants in 7 ms
[2022-05-17 22:28:49] [INFO ] Implicit Places using invariants and state equation in 2972 ms returned []
Implicit Place search using SMT with State Equation took 4321 ms to find 0 implicit places.
[2022-05-17 22:28:49] [INFO ] Redundant transitions in 133 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:28:49] [INFO ] Computed 1000 place invariants in 8 ms
[2022-05-17 22:28:51] [INFO ] Dead Transitions using invariants and state equation in 1490 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-PT-000500-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LT s2211 1) (LT s2471 1) (LT s2276 1) (LT s2406 1) (LT s2341 1) (LT s2130 1) (LT s2065 1) (LT s2227 1) (LT s2162 1) (LT s1935 1) (LT s2487 1) (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 1868 ms.
Stack based approach found an accepted trace after 5192 steps with 0 reset with depth 5193 and stack size 5193 in 194 ms.
FORMULA Philosophers-PT-000500-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000500-LTLFireability-03 finished in 8275 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X((!G(p0) U p0)))||G(p0)))'
Support contains 500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 73 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:28:53] [INFO ] Computed 1000 place invariants in 15 ms
[2022-05-17 22:28:54] [INFO ] Implicit Places using invariants in 1472 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:28:54] [INFO ] Computed 1000 place invariants in 6 ms
[2022-05-17 22:28:57] [INFO ] Implicit Places using invariants and state equation in 2983 ms returned []
Implicit Place search using SMT with State Equation took 4460 ms to find 0 implicit places.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:28:57] [INFO ] Computed 1000 place invariants in 6 ms
[2022-05-17 22:28:59] [INFO ] Dead Transitions using invariants and state equation in 1464 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000500-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s2211 1) (GEQ s2471 1) (GEQ s2276 1) (GEQ s2406 1) (GEQ s2341 1) (GEQ s2130 1) (GEQ s2065 1) (GEQ s2227 1) (GEQ s2162 1) (GEQ s1935 1) (GEQ s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration timeout after 56240 steps with 1402 reset in 10001 ms.
Product exploration timeout after 56380 steps with 1395 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 102 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Finished random walk after 96 steps, including 0 resets, run visited all 1 properties in 18 ms. (steps per millisecond=5 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 112 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:29:34] [INFO ] Computed 1000 place invariants in 6 ms
[2022-05-17 22:29:40] [INFO ] [Real]Absence check using 1000 positive place invariants in 2068 ms returned sat
[2022-05-17 22:29:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:29:49] [INFO ] [Real]Absence check using state equation in 8240 ms returned unknown
Could not prove EG (NOT p0)
Support contains 500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 75 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:29:49] [INFO ] Computed 1000 place invariants in 11 ms
[2022-05-17 22:29:50] [INFO ] Implicit Places using invariants in 1367 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:29:50] [INFO ] Computed 1000 place invariants in 5 ms
[2022-05-17 22:29:53] [INFO ] Implicit Places using invariants and state equation in 2949 ms returned []
Implicit Place search using SMT with State Equation took 4317 ms to find 0 implicit places.
[2022-05-17 22:29:53] [INFO ] Redundant transitions in 54 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:29:53] [INFO ] Computed 1000 place invariants in 14 ms
[2022-05-17 22:29:55] [INFO ] Dead Transitions using invariants and state equation in 1484 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2500/2500 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 105 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 50 steps, including 0 resets, run visited all 1 properties in 13 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 132 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:30:09] [INFO ] Computed 1000 place invariants in 8 ms
[2022-05-17 22:30:16] [INFO ] [Real]Absence check using 1000 positive place invariants in 2059 ms returned sat
[2022-05-17 22:30:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:30:24] [INFO ] [Real]Absence check using state equation in 8311 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration timeout after 57600 steps with 1431 reset in 10001 ms.
Product exploration timeout after 56510 steps with 1362 reset in 10001 ms.
Built C files in :
/tmp/ltsmin14412017444837288994
[2022-05-17 22:30:44] [INFO ] Too many transitions (2500) to apply POR reductions. Disabling POR matrices.
[2022-05-17 22:30:44] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14412017444837288994
Running compilation step : cd /tmp/ltsmin14412017444837288994;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14412017444837288994;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14412017444837288994;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 72 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:30:47] [INFO ] Computed 1000 place invariants in 8 ms
[2022-05-17 22:30:49] [INFO ] Implicit Places using invariants in 1372 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:30:49] [INFO ] Computed 1000 place invariants in 6 ms
[2022-05-17 22:30:52] [INFO ] Implicit Places using invariants and state equation in 3016 ms returned []
Implicit Place search using SMT with State Equation took 4393 ms to find 0 implicit places.
[2022-05-17 22:30:52] [INFO ] Redundant transitions in 72 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:30:52] [INFO ] Computed 1000 place invariants in 9 ms
[2022-05-17 22:30:53] [INFO ] Dead Transitions using invariants and state equation in 1439 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2500/2500 transitions.
Built C files in :
/tmp/ltsmin16926319045151007050
[2022-05-17 22:30:53] [INFO ] Too many transitions (2500) to apply POR reductions. Disabling POR matrices.
[2022-05-17 22:30:53] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16926319045151007050
Running compilation step : cd /tmp/ltsmin16926319045151007050;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16926319045151007050;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16926319045151007050;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-17 22:30:57] [INFO ] Flatten gal took : 99 ms
[2022-05-17 22:30:57] [INFO ] Flatten gal took : 92 ms
[2022-05-17 22:30:57] [INFO ] Time to serialize gal into /tmp/LTL10991794990546346378.gal : 25 ms
[2022-05-17 22:30:57] [INFO ] Time to serialize properties into /tmp/LTL13101934478983931442.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10991794990546346378.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13101934478983931442.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1099179...268
Read 1 LTL properties
Checking formula 0 : !(((F(X((!(G("((((((((((Eat_99>=1)||(Eat_405>=1))||((Eat_158>=1)||(Eat_336>=1)))||(((Eat_463>=1)||(Eat_246>=1))||((Eat_187>=1)||(Eat_8...23722
Formula 0 simplified : !(G"((((((((((Eat_99>=1)||(Eat_405>=1))||((Eat_158>=1)||(Eat_336>=1)))||(((Eat_463>=1)||(Eat_246>=1))||((Eat_187>=1)||(Eat_82>=1))))...23709
Detected timeout of ITS tools.
[2022-05-17 22:31:12] [INFO ] Flatten gal took : 90 ms
[2022-05-17 22:31:12] [INFO ] Applying decomposition
[2022-05-17 22:31:12] [INFO ] Flatten gal took : 93 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph16457820352766991397.txt' '-o' '/tmp/graph16457820352766991397.bin' '-w' '/tmp/graph16457820352766991397.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16457820352766991397.bin' '-l' '-1' '-v' '-w' '/tmp/graph16457820352766991397.weights' '-q' '0' '-e' '0.001'
[2022-05-17 22:31:12] [INFO ] Decomposing Gal with order
[2022-05-17 22:31:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 22:31:13] [INFO ] Removed a total of 489 redundant transitions.
[2022-05-17 22:31:13] [INFO ] Flatten gal took : 225 ms
[2022-05-17 22:31:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 1678 labels/synchronizations in 56 ms.
[2022-05-17 22:31:14] [INFO ] Time to serialize gal into /tmp/LTL15774666610147301235.gal : 23 ms
[2022-05-17 22:31:14] [INFO ] Time to serialize properties into /tmp/LTL16776390220529446010.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15774666610147301235.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16776390220529446010.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1577466...247
Read 1 LTL properties
Checking formula 0 : !(((F(X((!(G("((((((((((i36.i0.i1.u109.Eat_99>=1)||(i20.i0.i2.u225.Eat_405>=1))||((i10.i0.i1.u266.Eat_158>=1)||(i18.i0.i1.u201.Eat_336...45427
Formula 0 simplified : !(G"((((((((((i36.i0.i1.u109.Eat_99>=1)||(i20.i0.i2.u225.Eat_405>=1))||((i10.i0.i1.u266.Eat_158>=1)||(i18.i0.i1.u201.Eat_336>=1)))||...45414
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13132694832758039057
[2022-05-17 22:31:29] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13132694832758039057
Running compilation step : cd /tmp/ltsmin13132694832758039057;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13132694832758039057;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13132694832758039057;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property Philosophers-PT-000500-LTLFireability-04 finished in 159437 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(p0))))'
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 45 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:31:32] [INFO ] Computed 1000 place invariants in 9 ms
[2022-05-17 22:31:33] [INFO ] Implicit Places using invariants in 853 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:31:33] [INFO ] Computed 1000 place invariants in 7 ms
[2022-05-17 22:31:35] [INFO ] Implicit Places using invariants and state equation in 2047 ms returned []
Implicit Place search using SMT with State Equation took 2904 ms to find 0 implicit places.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:31:35] [INFO ] Computed 1000 place invariants in 12 ms
[2022-05-17 22:31:37] [INFO ] Dead Transitions using invariants and state equation in 1453 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000500-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (AND (GEQ s399 1) (GEQ s842 1)) (AND (GEQ s242 1) (GEQ s706 1)) (AND (GEQ s137 1) (GEQ s600 1)) (AND (GEQ s298 1) (GEQ s792 1)) (AND (GEQ s421 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 10004 steps with 0 reset in 315 ms.
FORMULA Philosophers-PT-000500-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000500-LTLFireability-06 finished in 4871 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(!(p0 U G(p1)) U X((G(!p3)&&p2))))'
Support contains 8 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 69 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:31:37] [INFO ] Computed 1000 place invariants in 4 ms
[2022-05-17 22:31:38] [INFO ] Implicit Places using invariants in 1410 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:31:38] [INFO ] Computed 1000 place invariants in 5 ms
[2022-05-17 22:31:42] [INFO ] Implicit Places using invariants and state equation in 3020 ms returned []
Implicit Place search using SMT with State Equation took 4432 ms to find 0 implicit places.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:31:42] [INFO ] Computed 1000 place invariants in 6 ms
[2022-05-17 22:31:43] [INFO ] Dead Transitions using invariants and state equation in 1620 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 408 ms :[(AND p2 (NOT p3)), (AND (NOT p3) p2), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (NOT p3), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p3) (NOT p1) p2), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p1))]
Running random walk in product with property : Philosophers-PT-000500-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 6}], [{ cond=(NOT p3), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) p2 (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(AND p0 p2 (NOT p3)), acceptance={} source=5 dest: 7}, { cond=(AND p1 (NOT p0) p2 (NOT p3)), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=6 dest: 4}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=7 dest: 4}, { cond=(AND p1 p0 (NOT p3)), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={0} source=7 dest: 7}, { cond=(AND p1 (NOT p0) (NOT p3)), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=8 dest: 4}, { cond=(AND p1 (NOT p3)), acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(AND (GEQ s488 1) (GEQ s1458 1)), p0:(AND (GEQ s522 1) (GEQ s1654 1)), p2:(AND (GEQ s261 1) (GEQ s821 1)), p3:(AND (GEQ s677 1) (GEQ s1075 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 17 reset in 2558 ms.
Stack based approach found an accepted trace after 4552 steps with 2 reset with depth 3015 and stack size 3015 in 269 ms.
FORMULA Philosophers-PT-000500-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000500-LTLFireability-08 finished in 9390 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p1)||p0))))'
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 64 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:31:46] [INFO ] Computed 1000 place invariants in 9 ms
[2022-05-17 22:31:48] [INFO ] Implicit Places using invariants in 1466 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:31:48] [INFO ] Computed 1000 place invariants in 9 ms
[2022-05-17 22:31:51] [INFO ] Implicit Places using invariants and state equation in 2857 ms returned []
Implicit Place search using SMT with State Equation took 4325 ms to find 0 implicit places.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:31:51] [INFO ] Computed 1000 place invariants in 10 ms
[2022-05-17 22:31:52] [INFO ] Dead Transitions using invariants and state equation in 1493 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 158 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-PT-000500-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(OR (LT s399 1) (LT s841 1)), p0:(OR (LT s997 1) (LT s1422 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 26 steps with 8 reset in 4 ms.
FORMULA Philosophers-PT-000500-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000500-LTLFireability-09 finished in 6072 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(X(p0)))))'
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 63 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:31:53] [INFO ] Computed 1000 place invariants in 14 ms
[2022-05-17 22:31:54] [INFO ] Implicit Places using invariants in 1395 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:31:54] [INFO ] Computed 1000 place invariants in 4 ms
[2022-05-17 22:31:57] [INFO ] Implicit Places using invariants and state equation in 2974 ms returned []
Implicit Place search using SMT with State Equation took 4369 ms to find 0 implicit places.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:31:57] [INFO ] Computed 1000 place invariants in 8 ms
[2022-05-17 22:31:58] [INFO ] Dead Transitions using invariants and state equation in 1425 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000500-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (LT s104 1) (LT s576 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 80120 steps with 352 reset in 10001 ms.
Product exploration timeout after 77870 steps with 342 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 91 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 300 steps, including 0 resets, run visited all 1 properties in 41 ms. (steps per millisecond=7 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 91 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:32:33] [INFO ] Computed 1000 place invariants in 9 ms
[2022-05-17 22:32:42] [INFO ] [Real]Absence check using 1000 positive place invariants in 6040 ms returned unknown
Could not prove EG (NOT p0)
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 65 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:32:42] [INFO ] Computed 1000 place invariants in 10 ms
[2022-05-17 22:32:44] [INFO ] Implicit Places using invariants in 1388 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:32:44] [INFO ] Computed 1000 place invariants in 5 ms
[2022-05-17 22:32:46] [INFO ] Implicit Places using invariants and state equation in 2794 ms returned []
Implicit Place search using SMT with State Equation took 4184 ms to find 0 implicit places.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:32:46] [INFO ] Computed 1000 place invariants in 5 ms
[2022-05-17 22:32:48] [INFO ] Dead Transitions using invariants and state equation in 1542 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2500/2500 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 78 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 81 steps, including 0 resets, run visited all 1 properties in 17 ms. (steps per millisecond=4 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 116 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:33:03] [INFO ] Computed 1000 place invariants in 6 ms
[2022-05-17 22:33:12] [INFO ] [Real]Absence check using 1000 positive place invariants in 6078 ms returned sat
[2022-05-17 22:33:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:33:18] [INFO ] [Real]Absence check using state equation in 6011 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration timeout after 81110 steps with 353 reset in 10001 ms.
Product exploration timeout after 78630 steps with 339 reset in 10001 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Performed 498 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 498 places in 0 ms
Iterating global reduction 0 with 498 rules applied. Total rules applied 498 place count 2500 transition count 2500
Deduced a syphon composed of 498 places in 1 ms
Applied a total of 498 rules in 661 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2022-05-17 22:33:39] [INFO ] Redundant transitions in 64 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:33:39] [INFO ] Computed 1000 place invariants in 9 ms
[2022-05-17 22:33:40] [INFO ] Dead Transitions using invariants and state equation in 1378 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2500/2500 places, 2500/2500 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2500/2500 transitions.
Product exploration timeout after 75800 steps with 322 reset in 10001 ms.
Stack based approach found an accepted trace after 673 steps with 2 reset with depth 46 and stack size 44 in 96 ms.
FORMULA Philosophers-PT-000500-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000500-LTLFireability-10 finished in 117831 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&(F(p1)||G(p2)))))'
Support contains 7 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Performed 493 Post agglomeration using F-continuation condition.Transition count delta: 493
Deduced a syphon composed of 493 places in 0 ms
Reduce places removed 493 places and 0 transitions.
Iterating global reduction 0 with 986 rules applied. Total rules applied 986 place count 2007 transition count 2007
Applied a total of 986 rules in 198 ms. Remains 2007 /2500 variables (removed 493) and now considering 2007/2500 (removed 493) transitions.
// Phase 1: matrix 2007 rows 2007 cols
[2022-05-17 22:33:50] [INFO ] Computed 1000 place invariants in 3 ms
[2022-05-17 22:33:52] [INFO ] Implicit Places using invariants in 1241 ms returned []
// Phase 1: matrix 2007 rows 2007 cols
[2022-05-17 22:33:52] [INFO ] Computed 1000 place invariants in 3 ms
[2022-05-17 22:33:54] [INFO ] Implicit Places using invariants and state equation in 2750 ms returned []
Implicit Place search using SMT with State Equation took 3997 ms to find 0 implicit places.
[2022-05-17 22:33:55] [INFO ] Redundant transitions in 47 ms returned []
// Phase 1: matrix 2007 rows 2007 cols
[2022-05-17 22:33:55] [INFO ] Computed 1000 place invariants in 5 ms
[2022-05-17 22:33:56] [INFO ] Dead Transitions using invariants and state equation in 1058 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2007/2500 places, 2007/2500 transitions.
Finished structural reductions, in 1 iterations. Remains : 2007/2500 places, 2007/2500 transitions.
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1)]
Running random walk in product with property : Philosophers-PT-000500-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s197 1) (GEQ s660 1)), p1:(OR (LT s157 1) (LT s688 1) (LT s894 1) (LT s1955 1)), p2:(GEQ s2006 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 61 reset in 6899 ms.
Stack based approach found an accepted trace after 357 steps with 0 reset with depth 358 and stack size 358 in 52 ms.
FORMULA Philosophers-PT-000500-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000500-LTLFireability-12 finished in 12391 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 60 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:34:03] [INFO ] Computed 1000 place invariants in 10 ms
[2022-05-17 22:34:04] [INFO ] Implicit Places using invariants in 1340 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:34:04] [INFO ] Computed 1000 place invariants in 4 ms
[2022-05-17 22:34:07] [INFO ] Implicit Places using invariants and state equation in 2884 ms returned []
Implicit Place search using SMT with State Equation took 4225 ms to find 0 implicit places.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:34:07] [INFO ] Computed 1000 place invariants in 4 ms
[2022-05-17 22:34:09] [INFO ] Dead Transitions using invariants and state equation in 1541 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000500-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s305 1) (GEQ s812 1) (OR (LT s407 1) (LT s833 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 74 reset in 4595 ms.
Stack based approach found an accepted trace after 6198 steps with 6 reset with depth 2779 and stack size 2779 in 364 ms.
FORMULA Philosophers-PT-000500-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000500-LTLFireability-13 finished in 10898 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(((G(p0) U p0)||G(p1))))||F(p2))))'
Support contains 6 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Performed 494 Post agglomeration using F-continuation condition.Transition count delta: 494
Deduced a syphon composed of 494 places in 0 ms
Reduce places removed 494 places and 0 transitions.
Iterating global reduction 0 with 988 rules applied. Total rules applied 988 place count 2006 transition count 2006
Applied a total of 988 rules in 178 ms. Remains 2006 /2500 variables (removed 494) and now considering 2006/2500 (removed 494) transitions.
// Phase 1: matrix 2006 rows 2006 cols
[2022-05-17 22:34:14] [INFO ] Computed 1000 place invariants in 4 ms
[2022-05-17 22:34:15] [INFO ] Implicit Places using invariants in 1239 ms returned []
// Phase 1: matrix 2006 rows 2006 cols
[2022-05-17 22:34:15] [INFO ] Computed 1000 place invariants in 3 ms
[2022-05-17 22:34:18] [INFO ] Implicit Places using invariants and state equation in 2597 ms returned []
Implicit Place search using SMT with State Equation took 3838 ms to find 0 implicit places.
[2022-05-17 22:34:18] [INFO ] Redundant transitions in 51 ms returned []
// Phase 1: matrix 2006 rows 2006 cols
[2022-05-17 22:34:18] [INFO ] Computed 1000 place invariants in 4 ms
[2022-05-17 22:34:19] [INFO ] Dead Transitions using invariants and state equation in 1122 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2006/2500 places, 2006/2500 transitions.
Finished structural reductions, in 1 iterations. Remains : 2006/2500 places, 2006/2500 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : Philosophers-PT-000500-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s308 1) (GEQ s810 1)), p2:(AND (GEQ s270 1) (GEQ s729 1)), p1:(AND (GEQ s627 1) (GEQ s1573 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 32 reset in 4546 ms.
Stack based approach found an accepted trace after 1270 steps with 1 reset with depth 898 and stack size 897 in 143 ms.
FORMULA Philosophers-PT-000500-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000500-LTLFireability-14 finished in 9982 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((G((X(F(p0))&&X(p1)))||F(X(p2)))))))'
Support contains 6 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 59 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:34:24] [INFO ] Computed 1000 place invariants in 10 ms
[2022-05-17 22:34:25] [INFO ] Implicit Places using invariants in 1404 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:34:25] [INFO ] Computed 1000 place invariants in 4 ms
[2022-05-17 22:34:28] [INFO ] Implicit Places using invariants and state equation in 3014 ms returned []
Implicit Place search using SMT with State Equation took 4421 ms to find 0 implicit places.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:34:28] [INFO ] Computed 1000 place invariants in 6 ms
[2022-05-17 22:34:30] [INFO ] Dead Transitions using invariants and state equation in 1478 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 217 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : Philosophers-PT-000500-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(OR (LT s669 1) (LT s1213 1)), p2:(OR (LT s305 1) (LT s812 1)), p0:(OR (LT s614 1) (LT s1626 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 1277 ms.
Product exploration explored 100000 steps with 0 reset in 1582 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 106 ms. Reduced automaton from 6 states, 8 edges and 3 AP to 6 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 268 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (AND (NOT p2) (NOT p0))]
Finished random walk after 338 steps, including 0 resets, run visited all 4 properties in 49 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND p1 (NOT p2) p0), true]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p0))), (F (AND (NOT p1) (NOT p2))), (F p2), (F (AND p1 (NOT p2) (NOT p0)))]
Knowledge based reduction with 2 factoid took 192 ms. Reduced automaton from 6 states, 8 edges and 3 AP to 6 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 212 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 222 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (AND (NOT p2) (NOT p0))]
Support contains 6 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 62 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:34:47] [INFO ] Computed 1000 place invariants in 8 ms
[2022-05-17 22:34:48] [INFO ] Implicit Places using invariants in 1421 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:34:48] [INFO ] Computed 1000 place invariants in 8 ms
[2022-05-17 22:34:51] [INFO ] Implicit Places using invariants and state equation in 3014 ms returned []
Implicit Place search using SMT with State Equation took 4437 ms to find 0 implicit places.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:34:51] [INFO ] Computed 1000 place invariants in 8 ms
[2022-05-17 22:34:53] [INFO ] Dead Transitions using invariants and state equation in 1461 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2500/2500 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 108 ms. Reduced automaton from 6 states, 8 edges and 3 AP to 6 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 222 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (AND (NOT p2) (NOT p0))]
Finished random walk after 2244 steps, including 0 resets, run visited all 4 properties in 138 ms. (steps per millisecond=16 )
Knowledge obtained : [(AND p1 (NOT p2) p0), true]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p0))), (F (AND (NOT p1) (NOT p2))), (F p2), (F (AND p1 (NOT p2) (NOT p0)))]
Knowledge based reduction with 2 factoid took 156 ms. Reduced automaton from 6 states, 8 edges and 3 AP to 6 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 202 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 202 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 211 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 1284 ms.
Product exploration explored 100000 steps with 9 reset in 2330 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 241 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (AND (NOT p2) (NOT p0))]
Support contains 6 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Performed 494 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 494 places in 1 ms
Iterating global reduction 0 with 494 rules applied. Total rules applied 494 place count 2500 transition count 2500
Deduced a syphon composed of 494 places in 1 ms
Applied a total of 494 rules in 209 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2022-05-17 22:35:12] [INFO ] Redundant transitions in 66 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:35:12] [INFO ] Computed 1000 place invariants in 7 ms
[2022-05-17 22:35:13] [INFO ] Dead Transitions using invariants and state equation in 1487 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2500/2500 places, 2500/2500 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2500/2500 transitions.
Product exploration explored 100000 steps with 4 reset in 2167 ms.
Stack based approach found an accepted trace after 89340 steps with 3 reset with depth 54076 and stack size 3936 in 2182 ms.
FORMULA Philosophers-PT-000500-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000500-LTLFireability-15 finished in 53974 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X((!G(p0) U p0)))||G(p0)))'
Found a CL insensitive property : Philosophers-PT-000500-LTLFireability-04
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Support contains 500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 67 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:35:18] [INFO ] Computed 1000 place invariants in 11 ms
[2022-05-17 22:35:19] [INFO ] Implicit Places using invariants in 1479 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:35:19] [INFO ] Computed 1000 place invariants in 5 ms
[2022-05-17 22:35:22] [INFO ] Implicit Places using invariants and state equation in 2968 ms returned []
Implicit Place search using SMT with State Equation took 4448 ms to find 0 implicit places.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:35:22] [INFO ] Computed 1000 place invariants in 6 ms
[2022-05-17 22:35:24] [INFO ] Dead Transitions using invariants and state equation in 1529 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2500/2500 transitions.
Running random walk in product with property : Philosophers-PT-000500-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s2211 1) (GEQ s2471 1) (GEQ s2276 1) (GEQ s2406 1) (GEQ s2341 1) (GEQ s2130 1) (GEQ s2065 1) (GEQ s2227 1) (GEQ s2162 1) (GEQ s1935 1) (GEQ s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration timeout after 58360 steps with 1429 reset in 10001 ms.
Product exploration timeout after 56840 steps with 1401 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 92 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Finished random walk after 24 steps, including 0 resets, run visited all 1 properties in 10 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 107 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:35:58] [INFO ] Computed 1000 place invariants in 9 ms
[2022-05-17 22:36:05] [INFO ] [Real]Absence check using 1000 positive place invariants in 2229 ms returned sat
[2022-05-17 22:36:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:36:13] [INFO ] [Real]Absence check using state equation in 7930 ms returned unknown
Could not prove EG (NOT p0)
Support contains 500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 64 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:36:13] [INFO ] Computed 1000 place invariants in 11 ms
[2022-05-17 22:36:14] [INFO ] Implicit Places using invariants in 1423 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:36:14] [INFO ] Computed 1000 place invariants in 4 ms
[2022-05-17 22:36:17] [INFO ] Implicit Places using invariants and state equation in 2846 ms returned []
Implicit Place search using SMT with State Equation took 4270 ms to find 0 implicit places.
[2022-05-17 22:36:17] [INFO ] Redundant transitions in 67 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:36:17] [INFO ] Computed 1000 place invariants in 4 ms
[2022-05-17 22:36:19] [INFO ] Dead Transitions using invariants and state equation in 1429 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2500/2500 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 212 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Finished random walk after 28 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 123 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:36:33] [INFO ] Computed 1000 place invariants in 7 ms
[2022-05-17 22:36:40] [INFO ] [Real]Absence check using 1000 positive place invariants in 2153 ms returned sat
[2022-05-17 22:36:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:36:48] [INFO ] [Real]Absence check using state equation in 8099 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration timeout after 57620 steps with 1447 reset in 10003 ms.
Product exploration timeout after 56360 steps with 1357 reset in 10002 ms.
Built C files in :
/tmp/ltsmin3310945067277759948
[2022-05-17 22:37:08] [INFO ] Too many transitions (2500) to apply POR reductions. Disabling POR matrices.
[2022-05-17 22:37:08] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3310945067277759948
Running compilation step : cd /tmp/ltsmin3310945067277759948;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3310945067277759948;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3310945067277759948;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 84 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:37:11] [INFO ] Computed 1000 place invariants in 8 ms
[2022-05-17 22:37:12] [INFO ] Implicit Places using invariants in 1406 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:37:12] [INFO ] Computed 1000 place invariants in 4 ms
[2022-05-17 22:37:15] [INFO ] Implicit Places using invariants and state equation in 2885 ms returned []
Implicit Place search using SMT with State Equation took 4293 ms to find 0 implicit places.
[2022-05-17 22:37:15] [INFO ] Redundant transitions in 51 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:37:15] [INFO ] Computed 1000 place invariants in 6 ms
[2022-05-17 22:37:17] [INFO ] Dead Transitions using invariants and state equation in 1484 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2500/2500 transitions.
Built C files in :
/tmp/ltsmin12022291839336841181
[2022-05-17 22:37:17] [INFO ] Too many transitions (2500) to apply POR reductions. Disabling POR matrices.
[2022-05-17 22:37:17] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12022291839336841181
Running compilation step : cd /tmp/ltsmin12022291839336841181;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12022291839336841181;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12022291839336841181;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-17 22:37:20] [INFO ] Flatten gal took : 94 ms
[2022-05-17 22:37:20] [INFO ] Flatten gal took : 98 ms
[2022-05-17 22:37:20] [INFO ] Time to serialize gal into /tmp/LTL15877100980206203318.gal : 12 ms
[2022-05-17 22:37:20] [INFO ] Time to serialize properties into /tmp/LTL14299529811957784827.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15877100980206203318.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14299529811957784827.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1587710...268
Read 1 LTL properties
Checking formula 0 : !(((F(X((!(G("((((((((((Eat_99>=1)||(Eat_405>=1))||((Eat_158>=1)||(Eat_336>=1)))||(((Eat_463>=1)||(Eat_246>=1))||((Eat_187>=1)||(Eat_8...23722
Formula 0 simplified : !(G"((((((((((Eat_99>=1)||(Eat_405>=1))||((Eat_158>=1)||(Eat_336>=1)))||(((Eat_463>=1)||(Eat_246>=1))||((Eat_187>=1)||(Eat_82>=1))))...23709
Detected timeout of ITS tools.
[2022-05-17 22:37:35] [INFO ] Flatten gal took : 79 ms
[2022-05-17 22:37:35] [INFO ] Applying decomposition
[2022-05-17 22:37:35] [INFO ] Flatten gal took : 79 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph11059275126601986695.txt' '-o' '/tmp/graph11059275126601986695.bin' '-w' '/tmp/graph11059275126601986695.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11059275126601986695.bin' '-l' '-1' '-v' '-w' '/tmp/graph11059275126601986695.weights' '-q' '0' '-e' '0.001'
[2022-05-17 22:37:36] [INFO ] Decomposing Gal with order
[2022-05-17 22:37:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 22:37:36] [INFO ] Removed a total of 495 redundant transitions.
[2022-05-17 22:37:36] [INFO ] Flatten gal took : 136 ms
[2022-05-17 22:37:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 1100 labels/synchronizations in 21 ms.
[2022-05-17 22:37:36] [INFO ] Time to serialize gal into /tmp/LTL17606977786096729013.gal : 14 ms
[2022-05-17 22:37:36] [INFO ] Time to serialize properties into /tmp/LTL4489765082046251623.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17606977786096729013.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4489765082046251623.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1760697...246
Read 1 LTL properties
Checking formula 0 : !(((F(X((!(G("((((((((((i12.u375.Eat_99>=1)||(i29.u218.Eat_405>=1))||((i43.u403.Eat_158>=1)||(i45.u190.Eat_336>=1)))||(((i32.u268.Eat_...36880
Formula 0 simplified : !(G"((((((((((i12.u375.Eat_99>=1)||(i29.u218.Eat_405>=1))||((i43.u403.Eat_158>=1)||(i45.u190.Eat_336>=1)))||(((i32.u268.Eat_463>=1)|...36867
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10190220369745639698
[2022-05-17 22:37:51] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10190220369745639698
Running compilation step : cd /tmp/ltsmin10190220369745639698;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10190220369745639698;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10190220369745639698;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property Philosophers-PT-000500-LTLFireability-04 finished in 156600 ms.
[2022-05-17 22:37:54] [INFO ] Flatten gal took : 75 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10024216544687841253
[2022-05-17 22:37:54] [INFO ] Too many transitions (2500) to apply POR reductions. Disabling POR matrices.
[2022-05-17 22:37:54] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10024216544687841253
Running compilation step : cd /tmp/ltsmin10024216544687841253;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-17 22:37:54] [INFO ] Applying decomposition
[2022-05-17 22:37:54] [INFO ] Flatten gal took : 80 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph3711092753868607950.txt' '-o' '/tmp/graph3711092753868607950.bin' '-w' '/tmp/graph3711092753868607950.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3711092753868607950.bin' '-l' '-1' '-v' '-w' '/tmp/graph3711092753868607950.weights' '-q' '0' '-e' '0.001'
[2022-05-17 22:37:55] [INFO ] Decomposing Gal with order
[2022-05-17 22:37:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 22:37:55] [INFO ] Removed a total of 497 redundant transitions.
[2022-05-17 22:37:55] [INFO ] Flatten gal took : 137 ms
[2022-05-17 22:37:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 1714 labels/synchronizations in 28 ms.
[2022-05-17 22:37:56] [INFO ] Time to serialize gal into /tmp/LTLFireability13331649951931483453.gal : 17 ms
[2022-05-17 22:37:56] [INFO ] Time to serialize properties into /tmp/LTLFireability15133313189231441018.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13331649951931483453.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15133313189231441018.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...269
Read 1 LTL properties
Checking formula 0 : !(((F(X((!(G("((((((((((i0.i1.i0.u9.Eat_99>=1)||(i21.i0.i0.u247.Eat_405>=1))||((i12.i1.i1.u151.Eat_158>=1)||(i39.i1.i0.u454.Eat_336>=1...45385
Formula 0 simplified : !(G"((((((((((i0.i1.i0.u9.Eat_99>=1)||(i21.i0.i0.u247.Eat_405>=1))||((i12.i1.i1.u151.Eat_158>=1)||(i39.i1.i0.u454.Eat_336>=1)))||(((...45372
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
Compilation finished in 5695 ms.
Running link step : cd /tmp/ltsmin10024216544687841253;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin10024216544687841253;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>(X(() U (LTLAPp0==true))))||[]((LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-17 23:01:09] [INFO ] Flatten gal took : 220 ms
[2022-05-17 23:01:09] [INFO ] Time to serialize gal into /tmp/LTLFireability2184330680830651162.gal : 7 ms
[2022-05-17 23:01:09] [INFO ] Time to serialize properties into /tmp/LTLFireability4759044438788396846.ltl : 10 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2184330680830651162.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4759044438788396846.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...288
Read 1 LTL properties
Checking formula 0 : !(((F(X((!(G("((((((((((Eat_99>=1)||(Eat_405>=1))||((Eat_158>=1)||(Eat_336>=1)))||(((Eat_463>=1)||(Eat_246>=1))||((Eat_187>=1)||(Eat_8...23722
Formula 0 simplified : !(G"((((((((((Eat_99>=1)||(Eat_405>=1))||((Eat_158>=1)||(Eat_336>=1)))||(((Eat_463>=1)||(Eat_246>=1))||((Eat_187>=1)||(Eat_82>=1))))...23709
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
49549 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,495.765,3118672,1,0,860,1.72007e+07,14,850,38001,2.41809e+07,2137
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Philosophers-PT-000500-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 3122155 ms.

BK_STOP 1652829618053

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -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=@none -Xss128m -Xms40m -Xmx8192m

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="Philosophers-PT-000500"
export BK_EXAMINATION="LTLFireability"
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 Philosophers-PT-000500, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r168-tall-165277016500332"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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