Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.5M
-rw-r--r-- 1 mcc users 7.0K Apr 29 11:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 29 11:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 29 11:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 29 11:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K May 9 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 9 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 2.2M May 10 09:33 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 Echo-PT-d03r07-LTLCardinality-00
FORMULA_NAME Echo-PT-d03r07-LTLCardinality-01
FORMULA_NAME Echo-PT-d03r07-LTLCardinality-02
FORMULA_NAME Echo-PT-d03r07-LTLCardinality-03
FORMULA_NAME Echo-PT-d03r07-LTLCardinality-04
FORMULA_NAME Echo-PT-d03r07-LTLCardinality-05
FORMULA_NAME Echo-PT-d03r07-LTLCardinality-06
FORMULA_NAME Echo-PT-d03r07-LTLCardinality-07
FORMULA_NAME Echo-PT-d03r07-LTLCardinality-08
FORMULA_NAME Echo-PT-d03r07-LTLCardinality-09
FORMULA_NAME Echo-PT-d03r07-LTLCardinality-10
FORMULA_NAME Echo-PT-d03r07-LTLCardinality-11
FORMULA_NAME Echo-PT-d03r07-LTLCardinality-12
FORMULA_NAME Echo-PT-d03r07-LTLCardinality-13
FORMULA_NAME Echo-PT-d03r07-LTLCardinality-14
FORMULA_NAME Echo-PT-d03r07-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652677985693

Running Version 202205111006
[2022-05-16 05:13:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 05:13:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 05:13:07] [INFO ] Load time of PNML (sax parser for PT used): 307 ms
[2022-05-16 05:13:07] [INFO ] Transformed 4209 places.
[2022-05-16 05:13:07] [INFO ] Transformed 3518 transitions.
[2022-05-16 05:13:07] [INFO ] Found NUPN structural information;
[2022-05-16 05:13:07] [INFO ] Parsed PT model containing 4209 places and 3518 transitions in 452 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Echo-PT-d03r07-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r07-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r07-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r07-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r07-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r07-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 4209 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4209/4209 places, 3518/3518 transitions.
Reduce places removed 342 places and 0 transitions.
Iterating post reduction 0 with 342 rules applied. Total rules applied 342 place count 3867 transition count 3518
Applied a total of 342 rules in 426 ms. Remains 3867 /4209 variables (removed 342) and now considering 3518/3518 (removed 0) transitions.
// Phase 1: matrix 3518 rows 3867 cols
[2022-05-16 05:13:16] [INFO ] Invariants computation overflowed in 8839 ms
[2022-05-16 05:13:17] [INFO ] Implicit Places using invariants in 9465 ms returned []
// Phase 1: matrix 3518 rows 3867 cols
[2022-05-16 05:13:25] [INFO ] Invariants computation overflowed in 8392 ms
[2022-05-16 05:13:26] [INFO ] Implicit Places using invariants and state equation in 9394 ms returned []
Implicit Place search using SMT with State Equation took 18890 ms to find 0 implicit places.
// Phase 1: matrix 3518 rows 3867 cols
[2022-05-16 05:13:35] [INFO ] Invariants computation overflowed in 8912 ms
[2022-05-16 05:13:38] [INFO ] Dead Transitions using invariants and state equation in 11186 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3867/4209 places, 3518/3518 transitions.
Finished structural reductions, in 1 iterations. Remains : 3867/4209 places, 3518/3518 transitions.
Support contains 27 out of 3867 places after structural reductions.
[2022-05-16 05:13:38] [INFO ] Flatten gal took : 431 ms
[2022-05-16 05:13:39] [INFO ] Flatten gal took : 261 ms
[2022-05-16 05:13:39] [INFO ] Input system was already deterministic with 3518 transitions.
Support contains 23 out of 3867 places (down from 27) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 832 ms. (steps per millisecond=12 ) properties (out of 13) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 3518 rows 3867 cols
[2022-05-16 05:13:49] [INFO ] Invariants computation overflowed in 8471 ms
[2022-05-16 05:14:14] [INFO ] After 24165ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-16 05:14:14] [INFO ] After 24179ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-16 05:14:14] [INFO ] After 25043ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 3867 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3867/3867 places, 3518/3518 transitions.
Graph (complete) has 14537 edges and 3867 vertex of which 3853 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.24 ms
Discarding 14 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 3853 transition count 3511
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 3852 transition count 3510
Applied a total of 8 rules in 491 ms. Remains 3852 /3867 variables (removed 15) and now considering 3510/3518 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 3852/3867 places, 3510/3518 transitions.
Finished random walk after 8998 steps, including 13 resets, run visited all 2 properties in 418 ms. (steps per millisecond=21 )
FORMULA Echo-PT-d03r07-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Echo-PT-d03r07-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 3867 stabilizing places and 3518 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3867 transition count 3518
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(p0))))'
Support contains 2 out of 3867 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3867/3867 places, 3518/3518 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3866 transition count 3518
Applied a total of 1 rules in 166 ms. Remains 3866 /3867 variables (removed 1) and now considering 3518/3518 (removed 0) transitions.
// Phase 1: matrix 3518 rows 3866 cols
[2022-05-16 05:14:23] [INFO ] Invariants computation overflowed in 7437 ms
[2022-05-16 05:14:23] [INFO ] Implicit Places using invariants in 8003 ms returned []
// Phase 1: matrix 3518 rows 3866 cols
[2022-05-16 05:14:30] [INFO ] Invariants computation overflowed in 7047 ms
[2022-05-16 05:14:31] [INFO ] Implicit Places using invariants and state equation in 7978 ms returned []
Implicit Place search using SMT with State Equation took 15988 ms to find 0 implicit places.
// Phase 1: matrix 3518 rows 3866 cols
[2022-05-16 05:14:38] [INFO ] Invariants computation overflowed in 7068 ms
[2022-05-16 05:14:40] [INFO ] Dead Transitions using invariants and state equation in 9330 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3866/3867 places, 3518/3518 transitions.
Finished structural reductions, in 1 iterations. Remains : 3866/3867 places, 3518/3518 transitions.
Stuttering acceptance computed with spot in 227 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Echo-PT-d03r07-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s2067 0) (EQ s2758 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 33333 reset in 1758 ms.
Product exploration explored 100000 steps with 33333 reset in 1747 ms.
Computed a total of 3866 stabilizing places and 3518 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3866 transition count 3518
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Echo-PT-d03r07-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d03r07-LTLCardinality-00 finished in 31296 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(G(X(X(p0)))))))'
Support contains 2 out of 3867 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3867/3867 places, 3518/3518 transitions.
Applied a total of 0 rules in 166 ms. Remains 3867 /3867 variables (removed 0) and now considering 3518/3518 (removed 0) transitions.
// Phase 1: matrix 3518 rows 3867 cols
[2022-05-16 05:14:55] [INFO ] Invariants computation overflowed in 8460 ms
[2022-05-16 05:14:58] [INFO ] Implicit Places using invariants in 11353 ms returned []
// Phase 1: matrix 3518 rows 3867 cols
[2022-05-16 05:15:06] [INFO ] Invariants computation overflowed in 8300 ms
[2022-05-16 05:15:07] [INFO ] Implicit Places using invariants and state equation in 9117 ms returned []
Implicit Place search using SMT with State Equation took 20488 ms to find 0 implicit places.
// Phase 1: matrix 3518 rows 3867 cols
[2022-05-16 05:15:15] [INFO ] Invariants computation overflowed in 8291 ms
[2022-05-16 05:15:16] [INFO ] Dead Transitions using invariants and state equation in 8811 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3867/3867 places, 3518/3518 transitions.
Stuttering acceptance computed with spot in 198 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Echo-PT-d03r07-LTLCardinality-07 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}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(AND (EQ s2250 0) (EQ s1629 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, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA Echo-PT-d03r07-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r07-LTLCardinality-07 finished in 29700 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(X(p0)))))'
Support contains 2 out of 3867 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3867/3867 places, 3518/3518 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3866 transition count 3518
Applied a total of 1 rules in 158 ms. Remains 3866 /3867 variables (removed 1) and now considering 3518/3518 (removed 0) transitions.
// Phase 1: matrix 3518 rows 3866 cols
[2022-05-16 05:15:23] [INFO ] Invariants computation overflowed in 7051 ms
[2022-05-16 05:15:26] [INFO ] Implicit Places using invariants in 9887 ms returned []
// Phase 1: matrix 3518 rows 3866 cols
[2022-05-16 05:15:33] [INFO ] Invariants computation overflowed in 7021 ms
[2022-05-16 05:15:34] [INFO ] Implicit Places using invariants and state equation in 7818 ms returned []
Implicit Place search using SMT with State Equation took 17710 ms to find 0 implicit places.
// Phase 1: matrix 3518 rows 3866 cols
[2022-05-16 05:15:41] [INFO ] Invariants computation overflowed in 6997 ms
[2022-05-16 05:15:43] [INFO ] Dead Transitions using invariants and state equation in 9218 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3866/3867 places, 3518/3518 transitions.
Finished structural reductions, in 1 iterations. Remains : 3866/3867 places, 3518/3518 transitions.
Stuttering acceptance computed with spot in 422 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Echo-PT-d03r07-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(OR (EQ s1997 0) (EQ s1543 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 1655 ms.
Product exploration explored 100000 steps with 25000 reset in 1774 ms.
Computed a total of 3866 stabilizing places and 3518 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3866 transition count 3518
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 6905 steps, including 10 resets, run visited all 1 properties in 237 ms. (steps per millisecond=29 )
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 3866 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3866/3866 places, 3518/3518 transitions.
Applied a total of 0 rules in 162 ms. Remains 3866 /3866 variables (removed 0) and now considering 3518/3518 (removed 0) transitions.
// Phase 1: matrix 3518 rows 3866 cols
[2022-05-16 05:15:58] [INFO ] Invariants computation overflowed in 7554 ms
[2022-05-16 05:16:00] [INFO ] Implicit Places using invariants in 10463 ms returned []
// Phase 1: matrix 3518 rows 3866 cols
[2022-05-16 05:16:08] [INFO ] Invariants computation overflowed in 7565 ms
[2022-05-16 05:16:09] [INFO ] Implicit Places using invariants and state equation in 8374 ms returned []
Implicit Place search using SMT with State Equation took 18859 ms to find 0 implicit places.
// Phase 1: matrix 3518 rows 3866 cols
[2022-05-16 05:16:16] [INFO ] Invariants computation overflowed in 7468 ms
[2022-05-16 05:16:19] [INFO ] Dead Transitions using invariants and state equation in 9721 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3866/3866 places, 3518/3518 transitions.
Computed a total of 3866 stabilizing places and 3518 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3866 transition count 3518
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 339 ms. (steps per millisecond=29 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 128635 steps, run timeout after 3006 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 128635 steps, saw 91467 distinct states, run finished after 3007 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 3518 rows 3866 cols
[2022-05-16 05:16:31] [INFO ] Invariants computation overflowed in 7081 ms
[2022-05-16 05:16:56] [INFO ] After 25038ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 3866 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3866/3866 places, 3518/3518 transitions.
Graph (complete) has 14527 edges and 3866 vertex of which 3853 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.3 ms
Discarding 13 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 3853 transition count 3511
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 3852 transition count 3510
Applied a total of 8 rules in 355 ms. Remains 3852 /3866 variables (removed 14) and now considering 3510/3518 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 3852/3866 places, 3510/3518 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 345 ms. (steps per millisecond=28 ) properties (out of 1) seen :0
Finished Best-First random walk after 7006 steps, including 2 resets, run visited all 1 properties in 55 ms. (steps per millisecond=127 )
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 142 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 1485 ms.
Product exploration explored 100000 steps with 25000 reset in 1627 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 3866 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3866/3866 places, 3518/3518 transitions.
Graph (complete) has 14527 edges and 3866 vertex of which 3859 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.23 ms
Discarding 7 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Applied a total of 1 rules in 637 ms. Remains 3859 /3866 variables (removed 7) and now considering 3517/3518 (removed 1) transitions.
[2022-05-16 05:17:02] [INFO ] Redundant transitions in 238 ms returned []
// Phase 1: matrix 3517 rows 3859 cols
[2022-05-16 05:17:13] [INFO ] Invariants computation overflowed in 11391 ms
[2022-05-16 05:17:16] [INFO ] Dead Transitions using invariants and state equation in 13870 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3859/3866 places, 3517/3518 transitions.
Finished structural reductions, in 1 iterations. Remains : 3859/3866 places, 3517/3518 transitions.
Product exploration explored 100000 steps with 25000 reset in 8835 ms.
Product exploration explored 100000 steps with 25000 reset in 8997 ms.
Built C files in :
/tmp/ltsmin15092858047674581444
[2022-05-16 05:17:34] [INFO ] Built C files in 275ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15092858047674581444
Running compilation step : cd /tmp/ltsmin15092858047674581444;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15092858047674581444;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15092858047674581444;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 3866 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3866/3866 places, 3518/3518 transitions.
Applied a total of 0 rules in 167 ms. Remains 3866 /3866 variables (removed 0) and now considering 3518/3518 (removed 0) transitions.
// Phase 1: matrix 3518 rows 3866 cols
[2022-05-16 05:17:44] [INFO ] Invariants computation overflowed in 7104 ms
[2022-05-16 05:17:47] [INFO ] Implicit Places using invariants in 10045 ms returned []
// Phase 1: matrix 3518 rows 3866 cols
[2022-05-16 05:17:54] [INFO ] Invariants computation overflowed in 6892 ms
[2022-05-16 05:17:55] [INFO ] Implicit Places using invariants and state equation in 7702 ms returned []
Implicit Place search using SMT with State Equation took 17749 ms to find 0 implicit places.
// Phase 1: matrix 3518 rows 3866 cols
[2022-05-16 05:18:02] [INFO ] Invariants computation overflowed in 6879 ms
[2022-05-16 05:18:04] [INFO ] Dead Transitions using invariants and state equation in 9409 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3866/3866 places, 3518/3518 transitions.
Built C files in :
/tmp/ltsmin7982842582936527454
[2022-05-16 05:18:05] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7982842582936527454
Running compilation step : cd /tmp/ltsmin7982842582936527454;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7982842582936527454;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7982842582936527454;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-16 05:18:08] [INFO ] Flatten gal took : 332 ms
[2022-05-16 05:18:09] [INFO ] Flatten gal took : 405 ms
[2022-05-16 05:18:09] [INFO ] Time to serialize gal into /tmp/LTL2698807798516890001.gal : 132 ms
[2022-05-16 05:18:09] [INFO ] Time to serialize properties into /tmp/LTL7210660603211034705.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2698807798516890001.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7210660603211034705.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2698807...266
Read 1 LTL properties
Checking formula 0 : !((X(F(X(X("((p2997==0)||(p2543==1))"))))))
Formula 0 simplified : !XFXX"((p2997==0)||(p2543==1))"
Detected timeout of ITS tools.
[2022-05-16 05:18:24] [INFO ] Flatten gal took : 205 ms
[2022-05-16 05:18:24] [INFO ] Applying decomposition
[2022-05-16 05:18:24] [INFO ] Flatten gal took : 204 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13633612367276498135.txt' '-o' '/tmp/graph13633612367276498135.bin' '-w' '/tmp/graph13633612367276498135.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13633612367276498135.bin' '-l' '-1' '-v' '-w' '/tmp/graph13633612367276498135.weights' '-q' '0' '-e' '0.001'
[2022-05-16 05:18:25] [INFO ] Decomposing Gal with order
[2022-05-16 05:18:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 05:18:26] [INFO ] Removed a total of 6268 redundant transitions.
[2022-05-16 05:18:26] [INFO ] Flatten gal took : 668 ms
[2022-05-16 05:18:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 953 labels/synchronizations in 191 ms.
[2022-05-16 05:18:26] [INFO ] Time to serialize gal into /tmp/LTL7347565202174934796.gal : 42 ms
[2022-05-16 05:18:26] [INFO ] Time to serialize properties into /tmp/LTL7585880857342148727.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7347565202174934796.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7585880857342148727.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7347565...245
Read 1 LTL properties
Checking formula 0 : !((X(F(X(X("((i8.u169.p2997==0)||(i3.i0.u114.p2543==1))"))))))
Formula 0 simplified : !XFXX"((i8.u169.p2997==0)||(i3.i0.u114.p2543==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8849682780255575347
[2022-05-16 05:18:42] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8849682780255575347
Running compilation step : cd /tmp/ltsmin8849682780255575347;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8849682780255575347;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8849682780255575347;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property Echo-PT-d03r07-LTLCardinality-09 finished in 208722 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))&&F(p1))))'
Support contains 4 out of 3867 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3867/3867 places, 3518/3518 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3866 transition count 3518
Applied a total of 1 rules in 325 ms. Remains 3866 /3867 variables (removed 1) and now considering 3518/3518 (removed 0) transitions.
// Phase 1: matrix 3518 rows 3866 cols
[2022-05-16 05:18:52] [INFO ] Invariants computation overflowed in 7401 ms
[2022-05-16 05:18:55] [INFO ] Implicit Places using invariants in 10459 ms returned []
// Phase 1: matrix 3518 rows 3866 cols
[2022-05-16 05:19:02] [INFO ] Invariants computation overflowed in 7049 ms
[2022-05-16 05:19:03] [INFO ] Implicit Places using invariants and state equation in 7972 ms returned []
Implicit Place search using SMT with State Equation took 18442 ms to find 0 implicit places.
// Phase 1: matrix 3518 rows 3866 cols
[2022-05-16 05:19:10] [INFO ] Invariants computation overflowed in 6958 ms
[2022-05-16 05:19:11] [INFO ] Dead Transitions using invariants and state equation in 7443 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3866/3867 places, 3518/3518 transitions.
Finished structural reductions, in 1 iterations. Remains : 3866/3867 places, 3518/3518 transitions.
Stuttering acceptance computed with spot in 198 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Echo-PT-d03r07-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(AND (EQ s2038 0) (EQ s1418 1)), p1:(AND (EQ s1053 0) (EQ s2490 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Echo-PT-d03r07-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r07-LTLCardinality-10 finished in 26478 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G(p0))))'
Support contains 2 out of 3867 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3867/3867 places, 3518/3518 transitions.
Graph (complete) has 14537 edges and 3867 vertex of which 3859 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.22 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 225 ms. Remains 3858 /3867 variables (removed 9) and now considering 3516/3518 (removed 2) transitions.
// Phase 1: matrix 3516 rows 3858 cols
[2022-05-16 05:19:17] [INFO ] Invariants computation overflowed in 5772 ms
[2022-05-16 05:19:18] [INFO ] Implicit Places using invariants in 6251 ms returned []
// Phase 1: matrix 3516 rows 3858 cols
[2022-05-16 05:19:23] [INFO ] Invariants computation overflowed in 5782 ms
[2022-05-16 05:19:24] [INFO ] Implicit Places using invariants and state equation in 6593 ms returned []
Implicit Place search using SMT with State Equation took 12847 ms to find 0 implicit places.
[2022-05-16 05:19:24] [INFO ] Redundant transitions in 106 ms returned []
// Phase 1: matrix 3516 rows 3858 cols
[2022-05-16 05:19:30] [INFO ] Invariants computation overflowed in 5806 ms
[2022-05-16 05:19:32] [INFO ] Dead Transitions using invariants and state equation in 7890 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3858/3867 places, 3516/3518 transitions.
Finished structural reductions, in 1 iterations. Remains : 3858/3867 places, 3516/3518 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : Echo-PT-d03r07-LTLCardinality-11 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 (EQ s2601 0) (EQ s2264 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 684 steps with 0 reset in 24 ms.
FORMULA Echo-PT-d03r07-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r07-LTLCardinality-11 finished in 21196 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 3867 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3867/3867 places, 3518/3518 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3866 transition count 3518
Applied a total of 1 rules in 189 ms. Remains 3866 /3867 variables (removed 1) and now considering 3518/3518 (removed 0) transitions.
// Phase 1: matrix 3518 rows 3866 cols
[2022-05-16 05:19:39] [INFO ] Invariants computation overflowed in 6857 ms
[2022-05-16 05:19:42] [INFO ] Implicit Places using invariants in 9634 ms returned []
// Phase 1: matrix 3518 rows 3866 cols
[2022-05-16 05:19:49] [INFO ] Invariants computation overflowed in 6867 ms
[2022-05-16 05:19:50] [INFO ] Implicit Places using invariants and state equation in 7681 ms returned []
Implicit Place search using SMT with State Equation took 17337 ms to find 0 implicit places.
// Phase 1: matrix 3518 rows 3866 cols
[2022-05-16 05:19:57] [INFO ] Invariants computation overflowed in 6896 ms
[2022-05-16 05:19:59] [INFO ] Dead Transitions using invariants and state equation in 8956 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3866/3867 places, 3518/3518 transitions.
Finished structural reductions, in 1 iterations. Remains : 3866/3867 places, 3518/3518 transitions.
Stuttering acceptance computed with spot in 419 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Echo-PT-d03r07-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s10 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Echo-PT-d03r07-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r07-LTLCardinality-13 finished in 26947 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(G(p0)))))'
Support contains 1 out of 3867 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3867/3867 places, 3518/3518 transitions.
Graph (complete) has 14537 edges and 3867 vertex of which 3859 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.7 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 207 ms. Remains 3858 /3867 variables (removed 9) and now considering 3516/3518 (removed 2) transitions.
// Phase 1: matrix 3516 rows 3858 cols
[2022-05-16 05:20:05] [INFO ] Invariants computation overflowed in 5741 ms
[2022-05-16 05:20:08] [INFO ] Implicit Places using invariants in 8469 ms returned []
// Phase 1: matrix 3516 rows 3858 cols
[2022-05-16 05:20:14] [INFO ] Invariants computation overflowed in 5714 ms
[2022-05-16 05:20:14] [INFO ] Implicit Places using invariants and state equation in 6499 ms returned []
Implicit Place search using SMT with State Equation took 15003 ms to find 0 implicit places.
[2022-05-16 05:20:15] [INFO ] Redundant transitions in 201 ms returned []
// Phase 1: matrix 3516 rows 3858 cols
[2022-05-16 05:20:20] [INFO ] Invariants computation overflowed in 5606 ms
[2022-05-16 05:20:22] [INFO ] Dead Transitions using invariants and state equation in 7684 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3858/3867 places, 3516/3518 transitions.
Finished structural reductions, in 1 iterations. Remains : 3858/3867 places, 3516/3518 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : Echo-PT-d03r07-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s744 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 145 reset in 3253 ms.
Product exploration explored 100000 steps with 145 reset in 3480 ms.
Computed a total of 3858 stabilizing places and 3516 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3858 transition count 3516
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
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 142 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Finished random walk after 525 steps, including 0 resets, run visited all 1 properties in 21 ms. (steps per millisecond=25 )
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 140 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 1 out of 3858 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3858/3858 places, 3516/3516 transitions.
Applied a total of 0 rules in 197 ms. Remains 3858 /3858 variables (removed 0) and now considering 3516/3516 (removed 0) transitions.
// Phase 1: matrix 3516 rows 3858 cols
[2022-05-16 05:20:37] [INFO ] Invariants computation overflowed in 5739 ms
[2022-05-16 05:20:40] [INFO ] Implicit Places using invariants in 8466 ms returned []
// Phase 1: matrix 3516 rows 3858 cols
[2022-05-16 05:20:46] [INFO ] Invariants computation overflowed in 5751 ms
[2022-05-16 05:20:47] [INFO ] Implicit Places using invariants and state equation in 6565 ms returned []
Implicit Place search using SMT with State Equation took 15057 ms to find 0 implicit places.
[2022-05-16 05:20:47] [INFO ] Redundant transitions in 109 ms returned []
// Phase 1: matrix 3516 rows 3858 cols
[2022-05-16 05:20:53] [INFO ] Invariants computation overflowed in 5806 ms
[2022-05-16 05:20:55] [INFO ] Dead Transitions using invariants and state equation in 7932 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3858/3858 places, 3516/3516 transitions.
Computed a total of 3858 stabilizing places and 3516 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3858 transition count 3516
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
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 131 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Finished random walk after 229 steps, including 0 resets, run visited all 1 properties in 26 ms. (steps per millisecond=8 )
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 168 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Product exploration explored 100000 steps with 145 reset in 3191 ms.
Product exploration explored 100000 steps with 145 reset in 3539 ms.
Built C files in :
/tmp/ltsmin14184176859765899446
[2022-05-16 05:21:04] [INFO ] Too many transitions (3516) to apply POR reductions. Disabling POR matrices.
[2022-05-16 05:21:04] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14184176859765899446
Running compilation step : cd /tmp/ltsmin14184176859765899446;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14184176859765899446;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14184176859765899446;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 1 out of 3858 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3858/3858 places, 3516/3516 transitions.
Applied a total of 0 rules in 245 ms. Remains 3858 /3858 variables (removed 0) and now considering 3516/3516 (removed 0) transitions.
// Phase 1: matrix 3516 rows 3858 cols
[2022-05-16 05:21:13] [INFO ] Invariants computation overflowed in 6024 ms
[2022-05-16 05:21:17] [INFO ] Implicit Places using invariants in 10123 ms returned []
// Phase 1: matrix 3516 rows 3858 cols
[2022-05-16 05:21:23] [INFO ] Invariants computation overflowed in 5665 ms
[2022-05-16 05:21:24] [INFO ] Implicit Places using invariants and state equation in 6474 ms returned []
Implicit Place search using SMT with State Equation took 16612 ms to find 0 implicit places.
[2022-05-16 05:21:24] [INFO ] Redundant transitions in 107 ms returned []
// Phase 1: matrix 3516 rows 3858 cols
[2022-05-16 05:21:29] [INFO ] Invariants computation overflowed in 5497 ms
[2022-05-16 05:21:31] [INFO ] Dead Transitions using invariants and state equation in 7547 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3858/3858 places, 3516/3516 transitions.
Built C files in :
/tmp/ltsmin13093352989788841759
[2022-05-16 05:21:31] [INFO ] Too many transitions (3516) to apply POR reductions. Disabling POR matrices.
[2022-05-16 05:21:32] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13093352989788841759
Running compilation step : cd /tmp/ltsmin13093352989788841759;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13093352989788841759;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13093352989788841759;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-16 05:21:35] [INFO ] Flatten gal took : 465 ms
[2022-05-16 05:21:36] [INFO ] Flatten gal took : 388 ms
[2022-05-16 05:21:36] [INFO ] Time to serialize gal into /tmp/LTL12669294435103090469.gal : 76 ms
[2022-05-16 05:21:36] [INFO ] Time to serialize properties into /tmp/LTL11679009221564315833.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12669294435103090469.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11679009221564315833.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1266929...268
Read 1 LTL properties
Checking formula 0 : !((X(F(X(G("(p1750==0)"))))))
Formula 0 simplified : !XFXG"(p1750==0)"
Detected timeout of ITS tools.
[2022-05-16 05:21:51] [INFO ] Flatten gal took : 195 ms
[2022-05-16 05:21:51] [INFO ] Applying decomposition
[2022-05-16 05:21:51] [INFO ] Flatten gal took : 199 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2286732889078625425.txt' '-o' '/tmp/graph2286732889078625425.bin' '-w' '/tmp/graph2286732889078625425.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2286732889078625425.bin' '-l' '-1' '-v' '-w' '/tmp/graph2286732889078625425.weights' '-q' '0' '-e' '0.001'
[2022-05-16 05:21:52] [INFO ] Decomposing Gal with order
[2022-05-16 05:21:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 05:21:52] [INFO ] Removed a total of 6210 redundant transitions.
[2022-05-16 05:21:52] [INFO ] Flatten gal took : 454 ms
[2022-05-16 05:21:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 877 labels/synchronizations in 222 ms.
[2022-05-16 05:21:53] [INFO ] Time to serialize gal into /tmp/LTL10776063285503377146.gal : 71 ms
[2022-05-16 05:21:53] [INFO ] Time to serialize properties into /tmp/LTL8571854391437091163.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10776063285503377146.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8571854391437091163.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1077606...246
Read 1 LTL properties
Checking formula 0 : !((X(F(X(G("(i10.i1.u215.p1750==0)"))))))
Formula 0 simplified : !XFXG"(i10.i1.u215.p1750==0)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12476967318678804506
[2022-05-16 05:22:08] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12476967318678804506
Running compilation step : cd /tmp/ltsmin12476967318678804506;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12476967318678804506;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12476967318678804506;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property Echo-PT-d03r07-LTLCardinality-14 finished in 131723 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 3867 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3867/3867 places, 3518/3518 transitions.
Graph (complete) has 14537 edges and 3867 vertex of which 3859 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.10 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 221 ms. Remains 3858 /3867 variables (removed 9) and now considering 3516/3518 (removed 2) transitions.
// Phase 1: matrix 3516 rows 3858 cols
[2022-05-16 05:22:17] [INFO ] Invariants computation overflowed in 6221 ms
[2022-05-16 05:22:20] [INFO ] Implicit Places using invariants in 9085 ms returned []
// Phase 1: matrix 3516 rows 3858 cols
[2022-05-16 05:22:26] [INFO ] Invariants computation overflowed in 6039 ms
[2022-05-16 05:22:27] [INFO ] Implicit Places using invariants and state equation in 6937 ms returned []
Implicit Place search using SMT with State Equation took 16024 ms to find 0 implicit places.
[2022-05-16 05:22:27] [INFO ] Redundant transitions in 114 ms returned []
// Phase 1: matrix 3516 rows 3858 cols
[2022-05-16 05:22:34] [INFO ] Invariants computation overflowed in 6340 ms
[2022-05-16 05:22:36] [INFO ] Dead Transitions using invariants and state equation in 8457 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3858/3867 places, 3516/3518 transitions.
Finished structural reductions, in 1 iterations. Remains : 3858/3867 places, 3516/3518 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Echo-PT-d03r07-LTLCardinality-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:(OR (EQ s1871 0) (EQ s354 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]]
Product exploration explored 100000 steps with 150 reset in 3466 ms.
Product exploration explored 100000 steps with 152 reset in 3749 ms.
Computed a total of 3858 stabilizing places and 3516 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3858 transition count 3516
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
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 134 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Finished random walk after 2432 steps, including 3 resets, run visited all 1 properties in 90 ms. (steps per millisecond=27 )
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 167 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 3858 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3858/3858 places, 3516/3516 transitions.
Applied a total of 0 rules in 200 ms. Remains 3858 /3858 variables (removed 0) and now considering 3516/3516 (removed 0) transitions.
// Phase 1: matrix 3516 rows 3858 cols
[2022-05-16 05:22:52] [INFO ] Invariants computation overflowed in 6251 ms
[2022-05-16 05:22:55] [INFO ] Implicit Places using invariants in 9266 ms returned []
// Phase 1: matrix 3516 rows 3858 cols
[2022-05-16 05:23:01] [INFO ] Invariants computation overflowed in 6269 ms
[2022-05-16 05:23:02] [INFO ] Implicit Places using invariants and state equation in 7161 ms returned []
Implicit Place search using SMT with State Equation took 16432 ms to find 0 implicit places.
[2022-05-16 05:23:02] [INFO ] Redundant transitions in 112 ms returned []
// Phase 1: matrix 3516 rows 3858 cols
[2022-05-16 05:23:09] [INFO ] Invariants computation overflowed in 6202 ms
[2022-05-16 05:23:09] [INFO ] Dead Transitions using invariants and state equation in 6763 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3858/3858 places, 3516/3516 transitions.
Computed a total of 3858 stabilizing places and 3516 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3858 transition count 3516
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
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 442 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 353 ms. (steps per millisecond=28 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 122851 steps, run timeout after 3029 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 122851 steps, saw 85717 distinct states, run finished after 3029 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 3516 rows 3858 cols
[2022-05-16 05:23:21] [INFO ] Invariants computation overflowed in 5747 ms
[2022-05-16 05:23:46] [INFO ] After 25026ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 3858 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3858/3858 places, 3516/3516 transitions.
Graph (complete) has 14478 edges and 3858 vertex of which 3852 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 3852 transition count 3510
Applied a total of 7 rules in 231 ms. Remains 3852 /3858 variables (removed 6) and now considering 3510/3516 (removed 6) transitions.
Finished structural reductions, in 1 iterations. Remains : 3852/3858 places, 3510/3516 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 322 ms. (steps per millisecond=31 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 132043 steps, run timeout after 3002 ms. (steps per millisecond=43 ) properties seen :{}
Probabilistic random walk after 132043 steps, saw 94548 distinct states, run finished after 3003 ms. (steps per millisecond=43 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 3510 rows 3852 cols
[2022-05-16 05:23:56] [INFO ] Invariants computation overflowed in 6733 ms
[2022-05-16 05:24:21] [INFO ] After 25029ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 3852 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3852/3852 places, 3510/3510 transitions.
Applied a total of 0 rules in 194 ms. Remains 3852 /3852 variables (removed 0) and now considering 3510/3510 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3852/3852 places, 3510/3510 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 3852/3852 places, 3510/3510 transitions.
Applied a total of 0 rules in 191 ms. Remains 3852 /3852 variables (removed 0) and now considering 3510/3510 (removed 0) transitions.
// Phase 1: matrix 3510 rows 3852 cols
[2022-05-16 05:24:28] [INFO ] Invariants computation overflowed in 6500 ms
[2022-05-16 05:24:31] [INFO ] Implicit Places using invariants in 9204 ms returned []
// Phase 1: matrix 3510 rows 3852 cols
[2022-05-16 05:24:37] [INFO ] Invariants computation overflowed in 6378 ms
[2022-05-16 05:24:38] [INFO ] Implicit Places using invariants and state equation in 7200 ms returned []
Implicit Place search using SMT with State Equation took 16429 ms to find 0 implicit places.
[2022-05-16 05:24:38] [INFO ] Redundant transitions in 111 ms returned []
// Phase 1: matrix 3510 rows 3852 cols
[2022-05-16 05:24:45] [INFO ] Invariants computation overflowed in 6408 ms
[2022-05-16 05:24:47] [INFO ] Dead Transitions using invariants and state equation in 8423 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3852/3852 places, 3510/3510 transitions.
Applied a total of 0 rules in 198 ms. Remains 3852 /3852 variables (removed 0) and now considering 3510/3510 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 3510 rows 3852 cols
[2022-05-16 05:24:53] [INFO ] Invariants computation overflowed in 6391 ms
[2022-05-16 05:28:38] [INFO ] After 225029ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
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 116 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 149 reset in 3260 ms.
Product exploration explored 100000 steps with 153 reset in 3638 ms.
Built C files in :
/tmp/ltsmin7800207810111064834
[2022-05-16 05:28:46] [INFO ] Too many transitions (3516) to apply POR reductions. Disabling POR matrices.
[2022-05-16 05:28:46] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7800207810111064834
Running compilation step : cd /tmp/ltsmin7800207810111064834;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7800207810111064834;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7800207810111064834;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 3858 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3858/3858 places, 3516/3516 transitions.
Applied a total of 0 rules in 189 ms. Remains 3858 /3858 variables (removed 0) and now considering 3516/3516 (removed 0) transitions.
// Phase 1: matrix 3516 rows 3858 cols
[2022-05-16 05:28:55] [INFO ] Invariants computation overflowed in 5954 ms
[2022-05-16 05:28:59] [INFO ] Implicit Places using invariants in 9819 ms returned []
// Phase 1: matrix 3516 rows 3858 cols
[2022-05-16 05:29:04] [INFO ] Invariants computation overflowed in 5604 ms
[2022-05-16 05:29:05] [INFO ] Implicit Places using invariants and state equation in 6394 ms returned []
Implicit Place search using SMT with State Equation took 16217 ms to find 0 implicit places.
[2022-05-16 05:29:05] [INFO ] Redundant transitions in 109 ms returned []
// Phase 1: matrix 3516 rows 3858 cols
[2022-05-16 05:29:11] [INFO ] Invariants computation overflowed in 5666 ms
[2022-05-16 05:29:13] [INFO ] Dead Transitions using invariants and state equation in 7698 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3858/3858 places, 3516/3516 transitions.
Built C files in :
/tmp/ltsmin7787258035624375986
[2022-05-16 05:29:13] [INFO ] Too many transitions (3516) to apply POR reductions. Disabling POR matrices.
[2022-05-16 05:29:13] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7787258035624375986
Running compilation step : cd /tmp/ltsmin7787258035624375986;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7787258035624375986;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7787258035624375986;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-16 05:29:17] [INFO ] Flatten gal took : 395 ms
[2022-05-16 05:29:17] [INFO ] Flatten gal took : 188 ms
[2022-05-16 05:29:17] [INFO ] Time to serialize gal into /tmp/LTL6803154290705627960.gal : 17 ms
[2022-05-16 05:29:17] [INFO ] Time to serialize properties into /tmp/LTL7706449893956554148.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6803154290705627960.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7706449893956554148.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6803154...266
Read 1 LTL properties
Checking formula 0 : !((G(F("((p2878==0)||(p1360==1))"))))
Formula 0 simplified : !GF"((p2878==0)||(p1360==1))"
Detected timeout of ITS tools.
[2022-05-16 05:29:32] [INFO ] Flatten gal took : 194 ms
[2022-05-16 05:29:32] [INFO ] Applying decomposition
[2022-05-16 05:29:32] [INFO ] Flatten gal took : 197 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph11805975008607914712.txt' '-o' '/tmp/graph11805975008607914712.bin' '-w' '/tmp/graph11805975008607914712.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11805975008607914712.bin' '-l' '-1' '-v' '-w' '/tmp/graph11805975008607914712.weights' '-q' '0' '-e' '0.001'
[2022-05-16 05:29:33] [INFO ] Decomposing Gal with order
[2022-05-16 05:29:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 05:29:33] [INFO ] Removed a total of 6280 redundant transitions.
[2022-05-16 05:29:33] [INFO ] Flatten gal took : 334 ms
[2022-05-16 05:29:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 970 labels/synchronizations in 97 ms.
[2022-05-16 05:29:34] [INFO ] Time to serialize gal into /tmp/LTL15080200746865314148.gal : 134 ms
[2022-05-16 05:29:34] [INFO ] Time to serialize properties into /tmp/LTL17562798182073546576.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15080200746865314148.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17562798182073546576.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1508020...247
Read 1 LTL properties
Checking formula 0 : !((G(F("((i12.i1.u13.p2878==0)||(i5.i1.u191.p1360==1))"))))
Formula 0 simplified : !GF"((i12.i1.u13.p2878==0)||(i5.i1.u191.p1360==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1972836234970395398
[2022-05-16 05:29:49] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1972836234970395398
Running compilation step : cd /tmp/ltsmin1972836234970395398;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1972836234970395398;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1972836234970395398;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property Echo-PT-d03r07-LTLCardinality-15 finished in 460712 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(X(p0)))))'
Found a CL insensitive property : Echo-PT-d03r07-LTLCardinality-09
Stuttering acceptance computed with spot in 225 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 3867 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 3867/3867 places, 3518/3518 transitions.
Graph (complete) has 14537 edges and 3867 vertex of which 3859 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.11 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 287 ms. Remains 3858 /3867 variables (removed 9) and now considering 3516/3518 (removed 2) transitions.
// Phase 1: matrix 3516 rows 3858 cols
[2022-05-16 05:29:58] [INFO ] Invariants computation overflowed in 5883 ms
[2022-05-16 05:30:01] [INFO ] Implicit Places using invariants in 8949 ms returned []
// Phase 1: matrix 3516 rows 3858 cols
[2022-05-16 05:30:08] [INFO ] Invariants computation overflowed in 6438 ms
[2022-05-16 05:30:09] [INFO ] Implicit Places using invariants and state equation in 7316 ms returned []
Implicit Place search using SMT with State Equation took 16267 ms to find 0 implicit places.
// Phase 1: matrix 3516 rows 3858 cols
[2022-05-16 05:30:15] [INFO ] Invariants computation overflowed in 6257 ms
[2022-05-16 05:30:17] [INFO ] Dead Transitions using invariants and state equation in 8549 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 3858/3867 places, 3516/3518 transitions.
Finished structural reductions, in 1 iterations. Remains : 3858/3867 places, 3516/3518 transitions.
Running random walk in product with property : Echo-PT-d03r07-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(OR (EQ s1990 0) (EQ s1537 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 1374 ms.
Product exploration explored 100000 steps with 25000 reset in 1494 ms.
Computed a total of 3858 stabilizing places and 3516 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3858 transition count 3516
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 128 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 737 steps, including 1 resets, run visited all 1 properties in 30 ms. (steps per millisecond=24 )
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 3858 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3858/3858 places, 3516/3516 transitions.
Applied a total of 0 rules in 172 ms. Remains 3858 /3858 variables (removed 0) and now considering 3516/3516 (removed 0) transitions.
// Phase 1: matrix 3516 rows 3858 cols
[2022-05-16 05:30:28] [INFO ] Invariants computation overflowed in 5748 ms
[2022-05-16 05:30:31] [INFO ] Implicit Places using invariants in 8801 ms returned []
// Phase 1: matrix 3516 rows 3858 cols
[2022-05-16 05:30:38] [INFO ] Invariants computation overflowed in 6332 ms
[2022-05-16 05:30:39] [INFO ] Implicit Places using invariants and state equation in 7256 ms returned []
Implicit Place search using SMT with State Equation took 16068 ms to find 0 implicit places.
// Phase 1: matrix 3516 rows 3858 cols
[2022-05-16 05:30:45] [INFO ] Invariants computation overflowed in 6289 ms
[2022-05-16 05:30:47] [INFO ] Dead Transitions using invariants and state equation in 8442 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3858/3858 places, 3516/3516 transitions.
Computed a total of 3858 stabilizing places and 3516 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3858 transition count 3516
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 134 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 3675 steps, including 5 resets, run visited all 1 properties in 120 ms. (steps per millisecond=30 )
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 136 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 1387 ms.
Product exploration explored 100000 steps with 25000 reset in 1509 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 3858 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3858/3858 places, 3516/3516 transitions.
Applied a total of 0 rules in 203 ms. Remains 3858 /3858 variables (removed 0) and now considering 3516/3516 (removed 0) transitions.
[2022-05-16 05:30:54] [INFO ] Redundant transitions in 113 ms returned []
// Phase 1: matrix 3516 rows 3858 cols
[2022-05-16 05:31:00] [INFO ] Invariants computation overflowed in 6311 ms
[2022-05-16 05:31:00] [INFO ] Dead Transitions using invariants and state equation in 6843 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3858/3858 places, 3516/3516 transitions.
Product exploration explored 100000 steps with 25000 reset in 8931 ms.
Product exploration explored 100000 steps with 25000 reset in 8910 ms.
Built C files in :
/tmp/ltsmin17820975335371102899
[2022-05-16 05:31:18] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17820975335371102899
Running compilation step : cd /tmp/ltsmin17820975335371102899;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17820975335371102899;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17820975335371102899;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 3858 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3858/3858 places, 3516/3516 transitions.
Applied a total of 0 rules in 164 ms. Remains 3858 /3858 variables (removed 0) and now considering 3516/3516 (removed 0) transitions.
// Phase 1: matrix 3516 rows 3858 cols
[2022-05-16 05:31:28] [INFO ] Invariants computation overflowed in 6188 ms
[2022-05-16 05:31:32] [INFO ] Implicit Places using invariants in 10257 ms returned []
// Phase 1: matrix 3516 rows 3858 cols
[2022-05-16 05:31:38] [INFO ] Invariants computation overflowed in 5787 ms
[2022-05-16 05:31:38] [INFO ] Implicit Places using invariants and state equation in 6585 ms returned []
Implicit Place search using SMT with State Equation took 16857 ms to find 0 implicit places.
// Phase 1: matrix 3516 rows 3858 cols
[2022-05-16 05:31:44] [INFO ] Invariants computation overflowed in 5793 ms
[2022-05-16 05:31:46] [INFO ] Dead Transitions using invariants and state equation in 7864 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3858/3858 places, 3516/3516 transitions.
Built C files in :
/tmp/ltsmin10543719784927478485
[2022-05-16 05:31:46] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10543719784927478485
Running compilation step : cd /tmp/ltsmin10543719784927478485;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10543719784927478485;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10543719784927478485;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-16 05:31:50] [INFO ] Flatten gal took : 360 ms
[2022-05-16 05:31:50] [INFO ] Flatten gal took : 204 ms
[2022-05-16 05:31:50] [INFO ] Time to serialize gal into /tmp/LTL13917098739206143633.gal : 18 ms
[2022-05-16 05:31:50] [INFO ] Time to serialize properties into /tmp/LTL11014941734033021250.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13917098739206143633.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11014941734033021250.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1391709...268
Read 1 LTL properties
Checking formula 0 : !((X(F(X(X("((p2997==0)||(p2543==1))"))))))
Formula 0 simplified : !XFXX"((p2997==0)||(p2543==1))"
Detected timeout of ITS tools.
[2022-05-16 05:32:05] [INFO ] Flatten gal took : 200 ms
[2022-05-16 05:32:05] [INFO ] Applying decomposition
[2022-05-16 05:32:06] [INFO ] Flatten gal took : 287 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph11710509366876943601.txt' '-o' '/tmp/graph11710509366876943601.bin' '-w' '/tmp/graph11710509366876943601.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11710509366876943601.bin' '-l' '-1' '-v' '-w' '/tmp/graph11710509366876943601.weights' '-q' '0' '-e' '0.001'
[2022-05-16 05:32:06] [INFO ] Decomposing Gal with order
[2022-05-16 05:32:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 05:32:07] [INFO ] Removed a total of 6364 redundant transitions.
[2022-05-16 05:32:07] [INFO ] Flatten gal took : 342 ms
[2022-05-16 05:32:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 1037 labels/synchronizations in 105 ms.
[2022-05-16 05:32:07] [INFO ] Time to serialize gal into /tmp/LTL14479747021415951310.gal : 34 ms
[2022-05-16 05:32:07] [INFO ] Time to serialize properties into /tmp/LTL2091311854374159158.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14479747021415951310.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2091311854374159158.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1447974...246
Read 1 LTL properties
Checking formula 0 : !((X(F(X(X("((i6.i0.u184.p2997==0)||(i13.u133.p2543==1))"))))))
Formula 0 simplified : !XFXX"((i6.i0.u184.p2997==0)||(i13.u133.p2543==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11240190757779978604
[2022-05-16 05:32:22] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11240190757779978604
Running compilation step : cd /tmp/ltsmin11240190757779978604;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11240190757779978604;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11240190757779978604;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property Echo-PT-d03r07-LTLCardinality-09 finished in 153394 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(G(p0)))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2022-05-16 05:32:26] [INFO ] Flatten gal took : 224 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7358382012813687365
[2022-05-16 05:32:26] [INFO ] Too many transitions (3518) to apply POR reductions. Disabling POR matrices.
[2022-05-16 05:32:26] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7358382012813687365
Running compilation step : cd /tmp/ltsmin7358382012813687365;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-16 05:32:26] [INFO ] Applying decomposition
[2022-05-16 05:32:26] [INFO ] Flatten gal took : 197 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph923707677372056042.txt' '-o' '/tmp/graph923707677372056042.bin' '-w' '/tmp/graph923707677372056042.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph923707677372056042.bin' '-l' '-1' '-v' '-w' '/tmp/graph923707677372056042.weights' '-q' '0' '-e' '0.001'
[2022-05-16 05:32:27] [INFO ] Decomposing Gal with order
[2022-05-16 05:32:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 05:32:28] [INFO ] Removed a total of 6316 redundant transitions.
[2022-05-16 05:32:28] [INFO ] Flatten gal took : 702 ms
[2022-05-16 05:32:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 976 labels/synchronizations in 166 ms.
[2022-05-16 05:32:29] [INFO ] Time to serialize gal into /tmp/LTLCardinality67365354158236749.gal : 63 ms
[2022-05-16 05:32:29] [INFO ] Time to serialize properties into /tmp/LTLCardinality3475874754204742273.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality67365354158236749.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3475874754204742273.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...265
Read 3 LTL properties
Checking formula 0 : !((X(F(X(X("((i1.u180.p2997==0)||(i7.u129.p2543==1))"))))))
Formula 0 simplified : !XFXX"((i1.u180.p2997==0)||(i7.u129.p2543==1))"
Compilation finished in 13359 ms.
Running link step : cd /tmp/ltsmin7358382012813687365;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 74 ms.
Running LTSmin : cd /tmp/ltsmin7358382012813687365;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(X(X((LTLAPp0==true)))))' '--buchi-type=spotba'
LTSmin run took 1177 ms.
FORMULA Echo-PT-d03r07-LTLCardinality-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin7358382012813687365;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(X([]((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin7358382012813687365;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(X([]((LTLAPp1==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin7358382012813687365;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp2==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-16 05:58:59] [INFO ] Applying decomposition
[2022-05-16 05:59:00] [INFO ] Flatten gal took : 1625 ms
[2022-05-16 05:59:01] [INFO ] Decomposing Gal with order
[2022-05-16 05:59:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 05:59:06] [INFO ] Removed a total of 14976 redundant transitions.
[2022-05-16 05:59:10] [INFO ] Flatten gal took : 5950 ms
[2022-05-16 05:59:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 468 ms.
[2022-05-16 05:59:11] [INFO ] Time to serialize gal into /tmp/LTLCardinality16383005253952911608.gal : 63 ms
[2022-05-16 05:59:11] [INFO ] Time to serialize properties into /tmp/LTLCardinality13621794484626377765.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality16383005253952911608.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality13621794484626377765.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...269
Read 2 LTL properties
Checking formula 0 : !((X(F(X(G("(u1093.p1750!=1)"))))))
Formula 0 simplified : !XFXG"(u1093.p1750!=1)"
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin7358382012813687365;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp2==true)))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin7358382012813687365;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(X([]((LTLAPp1==true)))))' '--buchi-type=spotba'

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Echo-PT-d03r07"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Echo-PT-d03r07, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r078-tall-165260110300419"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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