Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 28M
-rw-r--r-- 1 mcc users 710K Feb 25 14:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 3.6M Feb 25 14:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 646K Feb 25 13:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 4.1M Feb 25 13:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 681K Feb 25 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 2.5M Feb 25 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 307K Feb 25 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.5M Feb 25 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 359K Feb 25 15:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.7M Feb 25 15:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.3M Feb 25 14:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 8.2M Feb 25 14:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 95K Feb 25 16:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 261K Feb 25 16:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 2.3M Mar 5 18:23 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-001000-LTLFireability-00
FORMULA_NAME Philosophers-PT-001000-LTLFireability-01
FORMULA_NAME Philosophers-PT-001000-LTLFireability-02
FORMULA_NAME Philosophers-PT-001000-LTLFireability-03
FORMULA_NAME Philosophers-PT-001000-LTLFireability-04
FORMULA_NAME Philosophers-PT-001000-LTLFireability-05
FORMULA_NAME Philosophers-PT-001000-LTLFireability-06
FORMULA_NAME Philosophers-PT-001000-LTLFireability-07
FORMULA_NAME Philosophers-PT-001000-LTLFireability-08
FORMULA_NAME Philosophers-PT-001000-LTLFireability-09
FORMULA_NAME Philosophers-PT-001000-LTLFireability-10
FORMULA_NAME Philosophers-PT-001000-LTLFireability-11
FORMULA_NAME Philosophers-PT-001000-LTLFireability-12
FORMULA_NAME Philosophers-PT-001000-LTLFireability-13
FORMULA_NAME Philosophers-PT-001000-LTLFireability-14
FORMULA_NAME Philosophers-PT-001000-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678811479285

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-PT-001000
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-14 16:31:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-14 16:31:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 16:31:21] [INFO ] Load time of PNML (sax parser for PT used): 341 ms
[2023-03-14 16:31:21] [INFO ] Transformed 5000 places.
[2023-03-14 16:31:21] [INFO ] Transformed 5000 transitions.
[2023-03-14 16:31:21] [INFO ] Parsed PT model containing 5000 places and 5000 transitions and 16000 arcs in 434 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 67 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA Philosophers-PT-001000-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-001000-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-001000-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-001000-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-001000-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 5000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 41 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
// Phase 1: matrix 5000 rows 5000 cols
[2023-03-14 16:31:21] [INFO ] Computed 2000 place invariants in 49 ms
[2023-03-14 16:31:22] [INFO ] Implicit Places using invariants in 676 ms returned []
[2023-03-14 16:31:22] [INFO ] Invariant cache hit.
[2023-03-14 16:31:22] [INFO ] Implicit Places using invariants and state equation in 481 ms returned []
Implicit Place search using SMT with State Equation took 1185 ms to find 0 implicit places.
[2023-03-14 16:31:22] [INFO ] Invariant cache hit.
[2023-03-14 16:31:26] [INFO ] Dead Transitions using invariants and state equation in 3114 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4344 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Support contains 5000 out of 5000 places after structural reductions.
[2023-03-14 16:31:26] [INFO ] Flatten gal took : 355 ms
[2023-03-14 16:31:27] [INFO ] Flatten gal took : 283 ms
[2023-03-14 16:31:28] [INFO ] Input system was already deterministic with 5000 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1604 ms. (steps per millisecond=6 ) properties (out of 23) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2145 ms. (steps per millisecond=4 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3417 ms. (steps per millisecond=2 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2149 ms. (steps per millisecond=4 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2503 ms. (steps per millisecond=3 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 302 ms. (steps per millisecond=33 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 305 ms. (steps per millisecond=32 ) properties (out of 5) seen :1
Running SMT prover for 4 properties.
[2023-03-14 16:31:41] [INFO ] Invariant cache hit.
[2023-03-14 16:31:48] [INFO ] [Real]Absence check using 2000 positive place invariants in 526 ms returned sat
[2023-03-14 16:31:48] [INFO ] After 2296ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-14 16:31:50] [INFO ] [Nat]Absence check using 2000 positive place invariants in 464 ms returned sat
[2023-03-14 16:32:03] [INFO ] After 11695ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-14 16:32:10] [INFO ] After 18302ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 3443 ms.
[2023-03-14 16:32:13] [INFO ] After 25047ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 4 Parikh solutions to 1 different solutions.
Finished Parikh walk after 980 steps, including 0 resets, run visited all 4 properties in 198 ms. (steps per millisecond=4 )
Parikh walk visited 4 properties in 206 ms.
FORMULA Philosophers-PT-001000-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA Philosophers-PT-001000-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X((F(p1)&&X(G(!p2))))))'
Support contains 4000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 108 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 16:32:14] [INFO ] Invariant cache hit.
[2023-03-14 16:32:15] [INFO ] Implicit Places using invariants in 1132 ms returned []
[2023-03-14 16:32:15] [INFO ] Invariant cache hit.
[2023-03-14 16:32:17] [INFO ] Implicit Places using invariants and state equation in 1127 ms returned []
Implicit Place search using SMT with State Equation took 2263 ms to find 0 implicit places.
[2023-03-14 16:32:17] [INFO ] Invariant cache hit.
[2023-03-14 16:32:20] [INFO ] Dead Transitions using invariants and state equation in 3252 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5628 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 426 ms :[(OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2), (NOT p1), p2, true, p2, p2]
Running random walk in product with property : Philosophers-PT-001000-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 6}, { cond=p0, acceptance={} source=2 dest: 7}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}, { cond=p2, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) p2), acceptance={} source=6 dest: 3}, { cond=true, acceptance={} source=6 dest: 4}], [{ cond=(AND (NOT p1) p2), acceptance={} source=7 dest: 3}, { cond=(NOT p0), acceptance={} source=7 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=7 dest: 7}, { cond=(AND p0 p2), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(OR (GEQ s4356 1) (GEQ s4486 1) (GEQ s4876 1) (GEQ s4616 1) (GEQ s4145 1) (GEQ s4275 1) (GEQ s4746 1) (GEQ s3885 1) (GEQ s4957 1) (GEQ s4437 1) (GEQ s4...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 5 ms.
FORMULA Philosophers-PT-001000-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-001000-LTLFireability-01 finished in 6206 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((!p0&&G(F(p1))) U p2)))'
Support contains 5000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 84 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 16:32:20] [INFO ] Invariant cache hit.
[2023-03-14 16:32:21] [INFO ] Implicit Places using invariants in 469 ms returned []
[2023-03-14 16:32:21] [INFO ] Invariant cache hit.
[2023-03-14 16:32:21] [INFO ] Implicit Places using invariants and state equation in 527 ms returned []
Implicit Place search using SMT with State Equation took 998 ms to find 0 implicit places.
[2023-03-14 16:32:22] [INFO ] Redundant transitions in 440 ms returned []
[2023-03-14 16:32:22] [INFO ] Invariant cache hit.
[2023-03-14 16:32:25] [INFO ] Dead Transitions using invariants and state equation in 3315 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4852 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 192 ms :[(NOT p2), true, (NOT p1), (NOT p1), (NOT p2)]
Running random walk in product with property : Philosophers-PT-001000-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(OR p2 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(OR (AND (GEQ s169 1) (GEQ s1227 1)) (AND (GEQ s239 1) (GEQ s1184 1)) (AND (GEQ s59 1) (GEQ s1132 1)) (AND (GEQ s349 1) (GEQ s1279 1)) (AND (GEQ s354 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 6322 ms.
Product exploration explored 100000 steps with 0 reset in 6546 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 p2 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p0))), (X (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (OR p2 (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 257 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter insensitive) to 5 states, 13 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 174 ms :[(NOT p2), true, (NOT p1), (NOT p1), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1581 ms. (steps per millisecond=6 ) properties (out of 5) seen :1
Interrupted Best-First random walk after 8001 steps, including 1 resets, run timeout after 5027 ms. (steps per millisecond=1 ) properties seen 0
Interrupted Best-First random walk after 8001 steps, including 1 resets, run timeout after 5024 ms. (steps per millisecond=1 ) properties seen 0
Interrupted Best-First random walk after 6002 steps, including 1 resets, run timeout after 5134 ms. (steps per millisecond=1 ) properties seen 0
Interrupted Best-First random walk after 8001 steps, including 1 resets, run timeout after 5122 ms. (steps per millisecond=1 ) properties seen 0
Running SMT prover for 4 properties.
[2023-03-14 16:33:01] [INFO ] Invariant cache hit.
[2023-03-14 16:33:20] [INFO ] [Real]Absence check using 2000 positive place invariants in 506 ms returned sat
[2023-03-14 16:33:21] [INFO ] After 6544ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:2
[2023-03-14 16:33:24] [INFO ] [Nat]Absence check using 2000 positive place invariants in 497 ms returned sat
[2023-03-14 16:33:46] [INFO ] After 12592ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2023-03-14 16:33:46] [INFO ] After 12609ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-14 16:33:46] [INFO ] After 25066ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 77 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1442 ms. (steps per millisecond=6 ) properties (out of 2) seen :0
Interrupted Best-First random walk after 8001 steps, including 1 resets, run timeout after 5704 ms. (steps per millisecond=1 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5355 ms. (steps per millisecond=1 ) properties (out of 2) seen :0
Probabilistic random walk after 141639 steps, saw 141550 distinct states, run finished after 36214 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-14 16:34:35] [INFO ] Invariant cache hit.
[2023-03-14 16:34:44] [INFO ] [Real]Absence check using 2000 positive place invariants in 481 ms returned sat
[2023-03-14 16:34:45] [INFO ] After 3768ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 16:34:48] [INFO ] [Nat]Absence check using 2000 positive place invariants in 467 ms returned sat
[2023-03-14 16:35:10] [INFO ] After 13821ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 16:35:10] [INFO ] After 13833ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-14 16:35:10] [INFO ] After 25052ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 36 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 33 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 16:35:11] [INFO ] Invariant cache hit.
[2023-03-14 16:35:11] [INFO ] Implicit Places using invariants in 456 ms returned []
[2023-03-14 16:35:11] [INFO ] Invariant cache hit.
[2023-03-14 16:35:11] [INFO ] Implicit Places using invariants and state equation in 461 ms returned []
Implicit Place search using SMT with State Equation took 924 ms to find 0 implicit places.
[2023-03-14 16:35:12] [INFO ] Redundant transitions in 215 ms returned []
[2023-03-14 16:35:12] [INFO ] Invariant cache hit.
[2023-03-14 16:35:15] [INFO ] Dead Transitions using invariants and state equation in 2914 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4098 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p0))), (X (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (OR p2 (NOT p0))), (G (OR (NOT p0) p2)), (G (NOT (AND p0 (NOT p2))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 8 factoid took 365 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p2), (NOT p1), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 124 ms :[(NOT p2), (NOT p1), (NOT p1), (NOT p2)]
Support contains 5000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 45 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 16:35:15] [INFO ] Invariant cache hit.
[2023-03-14 16:35:16] [INFO ] Implicit Places using invariants in 493 ms returned []
[2023-03-14 16:35:16] [INFO ] Invariant cache hit.
[2023-03-14 16:35:16] [INFO ] Implicit Places using invariants and state equation in 452 ms returned []
Implicit Place search using SMT with State Equation took 946 ms to find 0 implicit places.
[2023-03-14 16:35:17] [INFO ] Redundant transitions in 315 ms returned []
[2023-03-14 16:35:17] [INFO ] Invariant cache hit.
[2023-03-14 16:35:20] [INFO ] Dead Transitions using invariants and state equation in 2923 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4242 ms. Remains : 5000/5000 places, 5000/5000 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 (NOT p1) p2), (X (NOT p1)), (X p2), (X (NOT (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 164 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 137 ms :[(NOT p2), (NOT p1), (NOT p1), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1359 ms. (steps per millisecond=7 ) properties (out of 3) seen :1
Interrupted Best-First random walk after 8001 steps, including 1 resets, run timeout after 5469 ms. (steps per millisecond=1 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4652 ms. (steps per millisecond=2 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-14 16:35:32] [INFO ] Invariant cache hit.
[2023-03-14 16:35:40] [INFO ] [Real]Absence check using 2000 positive place invariants in 493 ms returned sat
[2023-03-14 16:35:41] [INFO ] After 3771ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 16:35:43] [INFO ] [Nat]Absence check using 2000 positive place invariants in 491 ms returned sat
[2023-03-14 16:35:50] [INFO ] After 5272ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 16:35:52] [INFO ] After 7021ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1373 ms.
[2023-03-14 16:35:53] [INFO ] After 12151ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 970 steps, including 0 resets, run visited all 2 properties in 189 ms. (steps per millisecond=5 )
Parikh walk visited 2 properties in 192 ms.
Knowledge obtained : [(AND (NOT p1) p2), (X (NOT p1)), (X p2), (X (NOT (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F p1), (F (NOT p2))]
Knowledge based reduction with 4 factoid took 236 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 283 ms :[(NOT p2), (NOT p1), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 194 ms :[(NOT p2), (NOT p1), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 204 ms :[(NOT p2), (NOT p1), (NOT p1), (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 5562 ms.
Product exploration explored 100000 steps with 1 reset in 6569 ms.
Built C files in :
/tmp/ltsmin35579632181564718
[2023-03-14 16:36:06] [INFO ] Too many transitions (5000) to apply POR reductions. Disabling POR matrices.
[2023-03-14 16:36:07] [INFO ] Built C files in 91ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin35579632181564718
Running compilation step : cd /tmp/ltsmin35579632181564718;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin35579632181564718;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin35579632181564718;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 5000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 33 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 16:36:10] [INFO ] Invariant cache hit.
[2023-03-14 16:36:10] [INFO ] Implicit Places using invariants in 432 ms returned []
[2023-03-14 16:36:10] [INFO ] Invariant cache hit.
[2023-03-14 16:36:11] [INFO ] Implicit Places using invariants and state equation in 468 ms returned []
Implicit Place search using SMT with State Equation took 904 ms to find 0 implicit places.
[2023-03-14 16:36:11] [INFO ] Redundant transitions in 211 ms returned []
[2023-03-14 16:36:11] [INFO ] Invariant cache hit.
[2023-03-14 16:36:14] [INFO ] Dead Transitions using invariants and state equation in 3183 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4339 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Built C files in :
/tmp/ltsmin11296616949576126336
[2023-03-14 16:36:14] [INFO ] Too many transitions (5000) to apply POR reductions. Disabling POR matrices.
[2023-03-14 16:36:14] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11296616949576126336
Running compilation step : cd /tmp/ltsmin11296616949576126336;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin11296616949576126336;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin11296616949576126336;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-14 16:36:18] [INFO ] Flatten gal took : 157 ms
[2023-03-14 16:36:18] [INFO ] Flatten gal took : 152 ms
[2023-03-14 16:36:18] [INFO ] Time to serialize gal into /tmp/LTL13659750033053846591.gal : 41 ms
[2023-03-14 16:36:18] [INFO ] Time to serialize properties into /tmp/LTL17135077457804217188.prop : 30 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13659750033053846591.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13790853985191946949.hoa' '-atoms' '/tmp/LTL17135077457804217188.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL17135077457804217188.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13790853985191946949.hoa
Detected timeout of ITS tools.
[2023-03-14 16:36:33] [INFO ] Flatten gal took : 160 ms
[2023-03-14 16:36:34] [INFO ] Flatten gal took : 175 ms
[2023-03-14 16:36:34] [INFO ] Time to serialize gal into /tmp/LTL3012594743691238537.gal : 24 ms
[2023-03-14 16:36:34] [INFO ] Time to serialize properties into /tmp/LTL15375385848491842530.ltl : 31 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3012594743691238537.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15375385848491842530.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(((!("((((((((((((Fork_236>=1)&&(Catch2_237>=1))||((Fork_577>=1)&&(Catch2_578>=1)))||(((Fork_796>=1)&&(Catch2_797>=1))||((Fork_992...158080
Formula 0 simplified : F(("((((((((((((Fork_236>=1)&&(Catch2_237>=1))||((Fork_577>=1)&&(Catch2_578>=1)))||(((Fork_796>=1)&&(Catch2_797>=1))||((Fork_992>=1)...158069
Detected timeout of ITS tools.
[2023-03-14 16:36:49] [INFO ] Flatten gal took : 156 ms
[2023-03-14 16:36:49] [INFO ] Applying decomposition
[2023-03-14 16:36:49] [INFO ] Flatten gal took : 158 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph10491285888628078443.txt' '-o' '/tmp/graph10491285888628078443.bin' '-w' '/tmp/graph10491285888628078443.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph10491285888628078443.bin' '-l' '-1' '-v' '-w' '/tmp/graph10491285888628078443.weights' '-q' '0' '-e' '0.001'
[2023-03-14 16:36:50] [INFO ] Decomposing Gal with order
[2023-03-14 16:36:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-14 16:36:51] [INFO ] Removed a total of 998 redundant transitions.
[2023-03-14 16:36:51] [INFO ] Flatten gal took : 441 ms
[2023-03-14 16:36:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 2574 labels/synchronizations in 107 ms.
[2023-03-14 16:36:54] [INFO ] Time to serialize gal into /tmp/LTL18147119095208036491.gal : 69 ms
[2023-03-14 16:36:54] [INFO ] Time to serialize properties into /tmp/LTL17574159014951629422.ltl : 31 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18147119095208036491.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17574159014951629422.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(((!("((((((((((((i3.i0.i1.i0.u817.Fork_236>=1)&&(i3.i0.i1.i1.u221.Catch2_237>=1))||((i32.u398.Fork_577>=1)&&(i32.u397.Catch2_578>...263914
Formula 0 simplified : F(("((((((((((((i3.i0.i1.i0.u817.Fork_236>=1)&&(i3.i0.i1.i1.u221.Catch2_237>=1))||((i32.u398.Fork_577>=1)&&(i32.u397.Catch2_578>=1))...263903
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/ltsmin17993701447446288189
[2023-03-14 16:37:09] [INFO ] Built C files in 84ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17993701447446288189
Running compilation step : cd /tmp/ltsmin17993701447446288189;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin17993701447446288189;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin17993701447446288189;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property Philosophers-PT-001000-LTLFireability-03 finished in 291935 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(((!p1 U (p2||G(!p1)))||p0)))))))'
Support contains 3000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 165 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 16:37:12] [INFO ] Invariant cache hit.
[2023-03-14 16:37:14] [INFO ] Implicit Places using invariants in 1660 ms returned []
[2023-03-14 16:37:14] [INFO ] Invariant cache hit.
[2023-03-14 16:37:16] [INFO ] Implicit Places using invariants and state equation in 1611 ms returned []
Implicit Place search using SMT with State Equation took 3273 ms to find 0 implicit places.
[2023-03-14 16:37:16] [INFO ] Invariant cache hit.
[2023-03-14 16:37:19] [INFO ] Dead Transitions using invariants and state equation in 3183 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6640 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 1021 ms :[true, (AND p1 (NOT p2)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Running random walk in product with property : Philosophers-PT-001000-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=p2, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(OR p0 p2), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}]], initial=6, aps=[p2:(AND (NOT (OR (GEQ s4356 1) (GEQ s4486 1) (GEQ s4876 1) (GEQ s4616 1) (GEQ s4145 1) (GEQ s4275 1) (GEQ s4746 1) (GEQ s3885 1) (GEQ s4957 1) (GEQ s4437 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 30849 steps with 0 reset in 1862 ms.
FORMULA Philosophers-PT-001000-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-001000-LTLFireability-05 finished in 9568 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Performed 996 Post agglomeration using F-continuation condition.Transition count delta: 996
Deduced a syphon composed of 996 places in 1 ms
Reduce places removed 996 places and 0 transitions.
Iterating global reduction 0 with 1992 rules applied. Total rules applied 1992 place count 4004 transition count 4004
Applied a total of 1992 rules in 1357 ms. Remains 4004 /5000 variables (removed 996) and now considering 4004/5000 (removed 996) transitions.
// Phase 1: matrix 4004 rows 4004 cols
[2023-03-14 16:37:23] [INFO ] Computed 2000 place invariants in 11 ms
[2023-03-14 16:37:26] [INFO ] Implicit Places using invariants in 2566 ms returned []
[2023-03-14 16:37:26] [INFO ] Invariant cache hit.
[2023-03-14 16:37:29] [INFO ] Implicit Places using invariants and state equation in 3666 ms returned []
Implicit Place search using SMT with State Equation took 6240 ms to find 0 implicit places.
[2023-03-14 16:37:30] [INFO ] Redundant transitions in 145 ms returned []
[2023-03-14 16:37:30] [INFO ] Invariant cache hit.
[2023-03-14 16:37:32] [INFO ] Dead Transitions using invariants and state equation in 2197 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4004/5000 places, 4004/5000 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9950 ms. Remains : 4004/5000 places, 4004/5000 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-PT-001000-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s56 1) (GEQ s1107 1) (GEQ s1900 1) (GEQ s3599 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2 reset in 5972 ms.
Stack based approach found an accepted trace after 964 steps with 0 reset with depth 965 and stack size 965 in 260 ms.
FORMULA Philosophers-PT-001000-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-001000-LTLFireability-09 finished in 16244 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||(F(p1) U p2)))))'
Support contains 3 out of 5000 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 256 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
// Phase 1: matrix 5000 rows 5000 cols
[2023-03-14 16:37:38] [INFO ] Computed 2000 place invariants in 38 ms
[2023-03-14 16:37:41] [INFO ] Implicit Places using invariants in 2875 ms returned []
[2023-03-14 16:37:41] [INFO ] Invariant cache hit.
[2023-03-14 16:37:44] [INFO ] Implicit Places using invariants and state equation in 2635 ms returned []
Implicit Place search using SMT with State Equation took 5512 ms to find 0 implicit places.
[2023-03-14 16:37:44] [INFO ] Invariant cache hit.
[2023-03-14 16:37:47] [INFO ] Dead Transitions using invariants and state equation in 2954 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8723 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Philosophers-PT-001000-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s4790 1), p2:(AND (GEQ s682 1) (GEQ s1535 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][false, false]]
Product exploration timeout after 62950 steps with 10249 reset in 10001 ms.
Product exploration timeout after 68270 steps with 9251 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 : [(AND (NOT p0) p2)]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 1 factoid took 88 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p0) p2)]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 1 factoid took 113 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 5000 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 335 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 16:38:08] [INFO ] Invariant cache hit.
[2023-03-14 16:38:10] [INFO ] Implicit Places using invariants in 2698 ms returned []
[2023-03-14 16:38:10] [INFO ] Invariant cache hit.
[2023-03-14 16:38:13] [INFO ] Implicit Places using invariants and state equation in 2767 ms returned []
Implicit Place search using SMT with State Equation took 5465 ms to find 0 implicit places.
[2023-03-14 16:38:13] [INFO ] Invariant cache hit.
[2023-03-14 16:38:16] [INFO ] Dead Transitions using invariants and state equation in 3019 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8821 ms. Remains : 5000/5000 places, 5000/5000 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 (NOT p0) p2)]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 1 factoid took 80 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 747 steps, including 0 resets, run visited all 1 properties in 186 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p0) p2)]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 1 factoid took 98 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration timeout after 57790 steps with 15227 reset in 10003 ms.
Stack based approach found an accepted trace after 65193 steps with 5377 reset with depth 19953 and stack size 2908 in 7966 ms.
FORMULA Philosophers-PT-001000-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-001000-LTLFireability-10 finished in 56895 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||(p1&&X((F(p2)||G(p1)))))))'
Support contains 4 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 330 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 16:38:35] [INFO ] Invariant cache hit.
[2023-03-14 16:38:38] [INFO ] Implicit Places using invariants in 2823 ms returned []
[2023-03-14 16:38:38] [INFO ] Invariant cache hit.
[2023-03-14 16:38:41] [INFO ] Implicit Places using invariants and state equation in 2839 ms returned []
Implicit Place search using SMT with State Equation took 5675 ms to find 0 implicit places.
[2023-03-14 16:38:41] [INFO ] Invariant cache hit.
[2023-03-14 16:38:44] [INFO ] Dead Transitions using invariants and state equation in 3167 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9174 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 183 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : Philosophers-PT-001000-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(OR (LT s1293 1) (LT s2484 1)), p2:(LT s4531 1), p1:(LT s4708 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, null, null][false, false, false, false, false]]
Product exploration timeout after 53080 steps with 26536 reset in 10412 ms.
Product exploration timeout after 53070 steps with 26529 reset in 10744 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 p0 p2 p1), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 2 factoid took 122 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Finished random walk after 2721 steps, including 0 resets, run visited all 4 properties in 387 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (F (AND (NOT p2) (NOT p0) p1)), (F (AND (NOT p2) (NOT p0))), (F (AND (NOT p2) (NOT p0) (NOT p1))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 191 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Support contains 4 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 321 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 16:39:07] [INFO ] Invariant cache hit.
[2023-03-14 16:39:10] [INFO ] Implicit Places using invariants in 2624 ms returned []
[2023-03-14 16:39:10] [INFO ] Invariant cache hit.
[2023-03-14 16:39:12] [INFO ] Implicit Places using invariants and state equation in 2693 ms returned []
Implicit Place search using SMT with State Equation took 5326 ms to find 0 implicit places.
[2023-03-14 16:39:12] [INFO ] Invariant cache hit.
[2023-03-14 16:39:16] [INFO ] Dead Transitions using invariants and state equation in 3189 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8840 ms. Remains : 5000/5000 places, 5000/5000 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 p2 p0 p1)]
False Knowledge obtained : [(X (NOT p0)), (X p0)]
Knowledge based reduction with 1 factoid took 210 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1322 ms. (steps per millisecond=7 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 301 ms. (steps per millisecond=33 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 323 ms. (steps per millisecond=30 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 311 ms. (steps per millisecond=32 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-14 16:39:18] [INFO ] Invariant cache hit.
[2023-03-14 16:39:19] [INFO ] [Real]Absence check using 2000 positive place invariants in 474 ms returned sat
[2023-03-14 16:39:22] [INFO ] After 2888ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-14 16:39:23] [INFO ] After 3160ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:2
Attempting to minimize the solution found.
Minimization took 154 ms.
[2023-03-14 16:39:23] [INFO ] After 4524ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:2
[2023-03-14 16:39:24] [INFO ] [Nat]Absence check using 2000 positive place invariants in 504 ms returned sat
[2023-03-14 16:39:27] [INFO ] After 3294ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-14 16:39:28] [INFO ] After 4069ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 469 ms.
[2023-03-14 16:39:29] [INFO ] After 5876ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 738 steps, including 0 resets, run visited all 1 properties in 80 ms. (steps per millisecond=9 )
Parikh walk visited 3 properties in 249 ms.
Knowledge obtained : [(AND p2 p0 p1)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 155 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Product exploration timeout after 51330 steps with 25659 reset in 10002 ms.
Product exploration timeout after 54870 steps with 27429 reset in 11113 ms.
Applying partial POR strategy [true, false, false, true]
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 4 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Performed 996 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 996 places in 1 ms
Iterating global reduction 0 with 996 rules applied. Total rules applied 996 place count 5000 transition count 5000
Deduced a syphon composed of 996 places in 1 ms
Applied a total of 996 rules in 1226 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 16:39:52] [INFO ] Redundant transitions in 203 ms returned []
// Phase 1: matrix 5000 rows 5000 cols
[2023-03-14 16:39:52] [INFO ] Computed 2000 place invariants in 20 ms
[2023-03-14 16:39:55] [INFO ] Dead Transitions using invariants and state equation in 3037 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5000/5000 places, 5000/5000 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4481 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Built C files in :
/tmp/ltsmin7415905497792068979
[2023-03-14 16:39:56] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7415905497792068979
Running compilation step : cd /tmp/ltsmin7415905497792068979;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin7415905497792068979;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin7415905497792068979;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 281 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
// Phase 1: matrix 5000 rows 5000 cols
[2023-03-14 16:39:59] [INFO ] Computed 2000 place invariants in 18 ms
[2023-03-14 16:40:02] [INFO ] Implicit Places using invariants in 2924 ms returned []
[2023-03-14 16:40:02] [INFO ] Invariant cache hit.
[2023-03-14 16:40:05] [INFO ] Implicit Places using invariants and state equation in 2769 ms returned []
Implicit Place search using SMT with State Equation took 5700 ms to find 0 implicit places.
[2023-03-14 16:40:05] [INFO ] Invariant cache hit.
[2023-03-14 16:40:08] [INFO ] Dead Transitions using invariants and state equation in 3118 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9100 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Built C files in :
/tmp/ltsmin8972141259548196255
[2023-03-14 16:40:08] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8972141259548196255
Running compilation step : cd /tmp/ltsmin8972141259548196255;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin8972141259548196255;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin8972141259548196255;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-14 16:40:11] [INFO ] Flatten gal took : 141 ms
[2023-03-14 16:40:11] [INFO ] Flatten gal took : 118 ms
[2023-03-14 16:40:11] [INFO ] Time to serialize gal into /tmp/LTL18054914378705904329.gal : 24 ms
[2023-03-14 16:40:11] [INFO ] Time to serialize properties into /tmp/LTL4758205650843391841.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18054914378705904329.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17573539368562950251.hoa' '-atoms' '/tmp/LTL4758205650843391841.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL4758205650843391841.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17573539368562950251.hoa
Detected timeout of ITS tools.
[2023-03-14 16:40:26] [INFO ] Flatten gal took : 129 ms
[2023-03-14 16:40:27] [INFO ] Flatten gal took : 136 ms
[2023-03-14 16:40:27] [INFO ] Time to serialize gal into /tmp/LTL3331368342738001713.gal : 18 ms
[2023-03-14 16:40:27] [INFO ] Time to serialize properties into /tmp/LTL2632229072393503487.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3331368342738001713.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2632229072393503487.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X((F("((Fork_356<1)||(Catch1_356<1))"))||(("(Eat_981<1)")&&(X((F("(Eat_253<1)"))||(G("(Eat_981<1)"))))))))
Formula 0 simplified : X(G!"((Fork_356<1)||(Catch1_356<1))" & (!"(Eat_981<1)" | X(G!"(Eat_253<1)" & F!"(Eat_981<1)")))
Detected timeout of ITS tools.
[2023-03-14 16:40:42] [INFO ] Flatten gal took : 117 ms
[2023-03-14 16:40:42] [INFO ] Applying decomposition
[2023-03-14 16:40:42] [INFO ] Flatten gal took : 121 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph5230253967343422618.txt' '-o' '/tmp/graph5230253967343422618.bin' '-w' '/tmp/graph5230253967343422618.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph5230253967343422618.bin' '-l' '-1' '-v' '-w' '/tmp/graph5230253967343422618.weights' '-q' '0' '-e' '0.001'
[2023-03-14 16:40:42] [INFO ] Decomposing Gal with order
[2023-03-14 16:40:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-14 16:40:43] [INFO ] Removed a total of 987 redundant transitions.
[2023-03-14 16:40:43] [INFO ] Flatten gal took : 198 ms
[2023-03-14 16:40:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 2634 labels/synchronizations in 51 ms.
[2023-03-14 16:40:43] [INFO ] Time to serialize gal into /tmp/LTL4764456900010180182.gal : 36 ms
[2023-03-14 16:40:43] [INFO ] Time to serialize properties into /tmp/LTL12161184910002594056.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4764456900010180182.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12161184910002594056.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((F("((i49.u624.Fork_356<1)||(i49.u624.Catch1_356<1))"))||(("(i57.u867.Eat_981<1)")&&(X((F("(i54.u221.Eat_253<1)"))||(G("(i57.u867...175
Formula 0 simplified : X(G!"((i49.u624.Fork_356<1)||(i49.u624.Catch1_356<1))" & (!"(i57.u867.Eat_981<1)" | X(G!"(i54.u221.Eat_253<1)" & F!"(i57.u867.Eat_98...163
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
503 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,5.65337,80340,1,0,153481,583,11206,166532,360,1390,221430
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Philosophers-PT-001000-LTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property Philosophers-PT-001000-LTLFireability-11 finished in 134192 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(F(p0))||(!X(X(p1)) U p2))))'
Support contains 6 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 294 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 16:40:49] [INFO ] Invariant cache hit.
[2023-03-14 16:40:52] [INFO ] Implicit Places using invariants in 2780 ms returned []
[2023-03-14 16:40:52] [INFO ] Invariant cache hit.
[2023-03-14 16:40:55] [INFO ] Implicit Places using invariants and state equation in 2768 ms returned []
Implicit Place search using SMT with State Equation took 5564 ms to find 0 implicit places.
[2023-03-14 16:40:55] [INFO ] Invariant cache hit.
[2023-03-14 16:40:58] [INFO ] Dead Transitions using invariants and state equation in 3120 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8981 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 292 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-001000-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 5}, { cond=p1, acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(AND (GEQ s557 1) (GEQ s1446 1)), p0:(OR (LT s71 1) (LT s1146 1)), p1:(AND (GEQ s1541 1) (GEQ s3785 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, null][false, false, false, false, false, false, false]]
Product exploration timeout after 39540 steps with 78 reset in 10001 ms.
Product exploration timeout after 44760 steps with 77 reset in 10004 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 p2 (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0))))]
Knowledge based reduction with 1 factoid took 116 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 255 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (NOT p0), (NOT p0)]
Finished random walk after 711 steps, including 0 resets, run visited all 5 properties in 185 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (F p0), (F p1), (F (NOT p2)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 1 factoid took 247 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 283 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 255 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (NOT p0), (NOT p0)]
Support contains 6 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 237 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 16:41:20] [INFO ] Invariant cache hit.
[2023-03-14 16:41:23] [INFO ] Implicit Places using invariants in 2787 ms returned []
[2023-03-14 16:41:23] [INFO ] Invariant cache hit.
[2023-03-14 16:41:26] [INFO ] Implicit Places using invariants and state equation in 2815 ms returned []
Implicit Place search using SMT with State Equation took 5603 ms to find 0 implicit places.
[2023-03-14 16:41:26] [INFO ] Invariant cache hit.
[2023-03-14 16:41:29] [INFO ] Dead Transitions using invariants and state equation in 3138 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8978 ms. Remains : 5000/5000 places, 5000/5000 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 p2 (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 1 factoid took 126 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 274 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1244 ms. (steps per millisecond=8 ) properties (out of 5) seen :4
Finished Best-First random walk after 2001 steps, including 0 resets, run visited all 1 properties in 57 ms. (steps per millisecond=35 )
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (F p0), (F p1), (F (NOT p2)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 1 factoid took 208 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 273 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 286 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 250 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (NOT p0), (NOT p0)]
Product exploration timeout after 68050 steps with 67 reset in 10002 ms.
Product exploration timeout after 41290 steps with 75 reset in 10001 ms.
Applying partial POR strategy [false, false, true, false, true, true, true]
Stuttering acceptance computed with spot in 257 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (NOT p0), (NOT p0)]
Support contains 6 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Performed 994 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 994 places in 1 ms
Iterating global reduction 0 with 994 rules applied. Total rules applied 994 place count 5000 transition count 5000
Deduced a syphon composed of 994 places in 0 ms
Applied a total of 994 rules in 630 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 16:41:53] [INFO ] Redundant transitions in 225 ms returned []
// Phase 1: matrix 5000 rows 5000 cols
[2023-03-14 16:41:53] [INFO ] Computed 2000 place invariants in 14 ms
[2023-03-14 16:41:56] [INFO ] Dead Transitions using invariants and state equation in 3212 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5000/5000 places, 5000/5000 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4074 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Built C files in :
/tmp/ltsmin3792462982740646547
[2023-03-14 16:41:56] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3792462982740646547
Running compilation step : cd /tmp/ltsmin3792462982740646547;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin3792462982740646547;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin3792462982740646547;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 6 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 247 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
// Phase 1: matrix 5000 rows 5000 cols
[2023-03-14 16:42:00] [INFO ] Computed 2000 place invariants in 17 ms
[2023-03-14 16:42:02] [INFO ] Implicit Places using invariants in 2773 ms returned []
[2023-03-14 16:42:02] [INFO ] Invariant cache hit.
[2023-03-14 16:42:05] [INFO ] Implicit Places using invariants and state equation in 2851 ms returned []
Implicit Place search using SMT with State Equation took 5628 ms to find 0 implicit places.
[2023-03-14 16:42:05] [INFO ] Invariant cache hit.
[2023-03-14 16:42:08] [INFO ] Dead Transitions using invariants and state equation in 3176 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9052 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Built C files in :
/tmp/ltsmin3139769559712402685
[2023-03-14 16:42:08] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3139769559712402685
Running compilation step : cd /tmp/ltsmin3139769559712402685;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin3139769559712402685;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin3139769559712402685;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-14 16:42:12] [INFO ] Flatten gal took : 130 ms
[2023-03-14 16:42:12] [INFO ] Flatten gal took : 115 ms
[2023-03-14 16:42:12] [INFO ] Time to serialize gal into /tmp/LTL17215267314011744432.gal : 23 ms
[2023-03-14 16:42:12] [INFO ] Time to serialize properties into /tmp/LTL13192813124487821774.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17215267314011744432.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6416626305437283186.hoa' '-atoms' '/tmp/LTL13192813124487821774.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13192813124487821774.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6416626305437283186.hoa
Detected timeout of ITS tools.
[2023-03-14 16:42:27] [INFO ] Flatten gal took : 117 ms
[2023-03-14 16:42:27] [INFO ] Flatten gal took : 119 ms
[2023-03-14 16:42:27] [INFO ] Time to serialize gal into /tmp/LTL5605151429534133921.gal : 19 ms
[2023-03-14 16:42:27] [INFO ] Time to serialize properties into /tmp/LTL16602413769232060285.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5605151429534133921.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16602413769232060285.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((G(F("((Think_76<1)||(Fork_76<1))")))||((!(X(X("((Fork_632>=1)&&(Catch2_633>=1))"))))U("((Think_531>=1)&&(Fork_531>=1))")))))
Formula 0 simplified : F(!"((Think_531>=1)&&(Fork_531>=1))" & X(FG!"((Think_76<1)||(Fork_76<1))" & (!"((Think_531>=1)&&(Fork_531>=1))" W X"((Fork_632>=1)&&...175
Detected timeout of ITS tools.
[2023-03-14 16:42:42] [INFO ] Flatten gal took : 121 ms
[2023-03-14 16:42:42] [INFO ] Applying decomposition
[2023-03-14 16:42:42] [INFO ] Flatten gal took : 126 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph14545623194500213644.txt' '-o' '/tmp/graph14545623194500213644.bin' '-w' '/tmp/graph14545623194500213644.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph14545623194500213644.bin' '-l' '-1' '-v' '-w' '/tmp/graph14545623194500213644.weights' '-q' '0' '-e' '0.001'
[2023-03-14 16:42:43] [INFO ] Decomposing Gal with order
[2023-03-14 16:42:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-14 16:42:43] [INFO ] Removed a total of 992 redundant transitions.
[2023-03-14 16:42:44] [INFO ] Flatten gal took : 195 ms
[2023-03-14 16:42:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 2658 labels/synchronizations in 73 ms.
[2023-03-14 16:42:44] [INFO ] Time to serialize gal into /tmp/LTL7137178258557838917.gal : 45 ms
[2023-03-14 16:42:44] [INFO ] Time to serialize properties into /tmp/LTL10485969397759274275.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7137178258557838917.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10485969397759274275.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G((G(F("((i37.u176.Think_76<1)||(i37.u176.Fork_76<1))")))||((!(X(X("((i56.u326.Fork_632>=1)&&(i56.u556.Catch2_633>=1))"))))U("((i18...205
Formula 0 simplified : F(!"((i18.u291.Think_531>=1)&&(i18.u292.Fork_531>=1))" & X(FG!"((i37.u176.Think_76<1)||(i37.u176.Fork_76<1))" & (!"((i18.u291.Think_...247
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
4 transitions explored
3 items max in DFS search stack
755 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,8.2422,185836,1,0,431561,616,16873,403420,389,1538,941702
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Philosophers-PT-001000-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property Philosophers-PT-001000-LTLFireability-12 finished in 123570 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U p1)))'
Support contains 2 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 244 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 16:42:53] [INFO ] Invariant cache hit.
[2023-03-14 16:42:56] [INFO ] Implicit Places using invariants in 2787 ms returned []
[2023-03-14 16:42:56] [INFO ] Invariant cache hit.
[2023-03-14 16:42:59] [INFO ] Implicit Places using invariants and state equation in 2823 ms returned []
Implicit Place search using SMT with State Equation took 5611 ms to find 0 implicit places.
[2023-03-14 16:42:59] [INFO ] Invariant cache hit.
[2023-03-14 16:43:02] [INFO ] Dead Transitions using invariants and state equation in 3185 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9041 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 185 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : Philosophers-PT-001000-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s4844 1) (GEQ s3902 1)), p0:(GEQ s3902 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 15 reset in 8225 ms.
Stack based approach found an accepted trace after 7585 steps with 0 reset with depth 7586 and stack size 7586 in 685 ms.
FORMULA Philosophers-PT-001000-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-001000-LTLFireability-13 finished in 18163 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0 U (p1||G(p0))))))'
Support contains 3 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Performed 997 Post agglomeration using F-continuation condition.Transition count delta: 997
Deduced a syphon composed of 997 places in 1 ms
Reduce places removed 997 places and 0 transitions.
Iterating global reduction 0 with 1994 rules applied. Total rules applied 1994 place count 4003 transition count 4003
Applied a total of 1994 rules in 640 ms. Remains 4003 /5000 variables (removed 997) and now considering 4003/5000 (removed 997) transitions.
// Phase 1: matrix 4003 rows 4003 cols
[2023-03-14 16:43:12] [INFO ] Computed 2000 place invariants in 12 ms
[2023-03-14 16:43:14] [INFO ] Implicit Places using invariants in 2351 ms returned []
[2023-03-14 16:43:14] [INFO ] Invariant cache hit.
[2023-03-14 16:43:17] [INFO ] Implicit Places using invariants and state equation in 3584 ms returned []
Implicit Place search using SMT with State Equation took 5937 ms to find 0 implicit places.
[2023-03-14 16:43:18] [INFO ] Redundant transitions in 142 ms returned []
[2023-03-14 16:43:18] [INFO ] Invariant cache hit.
[2023-03-14 16:43:20] [INFO ] Dead Transitions using invariants and state equation in 2167 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4003/5000 places, 4003/5000 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8895 ms. Remains : 4003/5000 places, 4003/5000 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-PT-001000-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (LT s4002 1) (NOT (AND (GEQ s1680 1) (GEQ s3632 1)))), p0:(LT s4002 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 10 reset in 7923 ms.
Stack based approach found an accepted trace after 2483 steps with 0 reset with depth 2484 and stack size 2484 in 475 ms.
FORMULA Philosophers-PT-001000-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-001000-LTLFireability-14 finished in 17402 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((!p0&&G(F(p1))) U p2)))'
[2023-03-14 16:43:29] [INFO ] Flatten gal took : 144 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10935804052083420156
[2023-03-14 16:43:29] [INFO ] Too many transitions (5000) to apply POR reductions. Disabling POR matrices.
[2023-03-14 16:43:29] [INFO ] Built C files in 92ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10935804052083420156
Running compilation step : cd /tmp/ltsmin10935804052083420156;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-14 16:43:29] [INFO ] Applying decomposition
[2023-03-14 16:43:29] [INFO ] Flatten gal took : 148 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph12566864181520164216.txt' '-o' '/tmp/graph12566864181520164216.bin' '-w' '/tmp/graph12566864181520164216.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12566864181520164216.bin' '-l' '-1' '-v' '-w' '/tmp/graph12566864181520164216.weights' '-q' '0' '-e' '0.001'
[2023-03-14 16:43:29] [INFO ] Decomposing Gal with order
[2023-03-14 16:43:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-14 16:43:30] [INFO ] Removed a total of 994 redundant transitions.
[2023-03-14 16:43:30] [INFO ] Flatten gal took : 238 ms
[2023-03-14 16:43:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 2650 labels/synchronizations in 48 ms.
[2023-03-14 16:43:33] [INFO ] Time to serialize gal into /tmp/LTLFireability12729224355493068529.gal : 28 ms
[2023-03-14 16:43:33] [INFO ] Time to serialize properties into /tmp/LTLFireability11490115777817257259.ltl : 21 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12729224355493068529.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11490115777817257259.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((G(((!("((((((((((((i11.u190.Fork_236>=1)&&(i11.u190.Catch2_237>=1))||((i24.i0.i1.i0.u374.Fork_577>=1)&&(i24.i0.i0.i0.u720.Catch2_57...267194
Formula 0 simplified : F(("((((((((((((i11.u190.Fork_236>=1)&&(i11.u190.Catch2_237>=1))||((i24.i0.i1.i0.u374.Fork_577>=1)&&(i24.i0.i0.i0.u720.Catch2_578>=1...267183
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
Compilation finished in 19165 ms.
Running link step : cd /tmp/ltsmin10935804052083420156;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 86 ms.
Running LTSmin : cd /tmp/ltsmin10935804052083420156;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](((!(LTLAPp0==true)&&[](<>((LTLAPp1==true)))) U (LTLAPp2==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-14 17:07:36] [INFO ] Flatten gal took : 339 ms
[2023-03-14 17:07:36] [INFO ] Time to serialize gal into /tmp/LTLFireability8701857260217511080.gal : 80 ms
[2023-03-14 17:07:36] [INFO ] Time to serialize properties into /tmp/LTLFireability505297851421810966.ltl : 15 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8701857260217511080.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability505297851421810966.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...296
Read 1 LTL properties
Checking formula 0 : !((G(((!("((((((((((((Fork_236>=1)&&(Catch2_237>=1))||((Fork_577>=1)&&(Catch2_578>=1)))||(((Fork_796>=1)&&(Catch2_797>=1))||((Fork_992...158080
Formula 0 simplified : F(("((((((((((((Fork_236>=1)&&(Catch2_237>=1))||((Fork_577>=1)&&(Catch2_578>=1)))||(((Fork_796>=1)&&(Catch2_797>=1))||((Fork_992>=1)...158069
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 5165464 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16004096 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Philosophers-PT-001000"
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-5348"
echo " Executing tool itstools"
echo " Input is Philosophers-PT-001000, 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 r293-tall-167873945200244"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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