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.r229-tall-167856413700764.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 MultiCrashLeafsetExtension-PT-S16C04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r229-tall-167856413700764
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 11K Feb 26 02:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 26 02:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Feb 26 02:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 02:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 24K Feb 26 02:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Feb 26 02:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Feb 26 02:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 26 02:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 4.1M Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679556086578

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=MultiCrashLeafsetExtension-PT-S16C04
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-23 07:21:29] [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-23 07:21:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 07:21:30] [INFO ] Load time of PNML (sax parser for PT used): 221 ms
[2023-03-23 07:21:30] [INFO ] Transformed 4260 places.
[2023-03-23 07:21:30] [INFO ] Transformed 6027 transitions.
[2023-03-23 07:21:30] [INFO ] Parsed PT model containing 4260 places and 6027 transitions and 23774 arcs in 337 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 66 out of 4260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4260/4260 places, 6027/6027 transitions.
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 4232 transition count 6027
Discarding 1072 places :
Symmetric choice reduction at 1 with 1072 rule applications. Total rules 1100 place count 3160 transition count 4955
Iterating global reduction 1 with 1072 rules applied. Total rules applied 2172 place count 3160 transition count 4955
Discarding 937 places :
Symmetric choice reduction at 1 with 937 rule applications. Total rules 3109 place count 2223 transition count 4018
Iterating global reduction 1 with 937 rules applied. Total rules applied 4046 place count 2223 transition count 4018
Discarding 215 places :
Symmetric choice reduction at 1 with 215 rule applications. Total rules 4261 place count 2008 transition count 3158
Iterating global reduction 1 with 215 rules applied. Total rules applied 4476 place count 2008 transition count 3158
Applied a total of 4476 rules in 819 ms. Remains 2008 /4260 variables (removed 2252) and now considering 3158/6027 (removed 2869) transitions.
[2023-03-23 07:21:31] [INFO ] Flow matrix only has 2886 transitions (discarded 272 similar events)
// Phase 1: matrix 2886 rows 2008 cols
[2023-03-23 07:21:31] [INFO ] Computed 469 place invariants in 180 ms
[2023-03-23 07:21:33] [INFO ] Implicit Places using invariants in 2483 ms returned [8, 14, 16, 20, 30, 38, 47, 58, 71, 86, 102, 118, 120, 122, 124, 126, 139, 151, 160, 167, 172, 175, 194, 201, 204, 205, 206, 207, 208, 211, 216, 223, 232, 243, 256, 270, 284, 285, 286, 287, 288, 299, 308, 315, 320, 323, 325, 344, 351, 354, 355, 356, 357, 358, 361, 364, 369, 376, 385, 396, 420, 421, 422, 424, 433, 440, 445, 448, 453, 455, 475, 482, 485, 486, 487, 488, 489, 491, 493, 496, 501, 508, 517, 527, 537, 538, 539, 540, 541, 548, 553, 556, 558, 560, 562, 581, 588, 591, 592, 593, 594, 595, 597, 599, 601, 604, 609, 616, 624, 632, 633, 634, 635, 636, 641, 644, 646, 648, 650, 652, 671, 678, 681, 682, 683, 684, 685, 687, 689, 691, 693, 696, 701, 707, 713, 714, 715, 716, 717, 720, 722, 724, 726, 728, 730, 749, 756, 759, 760, 761, 762, 763, 766, 768, 770, 772, 774, 777, 781, 785, 786, 787, 788, 789, 791, 793, 795, 797, 799, 801, 820, 827, 830, 831, 832, 834, 836, 838, 841, 843, 845, 847, 851, 854, 855, 856, 857, 858, 860, 862, 864, 866, 868, 870, 889, 891, 895, 898, 899, 900, 901, 902, 904, 906, 908, 910, 912, 914, 916, 920, 921, 922, 923, 925, 927, 932, 934, 936, 938, 957, 964, 967, 968, 969, 971, 973, 975, 977, 979, 981, 983, 988, 991, 992, 995, 997, 1001, 1003, 1005, 1007, 1011, 1037, 1040, 1041, 1042, 1043, 1044, 1046, 1048, 1050, 1052, 1054, 1056, 1059, 1064, 1067, 1068, 1069, 1074, 1076, 1078, 1081, 1083, 1085, 1104, 1111, 1115, 1116, 1117, 1118, 1123, 1125, 1130, 1132, 1134, 1137, 1142, 1149, 1150, 1151, 1152, 1153, 1158, 1161, 1163, 1165, 1167, 1169, 1188, 1195, 1198, 1200, 1201, 1202, 1204, 1206, 1209, 1211, 1214, 1219, 1228, 1237, 1238, 1239, 1240, 1241, 1248, 1253, 1256, 1258, 1260, 1262, 1281, 1288, 1292, 1293, 1294, 1295, 1299, 1301, 1303, 1306, 1311, 1318, 1327, 1338, 1339, 1341, 1342, 1351, 1358, 1365, 1368, 1370, 1372, 1391, 1398, 1401, 1402, 1403, 1404, 1405, 1407, 1409, 1412, 1417, 1424, 1433, 1444, 1457, 1458, 1459, 1460, 1461, 1472, 1481, 1488, 1493, 1496, 1498, 1517, 1524, 1527, 1528, 1529, 1530, 1531, 1533, 1536, 1541, 1548, 1557, 1568, 1581, 1596, 1597, 1598, 1599, 1600, 1613, 1624, 1633, 1640, 1645, 1648, 1668, 1670, 1674, 1677, 1678, 1679, 1680, 1681, 1684, 1689, 1696, 1705, 1716, 1729, 1744, 1761, 1763, 1764, 1765, 1780, 1793, 1804, 1815, 1822, 1827, 1847]
Discarding 411 places :
Implicit Place search using SMT only with invariants took 2527 ms to find 411 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1597/4260 places, 3158/6027 transitions.
Discarding 114 places :
Symmetric choice reduction at 0 with 114 rule applications. Total rules 114 place count 1483 transition count 3044
Iterating global reduction 0 with 114 rules applied. Total rules applied 228 place count 1483 transition count 3044
Discarding 113 places :
Symmetric choice reduction at 0 with 113 rule applications. Total rules 341 place count 1370 transition count 2931
Iterating global reduction 0 with 113 rules applied. Total rules applied 454 place count 1370 transition count 2931
Discarding 111 places :
Symmetric choice reduction at 0 with 111 rule applications. Total rules 565 place count 1259 transition count 2820
Iterating global reduction 0 with 111 rules applied. Total rules applied 676 place count 1259 transition count 2820
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 693 place count 1242 transition count 2752
Iterating global reduction 0 with 17 rules applied. Total rules applied 710 place count 1242 transition count 2752
Applied a total of 710 rules in 490 ms. Remains 1242 /1597 variables (removed 355) and now considering 2752/3158 (removed 406) transitions.
[2023-03-23 07:21:34] [INFO ] Flow matrix only has 2480 transitions (discarded 272 similar events)
// Phase 1: matrix 2480 rows 1242 cols
[2023-03-23 07:21:34] [INFO ] Computed 58 place invariants in 78 ms
[2023-03-23 07:21:35] [INFO ] Implicit Places using invariants in 947 ms returned []
[2023-03-23 07:21:35] [INFO ] Flow matrix only has 2480 transitions (discarded 272 similar events)
[2023-03-23 07:21:35] [INFO ] Invariant cache hit.
[2023-03-23 07:21:36] [INFO ] State equation strengthened by 938 read => feed constraints.
[2023-03-23 07:21:47] [INFO ] Implicit Places using invariants and state equation in 12248 ms returned []
Implicit Place search using SMT with State Equation took 13203 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1242/4260 places, 2752/6027 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 17041 ms. Remains : 1242/4260 places, 2752/6027 transitions.
Support contains 66 out of 1242 places after structural reductions.
[2023-03-23 07:21:47] [INFO ] Flatten gal took : 216 ms
[2023-03-23 07:21:48] [INFO ] Flatten gal took : 124 ms
[2023-03-23 07:21:48] [INFO ] Input system was already deterministic with 2752 transitions.
Support contains 62 out of 1242 places (down from 66) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 239 resets, run finished after 636 ms. (steps per millisecond=15 ) properties (out of 29) seen :15
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 14) seen :2
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 61 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 61 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-23 07:21:49] [INFO ] Flow matrix only has 2480 transitions (discarded 272 similar events)
[2023-03-23 07:21:49] [INFO ] Invariant cache hit.
[2023-03-23 07:21:50] [INFO ] [Real]Absence check using 31 positive place invariants in 14 ms returned sat
[2023-03-23 07:21:50] [INFO ] [Real]Absence check using 31 positive and 27 generalized place invariants in 26 ms returned sat
[2023-03-23 07:21:52] [INFO ] After 2829ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:9
[2023-03-23 07:21:53] [INFO ] [Nat]Absence check using 31 positive place invariants in 14 ms returned sat
[2023-03-23 07:21:53] [INFO ] [Nat]Absence check using 31 positive and 27 generalized place invariants in 28 ms returned sat
[2023-03-23 07:21:54] [INFO ] After 1647ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :9
[2023-03-23 07:21:54] [INFO ] State equation strengthened by 938 read => feed constraints.
[2023-03-23 07:21:57] [INFO ] After 2459ms SMT Verify possible using 938 Read/Feed constraints in natural domain returned unsat :4 sat :6
[2023-03-23 07:21:58] [INFO ] Deduced a trap composed of 254 places in 554 ms of which 8 ms to minimize.
[2023-03-23 07:21:58] [INFO ] Deduced a trap composed of 237 places in 529 ms of which 2 ms to minimize.
[2023-03-23 07:21:59] [INFO ] Deduced a trap composed of 263 places in 556 ms of which 2 ms to minimize.
[2023-03-23 07:22:00] [INFO ] Deduced a trap composed of 229 places in 543 ms of which 3 ms to minimize.
[2023-03-23 07:22:01] [INFO ] Deduced a trap composed of 160 places in 590 ms of which 2 ms to minimize.
[2023-03-23 07:22:02] [INFO ] Deduced a trap composed of 283 places in 584 ms of which 2 ms to minimize.
[2023-03-23 07:22:03] [INFO ] Deduced a trap composed of 298 places in 514 ms of which 1 ms to minimize.
[2023-03-23 07:22:04] [INFO ] Deduced a trap composed of 308 places in 514 ms of which 2 ms to minimize.
[2023-03-23 07:22:04] [INFO ] Deduced a trap composed of 393 places in 502 ms of which 1 ms to minimize.
[2023-03-23 07:22:05] [INFO ] Deduced a trap composed of 407 places in 543 ms of which 2 ms to minimize.
[2023-03-23 07:22:05] [INFO ] Deduced a trap composed of 177 places in 570 ms of which 1 ms to minimize.
[2023-03-23 07:22:06] [INFO ] Deduced a trap composed of 263 places in 564 ms of which 2 ms to minimize.
[2023-03-23 07:22:07] [INFO ] Deduced a trap composed of 275 places in 543 ms of which 1 ms to minimize.
[2023-03-23 07:22:07] [INFO ] Deduced a trap composed of 261 places in 513 ms of which 1 ms to minimize.
[2023-03-23 07:22:08] [INFO ] Deduced a trap composed of 396 places in 547 ms of which 1 ms to minimize.
[2023-03-23 07:22:09] [INFO ] Deduced a trap composed of 180 places in 521 ms of which 1 ms to minimize.
[2023-03-23 07:22:10] [INFO ] Deduced a trap composed of 178 places in 546 ms of which 1 ms to minimize.
[2023-03-23 07:22:10] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 12566 ms
[2023-03-23 07:22:10] [INFO ] Deduced a trap composed of 195 places in 554 ms of which 1 ms to minimize.
[2023-03-23 07:22:11] [INFO ] Deduced a trap composed of 207 places in 514 ms of which 1 ms to minimize.
[2023-03-23 07:22:12] [INFO ] Deduced a trap composed of 207 places in 472 ms of which 1 ms to minimize.
[2023-03-23 07:22:12] [INFO ] Deduced a trap composed of 180 places in 463 ms of which 2 ms to minimize.
[2023-03-23 07:22:13] [INFO ] Deduced a trap composed of 217 places in 485 ms of which 2 ms to minimize.
[2023-03-23 07:22:13] [INFO ] Deduced a trap composed of 227 places in 462 ms of which 2 ms to minimize.
[2023-03-23 07:22:14] [INFO ] Deduced a trap composed of 201 places in 466 ms of which 1 ms to minimize.
[2023-03-23 07:22:14] [INFO ] Deduced a trap composed of 217 places in 468 ms of which 1 ms to minimize.
[2023-03-23 07:22:15] [INFO ] Deduced a trap composed of 200 places in 456 ms of which 1 ms to minimize.
[2023-03-23 07:22:16] [INFO ] Deduced a trap composed of 218 places in 458 ms of which 1 ms to minimize.
[2023-03-23 07:22:16] [INFO ] Deduced a trap composed of 196 places in 478 ms of which 1 ms to minimize.
[2023-03-23 07:22:17] [INFO ] Deduced a trap composed of 205 places in 458 ms of which 1 ms to minimize.
[2023-03-23 07:22:17] [INFO ] Deduced a trap composed of 206 places in 487 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 07:22:17] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 07:22:17] [INFO ] After 25128ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:9
Fused 10 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 19 ms.
Support contains 11 out of 1242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1242/1242 places, 2752/2752 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 1242 transition count 2738
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 1228 transition count 2738
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 28 place count 1228 transition count 2721
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 62 place count 1211 transition count 2721
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 80 place count 1193 transition count 2679
Iterating global reduction 2 with 18 rules applied. Total rules applied 98 place count 1193 transition count 2679
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 98 place count 1193 transition count 2677
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 102 place count 1191 transition count 2677
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 112 place count 1181 transition count 2640
Iterating global reduction 2 with 10 rules applied. Total rules applied 122 place count 1181 transition count 2640
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 123 place count 1180 transition count 2636
Iterating global reduction 2 with 1 rules applied. Total rules applied 124 place count 1180 transition count 2636
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 3 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 176 place count 1154 transition count 2610
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 181 place count 1149 transition count 2605
Iterating global reduction 2 with 5 rules applied. Total rules applied 186 place count 1149 transition count 2605
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 191 place count 1144 transition count 2585
Iterating global reduction 2 with 5 rules applied. Total rules applied 196 place count 1144 transition count 2585
Free-agglomeration rule (complex) applied 146 times.
Iterating global reduction 2 with 146 rules applied. Total rules applied 342 place count 1144 transition count 3204
Reduce places removed 146 places and 0 transitions.
Iterating post reduction 2 with 146 rules applied. Total rules applied 488 place count 998 transition count 3204
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 498 place count 998 transition count 3204
Applied a total of 498 rules in 801 ms. Remains 998 /1242 variables (removed 244) and now considering 3204/2752 (removed -452) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 803 ms. Remains : 998/1242 places, 3204/2752 transitions.
Incomplete random walk after 10000 steps, including 426 resets, run finished after 293 ms. (steps per millisecond=34 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 69641 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{1=1, 2=1, 5=1}
Probabilistic random walk after 69641 steps, saw 29230 distinct states, run finished after 3003 ms. (steps per millisecond=23 ) properties seen :3
Running SMT prover for 3 properties.
[2023-03-23 07:22:22] [INFO ] Flow matrix only has 2806 transitions (discarded 398 similar events)
// Phase 1: matrix 2806 rows 998 cols
[2023-03-23 07:22:22] [INFO ] Computed 58 place invariants in 59 ms
[2023-03-23 07:22:22] [INFO ] [Real]Absence check using 33 positive place invariants in 32 ms returned sat
[2023-03-23 07:22:22] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 5 ms returned sat
[2023-03-23 07:22:23] [INFO ] After 1274ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 07:22:23] [INFO ] [Nat]Absence check using 33 positive place invariants in 26 ms returned sat
[2023-03-23 07:22:23] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 4 ms returned sat
[2023-03-23 07:22:24] [INFO ] After 1015ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 07:22:24] [INFO ] State equation strengthened by 1634 read => feed constraints.
[2023-03-23 07:22:25] [INFO ] After 749ms SMT Verify possible using 1634 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 07:22:26] [INFO ] Deduced a trap composed of 176 places in 399 ms of which 1 ms to minimize.
[2023-03-23 07:22:27] [INFO ] Deduced a trap composed of 183 places in 445 ms of which 1 ms to minimize.
[2023-03-23 07:22:27] [INFO ] Deduced a trap composed of 78 places in 507 ms of which 1 ms to minimize.
[2023-03-23 07:22:28] [INFO ] Deduced a trap composed of 90 places in 527 ms of which 1 ms to minimize.
[2023-03-23 07:22:29] [INFO ] Deduced a trap composed of 70 places in 494 ms of which 1 ms to minimize.
[2023-03-23 07:22:29] [INFO ] Deduced a trap composed of 73 places in 502 ms of which 1 ms to minimize.
[2023-03-23 07:22:30] [INFO ] Deduced a trap composed of 76 places in 481 ms of which 1 ms to minimize.
[2023-03-23 07:22:30] [INFO ] Deduced a trap composed of 86 places in 505 ms of which 0 ms to minimize.
[2023-03-23 07:22:31] [INFO ] Deduced a trap composed of 78 places in 502 ms of which 1 ms to minimize.
[2023-03-23 07:22:32] [INFO ] Deduced a trap composed of 73 places in 497 ms of which 2 ms to minimize.
[2023-03-23 07:22:32] [INFO ] Deduced a trap composed of 85 places in 492 ms of which 1 ms to minimize.
[2023-03-23 07:22:33] [INFO ] Deduced a trap composed of 86 places in 482 ms of which 1 ms to minimize.
[2023-03-23 07:22:34] [INFO ] Deduced a trap composed of 77 places in 453 ms of which 1 ms to minimize.
[2023-03-23 07:22:34] [INFO ] Deduced a trap composed of 167 places in 447 ms of which 1 ms to minimize.
[2023-03-23 07:22:35] [INFO ] Deduced a trap composed of 77 places in 482 ms of which 1 ms to minimize.
[2023-03-23 07:22:36] [INFO ] Deduced a trap composed of 157 places in 440 ms of which 1 ms to minimize.
[2023-03-23 07:22:36] [INFO ] Deduced a trap composed of 94 places in 480 ms of which 1 ms to minimize.
[2023-03-23 07:22:37] [INFO ] Deduced a trap composed of 83 places in 472 ms of which 1 ms to minimize.
[2023-03-23 07:22:37] [INFO ] Deduced a trap composed of 89 places in 474 ms of which 1 ms to minimize.
[2023-03-23 07:22:38] [INFO ] Deduced a trap composed of 78 places in 471 ms of which 1 ms to minimize.
[2023-03-23 07:22:38] [INFO ] Deduced a trap composed of 92 places in 492 ms of which 3 ms to minimize.
[2023-03-23 07:22:39] [INFO ] Deduced a trap composed of 85 places in 484 ms of which 1 ms to minimize.
[2023-03-23 07:22:40] [INFO ] Deduced a trap composed of 77 places in 494 ms of which 1 ms to minimize.
[2023-03-23 07:22:40] [INFO ] Deduced a trap composed of 82 places in 493 ms of which 1 ms to minimize.
[2023-03-23 07:22:41] [INFO ] Deduced a trap composed of 103 places in 468 ms of which 1 ms to minimize.
[2023-03-23 07:22:41] [INFO ] Deduced a trap composed of 82 places in 485 ms of which 1 ms to minimize.
[2023-03-23 07:22:42] [INFO ] Deduced a trap composed of 87 places in 475 ms of which 2 ms to minimize.
[2023-03-23 07:22:43] [INFO ] Deduced a trap composed of 159 places in 450 ms of which 1 ms to minimize.
[2023-03-23 07:22:43] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 18100 ms
[2023-03-23 07:22:45] [INFO ] Deduced a trap composed of 163 places in 473 ms of which 1 ms to minimize.
[2023-03-23 07:22:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 622 ms
[2023-03-23 07:22:45] [INFO ] After 20789ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 2985 ms.
[2023-03-23 07:22:48] [INFO ] After 25022ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 3 ms.
Support contains 7 out of 998 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 998/998 places, 3204/3204 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 998 transition count 3202
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 996 transition count 3202
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 996 transition count 3201
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 995 transition count 3201
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 994 transition count 3200
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 994 transition count 3200
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 11 place count 994 transition count 3200
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 13 place count 992 transition count 3198
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 992 transition count 3198
Applied a total of 15 rules in 251 ms. Remains 992 /998 variables (removed 6) and now considering 3198/3204 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 251 ms. Remains : 992/998 places, 3198/3204 transitions.
Incomplete random walk after 10000 steps, including 426 resets, run finished after 293 ms. (steps per millisecond=34 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 64991 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 64991 steps, saw 27295 distinct states, run finished after 3002 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-23 07:22:52] [INFO ] Flow matrix only has 2800 transitions (discarded 398 similar events)
// Phase 1: matrix 2800 rows 992 cols
[2023-03-23 07:22:52] [INFO ] Computed 58 place invariants in 33 ms
[2023-03-23 07:22:52] [INFO ] [Real]Absence check using 33 positive place invariants in 25 ms returned sat
[2023-03-23 07:22:52] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 5 ms returned sat
[2023-03-23 07:22:53] [INFO ] After 1228ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 07:22:53] [INFO ] [Nat]Absence check using 33 positive place invariants in 33 ms returned sat
[2023-03-23 07:22:53] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 5 ms returned sat
[2023-03-23 07:22:54] [INFO ] After 1058ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 07:22:54] [INFO ] State equation strengthened by 1634 read => feed constraints.
[2023-03-23 07:22:55] [INFO ] After 590ms SMT Verify possible using 1634 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 07:22:56] [INFO ] Deduced a trap composed of 193 places in 442 ms of which 1 ms to minimize.
[2023-03-23 07:22:57] [INFO ] Deduced a trap composed of 277 places in 446 ms of which 1 ms to minimize.
[2023-03-23 07:22:57] [INFO ] Deduced a trap composed of 76 places in 488 ms of which 1 ms to minimize.
[2023-03-23 07:22:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2141 ms
[2023-03-23 07:22:58] [INFO ] Deduced a trap composed of 206 places in 448 ms of which 1 ms to minimize.
[2023-03-23 07:22:58] [INFO ] Deduced a trap composed of 70 places in 429 ms of which 3 ms to minimize.
[2023-03-23 07:22:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1089 ms
[2023-03-23 07:22:59] [INFO ] After 4487ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 549 ms.
[2023-03-23 07:22:59] [INFO ] After 6333ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 6 ms.
Support contains 7 out of 992 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 992/992 places, 3198/3198 transitions.
Applied a total of 0 rules in 84 ms. Remains 992 /992 variables (removed 0) and now considering 3198/3198 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 992/992 places, 3198/3198 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 992/992 places, 3198/3198 transitions.
Applied a total of 0 rules in 76 ms. Remains 992 /992 variables (removed 0) and now considering 3198/3198 (removed 0) transitions.
[2023-03-23 07:23:00] [INFO ] Flow matrix only has 2800 transitions (discarded 398 similar events)
[2023-03-23 07:23:00] [INFO ] Invariant cache hit.
[2023-03-23 07:23:01] [INFO ] Implicit Places using invariants in 1020 ms returned [4, 8, 9, 267, 277, 449, 479, 494, 503, 504, 516, 532, 549, 580, 621, 649, 903]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 1027 ms to find 17 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 975/992 places, 3198/3198 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 966 transition count 3189
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 966 transition count 3189
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 27 place count 957 transition count 3180
Iterating global reduction 0 with 9 rules applied. Total rules applied 36 place count 957 transition count 3180
Applied a total of 36 rules in 138 ms. Remains 957 /975 variables (removed 18) and now considering 3180/3198 (removed 18) transitions.
[2023-03-23 07:23:01] [INFO ] Flow matrix only has 2782 transitions (discarded 398 similar events)
// Phase 1: matrix 2782 rows 957 cols
[2023-03-23 07:23:01] [INFO ] Computed 41 place invariants in 27 ms
[2023-03-23 07:23:02] [INFO ] Implicit Places using invariants in 895 ms returned []
[2023-03-23 07:23:02] [INFO ] Flow matrix only has 2782 transitions (discarded 398 similar events)
[2023-03-23 07:23:02] [INFO ] Invariant cache hit.
[2023-03-23 07:23:02] [INFO ] State equation strengthened by 1634 read => feed constraints.
[2023-03-23 07:23:15] [INFO ] Implicit Places using invariants and state equation in 13373 ms returned []
Implicit Place search using SMT with State Equation took 14271 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 957/992 places, 3180/3198 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 15514 ms. Remains : 957/992 places, 3180/3198 transitions.
Incomplete random walk after 10000 steps, including 427 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 72223 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 72223 steps, saw 30146 distinct states, run finished after 3002 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-23 07:23:18] [INFO ] Flow matrix only has 2782 transitions (discarded 398 similar events)
[2023-03-23 07:23:18] [INFO ] Invariant cache hit.
[2023-03-23 07:23:18] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2023-03-23 07:23:18] [INFO ] [Real]Absence check using 31 positive and 10 generalized place invariants in 2 ms returned sat
[2023-03-23 07:23:20] [INFO ] After 1361ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 07:23:20] [INFO ] [Nat]Absence check using 31 positive place invariants in 13 ms returned sat
[2023-03-23 07:23:20] [INFO ] [Nat]Absence check using 31 positive and 10 generalized place invariants in 2 ms returned sat
[2023-03-23 07:23:21] [INFO ] After 1121ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 07:23:21] [INFO ] State equation strengthened by 1634 read => feed constraints.
[2023-03-23 07:23:22] [INFO ] After 1094ms SMT Verify possible using 1634 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 07:23:23] [INFO ] Deduced a trap composed of 194 places in 413 ms of which 1 ms to minimize.
[2023-03-23 07:23:23] [INFO ] Deduced a trap composed of 60 places in 470 ms of which 0 ms to minimize.
[2023-03-23 07:23:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1086 ms
[2023-03-23 07:23:24] [INFO ] Deduced a trap composed of 150 places in 423 ms of which 1 ms to minimize.
[2023-03-23 07:23:25] [INFO ] Deduced a trap composed of 86 places in 451 ms of which 1 ms to minimize.
[2023-03-23 07:23:25] [INFO ] Deduced a trap composed of 61 places in 471 ms of which 1 ms to minimize.
[2023-03-23 07:23:26] [INFO ] Deduced a trap composed of 97 places in 454 ms of which 0 ms to minimize.
[2023-03-23 07:23:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2137 ms
[2023-03-23 07:23:26] [INFO ] Deduced a trap composed of 63 places in 455 ms of which 1 ms to minimize.
[2023-03-23 07:23:27] [INFO ] Deduced a trap composed of 167 places in 427 ms of which 1 ms to minimize.
[2023-03-23 07:23:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1098 ms
[2023-03-23 07:23:27] [INFO ] After 5942ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 523 ms.
[2023-03-23 07:23:27] [INFO ] After 7807ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 5 ms.
Support contains 7 out of 957 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 957/957 places, 3180/3180 transitions.
Applied a total of 0 rules in 78 ms. Remains 957 /957 variables (removed 0) and now considering 3180/3180 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 957/957 places, 3180/3180 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 957/957 places, 3180/3180 transitions.
Applied a total of 0 rules in 81 ms. Remains 957 /957 variables (removed 0) and now considering 3180/3180 (removed 0) transitions.
[2023-03-23 07:23:28] [INFO ] Flow matrix only has 2782 transitions (discarded 398 similar events)
[2023-03-23 07:23:28] [INFO ] Invariant cache hit.
[2023-03-23 07:23:29] [INFO ] Implicit Places using invariants in 908 ms returned []
[2023-03-23 07:23:29] [INFO ] Flow matrix only has 2782 transitions (discarded 398 similar events)
[2023-03-23 07:23:29] [INFO ] Invariant cache hit.
[2023-03-23 07:23:29] [INFO ] State equation strengthened by 1634 read => feed constraints.
[2023-03-23 07:23:42] [INFO ] Implicit Places using invariants and state equation in 13149 ms returned []
Implicit Place search using SMT with State Equation took 14060 ms to find 0 implicit places.
[2023-03-23 07:23:42] [INFO ] Redundant transitions in 218 ms returned []
[2023-03-23 07:23:42] [INFO ] Flow matrix only has 2782 transitions (discarded 398 similar events)
[2023-03-23 07:23:42] [INFO ] Invariant cache hit.
[2023-03-23 07:23:43] [INFO ] Dead Transitions using invariants and state equation in 1132 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15503 ms. Remains : 957/957 places, 3180/3180 transitions.
Successfully simplified 4 atomic propositions for a total of 14 simplifications.
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 410 stabilizing places and 1119 stable transitions
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||(G(p1) U p2))))'
Support contains 3 out of 1242 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1242/1242 places, 2752/2752 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 1242 transition count 2738
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 1228 transition count 2738
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 28 place count 1228 transition count 2721
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 62 place count 1211 transition count 2721
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 79 place count 1194 transition count 2680
Iterating global reduction 2 with 17 rules applied. Total rules applied 96 place count 1194 transition count 2680
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 96 place count 1194 transition count 2678
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 100 place count 1192 transition count 2678
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 109 place count 1183 transition count 2645
Iterating global reduction 2 with 9 rules applied. Total rules applied 118 place count 1183 transition count 2645
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 119 place count 1182 transition count 2641
Iterating global reduction 2 with 1 rules applied. Total rules applied 120 place count 1182 transition count 2641
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 174 place count 1155 transition count 2614
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 180 place count 1149 transition count 2608
Iterating global reduction 2 with 6 rules applied. Total rules applied 186 place count 1149 transition count 2608
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 192 place count 1143 transition count 2584
Iterating global reduction 2 with 6 rules applied. Total rules applied 198 place count 1143 transition count 2584
Applied a total of 198 rules in 469 ms. Remains 1143 /1242 variables (removed 99) and now considering 2584/2752 (removed 168) transitions.
[2023-03-23 07:23:44] [INFO ] Flow matrix only has 2312 transitions (discarded 272 similar events)
// Phase 1: matrix 2312 rows 1143 cols
[2023-03-23 07:23:44] [INFO ] Computed 58 place invariants in 31 ms
[2023-03-23 07:23:45] [INFO ] Implicit Places using invariants in 944 ms returned [4, 10, 11, 305, 317, 552, 569, 579, 580, 592, 611, 672, 721, 755, 1046]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 949 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1128/1242 places, 2584/2752 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1121 transition count 2577
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1121 transition count 2577
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 1114 transition count 2570
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 1114 transition count 2570
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 1110 transition count 2554
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 1110 transition count 2554
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 1105 transition count 2549
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 1100 transition count 2544
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 1100 transition count 2544
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 62 place count 1094 transition count 2520
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 1094 transition count 2520
Applied a total of 68 rules in 373 ms. Remains 1094 /1128 variables (removed 34) and now considering 2520/2584 (removed 64) transitions.
[2023-03-23 07:23:45] [INFO ] Flow matrix only has 2248 transitions (discarded 272 similar events)
// Phase 1: matrix 2248 rows 1094 cols
[2023-03-23 07:23:45] [INFO ] Computed 43 place invariants in 27 ms
[2023-03-23 07:23:46] [INFO ] Implicit Places using invariants in 888 ms returned []
[2023-03-23 07:23:46] [INFO ] Flow matrix only has 2248 transitions (discarded 272 similar events)
[2023-03-23 07:23:46] [INFO ] Invariant cache hit.
[2023-03-23 07:23:47] [INFO ] State equation strengthened by 839 read => feed constraints.
[2023-03-23 07:23:54] [INFO ] Implicit Places using invariants and state equation in 8227 ms returned []
Implicit Place search using SMT with State Equation took 9118 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1094/1242 places, 2520/2752 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 10909 ms. Remains : 1094/1242 places, 2520/2752 transitions.
Stuttering acceptance computed with spot in 349 ms :[(AND (NOT p0) (NOT p2))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s608 1), p2:(AND (GEQ s517 1) (GEQ s527 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]]
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 5 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-01 finished in 11316 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||X(p1)))))'
Support contains 3 out of 1242 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1242/1242 places, 2752/2752 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 1217 transition count 2706
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 1217 transition count 2706
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 68 place count 1199 transition count 2661
Iterating global reduction 0 with 18 rules applied. Total rules applied 86 place count 1199 transition count 2661
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 95 place count 1190 transition count 2625
Iterating global reduction 0 with 9 rules applied. Total rules applied 104 place count 1190 transition count 2625
Applied a total of 104 rules in 190 ms. Remains 1190 /1242 variables (removed 52) and now considering 2625/2752 (removed 127) transitions.
[2023-03-23 07:23:55] [INFO ] Flow matrix only has 2353 transitions (discarded 272 similar events)
// Phase 1: matrix 2353 rows 1190 cols
[2023-03-23 07:23:55] [INFO ] Computed 58 place invariants in 28 ms
[2023-03-23 07:23:56] [INFO ] Implicit Places using invariants in 1004 ms returned [4, 11, 15, 327, 339, 546, 579, 598, 608, 609, 624, 644, 664, 703, 754, 788, 1084]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 1015 ms to find 17 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1173/1242 places, 2625/2752 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1159 transition count 2611
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1159 transition count 2611
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 41 place count 1146 transition count 2598
Iterating global reduction 0 with 13 rules applied. Total rules applied 54 place count 1146 transition count 2598
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 67 place count 1133 transition count 2585
Iterating global reduction 0 with 13 rules applied. Total rules applied 80 place count 1133 transition count 2585
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 91 place count 1122 transition count 2541
Iterating global reduction 0 with 11 rules applied. Total rules applied 102 place count 1122 transition count 2541
Applied a total of 102 rules in 250 ms. Remains 1122 /1173 variables (removed 51) and now considering 2541/2625 (removed 84) transitions.
[2023-03-23 07:23:56] [INFO ] Flow matrix only has 2269 transitions (discarded 272 similar events)
// Phase 1: matrix 2269 rows 1122 cols
[2023-03-23 07:23:56] [INFO ] Computed 41 place invariants in 28 ms
[2023-03-23 07:23:57] [INFO ] Implicit Places using invariants in 880 ms returned []
[2023-03-23 07:23:57] [INFO ] Flow matrix only has 2269 transitions (discarded 272 similar events)
[2023-03-23 07:23:57] [INFO ] Invariant cache hit.
[2023-03-23 07:23:58] [INFO ] State equation strengthened by 830 read => feed constraints.
[2023-03-23 07:24:06] [INFO ] Implicit Places using invariants and state equation in 8942 ms returned []
Implicit Place search using SMT with State Equation took 9825 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1122/1242 places, 2541/2752 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 11280 ms. Remains : 1122/1242 places, 2541/2752 transitions.
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s1094 1), p1:(OR (LT s114 1) (LT s1104 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1250 ms.
Product exploration explored 100000 steps with 50000 reset in 1248 ms.
Computed a total of 290 stabilizing places and 908 stable transitions
Computed a total of 290 stabilizing places and 908 stable transitions
Detected a total of 290/1122 stabilizing places and 908/2541 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 111 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-02 finished in 14057 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((G(F(p0))||G((p1 U p2)))))'
Support contains 7 out of 1242 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1242/1242 places, 2752/2752 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 1242 transition count 2737
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 1227 transition count 2737
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 30 place count 1227 transition count 2721
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 62 place count 1211 transition count 2721
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 78 place count 1195 transition count 2684
Iterating global reduction 2 with 16 rules applied. Total rules applied 94 place count 1195 transition count 2684
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 94 place count 1195 transition count 2683
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 96 place count 1194 transition count 2683
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 105 place count 1185 transition count 2650
Iterating global reduction 2 with 9 rules applied. Total rules applied 114 place count 1185 transition count 2650
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 115 place count 1184 transition count 2646
Iterating global reduction 2 with 1 rules applied. Total rules applied 116 place count 1184 transition count 2646
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 172 place count 1156 transition count 2618
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 178 place count 1150 transition count 2612
Iterating global reduction 2 with 6 rules applied. Total rules applied 184 place count 1150 transition count 2612
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 190 place count 1144 transition count 2588
Iterating global reduction 2 with 6 rules applied. Total rules applied 196 place count 1144 transition count 2588
Applied a total of 196 rules in 417 ms. Remains 1144 /1242 variables (removed 98) and now considering 2588/2752 (removed 164) transitions.
[2023-03-23 07:24:09] [INFO ] Flow matrix only has 2316 transitions (discarded 272 similar events)
// Phase 1: matrix 2316 rows 1144 cols
[2023-03-23 07:24:09] [INFO ] Computed 58 place invariants in 33 ms
[2023-03-23 07:24:10] [INFO ] Implicit Places using invariants in 955 ms returned [4, 10, 12, 306, 318, 519, 550, 567, 577, 578, 590, 630, 720, 754]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 957 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1130/1242 places, 2588/2752 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1123 transition count 2581
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1123 transition count 2581
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 1116 transition count 2574
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 1116 transition count 2574
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 1112 transition count 2558
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 1112 transition count 2558
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 44 place count 1108 transition count 2554
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 48 place count 1104 transition count 2550
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 1104 transition count 2550
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 57 place count 1099 transition count 2530
Iterating global reduction 0 with 5 rules applied. Total rules applied 62 place count 1099 transition count 2530
Applied a total of 62 rules in 376 ms. Remains 1099 /1130 variables (removed 31) and now considering 2530/2588 (removed 58) transitions.
[2023-03-23 07:24:10] [INFO ] Flow matrix only has 2258 transitions (discarded 272 similar events)
// Phase 1: matrix 2258 rows 1099 cols
[2023-03-23 07:24:10] [INFO ] Computed 44 place invariants in 26 ms
[2023-03-23 07:24:11] [INFO ] Implicit Places using invariants in 903 ms returned []
[2023-03-23 07:24:11] [INFO ] Flow matrix only has 2258 transitions (discarded 272 similar events)
[2023-03-23 07:24:11] [INFO ] Invariant cache hit.
[2023-03-23 07:24:12] [INFO ] State equation strengthened by 845 read => feed constraints.
[2023-03-23 07:24:20] [INFO ] Implicit Places using invariants and state equation in 8507 ms returned []
Implicit Place search using SMT with State Equation took 9411 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1099/1242 places, 2530/2752 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11162 ms. Remains : 1099/1242 places, 2530/2752 transitions.
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s642 1) (LT s1080 1) (AND (GEQ s658 1) (GEQ s683 1))), p2:(AND (GEQ s1057 1) (GEQ s1071 1)), p1:(GEQ s585 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 3365 reset in 561 ms.
Product exploration explored 100000 steps with 3364 reset in 548 ms.
Computed a total of 284 stabilizing places and 914 stable transitions
Computed a total of 284 stabilizing places and 914 stable transitions
Detected a total of 284/1099 stabilizing places and 914/2530 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 589 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 338 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 66 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 66 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-23 07:24:22] [INFO ] Flow matrix only has 2258 transitions (discarded 272 similar events)
[2023-03-23 07:24:22] [INFO ] Invariant cache hit.
[2023-03-23 07:24:22] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned sat
[2023-03-23 07:24:22] [INFO ] [Real]Absence check using 31 positive and 13 generalized place invariants in 3 ms returned sat
[2023-03-23 07:24:22] [INFO ] After 153ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-23 07:24:22] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2023-03-23 07:24:22] [INFO ] [Nat]Absence check using 31 positive and 13 generalized place invariants in 2 ms returned sat
[2023-03-23 07:24:22] [INFO ] After 156ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (G (NOT (AND (NOT p2) p1 (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p1) (NOT p0)))]
Knowledge based reduction with 12 factoid took 428 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 1099 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1099/1099 places, 2530/2530 transitions.
Applied a total of 0 rules in 76 ms. Remains 1099 /1099 variables (removed 0) and now considering 2530/2530 (removed 0) transitions.
[2023-03-23 07:24:23] [INFO ] Flow matrix only has 2258 transitions (discarded 272 similar events)
[2023-03-23 07:24:23] [INFO ] Invariant cache hit.
[2023-03-23 07:24:24] [INFO ] Implicit Places using invariants in 847 ms returned []
[2023-03-23 07:24:24] [INFO ] Flow matrix only has 2258 transitions (discarded 272 similar events)
[2023-03-23 07:24:24] [INFO ] Invariant cache hit.
[2023-03-23 07:24:25] [INFO ] State equation strengthened by 845 read => feed constraints.
[2023-03-23 07:24:32] [INFO ] Implicit Places using invariants and state equation in 8344 ms returned []
Implicit Place search using SMT with State Equation took 9197 ms to find 0 implicit places.
[2023-03-23 07:24:32] [INFO ] Redundant transitions in 129 ms returned []
[2023-03-23 07:24:32] [INFO ] Flow matrix only has 2258 transitions (discarded 272 similar events)
[2023-03-23 07:24:32] [INFO ] Invariant cache hit.
[2023-03-23 07:24:33] [INFO ] Dead Transitions using invariants and state equation in 998 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10415 ms. Remains : 1099/1099 places, 2530/2530 transitions.
Computed a total of 284 stabilizing places and 914 stable transitions
Computed a total of 284 stabilizing places and 914 stable transitions
Detected a total of 284/1099 stabilizing places and 914/2530 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 119 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 335 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 66 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Finished probabilistic random walk after 20681 steps, run visited all 1 properties in 753 ms. (steps per millisecond=27 )
Probabilistic random walk after 20681 steps, saw 8854 distinct states, run finished after 756 ms. (steps per millisecond=27 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 144 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3367 reset in 566 ms.
Product exploration explored 100000 steps with 3363 reset in 551 ms.
Built C files in :
/tmp/ltsmin6641341565288028890
[2023-03-23 07:24:36] [INFO ] Too many transitions (2530) to apply POR reductions. Disabling POR matrices.
[2023-03-23 07:24:36] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6641341565288028890
Running compilation step : cd /tmp/ltsmin6641341565288028890;'/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/ltsmin6641341565288028890;'/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/ltsmin6641341565288028890;'/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 1099 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1099/1099 places, 2530/2530 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1099 transition count 2529
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1098 transition count 2529
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 1098 transition count 2528
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 1097 transition count 2528
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 6 place count 1095 transition count 2526
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 1095 transition count 2526
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 10 place count 1093 transition count 2518
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 1093 transition count 2518
Applied a total of 12 rules in 190 ms. Remains 1093 /1099 variables (removed 6) and now considering 2518/2530 (removed 12) transitions.
[2023-03-23 07:24:39] [INFO ] Flow matrix only has 2246 transitions (discarded 272 similar events)
// Phase 1: matrix 2246 rows 1093 cols
[2023-03-23 07:24:39] [INFO ] Computed 44 place invariants in 23 ms
[2023-03-23 07:24:40] [INFO ] Implicit Places using invariants in 881 ms returned [584, 1008]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 883 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1091/1099 places, 2518/2530 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1090 transition count 2517
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1090 transition count 2517
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1089 transition count 2516
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1089 transition count 2516
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1088 transition count 2512
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1088 transition count 2512
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 1087 transition count 2511
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1086 transition count 2510
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1086 transition count 2510
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1085 transition count 2506
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1085 transition count 2506
Applied a total of 12 rules in 363 ms. Remains 1085 /1091 variables (removed 6) and now considering 2506/2518 (removed 12) transitions.
[2023-03-23 07:24:40] [INFO ] Flow matrix only has 2234 transitions (discarded 272 similar events)
// Phase 1: matrix 2234 rows 1085 cols
[2023-03-23 07:24:40] [INFO ] Computed 42 place invariants in 28 ms
[2023-03-23 07:24:41] [INFO ] Implicit Places using invariants in 855 ms returned []
[2023-03-23 07:24:41] [INFO ] Flow matrix only has 2234 transitions (discarded 272 similar events)
[2023-03-23 07:24:41] [INFO ] Invariant cache hit.
[2023-03-23 07:24:42] [INFO ] State equation strengthened by 833 read => feed constraints.
[2023-03-23 07:24:50] [INFO ] Implicit Places using invariants and state equation in 8626 ms returned [1078]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 9486 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1084/1099 places, 2506/2530 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1084 transition count 2505
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1083 transition count 2505
Applied a total of 2 rules in 83 ms. Remains 1083 /1084 variables (removed 1) and now considering 2505/2506 (removed 1) transitions.
[2023-03-23 07:24:50] [INFO ] Flow matrix only has 2233 transitions (discarded 272 similar events)
// Phase 1: matrix 2233 rows 1083 cols
[2023-03-23 07:24:50] [INFO ] Computed 41 place invariants in 23 ms
[2023-03-23 07:24:51] [INFO ] Implicit Places using invariants in 855 ms returned []
[2023-03-23 07:24:51] [INFO ] Flow matrix only has 2233 transitions (discarded 272 similar events)
[2023-03-23 07:24:51] [INFO ] Invariant cache hit.
[2023-03-23 07:24:52] [INFO ] State equation strengthened by 833 read => feed constraints.
[2023-03-23 07:25:00] [INFO ] Implicit Places using invariants and state equation in 9152 ms returned []
Implicit Place search using SMT with State Equation took 10023 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1083/1099 places, 2505/2530 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 21030 ms. Remains : 1083/1099 places, 2505/2530 transitions.
Built C files in :
/tmp/ltsmin2278068052232772931
[2023-03-23 07:25:00] [INFO ] Too many transitions (2505) to apply POR reductions. Disabling POR matrices.
[2023-03-23 07:25:00] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2278068052232772931
Running compilation step : cd /tmp/ltsmin2278068052232772931;'/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/ltsmin2278068052232772931;'/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/ltsmin2278068052232772931;'/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-23 07:25:03] [INFO ] Flatten gal took : 73 ms
[2023-03-23 07:25:03] [INFO ] Flatten gal took : 68 ms
[2023-03-23 07:25:04] [INFO ] Time to serialize gal into /tmp/LTL15501448563180757882.gal : 31 ms
[2023-03-23 07:25:04] [INFO ] Time to serialize properties into /tmp/LTL18072787168739984213.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/LTL15501448563180757882.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5632600220650158637.hoa' '-atoms' '/tmp/LTL18072787168739984213.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/LTL18072787168739984213.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5632600220650158637.hoa
Detected timeout of ITS tools.
[2023-03-23 07:25:19] [INFO ] Flatten gal took : 69 ms
[2023-03-23 07:25:19] [INFO ] Flatten gal took : 64 ms
[2023-03-23 07:25:19] [INFO ] Time to serialize gal into /tmp/LTL5424462772175398185.gal : 12 ms
[2023-03-23 07:25:19] [INFO ] Time to serialize properties into /tmp/LTL2402654815837146543.ltl : 17 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/LTL5424462772175398185.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2402654815837146543.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 : !((F((G(F("(((Node12ManageTheCrashOfNode3<1)||(Lx2IsAtTheLeftExtremityOfTheLeafSet<1))||((Node12HasAskedItsLeafSetToLx1ToReplaceNode7>...343
Formula 0 simplified : G(FG!"(((Node12ManageTheCrashOfNode3<1)||(Lx2IsAtTheLeftExtremityOfTheLeafSet<1))||((Node12HasAskedItsLeafSetToLx1ToReplaceNode7>=1)...334
Detected timeout of ITS tools.
[2023-03-23 07:25:34] [INFO ] Flatten gal took : 60 ms
[2023-03-23 07:25:34] [INFO ] Applying decomposition
[2023-03-23 07:25:34] [INFO ] Flatten gal took : 60 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/graph6002727800291722420.txt' '-o' '/tmp/graph6002727800291722420.bin' '-w' '/tmp/graph6002727800291722420.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6002727800291722420.bin' '-l' '-1' '-v' '-w' '/tmp/graph6002727800291722420.weights' '-q' '0' '-e' '0.001'
[2023-03-23 07:25:34] [INFO ] Decomposing Gal with order
[2023-03-23 07:25:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-23 07:25:35] [INFO ] Removed a total of 2272 redundant transitions.
[2023-03-23 07:25:35] [INFO ] Flatten gal took : 574 ms
[2023-03-23 07:25:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 1588 labels/synchronizations in 168 ms.
[2023-03-23 07:25:36] [INFO ] Time to serialize gal into /tmp/LTL11827126681742762479.gal : 55 ms
[2023-03-23 07:25:36] [INFO ] Time to serialize properties into /tmp/LTL6581185294270113283.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/LTL11827126681742762479.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6581185294270113283.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 : !((F((G(F("(((i2.i0.u88.Node12ManageTheCrashOfNode3<1)||(i2.i0.u153.Lx2IsAtTheLeftExtremityOfTheLeafSet<1))||((i2.i2.u150.Node12HasAsk...417
Formula 0 simplified : G(FG!"(((i2.i0.u88.Node12ManageTheCrashOfNode3<1)||(i2.i0.u153.Lx2IsAtTheLeftExtremityOfTheLeafSet<1))||((i2.i2.u150.Node12HasAskedI...408
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2366964064780818069
[2023-03-23 07:25:51] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2366964064780818069
Running compilation step : cd /tmp/ltsmin2366964064780818069;'/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/ltsmin2366964064780818069;'/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/ltsmin2366964064780818069;'/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 MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-03 finished in 105006 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(((!p1 U (p2||G(!p1)))&&p0))))'
Support contains 7 out of 1242 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1242/1242 places, 2752/2752 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1218 transition count 2707
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1218 transition count 2707
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 65 place count 1201 transition count 2666
Iterating global reduction 0 with 17 rules applied. Total rules applied 82 place count 1201 transition count 2666
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 91 place count 1192 transition count 2630
Iterating global reduction 0 with 9 rules applied. Total rules applied 100 place count 1192 transition count 2630
Applied a total of 100 rules in 194 ms. Remains 1192 /1242 variables (removed 50) and now considering 2630/2752 (removed 122) transitions.
[2023-03-23 07:25:54] [INFO ] Flow matrix only has 2358 transitions (discarded 272 similar events)
// Phase 1: matrix 2358 rows 1192 cols
[2023-03-23 07:25:54] [INFO ] Computed 58 place invariants in 57 ms
[2023-03-23 07:25:55] [INFO ] Implicit Places using invariants in 1020 ms returned [4, 11, 15, 326, 338, 545, 578, 597, 607, 608, 623, 643, 663, 702, 753, 787, 1086]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 1025 ms to find 17 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1175/1242 places, 2630/2752 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1161 transition count 2616
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1161 transition count 2616
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 42 place count 1147 transition count 2602
Iterating global reduction 0 with 14 rules applied. Total rules applied 56 place count 1147 transition count 2602
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 70 place count 1133 transition count 2588
Iterating global reduction 0 with 14 rules applied. Total rules applied 84 place count 1133 transition count 2588
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 96 place count 1121 transition count 2540
Iterating global reduction 0 with 12 rules applied. Total rules applied 108 place count 1121 transition count 2540
Applied a total of 108 rules in 232 ms. Remains 1121 /1175 variables (removed 54) and now considering 2540/2630 (removed 90) transitions.
[2023-03-23 07:25:55] [INFO ] Flow matrix only has 2268 transitions (discarded 272 similar events)
// Phase 1: matrix 2268 rows 1121 cols
[2023-03-23 07:25:55] [INFO ] Computed 41 place invariants in 19 ms
[2023-03-23 07:25:56] [INFO ] Implicit Places using invariants in 879 ms returned []
[2023-03-23 07:25:56] [INFO ] Flow matrix only has 2268 transitions (discarded 272 similar events)
[2023-03-23 07:25:56] [INFO ] Invariant cache hit.
[2023-03-23 07:25:57] [INFO ] State equation strengthened by 830 read => feed constraints.
[2023-03-23 07:26:05] [INFO ] Implicit Places using invariants and state equation in 9061 ms returned [1098]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 9943 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1120/1242 places, 2540/2752 transitions.
Applied a total of 0 rules in 42 ms. Remains 1120 /1120 variables (removed 0) and now considering 2540/2540 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 11437 ms. Remains : 1120/1242 places, 2540/2752 transitions.
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p2) p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (LT s623 1) (OR (LT s440 1) (LT s499 1))), p2:(AND (GEQ s954 1) (GEQ s1106 1) (NOT (AND (GEQ s952 1) (GEQ s1105 1)))), p1:(AND (GEQ s952 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2399 reset in 469 ms.
Product exploration explored 100000 steps with 2403 reset in 512 ms.
Computed a total of 288 stabilizing places and 907 stable transitions
Computed a total of 288 stabilizing places and 907 stable transitions
Detected a total of 288/1120 stabilizing places and 907/2540 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (OR (NOT p0) (AND (NOT p2) p1)))), (X (AND p0 (NOT p2) (NOT p1))), (X (X (NOT (OR (NOT p0) (AND (NOT p2) p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 370 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 239 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Finished Best-First random walk after 5750 steps, including 35 resets, run visited all 2 properties in 33 ms. (steps per millisecond=174 )
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (OR (NOT p0) (AND (NOT p2) p1)))), (X (AND p0 (NOT p2) (NOT p1))), (X (X (NOT (OR (NOT p0) (AND (NOT p2) p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (OR (NOT p0) (AND p1 (NOT p2)))), (F (AND p1 (NOT p2))), (F (NOT (AND p0 (NOT p1) (NOT p2))))]
Knowledge based reduction with 9 factoid took 407 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Support contains 7 out of 1120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1120/1120 places, 2540/2540 transitions.
Applied a total of 0 rules in 45 ms. Remains 1120 /1120 variables (removed 0) and now considering 2540/2540 (removed 0) transitions.
[2023-03-23 07:26:08] [INFO ] Flow matrix only has 2268 transitions (discarded 272 similar events)
// Phase 1: matrix 2268 rows 1120 cols
[2023-03-23 07:26:08] [INFO ] Computed 40 place invariants in 24 ms
[2023-03-23 07:26:09] [INFO ] Implicit Places using invariants in 866 ms returned []
[2023-03-23 07:26:09] [INFO ] Flow matrix only has 2268 transitions (discarded 272 similar events)
[2023-03-23 07:26:09] [INFO ] Invariant cache hit.
[2023-03-23 07:26:10] [INFO ] State equation strengthened by 830 read => feed constraints.
[2023-03-23 07:26:18] [INFO ] Implicit Places using invariants and state equation in 8889 ms returned []
Implicit Place search using SMT with State Equation took 9758 ms to find 0 implicit places.
[2023-03-23 07:26:18] [INFO ] Flow matrix only has 2268 transitions (discarded 272 similar events)
[2023-03-23 07:26:18] [INFO ] Invariant cache hit.
[2023-03-23 07:26:19] [INFO ] Dead Transitions using invariants and state equation in 1006 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10809 ms. Remains : 1120/1120 places, 2540/2540 transitions.
Computed a total of 288 stabilizing places and 907 stable transitions
Computed a total of 288 stabilizing places and 907 stable transitions
Detected a total of 288/1120 stabilizing places and 907/2540 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (OR (NOT p0) (AND p1 (NOT p2))))), (X (AND p0 (NOT p1) (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (OR (NOT p0) (AND p1 (NOT p2)))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 1439 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Finished random walk after 9700 steps, including 231 resets, run visited all 4 properties in 159 ms. (steps per millisecond=61 )
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (OR (NOT p0) (AND p1 (NOT p2))))), (X (AND p0 (NOT p1) (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (OR (NOT p0) (AND p1 (NOT p2)))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p1)))), (F (OR (NOT p0) (AND (NOT p2) p1))), (F (AND (NOT p2) p1)), (F (NOT (AND p0 (NOT p2) (NOT p1))))]
Knowledge based reduction with 9 factoid took 395 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 2405 reset in 485 ms.
Product exploration explored 100000 steps with 2400 reset in 505 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Support contains 7 out of 1120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1120/1120 places, 2540/2540 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 1120 transition count 2540
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 17 place count 1120 transition count 2540
Deduced a syphon composed of 25 places in 1 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 25 place count 1120 transition count 2540
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 34 place count 1111 transition count 2531
Deduced a syphon composed of 16 places in 1 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 43 place count 1111 transition count 2531
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 32 places in 1 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 59 place count 1111 transition count 2531
Deduced a syphon composed of 32 places in 1 ms
Applied a total of 59 rules in 371 ms. Remains 1111 /1120 variables (removed 9) and now considering 2531/2540 (removed 9) transitions.
[2023-03-23 07:26:23] [INFO ] Redundant transitions in 78 ms returned []
[2023-03-23 07:26:23] [INFO ] Flow matrix only has 2259 transitions (discarded 272 similar events)
// Phase 1: matrix 2259 rows 1111 cols
[2023-03-23 07:26:23] [INFO ] Computed 40 place invariants in 30 ms
[2023-03-23 07:26:24] [INFO ] Dead Transitions using invariants and state equation in 1059 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1111/1120 places, 2531/2540 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1523 ms. Remains : 1111/1120 places, 2531/2540 transitions.
Built C files in :
/tmp/ltsmin7989915868820060347
[2023-03-23 07:26:24] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7989915868820060347
Running compilation step : cd /tmp/ltsmin7989915868820060347;'/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/ltsmin7989915868820060347;'/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/ltsmin7989915868820060347;'/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 7 out of 1120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1120/1120 places, 2540/2540 transitions.
Applied a total of 0 rules in 49 ms. Remains 1120 /1120 variables (removed 0) and now considering 2540/2540 (removed 0) transitions.
[2023-03-23 07:26:27] [INFO ] Flow matrix only has 2268 transitions (discarded 272 similar events)
// Phase 1: matrix 2268 rows 1120 cols
[2023-03-23 07:26:27] [INFO ] Computed 40 place invariants in 23 ms
[2023-03-23 07:26:28] [INFO ] Implicit Places using invariants in 854 ms returned []
[2023-03-23 07:26:28] [INFO ] Flow matrix only has 2268 transitions (discarded 272 similar events)
[2023-03-23 07:26:28] [INFO ] Invariant cache hit.
[2023-03-23 07:26:29] [INFO ] State equation strengthened by 830 read => feed constraints.
[2023-03-23 07:26:37] [INFO ] Implicit Places using invariants and state equation in 8853 ms returned []
Implicit Place search using SMT with State Equation took 9711 ms to find 0 implicit places.
[2023-03-23 07:26:37] [INFO ] Flow matrix only has 2268 transitions (discarded 272 similar events)
[2023-03-23 07:26:37] [INFO ] Invariant cache hit.
[2023-03-23 07:26:38] [INFO ] Dead Transitions using invariants and state equation in 939 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10700 ms. Remains : 1120/1120 places, 2540/2540 transitions.
Built C files in :
/tmp/ltsmin12260695342572743389
[2023-03-23 07:26:38] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12260695342572743389
Running compilation step : cd /tmp/ltsmin12260695342572743389;'/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/ltsmin12260695342572743389;'/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/ltsmin12260695342572743389;'/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-23 07:26:41] [INFO ] Flatten gal took : 63 ms
[2023-03-23 07:26:41] [INFO ] Flatten gal took : 66 ms
[2023-03-23 07:26:41] [INFO ] Time to serialize gal into /tmp/LTL5893772201869612431.gal : 9 ms
[2023-03-23 07:26:41] [INFO ] Time to serialize properties into /tmp/LTL15346709627625593327.prop : 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/LTL5893772201869612431.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9786807857897855036.hoa' '-atoms' '/tmp/LTL15346709627625593327.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...318
Loading property file /tmp/LTL15346709627625593327.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9786807857897855036.hoa
Detected timeout of ITS tools.
[2023-03-23 07:26:56] [INFO ] Flatten gal took : 60 ms
[2023-03-23 07:26:56] [INFO ] Flatten gal took : 60 ms
[2023-03-23 07:26:56] [INFO ] Time to serialize gal into /tmp/LTL3354030925614944119.gal : 9 ms
[2023-03-23 07:26:56] [INFO ] Time to serialize properties into /tmp/LTL12535928367816526580.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/LTL3354030925614944119.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12535928367816526580.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 : !((X(F((("(Node11IsNotifiedThatHeIsTheNewMaster<1)")&&((!("((Node15ManageTheCrashOfNode16>=1)&&(Rx1IsAtTheRightExtremityOfTheLeafSet>=...517
Formula 0 simplified : XG(!"((Node4ThinksNode6ShouldBeNodeMasterToReplaceNode8<1)||(NodesCanDetectThatNode6HasCrashed<1))" | !"(Node11IsNotifiedThatHeIsThe...414
Detected timeout of ITS tools.
[2023-03-23 07:27:12] [INFO ] Flatten gal took : 57 ms
[2023-03-23 07:27:12] [INFO ] Applying decomposition
[2023-03-23 07:27:12] [INFO ] Flatten gal took : 55 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/graph15552322329083381939.txt' '-o' '/tmp/graph15552322329083381939.bin' '-w' '/tmp/graph15552322329083381939.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph15552322329083381939.bin' '-l' '-1' '-v' '-w' '/tmp/graph15552322329083381939.weights' '-q' '0' '-e' '0.001'
[2023-03-23 07:27:12] [INFO ] Decomposing Gal with order
[2023-03-23 07:27:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-23 07:27:12] [INFO ] Removed a total of 2950 redundant transitions.
[2023-03-23 07:27:12] [INFO ] Flatten gal took : 161 ms
[2023-03-23 07:27:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 1138 labels/synchronizations in 47 ms.
[2023-03-23 07:27:12] [INFO ] Time to serialize gal into /tmp/LTL12592395343950422012.gal : 16 ms
[2023-03-23 07:27:12] [INFO ] Time to serialize properties into /tmp/LTL5202294133150852085.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/LTL12592395343950422012.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5202294133150852085.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((("(i9.u105.Node11IsNotifiedThatHeIsTheNewMaster<1)")&&((!("((i18.u157.Node15ManageTheCrashOfNode16>=1)&&(i18.u175.Rx1IsAtTheRi...613
Formula 0 simplified : XG(!"((i12.u80.Node4ThinksNode6ShouldBeNodeMasterToReplaceNode8<1)||(i9.u105.NodesCanDetectThatNode6HasCrashed<1))" | !"(i9.u105.Nod...492
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4404440765533765538
[2023-03-23 07:27:27] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4404440765533765538
Running compilation step : cd /tmp/ltsmin4404440765533765538;'/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/ltsmin4404440765533765538;'/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/ltsmin4404440765533765538;'/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 MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-04 finished in 96557 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(G(p0))))'
Support contains 2 out of 1242 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1242/1242 places, 2752/2752 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 1217 transition count 2703
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 1217 transition count 2703
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 67 place count 1200 transition count 2662
Iterating global reduction 0 with 17 rules applied. Total rules applied 84 place count 1200 transition count 2662
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 93 place count 1191 transition count 2626
Iterating global reduction 0 with 9 rules applied. Total rules applied 102 place count 1191 transition count 2626
Applied a total of 102 rules in 161 ms. Remains 1191 /1242 variables (removed 51) and now considering 2626/2752 (removed 126) transitions.
[2023-03-23 07:27:30] [INFO ] Flow matrix only has 2354 transitions (discarded 272 similar events)
// Phase 1: matrix 2354 rows 1191 cols
[2023-03-23 07:27:30] [INFO ] Computed 58 place invariants in 49 ms
[2023-03-23 07:27:31] [INFO ] Implicit Places using invariants in 1026 ms returned [4, 11, 15, 326, 338, 545, 578, 597, 608, 625, 645, 665, 704, 755, 789, 1085]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 1030 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1175/1242 places, 2626/2752 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1162 transition count 2613
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1162 transition count 2613
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 39 place count 1149 transition count 2600
Iterating global reduction 0 with 13 rules applied. Total rules applied 52 place count 1149 transition count 2600
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 65 place count 1136 transition count 2587
Iterating global reduction 0 with 13 rules applied. Total rules applied 78 place count 1136 transition count 2587
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 89 place count 1125 transition count 2543
Iterating global reduction 0 with 11 rules applied. Total rules applied 100 place count 1125 transition count 2543
Applied a total of 100 rules in 226 ms. Remains 1125 /1175 variables (removed 50) and now considering 2543/2626 (removed 83) transitions.
[2023-03-23 07:27:32] [INFO ] Flow matrix only has 2271 transitions (discarded 272 similar events)
// Phase 1: matrix 2271 rows 1125 cols
[2023-03-23 07:27:32] [INFO ] Computed 42 place invariants in 27 ms
[2023-03-23 07:27:33] [INFO ] Implicit Places using invariants in 906 ms returned []
[2023-03-23 07:27:33] [INFO ] Flow matrix only has 2271 transitions (discarded 272 similar events)
[2023-03-23 07:27:33] [INFO ] Invariant cache hit.
[2023-03-23 07:27:34] [INFO ] State equation strengthened by 830 read => feed constraints.
[2023-03-23 07:27:42] [INFO ] Implicit Places using invariants and state equation in 9338 ms returned [1101]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 10250 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1124/1242 places, 2543/2752 transitions.
Applied a total of 0 rules in 42 ms. Remains 1124 /1124 variables (removed 0) and now considering 2543/2543 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 11710 ms. Remains : 1124/1242 places, 2543/2752 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (LT s588 1) (LT s595 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 8448 steps with 202 reset in 38 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-06 finished in 11896 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((X(p0)||G(p1))))'
Support contains 3 out of 1242 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1242/1242 places, 2752/2752 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1218 transition count 2704
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1218 transition count 2704
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 64 place count 1202 transition count 2664
Iterating global reduction 0 with 16 rules applied. Total rules applied 80 place count 1202 transition count 2664
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 88 place count 1194 transition count 2632
Iterating global reduction 0 with 8 rules applied. Total rules applied 96 place count 1194 transition count 2632
Applied a total of 96 rules in 184 ms. Remains 1194 /1242 variables (removed 48) and now considering 2632/2752 (removed 120) transitions.
[2023-03-23 07:27:42] [INFO ] Flow matrix only has 2360 transitions (discarded 272 similar events)
// Phase 1: matrix 2360 rows 1194 cols
[2023-03-23 07:27:42] [INFO ] Computed 58 place invariants in 26 ms
[2023-03-23 07:27:43] [INFO ] Implicit Places using invariants in 1004 ms returned [4, 15, 329, 341, 548, 581, 600, 610, 628, 648, 668, 707, 758, 792, 1088]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 1006 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1179/1242 places, 2632/2752 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1167 transition count 2620
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1167 transition count 2620
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 36 place count 1155 transition count 2608
Iterating global reduction 0 with 12 rules applied. Total rules applied 48 place count 1155 transition count 2608
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 60 place count 1143 transition count 2596
Iterating global reduction 0 with 12 rules applied. Total rules applied 72 place count 1143 transition count 2596
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 82 place count 1133 transition count 2556
Iterating global reduction 0 with 10 rules applied. Total rules applied 92 place count 1133 transition count 2556
Applied a total of 92 rules in 223 ms. Remains 1133 /1179 variables (removed 46) and now considering 2556/2632 (removed 76) transitions.
[2023-03-23 07:27:44] [INFO ] Flow matrix only has 2284 transitions (discarded 272 similar events)
// Phase 1: matrix 2284 rows 1133 cols
[2023-03-23 07:27:44] [INFO ] Computed 43 place invariants in 28 ms
[2023-03-23 07:27:44] [INFO ] Implicit Places using invariants in 900 ms returned []
[2023-03-23 07:27:44] [INFO ] Flow matrix only has 2284 transitions (discarded 272 similar events)
[2023-03-23 07:27:44] [INFO ] Invariant cache hit.
[2023-03-23 07:27:45] [INFO ] State equation strengthened by 836 read => feed constraints.
[2023-03-23 07:27:55] [INFO ] Implicit Places using invariants and state equation in 10119 ms returned []
Implicit Place search using SMT with State Equation took 11021 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1133/1242 places, 2556/2752 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 12434 ms. Remains : 1133/1242 places, 2556/2752 transitions.
Stuttering acceptance computed with spot in 175 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(LT s21 1), p0:(OR (LT s599 1) (LT s602 1))], 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 2394 reset in 473 ms.
Product exploration explored 100000 steps with 2395 reset in 506 ms.
Computed a total of 301 stabilizing places and 923 stable transitions
Computed a total of 301 stabilizing places and 923 stable transitions
Detected a total of 301/1133 stabilizing places and 923/2556 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), true, (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 419 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 239 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10000 steps, including 61 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 61 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-23 07:27:57] [INFO ] Flow matrix only has 2284 transitions (discarded 272 similar events)
[2023-03-23 07:27:57] [INFO ] Invariant cache hit.
[2023-03-23 07:27:57] [INFO ] [Real]Absence check using 31 positive place invariants in 23 ms returned sat
[2023-03-23 07:27:57] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 20 ms returned sat
[2023-03-23 07:27:57] [INFO ] After 231ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-23 07:27:57] [INFO ] [Nat]Absence check using 31 positive place invariants in 20 ms returned sat
[2023-03-23 07:27:57] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 10 ms returned sat
[2023-03-23 07:27:58] [INFO ] After 760ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-23 07:27:58] [INFO ] State equation strengthened by 836 read => feed constraints.
[2023-03-23 07:27:58] [INFO ] After 200ms SMT Verify possible using 836 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2023-03-23 07:27:59] [INFO ] Deduced a trap composed of 305 places in 454 ms of which 1 ms to minimize.
[2023-03-23 07:27:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 583 ms
[2023-03-23 07:27:59] [INFO ] After 946ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 142 ms.
[2023-03-23 07:27:59] [INFO ] After 2066ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 1133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1133/1133 places, 2556/2556 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 1133 transition count 2542
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 1119 transition count 2542
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 28 place count 1119 transition count 2534
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 44 place count 1111 transition count 2534
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 84 place count 1091 transition count 2514
Free-agglomeration rule (complex) applied 135 times.
Iterating global reduction 2 with 135 rules applied. Total rules applied 219 place count 1091 transition count 3177
Reduce places removed 135 places and 0 transitions.
Iterating post reduction 2 with 135 rules applied. Total rules applied 354 place count 956 transition count 3177
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 355 place count 956 transition count 3177
Applied a total of 355 rules in 338 ms. Remains 956 /1133 variables (removed 177) and now considering 3177/2556 (removed -621) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 338 ms. Remains : 956/1133 places, 3177/2556 transitions.
Incomplete random walk after 10000 steps, including 426 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 45 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Finished probabilistic random walk after 2559 steps, run visited all 2 properties in 103 ms. (steps per millisecond=24 )
Probabilistic random walk after 2559 steps, saw 1166 distinct states, run finished after 104 ms. (steps per millisecond=24 ) properties seen :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), true, (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (AND p1 (NOT p0))), (F (NOT p0)), (F (NOT (AND p1 p0))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 16 factoid took 557 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 156 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 3 out of 1133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1133/1133 places, 2556/2556 transitions.
Applied a total of 0 rules in 44 ms. Remains 1133 /1133 variables (removed 0) and now considering 2556/2556 (removed 0) transitions.
[2023-03-23 07:28:01] [INFO ] Flow matrix only has 2284 transitions (discarded 272 similar events)
[2023-03-23 07:28:01] [INFO ] Invariant cache hit.
[2023-03-23 07:28:02] [INFO ] Implicit Places using invariants in 896 ms returned []
[2023-03-23 07:28:02] [INFO ] Flow matrix only has 2284 transitions (discarded 272 similar events)
[2023-03-23 07:28:02] [INFO ] Invariant cache hit.
[2023-03-23 07:28:02] [INFO ] State equation strengthened by 836 read => feed constraints.
[2023-03-23 07:28:12] [INFO ] Implicit Places using invariants and state equation in 9942 ms returned []
Implicit Place search using SMT with State Equation took 10841 ms to find 0 implicit places.
[2023-03-23 07:28:12] [INFO ] Flow matrix only has 2284 transitions (discarded 272 similar events)
[2023-03-23 07:28:12] [INFO ] Invariant cache hit.
[2023-03-23 07:28:13] [INFO ] Dead Transitions using invariants and state equation in 967 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11854 ms. Remains : 1133/1133 places, 2556/2556 transitions.
Computed a total of 301 stabilizing places and 923 stable transitions
Computed a total of 301 stabilizing places and 923 stable transitions
Detected a total of 301/1133 stabilizing places and 923/2556 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (AND p0 p1)), (X (X p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 408 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 792 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 239 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :3
Running SMT prover for 1 properties.
[2023-03-23 07:28:14] [INFO ] Flow matrix only has 2284 transitions (discarded 272 similar events)
[2023-03-23 07:28:14] [INFO ] Invariant cache hit.
[2023-03-23 07:28:14] [INFO ] [Real]Absence check using 31 positive place invariants in 22 ms returned sat
[2023-03-23 07:28:14] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 10 ms returned sat
[2023-03-23 07:28:15] [INFO ] After 910ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 07:28:15] [INFO ] [Nat]Absence check using 31 positive place invariants in 17 ms returned sat
[2023-03-23 07:28:15] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 13 ms returned sat
[2023-03-23 07:28:16] [INFO ] After 698ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 07:28:16] [INFO ] State equation strengthened by 836 read => feed constraints.
[2023-03-23 07:28:16] [INFO ] After 146ms SMT Verify possible using 836 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 07:28:17] [INFO ] Deduced a trap composed of 305 places in 450 ms of which 4 ms to minimize.
[2023-03-23 07:28:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 577 ms
[2023-03-23 07:28:17] [INFO ] After 780ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 68 ms.
[2023-03-23 07:28:17] [INFO ] After 1724ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 1133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1133/1133 places, 2556/2556 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 1133 transition count 2541
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 1118 transition count 2541
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 30 place count 1118 transition count 2533
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 46 place count 1110 transition count 2533
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 86 place count 1090 transition count 2513
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 87 place count 1089 transition count 2512
Iterating global reduction 2 with 1 rules applied. Total rules applied 88 place count 1089 transition count 2512
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 89 place count 1088 transition count 2508
Iterating global reduction 2 with 1 rules applied. Total rules applied 90 place count 1088 transition count 2508
Free-agglomeration rule (complex) applied 134 times.
Iterating global reduction 2 with 134 rules applied. Total rules applied 224 place count 1088 transition count 3175
Reduce places removed 134 places and 0 transitions.
Iterating post reduction 2 with 134 rules applied. Total rules applied 358 place count 954 transition count 3175
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 359 place count 954 transition count 3175
Applied a total of 359 rules in 390 ms. Remains 954 /1133 variables (removed 179) and now considering 3175/2556 (removed -619) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 390 ms. Remains : 954/1133 places, 3175/2556 transitions.
Incomplete random walk after 10000 steps, including 426 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2557 steps, run visited all 1 properties in 92 ms. (steps per millisecond=27 )
Probabilistic random walk after 2557 steps, saw 1165 distinct states, run finished after 93 ms. (steps per millisecond=27 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (AND p0 p1)), (X (X p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 10 factoid took 505 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 668 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 191 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 2395 reset in 434 ms.
Product exploration explored 100000 steps with 2392 reset in 443 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 174 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 3 out of 1133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1133/1133 places, 2556/2556 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 1133 transition count 2556
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 14 place count 1133 transition count 2557
Deduced a syphon composed of 22 places in 1 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 22 place count 1133 transition count 2557
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 28 place count 1127 transition count 2551
Deduced a syphon composed of 16 places in 2 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 34 place count 1127 transition count 2551
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 36 places in 1 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 54 place count 1127 transition count 2551
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 1124 transition count 2548
Deduced a syphon composed of 33 places in 1 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 1124 transition count 2548
Deduced a syphon composed of 33 places in 1 ms
Applied a total of 60 rules in 259 ms. Remains 1124 /1133 variables (removed 9) and now considering 2548/2556 (removed 8) transitions.
[2023-03-23 07:28:20] [INFO ] Redundant transitions in 77 ms returned []
[2023-03-23 07:28:20] [INFO ] Flow matrix only has 2276 transitions (discarded 272 similar events)
// Phase 1: matrix 2276 rows 1124 cols
[2023-03-23 07:28:20] [INFO ] Computed 43 place invariants in 32 ms
[2023-03-23 07:28:21] [INFO ] Dead Transitions using invariants and state equation in 1046 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1124/1133 places, 2548/2556 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1394 ms. Remains : 1124/1133 places, 2548/2556 transitions.
Built C files in :
/tmp/ltsmin12148323952033856891
[2023-03-23 07:28:22] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12148323952033856891
Running compilation step : cd /tmp/ltsmin12148323952033856891;'/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/ltsmin12148323952033856891;'/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/ltsmin12148323952033856891;'/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 3 out of 1133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1133/1133 places, 2556/2556 transitions.
Applied a total of 0 rules in 44 ms. Remains 1133 /1133 variables (removed 0) and now considering 2556/2556 (removed 0) transitions.
[2023-03-23 07:28:25] [INFO ] Flow matrix only has 2284 transitions (discarded 272 similar events)
// Phase 1: matrix 2284 rows 1133 cols
[2023-03-23 07:28:25] [INFO ] Computed 43 place invariants in 27 ms
[2023-03-23 07:28:25] [INFO ] Implicit Places using invariants in 891 ms returned []
[2023-03-23 07:28:25] [INFO ] Flow matrix only has 2284 transitions (discarded 272 similar events)
[2023-03-23 07:28:25] [INFO ] Invariant cache hit.
[2023-03-23 07:28:26] [INFO ] State equation strengthened by 836 read => feed constraints.
[2023-03-23 07:28:35] [INFO ] Implicit Places using invariants and state equation in 9881 ms returned []
Implicit Place search using SMT with State Equation took 10774 ms to find 0 implicit places.
[2023-03-23 07:28:35] [INFO ] Flow matrix only has 2284 transitions (discarded 272 similar events)
[2023-03-23 07:28:35] [INFO ] Invariant cache hit.
[2023-03-23 07:28:36] [INFO ] Dead Transitions using invariants and state equation in 1024 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11843 ms. Remains : 1133/1133 places, 2556/2556 transitions.
Built C files in :
/tmp/ltsmin6954999445550175839
[2023-03-23 07:28:36] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6954999445550175839
Running compilation step : cd /tmp/ltsmin6954999445550175839;'/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/ltsmin6954999445550175839;'/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/ltsmin6954999445550175839;'/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-23 07:28:40] [INFO ] Flatten gal took : 58 ms
[2023-03-23 07:28:40] [INFO ] Flatten gal took : 58 ms
[2023-03-23 07:28:40] [INFO ] Time to serialize gal into /tmp/LTL15628669795009761699.gal : 9 ms
[2023-03-23 07:28:40] [INFO ] Time to serialize properties into /tmp/LTL12854382425200709625.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/LTL15628669795009761699.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9394179578608703931.hoa' '-atoms' '/tmp/LTL12854382425200709625.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/LTL12854382425200709625.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9394179578608703931.hoa
Detected timeout of ITS tools.
[2023-03-23 07:28:55] [INFO ] Flatten gal took : 55 ms
[2023-03-23 07:28:55] [INFO ] Flatten gal took : 57 ms
[2023-03-23 07:28:55] [INFO ] Time to serialize gal into /tmp/LTL8193676612066084519.gal : 10 ms
[2023-03-23 07:28:55] [INFO ] Time to serialize properties into /tmp/LTL11009506663138835519.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/LTL8193676612066084519.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11009506663138835519.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((X("((Node9HasAskedItsLeafSetToRx3ToReplaceNode15<1)||(LeafSetOfRx3IsSentToNode9<1))"))||(G("(Node0HasTheLeafSetOfLx0ToReplaceNod...166
Formula 0 simplified : F(X!"((Node9HasAskedItsLeafSetToRx3ToReplaceNode15<1)||(LeafSetOfRx3IsSentToNode9<1))" & F!"(Node0HasTheLeafSetOfLx0ToReplaceNode2<1...158
Detected timeout of ITS tools.
[2023-03-23 07:29:10] [INFO ] Flatten gal took : 67 ms
[2023-03-23 07:29:10] [INFO ] Applying decomposition
[2023-03-23 07:29:10] [INFO ] Flatten gal took : 72 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/graph7584021816404330917.txt' '-o' '/tmp/graph7584021816404330917.bin' '-w' '/tmp/graph7584021816404330917.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph7584021816404330917.bin' '-l' '-1' '-v' '-w' '/tmp/graph7584021816404330917.weights' '-q' '0' '-e' '0.001'
[2023-03-23 07:29:10] [INFO ] Decomposing Gal with order
[2023-03-23 07:29:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-23 07:29:10] [INFO ] Removed a total of 3062 redundant transitions.
[2023-03-23 07:29:10] [INFO ] Flatten gal took : 153 ms
[2023-03-23 07:29:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 1839 labels/synchronizations in 102 ms.
[2023-03-23 07:29:11] [INFO ] Time to serialize gal into /tmp/LTL16462355994767652810.gal : 18 ms
[2023-03-23 07:29:11] [INFO ] Time to serialize properties into /tmp/LTL12939119537182073330.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/LTL16462355994767652810.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12939119537182073330.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((X("((i20.i2.u186.Node9HasAskedItsLeafSetToRx3ToReplaceNode15<1)||(i20.i2.u96.LeafSetOfRx3IsSentToNode9<1))"))||(G("(i6.i3.u182.N...200
Formula 0 simplified : F(X!"((i20.i2.u186.Node9HasAskedItsLeafSetToRx3ToReplaceNode15<1)||(i20.i2.u96.LeafSetOfRx3IsSentToNode9<1))" & F!"(i6.i3.u182.Node0...192
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12392424219125272350
[2023-03-23 07:29:26] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12392424219125272350
Running compilation step : cd /tmp/ltsmin12392424219125272350;'/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/ltsmin12392424219125272350;'/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/ltsmin12392424219125272350;'/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 MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-07 finished in 106563 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)&&X(X(X(G((!p0||G(p0))))))))'
Support contains 2 out of 1242 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1242/1242 places, 2752/2752 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 1216 transition count 2702
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 1216 transition count 2702
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 70 place count 1198 transition count 2657
Iterating global reduction 0 with 18 rules applied. Total rules applied 88 place count 1198 transition count 2657
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 97 place count 1189 transition count 2621
Iterating global reduction 0 with 9 rules applied. Total rules applied 106 place count 1189 transition count 2621
Applied a total of 106 rules in 186 ms. Remains 1189 /1242 variables (removed 53) and now considering 2621/2752 (removed 131) transitions.
[2023-03-23 07:29:29] [INFO ] Flow matrix only has 2349 transitions (discarded 272 similar events)
// Phase 1: matrix 2349 rows 1189 cols
[2023-03-23 07:29:29] [INFO ] Computed 58 place invariants in 33 ms
[2023-03-23 07:29:30] [INFO ] Implicit Places using invariants in 999 ms returned [4, 11, 15, 326, 338, 545, 578, 597, 607, 608, 623, 643, 663, 702, 753, 787, 1083]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 1000 ms to find 17 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1172/1242 places, 2621/2752 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1158 transition count 2607
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1158 transition count 2607
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 42 place count 1144 transition count 2593
Iterating global reduction 0 with 14 rules applied. Total rules applied 56 place count 1144 transition count 2593
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 70 place count 1130 transition count 2579
Iterating global reduction 0 with 14 rules applied. Total rules applied 84 place count 1130 transition count 2579
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 96 place count 1118 transition count 2531
Iterating global reduction 0 with 12 rules applied. Total rules applied 108 place count 1118 transition count 2531
Applied a total of 108 rules in 220 ms. Remains 1118 /1172 variables (removed 54) and now considering 2531/2621 (removed 90) transitions.
[2023-03-23 07:29:31] [INFO ] Flow matrix only has 2259 transitions (discarded 272 similar events)
// Phase 1: matrix 2259 rows 1118 cols
[2023-03-23 07:29:31] [INFO ] Computed 41 place invariants in 29 ms
[2023-03-23 07:29:31] [INFO ] Implicit Places using invariants in 901 ms returned []
[2023-03-23 07:29:31] [INFO ] Flow matrix only has 2259 transitions (discarded 272 similar events)
[2023-03-23 07:29:31] [INFO ] Invariant cache hit.
[2023-03-23 07:29:32] [INFO ] State equation strengthened by 824 read => feed constraints.
[2023-03-23 07:29:39] [INFO ] Implicit Places using invariants and state equation in 7049 ms returned []
Implicit Place search using SMT with State Equation took 7955 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1118/1242 places, 2531/2752 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 9362 ms. Remains : 1118/1242 places, 2531/2752 transitions.
Stuttering acceptance computed with spot in 237 ms :[(NOT p0), (NOT p0), false, false, false, (NOT p0), true]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}, { cond=p0, acceptance={} source=4 dest: 5}], [{ cond=p0, acceptance={} source=5 dest: 5}, { cond=(NOT p0), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(OR (LT s591 1) (LT s652 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]]
Entered a terminal (fully accepting) state of product in 195 steps with 4 reset in 3 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-08 finished in 10063 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(G(p0)))'
Support contains 6 out of 1242 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1242/1242 places, 2752/2752 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 1242 transition count 2736
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 1226 transition count 2736
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 32 place count 1226 transition count 2718
Deduced a syphon composed of 18 places in 3 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 68 place count 1208 transition count 2718
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 84 place count 1192 transition count 2684
Iterating global reduction 2 with 16 rules applied. Total rules applied 100 place count 1192 transition count 2684
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 100 place count 1192 transition count 2682
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 104 place count 1190 transition count 2682
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 114 place count 1180 transition count 2645
Iterating global reduction 2 with 10 rules applied. Total rules applied 124 place count 1180 transition count 2645
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 125 place count 1179 transition count 2641
Iterating global reduction 2 with 1 rules applied. Total rules applied 126 place count 1179 transition count 2641
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 2 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 180 place count 1152 transition count 2614
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 187 place count 1145 transition count 2607
Iterating global reduction 2 with 7 rules applied. Total rules applied 194 place count 1145 transition count 2607
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 201 place count 1138 transition count 2579
Iterating global reduction 2 with 7 rules applied. Total rules applied 208 place count 1138 transition count 2579
Applied a total of 208 rules in 400 ms. Remains 1138 /1242 variables (removed 104) and now considering 2579/2752 (removed 173) transitions.
[2023-03-23 07:29:39] [INFO ] Flow matrix only has 2307 transitions (discarded 272 similar events)
// Phase 1: matrix 2307 rows 1138 cols
[2023-03-23 07:29:39] [INFO ] Computed 58 place invariants in 30 ms
[2023-03-23 07:29:40] [INFO ] Implicit Places using invariants in 955 ms returned [4, 10, 11, 305, 317, 521, 552, 569, 579, 580, 592, 611, 630, 667, 716, 750, 1041]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 958 ms to find 17 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1121/1242 places, 2579/2752 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1112 transition count 2570
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1112 transition count 2570
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 27 place count 1103 transition count 2561
Iterating global reduction 0 with 9 rules applied. Total rules applied 36 place count 1103 transition count 2561
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 1097 transition count 2537
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 1097 transition count 2537
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 58 place count 1092 transition count 2532
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 63 place count 1087 transition count 2527
Iterating global reduction 0 with 5 rules applied. Total rules applied 68 place count 1087 transition count 2527
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 74 place count 1081 transition count 2503
Iterating global reduction 0 with 6 rules applied. Total rules applied 80 place count 1081 transition count 2503
Applied a total of 80 rules in 338 ms. Remains 1081 /1121 variables (removed 40) and now considering 2503/2579 (removed 76) transitions.
[2023-03-23 07:29:40] [INFO ] Flow matrix only has 2231 transitions (discarded 272 similar events)
// Phase 1: matrix 2231 rows 1081 cols
[2023-03-23 07:29:41] [INFO ] Computed 41 place invariants in 26 ms
[2023-03-23 07:29:41] [INFO ] Implicit Places using invariants in 867 ms returned []
[2023-03-23 07:29:41] [INFO ] Flow matrix only has 2231 transitions (discarded 272 similar events)
[2023-03-23 07:29:41] [INFO ] Invariant cache hit.
[2023-03-23 07:29:42] [INFO ] State equation strengthened by 833 read => feed constraints.
[2023-03-23 07:29:50] [INFO ] Implicit Places using invariants and state equation in 8419 ms returned []
Implicit Place search using SMT with State Equation took 9302 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1081/1242 places, 2503/2752 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11000 ms. Remains : 1081/1242 places, 2503/2752 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s502 1) (GEQ s1062 1) (OR (LT s589 1) (LT s1073 1)) (OR (LT s331 1) (LT s1070 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 30 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-09 finished in 11066 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(p1))))'
Support contains 3 out of 1242 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1242/1242 places, 2752/2752 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 1242 transition count 2737
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 1227 transition count 2737
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 30 place count 1227 transition count 2719
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 66 place count 1209 transition count 2719
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 85 place count 1190 transition count 2676
Iterating global reduction 2 with 19 rules applied. Total rules applied 104 place count 1190 transition count 2676
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 104 place count 1190 transition count 2674
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 108 place count 1188 transition count 2674
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 119 place count 1177 transition count 2633
Iterating global reduction 2 with 11 rules applied. Total rules applied 130 place count 1177 transition count 2633
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 131 place count 1176 transition count 2629
Iterating global reduction 2 with 1 rules applied. Total rules applied 132 place count 1176 transition count 2629
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 186 place count 1149 transition count 2602
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 192 place count 1143 transition count 2596
Iterating global reduction 2 with 6 rules applied. Total rules applied 198 place count 1143 transition count 2596
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 204 place count 1137 transition count 2572
Iterating global reduction 2 with 6 rules applied. Total rules applied 210 place count 1137 transition count 2572
Applied a total of 210 rules in 392 ms. Remains 1137 /1242 variables (removed 105) and now considering 2572/2752 (removed 180) transitions.
[2023-03-23 07:29:50] [INFO ] Flow matrix only has 2300 transitions (discarded 272 similar events)
// Phase 1: matrix 2300 rows 1137 cols
[2023-03-23 07:29:50] [INFO ] Computed 58 place invariants in 40 ms
[2023-03-23 07:29:51] [INFO ] Implicit Places using invariants in 953 ms returned [4, 10, 11, 305, 317, 518, 549, 579, 580, 592, 611, 629, 666, 715, 749, 1040]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 959 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1121/1242 places, 2572/2752 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1113 transition count 2564
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1113 transition count 2564
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 1105 transition count 2556
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 1105 transition count 2556
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 1100 transition count 2536
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 1100 transition count 2536
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 52 place count 1095 transition count 2531
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 57 place count 1090 transition count 2526
Iterating global reduction 0 with 5 rules applied. Total rules applied 62 place count 1090 transition count 2526
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 68 place count 1084 transition count 2502
Iterating global reduction 0 with 6 rules applied. Total rules applied 74 place count 1084 transition count 2502
Applied a total of 74 rules in 320 ms. Remains 1084 /1121 variables (removed 37) and now considering 2502/2572 (removed 70) transitions.
[2023-03-23 07:29:52] [INFO ] Flow matrix only has 2230 transitions (discarded 272 similar events)
// Phase 1: matrix 2230 rows 1084 cols
[2023-03-23 07:29:52] [INFO ] Computed 42 place invariants in 36 ms
[2023-03-23 07:29:52] [INFO ] Implicit Places using invariants in 882 ms returned []
[2023-03-23 07:29:52] [INFO ] Flow matrix only has 2230 transitions (discarded 272 similar events)
[2023-03-23 07:29:52] [INFO ] Invariant cache hit.
[2023-03-23 07:29:53] [INFO ] State equation strengthened by 830 read => feed constraints.
[2023-03-23 07:30:01] [INFO ] Implicit Places using invariants and state equation in 8784 ms returned [1077]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 9668 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1083/1242 places, 2502/2752 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1083 transition count 2501
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1082 transition count 2501
Applied a total of 2 rules in 72 ms. Remains 1082 /1083 variables (removed 1) and now considering 2501/2502 (removed 1) transitions.
[2023-03-23 07:30:01] [INFO ] Flow matrix only has 2229 transitions (discarded 272 similar events)
// Phase 1: matrix 2229 rows 1082 cols
[2023-03-23 07:30:01] [INFO ] Computed 41 place invariants in 29 ms
[2023-03-23 07:30:02] [INFO ] Implicit Places using invariants in 884 ms returned []
[2023-03-23 07:30:02] [INFO ] Flow matrix only has 2229 transitions (discarded 272 similar events)
[2023-03-23 07:30:02] [INFO ] Invariant cache hit.
[2023-03-23 07:30:03] [INFO ] State equation strengthened by 830 read => feed constraints.
[2023-03-23 07:30:11] [INFO ] Implicit Places using invariants and state equation in 8893 ms returned []
Implicit Place search using SMT with State Equation took 9778 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1082/1242 places, 2501/2752 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 21190 ms. Remains : 1082/1242 places, 2501/2752 transitions.
Stuttering acceptance computed with spot in 336 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=2, aps=[p1:(LT s560 1), p0:(AND (GEQ s599 1) (GEQ s800 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 32772 steps with 1110 reset in 160 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-11 finished in 21710 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((p0||((p2||F(p3))&&p1))))'
Support contains 10 out of 1242 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1242/1242 places, 2752/2752 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 1219 transition count 2708
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 1219 transition count 2708
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 62 place count 1203 transition count 2665
Iterating global reduction 0 with 16 rules applied. Total rules applied 78 place count 1203 transition count 2665
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 85 place count 1196 transition count 2637
Iterating global reduction 0 with 7 rules applied. Total rules applied 92 place count 1196 transition count 2637
Applied a total of 92 rules in 161 ms. Remains 1196 /1242 variables (removed 46) and now considering 2637/2752 (removed 115) transitions.
[2023-03-23 07:30:12] [INFO ] Flow matrix only has 2365 transitions (discarded 272 similar events)
// Phase 1: matrix 2365 rows 1196 cols
[2023-03-23 07:30:12] [INFO ] Computed 58 place invariants in 35 ms
[2023-03-23 07:30:13] [INFO ] Implicit Places using invariants in 956 ms returned [4, 11, 341, 548, 582, 601, 611, 612, 647, 667, 706, 757, 791, 1088]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 958 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1182/1242 places, 2637/2752 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1169 transition count 2624
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1169 transition count 2624
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 39 place count 1156 transition count 2611
Iterating global reduction 0 with 13 rules applied. Total rules applied 52 place count 1156 transition count 2611
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 65 place count 1143 transition count 2598
Iterating global reduction 0 with 13 rules applied. Total rules applied 78 place count 1143 transition count 2598
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 89 place count 1132 transition count 2554
Iterating global reduction 0 with 11 rules applied. Total rules applied 100 place count 1132 transition count 2554
Applied a total of 100 rules in 198 ms. Remains 1132 /1182 variables (removed 50) and now considering 2554/2637 (removed 83) transitions.
[2023-03-23 07:30:13] [INFO ] Flow matrix only has 2282 transitions (discarded 272 similar events)
// Phase 1: matrix 2282 rows 1132 cols
[2023-03-23 07:30:13] [INFO ] Computed 44 place invariants in 33 ms
[2023-03-23 07:30:14] [INFO ] Implicit Places using invariants in 852 ms returned []
[2023-03-23 07:30:14] [INFO ] Flow matrix only has 2282 transitions (discarded 272 similar events)
[2023-03-23 07:30:14] [INFO ] Invariant cache hit.
[2023-03-23 07:30:14] [INFO ] State equation strengthened by 836 read => feed constraints.
[2023-03-23 07:30:23] [INFO ] Implicit Places using invariants and state equation in 9310 ms returned [1121]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 10166 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1131/1242 places, 2554/2752 transitions.
Applied a total of 0 rules in 44 ms. Remains 1131 /1131 variables (removed 0) and now considering 2554/2554 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 11530 ms. Remains : 1131/1242 places, 2554/2752 transitions.
Stuttering acceptance computed with spot in 487 ms :[(NOT p3), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), true]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p3:(AND (GEQ s2 1) (GEQ s325 1) (GEQ s326 1) (GEQ s600 1) (LT s14 1)), p0:(GEQ s1103 1), p1:(AND (GEQ s471 1) (GEQ s729 1)), p2:(AND (GEQ s541 1) (GEQ s11...], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-12 finished in 12045 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)&&F(G(p1)))))'
Support contains 5 out of 1242 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1242/1242 places, 2752/2752 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 1242 transition count 2737
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 1227 transition count 2737
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 30 place count 1227 transition count 2719
Deduced a syphon composed of 18 places in 4 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 66 place count 1209 transition count 2719
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 85 place count 1190 transition count 2676
Iterating global reduction 2 with 19 rules applied. Total rules applied 104 place count 1190 transition count 2676
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 104 place count 1190 transition count 2674
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 108 place count 1188 transition count 2674
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 119 place count 1177 transition count 2633
Iterating global reduction 2 with 11 rules applied. Total rules applied 130 place count 1177 transition count 2633
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 131 place count 1176 transition count 2629
Iterating global reduction 2 with 1 rules applied. Total rules applied 132 place count 1176 transition count 2629
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 186 place count 1149 transition count 2602
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 192 place count 1143 transition count 2596
Iterating global reduction 2 with 6 rules applied. Total rules applied 198 place count 1143 transition count 2596
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 204 place count 1137 transition count 2572
Iterating global reduction 2 with 6 rules applied. Total rules applied 210 place count 1137 transition count 2572
Applied a total of 210 rules in 381 ms. Remains 1137 /1242 variables (removed 105) and now considering 2572/2752 (removed 180) transitions.
[2023-03-23 07:30:24] [INFO ] Flow matrix only has 2300 transitions (discarded 272 similar events)
// Phase 1: matrix 2300 rows 1137 cols
[2023-03-23 07:30:24] [INFO ] Computed 58 place invariants in 32 ms
[2023-03-23 07:30:25] [INFO ] Implicit Places using invariants in 938 ms returned [10, 11, 305, 521, 552, 569, 579, 580, 592, 611, 629, 666, 715, 749, 1040]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 940 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1122/1242 places, 2572/2752 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1114 transition count 2564
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1114 transition count 2564
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 1106 transition count 2556
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 1106 transition count 2556
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 1101 transition count 2536
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 1101 transition count 2536
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 52 place count 1096 transition count 2531
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 57 place count 1091 transition count 2526
Iterating global reduction 0 with 5 rules applied. Total rules applied 62 place count 1091 transition count 2526
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 68 place count 1085 transition count 2502
Iterating global reduction 0 with 6 rules applied. Total rules applied 74 place count 1085 transition count 2502
Applied a total of 74 rules in 311 ms. Remains 1085 /1122 variables (removed 37) and now considering 2502/2572 (removed 70) transitions.
[2023-03-23 07:30:25] [INFO ] Flow matrix only has 2230 transitions (discarded 272 similar events)
// Phase 1: matrix 2230 rows 1085 cols
[2023-03-23 07:30:25] [INFO ] Computed 43 place invariants in 29 ms
[2023-03-23 07:30:26] [INFO ] Implicit Places using invariants in 857 ms returned []
[2023-03-23 07:30:26] [INFO ] Flow matrix only has 2230 transitions (discarded 272 similar events)
[2023-03-23 07:30:26] [INFO ] Invariant cache hit.
[2023-03-23 07:30:27] [INFO ] State equation strengthened by 830 read => feed constraints.
[2023-03-23 07:30:34] [INFO ] Implicit Places using invariants and state equation in 8236 ms returned []
Implicit Place search using SMT with State Equation took 9098 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1085/1242 places, 2502/2752 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 10730 ms. Remains : 1085/1242 places, 2502/2752 transitions.
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s1 1) (LT s3 1) (LT s4 1)), p1:(LT s335 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 10768 reset in 738 ms.
Product exploration explored 100000 steps with 10870 reset in 724 ms.
Computed a total of 270 stabilizing places and 886 stable transitions
Computed a total of 270 stabilizing places and 886 stable transitions
Detected a total of 270/1085 stabilizing places and 886/2502 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 268 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 339 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-23 07:30:36] [INFO ] Flow matrix only has 2230 transitions (discarded 272 similar events)
[2023-03-23 07:30:36] [INFO ] Invariant cache hit.
[2023-03-23 07:30:37] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2023-03-23 07:30:37] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2023-03-23 07:30:37] [INFO ] After 847ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 07:30:37] [INFO ] [Nat]Absence check using 31 positive place invariants in 18 ms returned sat
[2023-03-23 07:30:37] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 2 ms returned sat
[2023-03-23 07:30:38] [INFO ] After 740ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 07:30:38] [INFO ] State equation strengthened by 830 read => feed constraints.
[2023-03-23 07:30:38] [INFO ] After 124ms SMT Verify possible using 830 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 07:30:39] [INFO ] Deduced a trap composed of 227 places in 413 ms of which 1 ms to minimize.
[2023-03-23 07:30:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 545 ms
[2023-03-23 07:30:39] [INFO ] After 722ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 62 ms.
[2023-03-23 07:30:39] [INFO ] After 1701ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 1085 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1085/1085 places, 2502/2502 transitions.
Free-agglomeration rule (complex) applied 133 times.
Iterating global reduction 0 with 133 rules applied. Total rules applied 133 place count 1085 transition count 3173
Reduce places removed 133 places and 0 transitions.
Iterating post reduction 0 with 133 rules applied. Total rules applied 266 place count 952 transition count 3173
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 267 place count 952 transition count 3173
Applied a total of 267 rules in 248 ms. Remains 952 /1085 variables (removed 133) and now considering 3173/2502 (removed -671) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 248 ms. Remains : 952/1085 places, 3173/2502 transitions.
Incomplete random walk after 10000 steps, including 426 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1421 steps, run visited all 1 properties in 49 ms. (steps per millisecond=29 )
Probabilistic random walk after 1421 steps, saw 683 distinct states, run finished after 49 ms. (steps per millisecond=29 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) p1), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 324 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-23 07:30:40] [INFO ] Flow matrix only has 2230 transitions (discarded 272 similar events)
[2023-03-23 07:30:40] [INFO ] Invariant cache hit.
[2023-03-23 07:30:42] [INFO ] [Real]Absence check using 31 positive place invariants in 33 ms returned sat
[2023-03-23 07:30:42] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 6 ms returned sat
[2023-03-23 07:30:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 07:30:44] [INFO ] [Real]Absence check using state equation in 1470 ms returned sat
[2023-03-23 07:30:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 07:30:46] [INFO ] [Nat]Absence check using 31 positive place invariants in 60 ms returned sat
[2023-03-23 07:30:46] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 8 ms returned sat
[2023-03-23 07:30:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 07:30:47] [INFO ] [Nat]Absence check using state equation in 1462 ms returned sat
[2023-03-23 07:30:47] [INFO ] State equation strengthened by 830 read => feed constraints.
[2023-03-23 07:30:47] [INFO ] [Nat]Added 830 Read/Feed constraints in 174 ms returned sat
[2023-03-23 07:30:48] [INFO ] Computed and/alt/rep : 1652/2401/1652 causal constraints (skipped 561 transitions) in 156 ms.
[2023-03-23 07:30:48] [INFO ] Added : 12 causal constraints over 3 iterations in 596 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 5 out of 1085 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1085/1085 places, 2502/2502 transitions.
Applied a total of 0 rules in 76 ms. Remains 1085 /1085 variables (removed 0) and now considering 2502/2502 (removed 0) transitions.
[2023-03-23 07:30:48] [INFO ] Flow matrix only has 2230 transitions (discarded 272 similar events)
[2023-03-23 07:30:48] [INFO ] Invariant cache hit.
[2023-03-23 07:30:49] [INFO ] Implicit Places using invariants in 867 ms returned []
[2023-03-23 07:30:49] [INFO ] Flow matrix only has 2230 transitions (discarded 272 similar events)
[2023-03-23 07:30:49] [INFO ] Invariant cache hit.
[2023-03-23 07:30:50] [INFO ] State equation strengthened by 830 read => feed constraints.
[2023-03-23 07:30:57] [INFO ] Implicit Places using invariants and state equation in 8288 ms returned []
Implicit Place search using SMT with State Equation took 9157 ms to find 0 implicit places.
[2023-03-23 07:30:57] [INFO ] Redundant transitions in 73 ms returned []
[2023-03-23 07:30:57] [INFO ] Flow matrix only has 2230 transitions (discarded 272 similar events)
[2023-03-23 07:30:57] [INFO ] Invariant cache hit.
[2023-03-23 07:30:58] [INFO ] Dead Transitions using invariants and state equation in 917 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10234 ms. Remains : 1085/1085 places, 2502/2502 transitions.
Computed a total of 270 stabilizing places and 886 stable transitions
Computed a total of 270 stabilizing places and 886 stable transitions
Detected a total of 270/1085 stabilizing places and 886/2502 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 257 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 339 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-23 07:30:59] [INFO ] Flow matrix only has 2230 transitions (discarded 272 similar events)
[2023-03-23 07:30:59] [INFO ] Invariant cache hit.
[2023-03-23 07:30:59] [INFO ] [Real]Absence check using 31 positive place invariants in 18 ms returned sat
[2023-03-23 07:30:59] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 2 ms returned sat
[2023-03-23 07:31:00] [INFO ] After 839ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 07:31:00] [INFO ] [Nat]Absence check using 31 positive place invariants in 18 ms returned sat
[2023-03-23 07:31:00] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 2 ms returned sat
[2023-03-23 07:31:01] [INFO ] After 695ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 07:31:01] [INFO ] State equation strengthened by 830 read => feed constraints.
[2023-03-23 07:31:01] [INFO ] After 126ms SMT Verify possible using 830 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 07:31:01] [INFO ] Deduced a trap composed of 227 places in 410 ms of which 1 ms to minimize.
[2023-03-23 07:31:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 535 ms
[2023-03-23 07:31:01] [INFO ] After 718ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 64 ms.
[2023-03-23 07:31:01] [INFO ] After 1646ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 1085 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1085/1085 places, 2502/2502 transitions.
Free-agglomeration rule (complex) applied 133 times.
Iterating global reduction 0 with 133 rules applied. Total rules applied 133 place count 1085 transition count 3173
Reduce places removed 133 places and 0 transitions.
Iterating post reduction 0 with 133 rules applied. Total rules applied 266 place count 952 transition count 3173
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 267 place count 952 transition count 3173
Applied a total of 267 rules in 226 ms. Remains 952 /1085 variables (removed 133) and now considering 3173/2502 (removed -671) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 226 ms. Remains : 952/1085 places, 3173/2502 transitions.
Incomplete random walk after 10000 steps, including 426 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 45 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1421 steps, run visited all 1 properties in 49 ms. (steps per millisecond=29 )
Probabilistic random walk after 1421 steps, saw 683 distinct states, run finished after 49 ms. (steps per millisecond=29 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) p1), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 307 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-23 07:31:02] [INFO ] Flow matrix only has 2230 transitions (discarded 272 similar events)
[2023-03-23 07:31:02] [INFO ] Invariant cache hit.
[2023-03-23 07:31:04] [INFO ] [Real]Absence check using 31 positive place invariants in 31 ms returned sat
[2023-03-23 07:31:04] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 7 ms returned sat
[2023-03-23 07:31:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 07:31:06] [INFO ] [Real]Absence check using state equation in 1416 ms returned sat
[2023-03-23 07:31:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 07:31:08] [INFO ] [Nat]Absence check using 31 positive place invariants in 61 ms returned sat
[2023-03-23 07:31:08] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 15 ms returned sat
[2023-03-23 07:31:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 07:31:10] [INFO ] [Nat]Absence check using state equation in 1582 ms returned sat
[2023-03-23 07:31:10] [INFO ] State equation strengthened by 830 read => feed constraints.
[2023-03-23 07:31:10] [INFO ] [Nat]Added 830 Read/Feed constraints in 173 ms returned sat
[2023-03-23 07:31:10] [INFO ] Computed and/alt/rep : 1652/2401/1652 causal constraints (skipped 561 transitions) in 111 ms.
[2023-03-23 07:31:10] [INFO ] Added : 12 causal constraints over 3 iterations in 543 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 11006 reset in 645 ms.
Product exploration explored 100000 steps with 10965 reset in 652 ms.
Built C files in :
/tmp/ltsmin17582896309297795716
[2023-03-23 07:31:12] [INFO ] Too many transitions (2502) to apply POR reductions. Disabling POR matrices.
[2023-03-23 07:31:12] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17582896309297795716
Running compilation step : cd /tmp/ltsmin17582896309297795716;'/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/ltsmin17582896309297795716;'/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/ltsmin17582896309297795716;'/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 5 out of 1085 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1085/1085 places, 2502/2502 transitions.
Applied a total of 0 rules in 75 ms. Remains 1085 /1085 variables (removed 0) and now considering 2502/2502 (removed 0) transitions.
[2023-03-23 07:31:15] [INFO ] Flow matrix only has 2230 transitions (discarded 272 similar events)
[2023-03-23 07:31:15] [INFO ] Invariant cache hit.
[2023-03-23 07:31:16] [INFO ] Implicit Places using invariants in 859 ms returned []
[2023-03-23 07:31:16] [INFO ] Flow matrix only has 2230 transitions (discarded 272 similar events)
[2023-03-23 07:31:16] [INFO ] Invariant cache hit.
[2023-03-23 07:31:17] [INFO ] State equation strengthened by 830 read => feed constraints.
[2023-03-23 07:31:24] [INFO ] Implicit Places using invariants and state equation in 8037 ms returned []
Implicit Place search using SMT with State Equation took 8906 ms to find 0 implicit places.
[2023-03-23 07:31:24] [INFO ] Redundant transitions in 74 ms returned []
[2023-03-23 07:31:24] [INFO ] Flow matrix only has 2230 transitions (discarded 272 similar events)
[2023-03-23 07:31:24] [INFO ] Invariant cache hit.
[2023-03-23 07:31:25] [INFO ] Dead Transitions using invariants and state equation in 985 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10051 ms. Remains : 1085/1085 places, 2502/2502 transitions.
Built C files in :
/tmp/ltsmin13798662723583715860
[2023-03-23 07:31:25] [INFO ] Too many transitions (2502) to apply POR reductions. Disabling POR matrices.
[2023-03-23 07:31:25] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13798662723583715860
Running compilation step : cd /tmp/ltsmin13798662723583715860;'/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/ltsmin13798662723583715860;'/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/ltsmin13798662723583715860;'/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-23 07:31:28] [INFO ] Flatten gal took : 52 ms
[2023-03-23 07:31:28] [INFO ] Flatten gal took : 55 ms
[2023-03-23 07:31:28] [INFO ] Time to serialize gal into /tmp/LTL5101415364992163355.gal : 10 ms
[2023-03-23 07:31:28] [INFO ] Time to serialize properties into /tmp/LTL3471560490831211308.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/LTL5101415364992163355.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10371882425917898331.hoa' '-atoms' '/tmp/LTL3471560490831211308.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...318
Loading property file /tmp/LTL3471560490831211308.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10371882425917898331.hoa
Detected timeout of ITS tools.
[2023-03-23 07:31:43] [INFO ] Flatten gal took : 52 ms
[2023-03-23 07:31:43] [INFO ] Flatten gal took : 54 ms
[2023-03-23 07:31:43] [INFO ] Time to serialize gal into /tmp/LTL6179541186729417031.gal : 10 ms
[2023-03-23 07:31:43] [INFO ] Time to serialize properties into /tmp/LTL17322942592619678196.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/LTL6179541186729417031.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17322942592619678196.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((F("(((CrashReservoir<1)||(NoCrashIsHappening<1))||((Node0IsActive<1)||(Node0NotifyThatHeIsActive<1)))"))&&(F(G("(Node2HasTheLeaf...188
Formula 0 simplified : F(G!"(((CrashReservoir<1)||(NoCrashIsHappening<1))||((Node0IsActive<1)||(Node0NotifyThatHeIsActive<1)))" | GF!"(Node2HasTheLeafSetOf...178
Detected timeout of ITS tools.
[2023-03-23 07:31:58] [INFO ] Flatten gal took : 52 ms
[2023-03-23 07:31:58] [INFO ] Applying decomposition
[2023-03-23 07:31:58] [INFO ] Flatten gal took : 49 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/graph16794437264446034405.txt' '-o' '/tmp/graph16794437264446034405.bin' '-w' '/tmp/graph16794437264446034405.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph16794437264446034405.bin' '-l' '-1' '-v' '-w' '/tmp/graph16794437264446034405.weights' '-q' '0' '-e' '0.001'
[2023-03-23 07:31:59] [INFO ] Decomposing Gal with order
[2023-03-23 07:31:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-23 07:31:59] [INFO ] Removed a total of 2241 redundant transitions.
[2023-03-23 07:31:59] [INFO ] Flatten gal took : 359 ms
[2023-03-23 07:31:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 1373 labels/synchronizations in 101 ms.
[2023-03-23 07:31:59] [INFO ] Time to serialize gal into /tmp/LTL10391433358667278453.gal : 28 ms
[2023-03-23 07:31:59] [INFO ] Time to serialize properties into /tmp/LTL2850805211052954315.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/LTL10391433358667278453.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2850805211052954315.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((F("(((u0.CrashReservoir<1)||(i14.u154.NoCrashIsHappening<1))||((u0.Node0IsActive<1)||(u0.Node0NotifyThatHeIsActive<1)))"))&&(F(G...214
Formula 0 simplified : F(G!"(((u0.CrashReservoir<1)||(i14.u154.NoCrashIsHappening<1))||((u0.Node0IsActive<1)||(u0.Node0NotifyThatHeIsActive<1)))" | GF!"(i1...204
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5859458490489771542
[2023-03-23 07:32:14] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5859458490489771542
Running compilation step : cd /tmp/ltsmin5859458490489771542;'/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/ltsmin5859458490489771542;'/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/ltsmin5859458490489771542;'/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 MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-14 finished in 113822 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)))'
Support contains 1 out of 1242 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1242/1242 places, 2752/2752 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 1242 transition count 2737
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 1227 transition count 2737
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 30 place count 1227 transition count 2719
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 66 place count 1209 transition count 2719
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 85 place count 1190 transition count 2676
Iterating global reduction 2 with 19 rules applied. Total rules applied 104 place count 1190 transition count 2676
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 104 place count 1190 transition count 2674
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 108 place count 1188 transition count 2674
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 119 place count 1177 transition count 2633
Iterating global reduction 2 with 11 rules applied. Total rules applied 130 place count 1177 transition count 2633
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 131 place count 1176 transition count 2629
Iterating global reduction 2 with 1 rules applied. Total rules applied 132 place count 1176 transition count 2629
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 186 place count 1149 transition count 2602
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 192 place count 1143 transition count 2596
Iterating global reduction 2 with 6 rules applied. Total rules applied 198 place count 1143 transition count 2596
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 204 place count 1137 transition count 2572
Iterating global reduction 2 with 6 rules applied. Total rules applied 210 place count 1137 transition count 2572
Applied a total of 210 rules in 386 ms. Remains 1137 /1242 variables (removed 105) and now considering 2572/2752 (removed 180) transitions.
[2023-03-23 07:32:18] [INFO ] Flow matrix only has 2300 transitions (discarded 272 similar events)
// Phase 1: matrix 2300 rows 1137 cols
[2023-03-23 07:32:18] [INFO ] Computed 58 place invariants in 30 ms
[2023-03-23 07:32:19] [INFO ] Implicit Places using invariants in 939 ms returned [4, 10, 11, 305, 317, 518, 569, 579, 580, 592, 611, 629, 666, 715, 749, 1040]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 943 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1121/1242 places, 2572/2752 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1112 transition count 2563
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1112 transition count 2563
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 27 place count 1103 transition count 2554
Iterating global reduction 0 with 9 rules applied. Total rules applied 36 place count 1103 transition count 2554
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 1097 transition count 2530
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 1097 transition count 2530
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 56 place count 1093 transition count 2526
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 60 place count 1089 transition count 2522
Iterating global reduction 0 with 4 rules applied. Total rules applied 64 place count 1089 transition count 2522
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 69 place count 1084 transition count 2502
Iterating global reduction 0 with 5 rules applied. Total rules applied 74 place count 1084 transition count 2502
Applied a total of 74 rules in 335 ms. Remains 1084 /1121 variables (removed 37) and now considering 2502/2572 (removed 70) transitions.
[2023-03-23 07:32:19] [INFO ] Flow matrix only has 2230 transitions (discarded 272 similar events)
// Phase 1: matrix 2230 rows 1084 cols
[2023-03-23 07:32:19] [INFO ] Computed 42 place invariants in 24 ms
[2023-03-23 07:32:20] [INFO ] Implicit Places using invariants in 853 ms returned []
[2023-03-23 07:32:20] [INFO ] Flow matrix only has 2230 transitions (discarded 272 similar events)
[2023-03-23 07:32:20] [INFO ] Invariant cache hit.
[2023-03-23 07:32:21] [INFO ] State equation strengthened by 830 read => feed constraints.
[2023-03-23 07:32:29] [INFO ] Implicit Places using invariants and state equation in 8657 ms returned [1067]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 9532 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1083/1242 places, 2502/2752 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1083 transition count 2501
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1082 transition count 2501
Applied a total of 2 rules in 98 ms. Remains 1082 /1083 variables (removed 1) and now considering 2501/2502 (removed 1) transitions.
[2023-03-23 07:32:29] [INFO ] Flow matrix only has 2229 transitions (discarded 272 similar events)
// Phase 1: matrix 2229 rows 1082 cols
[2023-03-23 07:32:29] [INFO ] Computed 41 place invariants in 18 ms
[2023-03-23 07:32:30] [INFO ] Implicit Places using invariants in 905 ms returned []
[2023-03-23 07:32:30] [INFO ] Flow matrix only has 2229 transitions (discarded 272 similar events)
[2023-03-23 07:32:30] [INFO ] Invariant cache hit.
[2023-03-23 07:32:30] [INFO ] State equation strengthened by 830 read => feed constraints.
[2023-03-23 07:32:38] [INFO ] Implicit Places using invariants and state equation in 8821 ms returned []
Implicit Place search using SMT with State Equation took 9738 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1082/1242 places, 2501/2752 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 21038 ms. Remains : 1082/1242 places, 2501/2752 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s542 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-15 finished in 21150 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((G(F(p0))||G((p1 U p2)))))'
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(((!p1 U (p2||G(!p1)))&&p0))))'
Found a Shortening insensitive property : MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-04
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Support contains 7 out of 1242 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1242/1242 places, 2752/2752 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 1242 transition count 2736
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 1226 transition count 2736
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 32 place count 1226 transition count 2718
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 68 place count 1208 transition count 2718
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 85 place count 1191 transition count 2680
Iterating global reduction 2 with 17 rules applied. Total rules applied 102 place count 1191 transition count 2680
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 102 place count 1191 transition count 2678
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 106 place count 1189 transition count 2678
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 116 place count 1179 transition count 2641
Iterating global reduction 2 with 10 rules applied. Total rules applied 126 place count 1179 transition count 2641
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 127 place count 1178 transition count 2637
Iterating global reduction 2 with 1 rules applied. Total rules applied 128 place count 1178 transition count 2637
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 2 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 180 place count 1152 transition count 2611
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 187 place count 1145 transition count 2604
Iterating global reduction 2 with 7 rules applied. Total rules applied 194 place count 1145 transition count 2604
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 201 place count 1138 transition count 2576
Iterating global reduction 2 with 7 rules applied. Total rules applied 208 place count 1138 transition count 2576
Applied a total of 208 rules in 383 ms. Remains 1138 /1242 variables (removed 104) and now considering 2576/2752 (removed 176) transitions.
[2023-03-23 07:32:39] [INFO ] Flow matrix only has 2304 transitions (discarded 272 similar events)
// Phase 1: matrix 2304 rows 1138 cols
[2023-03-23 07:32:39] [INFO ] Computed 58 place invariants in 30 ms
[2023-03-23 07:32:40] [INFO ] Implicit Places using invariants in 970 ms returned [4, 10, 11, 305, 317, 518, 549, 566, 576, 577, 589, 608, 627, 664, 713, 747, 1041]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 988 ms to find 17 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1121/1242 places, 2576/2752 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1112 transition count 2567
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1112 transition count 2567
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 27 place count 1103 transition count 2558
Iterating global reduction 0 with 9 rules applied. Total rules applied 36 place count 1103 transition count 2558
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 1097 transition count 2534
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 1097 transition count 2534
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 58 place count 1092 transition count 2529
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 63 place count 1087 transition count 2524
Iterating global reduction 0 with 5 rules applied. Total rules applied 68 place count 1087 transition count 2524
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 74 place count 1081 transition count 2500
Iterating global reduction 0 with 6 rules applied. Total rules applied 80 place count 1081 transition count 2500
Applied a total of 80 rules in 298 ms. Remains 1081 /1121 variables (removed 40) and now considering 2500/2576 (removed 76) transitions.
[2023-03-23 07:32:41] [INFO ] Flow matrix only has 2228 transitions (discarded 272 similar events)
// Phase 1: matrix 2228 rows 1081 cols
[2023-03-23 07:32:41] [INFO ] Computed 41 place invariants in 31 ms
[2023-03-23 07:32:41] [INFO ] Implicit Places using invariants in 880 ms returned []
[2023-03-23 07:32:41] [INFO ] Flow matrix only has 2228 transitions (discarded 272 similar events)
[2023-03-23 07:32:41] [INFO ] Invariant cache hit.
[2023-03-23 07:32:42] [INFO ] State equation strengthened by 830 read => feed constraints.
[2023-03-23 07:32:51] [INFO ] Implicit Places using invariants and state equation in 9262 ms returned [1065]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 10144 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 1080/1242 places, 2500/2752 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1080 transition count 2499
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1079 transition count 2499
Applied a total of 2 rules in 60 ms. Remains 1079 /1080 variables (removed 1) and now considering 2499/2500 (removed 1) transitions.
[2023-03-23 07:32:51] [INFO ] Flow matrix only has 2227 transitions (discarded 272 similar events)
// Phase 1: matrix 2227 rows 1079 cols
[2023-03-23 07:32:51] [INFO ] Computed 40 place invariants in 24 ms
[2023-03-23 07:32:52] [INFO ] Implicit Places using invariants in 887 ms returned []
[2023-03-23 07:32:52] [INFO ] Flow matrix only has 2227 transitions (discarded 272 similar events)
[2023-03-23 07:32:52] [INFO ] Invariant cache hit.
[2023-03-23 07:32:52] [INFO ] State equation strengthened by 830 read => feed constraints.
[2023-03-23 07:33:00] [INFO ] Implicit Places using invariants and state equation in 8727 ms returned []
Implicit Place search using SMT with State Equation took 9618 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 1079/1242 places, 2499/2752 transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 21511 ms. Remains : 1079/1242 places, 2499/2752 transitions.
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p2) p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (LT s596 1) (OR (LT s419 1) (LT s477 1))), p2:(AND (GEQ s923 1) (GEQ s1070 1) (NOT (AND (GEQ s921 1) (GEQ s1069 1)))), p1:(AND (GEQ s921 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3397 reset in 505 ms.
Product exploration explored 100000 steps with 3399 reset in 517 ms.
Computed a total of 263 stabilizing places and 882 stable transitions
Computed a total of 263 stabilizing places and 882 stable transitions
Detected a total of 263/1079 stabilizing places and 882/2499 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (OR (NOT p0) (AND (NOT p2) p1)))), (X (AND p0 (NOT p2) (NOT p1))), (X (X (NOT (OR (NOT p0) (AND (NOT p2) p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 364 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Finished random walk after 1995 steps, including 67 resets, run visited all 4 properties in 50 ms. (steps per millisecond=39 )
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (OR (NOT p0) (AND (NOT p2) p1)))), (X (AND p0 (NOT p2) (NOT p1))), (X (X (NOT (OR (NOT p0) (AND (NOT p2) p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (OR (NOT p0) (AND p1 (NOT p2)))), (F (AND p1 (NOT p2))), (F (NOT (AND p0 (NOT p1) (NOT p2))))]
Knowledge based reduction with 9 factoid took 416 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 94 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Support contains 7 out of 1079 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1079/1079 places, 2499/2499 transitions.
Applied a total of 0 rules in 38 ms. Remains 1079 /1079 variables (removed 0) and now considering 2499/2499 (removed 0) transitions.
[2023-03-23 07:33:03] [INFO ] Flow matrix only has 2227 transitions (discarded 272 similar events)
[2023-03-23 07:33:03] [INFO ] Invariant cache hit.
[2023-03-23 07:33:04] [INFO ] Implicit Places using invariants in 858 ms returned []
[2023-03-23 07:33:04] [INFO ] Flow matrix only has 2227 transitions (discarded 272 similar events)
[2023-03-23 07:33:04] [INFO ] Invariant cache hit.
[2023-03-23 07:33:04] [INFO ] State equation strengthened by 830 read => feed constraints.
[2023-03-23 07:33:13] [INFO ] Implicit Places using invariants and state equation in 8931 ms returned []
Implicit Place search using SMT with State Equation took 9827 ms to find 0 implicit places.
[2023-03-23 07:33:13] [INFO ] Flow matrix only has 2227 transitions (discarded 272 similar events)
[2023-03-23 07:33:13] [INFO ] Invariant cache hit.
[2023-03-23 07:33:14] [INFO ] Dead Transitions using invariants and state equation in 1022 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10913 ms. Remains : 1079/1079 places, 2499/2499 transitions.
Computed a total of 263 stabilizing places and 882 stable transitions
Computed a total of 263 stabilizing places and 882 stable transitions
Detected a total of 263/1079 stabilizing places and 882/2499 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (OR (NOT p0) (AND p1 (NOT p2))))), (X (AND p0 (NOT p1) (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (OR (NOT p0) (AND p1 (NOT p2)))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 331 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Finished random walk after 362 steps, including 12 resets, run visited all 4 properties in 11 ms. (steps per millisecond=32 )
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (OR (NOT p0) (AND p1 (NOT p2))))), (X (AND p0 (NOT p1) (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (OR (NOT p0) (AND p1 (NOT p2)))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p1)))), (F (OR (NOT p0) (AND (NOT p2) p1))), (F (AND (NOT p2) p1)), (F (NOT (AND p0 (NOT p2) (NOT p1))))]
Knowledge based reduction with 9 factoid took 538 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 3399 reset in 495 ms.
Product exploration explored 100000 steps with 3401 reset in 524 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Support contains 7 out of 1079 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1079/1079 places, 2499/2499 transitions.
Applied a total of 0 rules in 65 ms. Remains 1079 /1079 variables (removed 0) and now considering 2499/2499 (removed 0) transitions.
[2023-03-23 07:33:16] [INFO ] Redundant transitions in 71 ms returned []
[2023-03-23 07:33:16] [INFO ] Flow matrix only has 2227 transitions (discarded 272 similar events)
[2023-03-23 07:33:16] [INFO ] Invariant cache hit.
[2023-03-23 07:33:17] [INFO ] Dead Transitions using invariants and state equation in 974 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1139 ms. Remains : 1079/1079 places, 2499/2499 transitions.
Built C files in :
/tmp/ltsmin3939274367722992471
[2023-03-23 07:33:17] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3939274367722992471
Running compilation step : cd /tmp/ltsmin3939274367722992471;'/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/ltsmin3939274367722992471;'/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/ltsmin3939274367722992471;'/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 7 out of 1079 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1079/1079 places, 2499/2499 transitions.
Applied a total of 0 rules in 54 ms. Remains 1079 /1079 variables (removed 0) and now considering 2499/2499 (removed 0) transitions.
[2023-03-23 07:33:20] [INFO ] Flow matrix only has 2227 transitions (discarded 272 similar events)
[2023-03-23 07:33:20] [INFO ] Invariant cache hit.
[2023-03-23 07:33:21] [INFO ] Implicit Places using invariants in 859 ms returned []
[2023-03-23 07:33:21] [INFO ] Flow matrix only has 2227 transitions (discarded 272 similar events)
[2023-03-23 07:33:21] [INFO ] Invariant cache hit.
[2023-03-23 07:33:22] [INFO ] State equation strengthened by 830 read => feed constraints.
[2023-03-23 07:33:30] [INFO ] Implicit Places using invariants and state equation in 8847 ms returned []
Implicit Place search using SMT with State Equation took 9707 ms to find 0 implicit places.
[2023-03-23 07:33:30] [INFO ] Flow matrix only has 2227 transitions (discarded 272 similar events)
[2023-03-23 07:33:30] [INFO ] Invariant cache hit.
[2023-03-23 07:33:31] [INFO ] Dead Transitions using invariants and state equation in 891 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10653 ms. Remains : 1079/1079 places, 2499/2499 transitions.
Built C files in :
/tmp/ltsmin14296447743137010388
[2023-03-23 07:33:31] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14296447743137010388
Running compilation step : cd /tmp/ltsmin14296447743137010388;'/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/ltsmin14296447743137010388;'/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/ltsmin14296447743137010388;'/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-23 07:33:34] [INFO ] Flatten gal took : 60 ms
[2023-03-23 07:33:34] [INFO ] Flatten gal took : 47 ms
[2023-03-23 07:33:34] [INFO ] Time to serialize gal into /tmp/LTL18433149679978421944.gal : 8 ms
[2023-03-23 07:33:34] [INFO ] Time to serialize properties into /tmp/LTL3477139586241129384.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/LTL18433149679978421944.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11763084476002173471.hoa' '-atoms' '/tmp/LTL3477139586241129384.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/LTL3477139586241129384.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11763084476002173471.hoa
Detected timeout of ITS tools.
[2023-03-23 07:33:49] [INFO ] Flatten gal took : 47 ms
[2023-03-23 07:33:49] [INFO ] Flatten gal took : 48 ms
[2023-03-23 07:33:49] [INFO ] Time to serialize gal into /tmp/LTL4646716769690037947.gal : 8 ms
[2023-03-23 07:33:49] [INFO ] Time to serialize properties into /tmp/LTL9478064799293719932.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/LTL4646716769690037947.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9478064799293719932.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((("(Node11IsNotifiedThatHeIsTheNewMaster<1)")&&((!("((Node15ManageTheCrashOfNode16>=1)&&(Rx1IsAtTheRightExtremityOfTheLeafSet>=...517
Formula 0 simplified : XG(!"((Node4ThinksNode6ShouldBeNodeMasterToReplaceNode8<1)||(NodesCanDetectThatNode6HasCrashed<1))" | !"(Node11IsNotifiedThatHeIsThe...414
Detected timeout of ITS tools.
[2023-03-23 07:34:04] [INFO ] Flatten gal took : 50 ms
[2023-03-23 07:34:04] [INFO ] Applying decomposition
[2023-03-23 07:34:05] [INFO ] Flatten gal took : 49 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/graph14402941943350509383.txt' '-o' '/tmp/graph14402941943350509383.bin' '-w' '/tmp/graph14402941943350509383.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph14402941943350509383.bin' '-l' '-1' '-v' '-w' '/tmp/graph14402941943350509383.weights' '-q' '0' '-e' '0.001'
[2023-03-23 07:34:05] [INFO ] Decomposing Gal with order
[2023-03-23 07:34:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-23 07:34:05] [INFO ] Removed a total of 3156 redundant transitions.
[2023-03-23 07:34:05] [INFO ] Flatten gal took : 129 ms
[2023-03-23 07:34:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 1640 labels/synchronizations in 65 ms.
[2023-03-23 07:34:05] [INFO ] Time to serialize gal into /tmp/LTL196882689330107577.gal : 16 ms
[2023-03-23 07:34:05] [INFO ] Time to serialize properties into /tmp/LTL7586938797747201867.ltl : 3 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/LTL196882689330107577.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7586938797747201867.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...253
Read 1 LTL properties
Checking formula 0 : !((X(F((("(i13.u86.Node11IsNotifiedThatHeIsTheNewMaster<1)")&&((!("((i19.i0.u140.Node15ManageTheCrashOfNode16>=1)&&(i19.i0.u164.Rx1IsA...639
Formula 0 simplified : XG(!"((i9.i2.u61.Node4ThinksNode6ShouldBeNodeMasterToReplaceNode8<1)||(i13.u86.NodesCanDetectThatNode6HasCrashed<1))" | !"(i13.u86.N...512
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16757378393670670771
[2023-03-23 07:34:20] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16757378393670670771
Running compilation step : cd /tmp/ltsmin16757378393670670771;'/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/ltsmin16757378393670670771;'/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/ltsmin16757378393670670771;'/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 MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-04 finished in 104477 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((X(p0)||G(p1))))'
Found a Lengthening insensitive property : MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-07
Stuttering acceptance computed with spot in 137 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 1242 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1242/1242 places, 2752/2752 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 1242 transition count 2737
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 1227 transition count 2737
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 30 place count 1227 transition count 2720
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 64 place count 1210 transition count 2720
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 82 place count 1192 transition count 2678
Iterating global reduction 2 with 18 rules applied. Total rules applied 100 place count 1192 transition count 2678
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 100 place count 1192 transition count 2676
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 104 place count 1190 transition count 2676
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 114 place count 1180 transition count 2639
Iterating global reduction 2 with 10 rules applied. Total rules applied 124 place count 1180 transition count 2639
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 125 place count 1179 transition count 2635
Iterating global reduction 2 with 1 rules applied. Total rules applied 126 place count 1179 transition count 2635
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 180 place count 1152 transition count 2608
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 186 place count 1146 transition count 2602
Iterating global reduction 2 with 6 rules applied. Total rules applied 192 place count 1146 transition count 2602
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 198 place count 1140 transition count 2578
Iterating global reduction 2 with 6 rules applied. Total rules applied 204 place count 1140 transition count 2578
Applied a total of 204 rules in 368 ms. Remains 1140 /1242 variables (removed 102) and now considering 2578/2752 (removed 174) transitions.
[2023-03-23 07:34:24] [INFO ] Flow matrix only has 2306 transitions (discarded 272 similar events)
// Phase 1: matrix 2306 rows 1140 cols
[2023-03-23 07:34:24] [INFO ] Computed 58 place invariants in 32 ms
[2023-03-23 07:34:25] [INFO ] Implicit Places using invariants in 974 ms returned [4, 11, 308, 320, 521, 552, 569, 579, 595, 614, 632, 669, 718, 752, 1043]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 988 ms to find 15 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1125/1242 places, 2578/2752 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1118 transition count 2571
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1118 transition count 2571
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 1111 transition count 2564
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 1111 transition count 2564
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 1106 transition count 2544
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 1106 transition count 2544
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 48 place count 1101 transition count 2539
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 53 place count 1096 transition count 2534
Iterating global reduction 0 with 5 rules applied. Total rules applied 58 place count 1096 transition count 2534
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 63 place count 1091 transition count 2514
Iterating global reduction 0 with 5 rules applied. Total rules applied 68 place count 1091 transition count 2514
Applied a total of 68 rules in 308 ms. Remains 1091 /1125 variables (removed 34) and now considering 2514/2578 (removed 64) transitions.
[2023-03-23 07:34:25] [INFO ] Flow matrix only has 2242 transitions (discarded 272 similar events)
// Phase 1: matrix 2242 rows 1091 cols
[2023-03-23 07:34:25] [INFO ] Computed 43 place invariants in 19 ms
[2023-03-23 07:34:26] [INFO ] Implicit Places using invariants in 988 ms returned []
[2023-03-23 07:34:26] [INFO ] Flow matrix only has 2242 transitions (discarded 272 similar events)
[2023-03-23 07:34:26] [INFO ] Invariant cache hit.
[2023-03-23 07:34:27] [INFO ] State equation strengthened by 836 read => feed constraints.
[2023-03-23 07:34:35] [INFO ] Implicit Places using invariants and state equation in 8723 ms returned []
Implicit Place search using SMT with State Equation took 9727 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 1091/1242 places, 2514/2752 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 11393 ms. Remains : 1091/1242 places, 2514/2752 transitions.
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(LT s16 1), p0:(OR (LT s572 1) (LT s575 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 3380 reset in 518 ms.
Product exploration explored 100000 steps with 3381 reset in 550 ms.
Computed a total of 276 stabilizing places and 898 stable transitions
Computed a total of 276 stabilizing places and 898 stable transitions
Detected a total of 276/1091 stabilizing places and 898/2514 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), true, (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 617 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 337 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 66 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-23 07:34:37] [INFO ] Flow matrix only has 2242 transitions (discarded 272 similar events)
[2023-03-23 07:34:37] [INFO ] Invariant cache hit.
[2023-03-23 07:34:37] [INFO ] [Real]Absence check using 31 positive place invariants in 18 ms returned sat
[2023-03-23 07:34:37] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 2 ms returned sat
[2023-03-23 07:34:38] [INFO ] After 519ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:1
[2023-03-23 07:34:38] [INFO ] State equation strengthened by 836 read => feed constraints.
[2023-03-23 07:34:38] [INFO ] After 172ms SMT Verify possible using 836 Read/Feed constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-23 07:34:38] [INFO ] After 892ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-23 07:34:38] [INFO ] [Nat]Absence check using 31 positive place invariants in 14 ms returned sat
[2023-03-23 07:34:38] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 2 ms returned sat
[2023-03-23 07:34:39] [INFO ] After 590ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-23 07:34:39] [INFO ] After 242ms SMT Verify possible using 836 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2023-03-23 07:34:39] [INFO ] Deduced a trap composed of 222 places in 626 ms of which 2 ms to minimize.
[2023-03-23 07:34:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 777 ms
[2023-03-23 07:34:40] [INFO ] After 1198ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 135 ms.
[2023-03-23 07:34:40] [INFO ] After 2099ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2514/2514 transitions.
Free-agglomeration rule (complex) applied 135 times.
Iterating global reduction 0 with 135 rules applied. Total rules applied 135 place count 1091 transition count 3177
Reduce places removed 135 places and 0 transitions.
Iterating post reduction 0 with 135 rules applied. Total rules applied 270 place count 956 transition count 3177
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 271 place count 956 transition count 3177
Applied a total of 271 rules in 247 ms. Remains 956 /1091 variables (removed 135) and now considering 3177/2514 (removed -663) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 247 ms. Remains : 956/1091 places, 3177/2514 transitions.
Incomplete random walk after 10000 steps, including 427 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Finished probabilistic random walk after 2559 steps, run visited all 2 properties in 99 ms. (steps per millisecond=25 )
Probabilistic random walk after 2559 steps, saw 1166 distinct states, run finished after 100 ms. (steps per millisecond=25 ) properties seen :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), true, (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (AND p1 (NOT p0))), (F (NOT p0)), (F (NOT (AND p1 p0))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 16 factoid took 598 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 137 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 3 out of 1091 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1091/1091 places, 2514/2514 transitions.
Applied a total of 0 rules in 43 ms. Remains 1091 /1091 variables (removed 0) and now considering 2514/2514 (removed 0) transitions.
[2023-03-23 07:34:41] [INFO ] Flow matrix only has 2242 transitions (discarded 272 similar events)
[2023-03-23 07:34:41] [INFO ] Invariant cache hit.
[2023-03-23 07:34:42] [INFO ] Implicit Places using invariants in 846 ms returned []
[2023-03-23 07:34:42] [INFO ] Flow matrix only has 2242 transitions (discarded 272 similar events)
[2023-03-23 07:34:42] [INFO ] Invariant cache hit.
[2023-03-23 07:34:43] [INFO ] State equation strengthened by 836 read => feed constraints.
[2023-03-23 07:34:51] [INFO ] Implicit Places using invariants and state equation in 9065 ms returned []
Implicit Place search using SMT with State Equation took 9925 ms to find 0 implicit places.
[2023-03-23 07:34:51] [INFO ] Flow matrix only has 2242 transitions (discarded 272 similar events)
[2023-03-23 07:34:51] [INFO ] Invariant cache hit.
[2023-03-23 07:34:52] [INFO ] Dead Transitions using invariants and state equation in 911 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10880 ms. Remains : 1091/1091 places, 2514/2514 transitions.
Computed a total of 276 stabilizing places and 898 stable transitions
Computed a total of 276 stabilizing places and 898 stable transitions
Detected a total of 276/1091 stabilizing places and 898/2514 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (AND p0 p1)), (X (X p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 477 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 338 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-23 07:34:53] [INFO ] Flow matrix only has 2242 transitions (discarded 272 similar events)
[2023-03-23 07:34:53] [INFO ] Invariant cache hit.
[2023-03-23 07:34:53] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned sat
[2023-03-23 07:34:53] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 2 ms returned sat
[2023-03-23 07:34:54] [INFO ] After 514ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-23 07:34:54] [INFO ] State equation strengthened by 836 read => feed constraints.
[2023-03-23 07:34:54] [INFO ] After 192ms SMT Verify possible using 836 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 07:34:54] [INFO ] After 873ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 07:34:54] [INFO ] [Nat]Absence check using 31 positive place invariants in 14 ms returned sat
[2023-03-23 07:34:54] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2023-03-23 07:34:55] [INFO ] After 507ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 07:34:55] [INFO ] After 181ms SMT Verify possible using 836 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 07:34:55] [INFO ] Deduced a trap composed of 222 places in 410 ms of which 6 ms to minimize.
[2023-03-23 07:34:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 536 ms
[2023-03-23 07:34:55] [INFO ] After 764ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 61 ms.
[2023-03-23 07:34:55] [INFO ] After 1501ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2514/2514 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1091 transition count 2513
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1090 transition count 2513
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 1089 transition count 2512
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 1089 transition count 2512
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 1088 transition count 2508
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 1088 transition count 2508
Free-agglomeration rule (complex) applied 134 times.
Iterating global reduction 2 with 134 rules applied. Total rules applied 140 place count 1088 transition count 3175
Reduce places removed 134 places and 0 transitions.
Iterating post reduction 2 with 134 rules applied. Total rules applied 274 place count 954 transition count 3175
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 275 place count 954 transition count 3175
Applied a total of 275 rules in 320 ms. Remains 954 /1091 variables (removed 137) and now considering 3175/2514 (removed -661) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 321 ms. Remains : 954/1091 places, 3175/2514 transitions.
Incomplete random walk after 10000 steps, including 426 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2557 steps, run visited all 1 properties in 90 ms. (steps per millisecond=28 )
Probabilistic random walk after 2557 steps, saw 1165 distinct states, run finished after 90 ms. (steps per millisecond=28 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (AND p0 p1)), (X (X p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 10 factoid took 466 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 130 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 130 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 3380 reset in 511 ms.
Product exploration explored 100000 steps with 3378 reset in 516 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 140 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 3 out of 1091 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1091/1091 places, 2514/2514 transitions.
Applied a total of 0 rules in 68 ms. Remains 1091 /1091 variables (removed 0) and now considering 2514/2514 (removed 0) transitions.
[2023-03-23 07:34:58] [INFO ] Redundant transitions in 71 ms returned []
[2023-03-23 07:34:58] [INFO ] Flow matrix only has 2242 transitions (discarded 272 similar events)
[2023-03-23 07:34:58] [INFO ] Invariant cache hit.
[2023-03-23 07:34:59] [INFO ] Dead Transitions using invariants and state equation in 988 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1163 ms. Remains : 1091/1091 places, 2514/2514 transitions.
Built C files in :
/tmp/ltsmin15551141350411331555
[2023-03-23 07:34:59] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15551141350411331555
Running compilation step : cd /tmp/ltsmin15551141350411331555;'/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/ltsmin15551141350411331555;'/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/ltsmin15551141350411331555;'/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 3 out of 1091 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1091/1091 places, 2514/2514 transitions.
Applied a total of 0 rules in 39 ms. Remains 1091 /1091 variables (removed 0) and now considering 2514/2514 (removed 0) transitions.
[2023-03-23 07:35:02] [INFO ] Flow matrix only has 2242 transitions (discarded 272 similar events)
[2023-03-23 07:35:02] [INFO ] Invariant cache hit.
[2023-03-23 07:35:03] [INFO ] Implicit Places using invariants in 828 ms returned []
[2023-03-23 07:35:03] [INFO ] Flow matrix only has 2242 transitions (discarded 272 similar events)
[2023-03-23 07:35:03] [INFO ] Invariant cache hit.
[2023-03-23 07:35:04] [INFO ] State equation strengthened by 836 read => feed constraints.
[2023-03-23 07:35:12] [INFO ] Implicit Places using invariants and state equation in 8723 ms returned []
Implicit Place search using SMT with State Equation took 9555 ms to find 0 implicit places.
[2023-03-23 07:35:12] [INFO ] Flow matrix only has 2242 transitions (discarded 272 similar events)
[2023-03-23 07:35:12] [INFO ] Invariant cache hit.
[2023-03-23 07:35:13] [INFO ] Dead Transitions using invariants and state equation in 1018 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10613 ms. Remains : 1091/1091 places, 2514/2514 transitions.
Built C files in :
/tmp/ltsmin16552723357993771056
[2023-03-23 07:35:13] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16552723357993771056
Running compilation step : cd /tmp/ltsmin16552723357993771056;'/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/ltsmin16552723357993771056;'/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/ltsmin16552723357993771056;'/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-23 07:35:16] [INFO ] Flatten gal took : 48 ms
[2023-03-23 07:35:16] [INFO ] Flatten gal took : 48 ms
[2023-03-23 07:35:16] [INFO ] Time to serialize gal into /tmp/LTL8548406990231155821.gal : 8 ms
[2023-03-23 07:35:16] [INFO ] Time to serialize properties into /tmp/LTL13935988722407067861.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/LTL8548406990231155821.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7545071891127957981.hoa' '-atoms' '/tmp/LTL13935988722407067861.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...318
Loading property file /tmp/LTL13935988722407067861.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7545071891127957981.hoa
Detected timeout of ITS tools.
[2023-03-23 07:35:31] [INFO ] Flatten gal took : 47 ms
[2023-03-23 07:35:31] [INFO ] Flatten gal took : 48 ms
[2023-03-23 07:35:31] [INFO ] Time to serialize gal into /tmp/LTL9634776351059824156.gal : 9 ms
[2023-03-23 07:35:31] [INFO ] Time to serialize properties into /tmp/LTL10419735352266248901.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/LTL9634776351059824156.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10419735352266248901.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((X("((Node9HasAskedItsLeafSetToRx3ToReplaceNode15<1)||(LeafSetOfRx3IsSentToNode9<1))"))||(G("(Node0HasTheLeafSetOfLx0ToReplaceNod...166
Formula 0 simplified : F(X!"((Node9HasAskedItsLeafSetToRx3ToReplaceNode15<1)||(LeafSetOfRx3IsSentToNode9<1))" & F!"(Node0HasTheLeafSetOfLx0ToReplaceNode2<1...158
Detected timeout of ITS tools.
[2023-03-23 07:35:46] [INFO ] Flatten gal took : 57 ms
[2023-03-23 07:35:46] [INFO ] Applying decomposition
[2023-03-23 07:35:46] [INFO ] Flatten gal took : 49 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/graph13488362330239389948.txt' '-o' '/tmp/graph13488362330239389948.bin' '-w' '/tmp/graph13488362330239389948.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13488362330239389948.bin' '-l' '-1' '-v' '-w' '/tmp/graph13488362330239389948.weights' '-q' '0' '-e' '0.001'
[2023-03-23 07:35:47] [INFO ] Decomposing Gal with order
[2023-03-23 07:35:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-23 07:35:47] [INFO ] Removed a total of 2256 redundant transitions.
[2023-03-23 07:35:47] [INFO ] Flatten gal took : 191 ms
[2023-03-23 07:35:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 1431 labels/synchronizations in 49 ms.
[2023-03-23 07:35:47] [INFO ] Time to serialize gal into /tmp/LTL14093097444689194170.gal : 13 ms
[2023-03-23 07:35:47] [INFO ] Time to serialize properties into /tmp/LTL9083595053450123535.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/LTL14093097444689194170.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9083595053450123535.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((X("((i12.u160.Node9HasAskedItsLeafSetToRx3ToReplaceNode15<1)||(i12.u160.LeafSetOfRx3IsSentToNode9<1))"))||(G("(i12.u161.Node0Has...193
Formula 0 simplified : F(X!"((i12.u160.Node9HasAskedItsLeafSetToRx3ToReplaceNode15<1)||(i12.u160.LeafSetOfRx3IsSentToNode9<1))" & F!"(i12.u161.Node0HasTheL...185
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9964228109149403751
[2023-03-23 07:36:02] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9964228109149403751
Running compilation step : cd /tmp/ltsmin9964228109149403751;'/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/ltsmin9964228109149403751;'/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/ltsmin9964228109149403751;'/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 MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-07 finished in 101851 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)&&F(G(p1)))))'
[2023-03-23 07:36:05] [INFO ] Flatten gal took : 62 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3813629435101306108
[2023-03-23 07:36:05] [INFO ] Too many transitions (2752) to apply POR reductions. Disabling POR matrices.
[2023-03-23 07:36:05] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3813629435101306108
Running compilation step : cd /tmp/ltsmin3813629435101306108;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '180' '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-23 07:36:05] [INFO ] Applying decomposition
[2023-03-23 07:36:05] [INFO ] Flatten gal took : 62 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/graph6531350211547286129.txt' '-o' '/tmp/graph6531350211547286129.bin' '-w' '/tmp/graph6531350211547286129.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6531350211547286129.bin' '-l' '-1' '-v' '-w' '/tmp/graph6531350211547286129.weights' '-q' '0' '-e' '0.001'
[2023-03-23 07:36:05] [INFO ] Decomposing Gal with order
[2023-03-23 07:36:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-23 07:36:06] [INFO ] Removed a total of 2181 redundant transitions.
[2023-03-23 07:36:06] [INFO ] Flatten gal took : 138 ms
[2023-03-23 07:36:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 1837 labels/synchronizations in 57 ms.
[2023-03-23 07:36:06] [INFO ] Time to serialize gal into /tmp/LTLFireability17070770479475534694.gal : 17 ms
[2023-03-23 07:36:06] [INFO ] Time to serialize properties into /tmp/LTLFireability17509470231863613147.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/LTLFireability17070770479475534694.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17509470231863613147.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 4 LTL properties
Checking formula 0 : !((F((G(F("(((i0.i2.u119.Node12ManageTheCrashOfNode3<1)||(i0.i2.u23.Lx2IsAtTheLeftExtremityOfTheLeafSet<1))||((i0.i1.u3.Node12HasAsked...419
Formula 0 simplified : G(FG!"(((i0.i2.u119.Node12ManageTheCrashOfNode3<1)||(i0.i2.u23.Lx2IsAtTheLeftExtremityOfTheLeafSet<1))||((i0.i1.u3.Node12HasAskedIts...410
Compilation finished in 6390 ms.
Running link step : cd /tmp/ltsmin3813629435101306108;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin3813629435101306108;'/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'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin3813629435101306108;'/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'
Running LTSmin : cd /tmp/ltsmin3813629435101306108;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((!(LTLAPp4==true) U ((LTLAPp5==true)||[](!(LTLAPp4==true))))&&(LTLAPp3==true))))' '--buchi-type=spotba'
LTSmin run took 69733 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin3813629435101306108;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X((LTLAPp6==true))||[]((LTLAPp7==true))))' '--buchi-type=spotba'
LTSmin run took 66839 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin3813629435101306108;'/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' '[]((<>((LTLAPp8==true))&&<>([]((LTLAPp9==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-23 08:01:00] [INFO ] Flatten gal took : 757 ms
[2023-03-23 08:01:00] [INFO ] Time to serialize gal into /tmp/LTLFireability7870290960243443113.gal : 39 ms
[2023-03-23 08:01:00] [INFO ] Time to serialize properties into /tmp/LTLFireability18260089988244103942.ltl : 5 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/LTLFireability7870290960243443113.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability18260089988244103942.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...298
Read 2 LTL properties
Checking formula 0 : !((F((G(F("(((Node12ManageTheCrashOfNode3<1)||(Lx2IsAtTheLeftExtremityOfTheLeafSet<1))||((Node12HasAskedItsLeafSetToLx1ToReplaceNode7>...343
Formula 0 simplified : G(FG!"(((Node12ManageTheCrashOfNode3<1)||(Lx2IsAtTheLeftExtremityOfTheLeafSet<1))||((Node12HasAskedItsLeafSetToLx1ToReplaceNode7>=1)...334
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin3813629435101306108;'/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' '[]((<>((LTLAPp8==true))&&<>([]((LTLAPp9==true)))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 7200 s
Running LTSmin : cd /tmp/ltsmin3813629435101306108;'/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'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 3835572 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16007660 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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ 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="MultiCrashLeafsetExtension-PT-S16C04"
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 MultiCrashLeafsetExtension-PT-S16C04, 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 r229-tall-167856413700764"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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